@hackage polyseq0.1.1

Counter examples to Free Theorems

Categories
License
LicenseRef-PublicDomain
Maintainer
ds@iai.uni-bonn.de
Links
- Documentation
- No source repository
- Security
Versions
- 0.1.2.1 Wed, 6 Oct 2010
- 0.1.2 Wed, 17 Mar 2010
- 0.1.1 Fri, 12 Mar 2010

Installation
In your cabal file:
Dependencies (16)
- array >=0.1.0.0
- base >=4
- bytestring >=0.9.0.1
- containers >=0.1.0.1
- mtl >=1.1.0.0
- parsec >=3.0.0
Dependents (1)
@hackage/acme-everything

Given a term, this program calculates a set of optimal Free Theorems that hold in a lambda calculus with Seq. It drops bottom-reflectingness (or totality) restrictions when possible. The theory behind the algorithm is described in the paper "Taming Selective Strictness" (ATPS'09) by Daniel Seidel and Janis Voigtländer.

@hackage polyseq0.1.1

Categories

License

Maintainer

Links

Versions

Installation

Dependencies (16)

Dependents (1)