@Article{ Es2018.1,

author = {Espírito Santo, José and Matthes, Ralph and Pinto, Luís},

title = "{Inhabitation in Simply-Typed Lambda-Calculus through a Lambda-Calculus for Proof Search}",

journal = {Mathematical Structures in Computer Science},

publisher = {Cambridge University Press},

address = {http://www.cambridge.org/},

year = {2018},

month = {avril},

to_appear = {to appear},

pages = {1--33},

language = {anglais},

URL = {https://doi.org/10.1017/S0960129518000099},

note = {First View - avant attribution du tôme},

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 state-of-the-art coherence theorems ensuring uniqueness of inhabitants.}

}