Skip to Main content Skip to Navigation
Journal articles

Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search

Abstract : A new approach to inhabitation problems in simply typed lambda-calculus is shown, dealing with both decision and counting problems. This approach works by exploiting a representation of the search space generated by a given inhabitation problem, which is in terms of a lambda-calculus for proof search that the authors developed recently. The representation may be seen as extending the Curry-Howard representation of proofs by lambda terms. Our methodology reveals inductive descriptions of the decision problems, driven by the syntax of the proof-search expressions, and produces simple, recursive decision procedures and counting functions. These allow to predict the number of inhabitants by testing the given type for syntactic criteria. This new approach is comprehensive and robust: based on the same syntactic representation, we also derive the state-of-the-art coherence theorems ensuring uniqueness of inhabitants.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download
Contributor : Ralph Matthes <>
Submitted on : Wednesday, November 13, 2019 - 1:37:51 AM
Last modification on : Tuesday, September 8, 2020 - 9:22:02 AM
Long-term archiving on: : Friday, February 14, 2020 - 1:46:19 PM


Files produced by the author(s)



José Espírito Santo, Ralph Matthes, Luís Pinto. Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2019, 29 (8), pp.1092-1124. ⟨10.1017/S0960129518000099⟩. ⟨hal-02360678⟩



Record views


Files downloads