free-theorems-seq: Taming Selective Strictness
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]
| Versions [faq] | 1.0 |
|---|---|
| Dependencies | array (==0.*), 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.*), old-time (==1.*), parsec (==3.*), pretty (==1.*), syb (>=0.1.0.0), utf8-string (>=0.3.1.1 && <0.4), xhtml (==3000.*) [details] |
| License | LicenseRef-PublicDomain |
| Author | Daniel Seidel |
| Maintainer | ds@iai.uni-bonn.de |
| Category | Language |
| Uploaded | by DanielSeidel at Fri Mar 11 17:07:18 UTC 2011 |
| Distributions | NixOS:1.0 |
| Downloads | 588 total (12 in the last 30 days) |
| Rating | (no votes yet) [estimated by rule of succession] |
| Your Rating | |
| Status | Docs available [build log] Successful builds reported [all 1 reports] |
Modules
[Index]
- Language
- Haskell
- FreeTheorems
- Variations
- PolySeq
- Language.Haskell.FreeTheorems.Variations.PolySeq.Highlight
- Parser
- Language.Haskell.FreeTheorems.Variations.PolySeq.PolySeq
- Language.Haskell.FreeTheorems.Variations.PolySeq.PrettyPrint
- Language.Haskell.FreeTheorems.Variations.PolySeq.TheoremGen
- Language.Haskell.FreeTheorems.Variations.PolySeq.TypeTranslator
- PolySeq
- Variations
- FreeTheorems
- Haskell
Downloads
- free-theorems-seq-1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)