The free-theorems-seq package

[Tags: library, public-domain]

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.


Properties

Version1.0
Dependenciesarray (==0.*), base (>=1 && <4), 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.*), old-time (==1.*), parsec (==3.*), pretty (==1.*), utf8-string (>=0.3.1.1 && <0.4), xhtml (==3000.*) or
array (==0.*), base (>=4), 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.*), old-time (==1.*), parsec (==3.*), pretty (==1.*), syb (>=0.1.0.0), utf8-string (>=0.3.1.1 && <0.4), xhtml (==3000.*)
LicensePublicDomain
AuthorDaniel Seidel
Maintainerds@iai.uni-bonn.de
CategoryLanguage
Upload dateFri Mar 11 17:07:18 UTC 2011
Uploaded byDanielSeidel
Downloads114 total (12 in last 30 days)

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees