polyseq-0.1.2.1: Taming Selective Strictness

The polyseq package

This package is obsolete: use free-theorems-seq instead.

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.

Properties

Versions0.1.1, 0.1.2, 0.1.2.1
Dependenciesarray (≥0.1.0.0), base (≥1 & <4), bytestring (≥0.9.0.1), cgi (≥3001.1.5.1), containers (≥0.1.0.1), free-theorems (≥0.3.1), haskell-src (≥1.0.1.1), mtl (≥1.1.0.0), network (≥2.1.0.0), old-locale (≥1.0.0.0), old-time (≥1.0.0.0), parsec (≥3.0.0), pretty (≥1.0.0.0), utf8-string (≥0.3.1.1), xhtml (≥3000.0.2.1) or
array (≥0.1.0.0), base (≥4), bytestring (≥0.9.0.1), cgi (≥3001.1.5.1), containers (≥0.1.0.1), free-theorems (≥0.3.1), haskell-src (≥1.0.1.1), mtl (≥1.1.0.0), network (≥2.1.0.0), old-locale (≥1.0.0.0), old-time (≥1.0.0.0), parsec (≥3.0.0), pretty (≥1.0.0.0), syb (≥0.1.0.0), utf8-string (≥0.3.1.1), xhtml (≥3000.0.2.1)
LicensePublicDomain
AuthorDaniel Seidel
Maintainerds@iai.uni-bonn.de
CategoryLanguage
Executablespolyseq.cgi
Upload dateWed Oct 6 17:30:12 UTC 2010
Uploaded byDanielSeidel
Build failureghc-6.12 (log), ghc-7.0 (log)

Modules

Downloads