Remarks on the equational theory of non-normalizing pure type systems
Artikel i vetenskaplig tidskrift, 2006

Pure Type Systems (PTS) come in two flavours: domain-free systems with untyped λ-abstractions (i.e. of the form λx. M); and domain-free systems with typed λ-abstractions (i.e. of the form λx :A. M). Both flavours of systems are related by an erasure function |.| that removes types from λ-abstractions. Preservation of Equational Theory, which states the equational theories of both systems coincide through the erasure function, is a property of functional and normalizing PTSs. In this paper we establish that Preservation of Equational Theory fails for some non-normalizing PTSs, including the PTS with * : *. The gist of our argument is to exhibit a typable expression YH whose erasure |Y| is a fixpoint combinator, but which is not a fixpoint combinator itself.

Författare

Gilles Barthes

INRIA Sophia Antipolis

Thierry Coquand

Göteborgs universitet

Journal of Functional Programming

0956-7968 (ISSN) 1469-7653 (eISSN)

Vol. 16 2 137-155

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1017/S0956796803004726