Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/62948
Título: | Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search |
Autor(es): | Espírito Santo, José Matthes, Ralph Pinto, Luís F. |
Data: | 2019 |
Editora: | Cambridge University Press |
Revista: | Mathematical Structures in Computer Science |
Resumo(s): | 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. |
Tipo: | Artigo |
URI: | https://hdl.handle.net/1822/62948 |
DOI: | 10.1017/S0960129518000099 |
ISSN: | 0960-1295 |
e-ISSN: | 1469-8072 |
Arbitragem científica: | yes |
Acesso: | Acesso aberto |
Aparece nas coleções: | CMAT - Artigos em revistas com arbitragem / Papers in peer review journals |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
InhabitationThroughALambdaCalculusForProofSearch_Accepted.pdf | 425,48 kB | Adobe PDF | Ver/Abrir |