polyseq
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.
Ecosystem
hackage.haskell.org
hackage.haskell.org
Latest Release
almost 16 years ago
0.1.2
almost 16 years ago
Versions
3
3
Downloads
2,468 total
2,468 total
No dependent packages found.
Past Dependents
Include Past Dependents
Check this option to include packages that no longer depend on this package in their latest version but previously did.
Filter
Filter by Kind
Links
| Registry | hackage.haskell.org |
| JSON API | View JSON |
| CodeMeta | codemeta.json |
Package Details
| PURL |
pkg:hackage/polyseq
spec |
| License | Other |
| First Release | almost 16 years ago |
| Last Synced | 2 days ago |