Results 1 
1 of
1
Categorical Completeness Results for the SimplyTyped LambdaCalculus
 Proceedings of TLCA '95, Springer LNCS 902
, 1995
"... . We investigate, in a categorical setting, some completeness properties of betaeta conversion between closed terms of the simplytyped lambda calculus. A cartesianclosed category is said to be complete if, for any two unconvertible terms, there is some interpretation of the calculus in the catego ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
. We investigate, in a categorical setting, some completeness properties of betaeta conversion between closed terms of the simplytyped lambda calculus. A cartesianclosed category is said to be complete if, for any two unconvertible terms, there is some interpretation of the calculus in the category that distinguishes them. It is said to have a complete interpretation if there is some interpretation that equates only interconvertible terms. We give simple necessary and sufficient conditions on the category for each of the two forms of completeness to hold. The classic completeness results of, e.g., Friedman and Plotkin are immediate consequences. As another application, we derive a syntactic theorem of Statman characterizing betaeta conversion as a maximum consistent congruence relation satisfying a property known as typical ambiguity. 1 Introduction In 1970 Friedman proved that betaeta conversion is complete for deriving all equalities between the (simplytyped) lambdadefinable...