polyseq
Version 0.1.2.1 revision 0 uploaded by DanielSeidel.
Package meta
- Synopsis
- Taming Selective Strictness
- Description
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.
- Author
- Daniel Seidel
- Bug reports
- n/a
- Category
- Language
- Copyright
- n/a
- Homepage
- n/a
- Maintainer
- ds@iai.uni-bonn.de
- Package URL
- n/a
- Stability
- n/a