free-theorems-seq: Taming Selective Strictness

[ language, library, public-domain ] [ Propose Tags ] [ Report a vulnerability ]

Given a term, this program calculates a set of "optimal" free theorems that hold in a lambda calculus with selective strictness. It omits totality (in general, bottom-reflection) and other restrictions when possible. The underlying theory is described in the paper "Taming Selective Strictness" (ATPS'09) by Daniel Seidel and Janis Voigtländer. A webinterface for the program is running online at http://www-ps.iai.uni-bonn.de/cgi-bin/polyseq.cgi or available offline via the package http://hackage.haskell.org/package/free-theorems-seq-webui.

Related to this package you may be interested in the online free theorem generator at http://www-ps.iai.uni-bonn.de/ft that is also available offline via http://hackage.haskell.org/package/free-theorems-webui. Additionally interesting may be the counterexample generator for free theorems that exemplifies the need of strictness conditions imposed by general recursion. It can be downloaded at http://hackage.haskell.org/package/free-theorems-counterexamples or used via a webinterface at http://www-ps.iai.uni-bonn.de/cgi-bin/exfind.cgi.


[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 1.0
Dependencies array (<1), base (>=1), bytestring (>=0.9.0.1), containers (>=0.1.0.1), free-theorems (>=0.3.1 && <0.4), haskell-src (>=1.0.1.1), mtl (>=1.1.0.0), old-locale (>=1 && <2), old-time (>=1 && <2), parsec (>=3 && <4), pretty (>=1 && <2), syb (>=0.1.0.0), utf8-string (>=0.3.1.1 && <0.4), xhtml (>=3000 && <3001) [details]
Tested with ghc ==7.0.1
License LicenseRef-PublicDomain
Author Daniel Seidel
Maintainer ds@iai.uni-bonn.de
Category Language
Uploaded by DanielSeidel at 2011-03-11T17:07:18Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 1110 total (5 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Successful builds reported [all 1 reports]

Readme for free-theorems-seq-1.0

[back to package description]
The module free-theorems-seq-0.1 can be installed via

cabal install

or the following way:

runhaskell Setup.hs configure --user
runhaskell Setup.hs build
runhaskell Setup.hs haddock
runhaskell Setup.hs install

runhaskell Setup.hs haddock builds the documentation.
This step is not necessary.

After installation the modules
        Language.Haskell.FreeTheorems.Variations.PolySeq.PolySeq
        Language.Haskell.FreeTheorems.Variations.PolySeq.PrettyPrint
        Language.Haskell.FreeTheorems.Variations.PolySeq.TypeTranslator
        Language.Haskell.FreeTheorems.Variations.PolySeq.TheoremGen
        Language.Haskell.FreeTheorems.Variations.PolySeq.Parser.ParseTerm
        Language.Haskell.FreeTheorems.Variations.PolySeq.Highlight
are available.

The functionality of the library is also available via a webinterface
that is either available via the package at

http://hackage.haskell.org/package/free-theorems-seq-webui

or can be used online at

http://www-ps.iai.uni-bonn.de/cgi-bin/polyseq.cgi.

Enjoy.