Name
Abstract | ||
|---|---|---|
Automata theoretical techniques are developed that handle inhabitant search in the simply typed lambda calculus. The automata-theoretic model for inhabitant search, which can be viewed as proof search by the Curry-Howard isomorphism, is proven to be adequate by reduction of the inhabitant existence problem to the emptiness problem for the automata. To strengthen the claim, it is demonstrated that the latter has the same complexity as the former. We also discuss the basic closure properties of the automata. |
Year | Venue | Field |
|---|---|---|
2015 | CSL | Discrete mathematics,Quantum finite automata,Proof search,Automata theory,Simply typed lambda calculus,Computer science,Automaton,Isomorphism,Emptiness |
DocType | Citations | PageRank |
Conference | 1 | 0.37 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aleksy Schubert | 1 | 80 | 17.99 |
| Wil Dekkers | 2 | 6 | 1.19 |
| Hendrik Pieter Barendregt | 3 | 30 | 3.62 |