An alternate proof of Statman's finite completeness theorem

B. Srivathsan (1) , Igor Walukiewicz (1)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

Statman's finite completeness theorem says that for every pair of non-equivalent terms of simply-typed lamda-calculus there is a model that separates them. A direct method of constructing this model is provided using a simple induction on the Böhm tree of the term.

Mots clés: Simply typed lambda calculus; formal semantics; theory of computation

Domaines: Théorie et langage formel [cs.FL]

B. Srivathsan, Igor Walukiewicz. An alternate proof of Statman's finite completeness theorem. 2010. ⟨hal-00660832⟩