@hackage / polyseq

Taming Selective Strictness

Version Deprecated package0.1.2.1

About

Metadata

  • Last updated , by DanielSeidel
  • License LicenseRef-PublicDomain

  • Maintained by: ds@iai.uni-bonn.de

  • Lottery factor: 0

Links

Installation

This package has been deprecated in favour of

Readme

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.