Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

An alternate proof of Statman's finite completeness theorem

Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00660832
Contributor : B. Srivathsan <>
Submitted on : Tuesday, January 17, 2012 - 5:10:31 PM
Last modification on : Friday, February 15, 2019 - 2:46:10 PM
Long-term archiving on: : Tuesday, December 13, 2016 - 11:35:27 PM

File

m.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00660832, version 1

Collections

Citation

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

Share

Metrics

Record views

416

Files downloads

240