Recognizability in the Simply Typed Lambda-Calculus
Author:
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 48-60
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Higher Order β Matching is UndecidableLogic Journal of the IGPL, 2003
- The emptiness problem for intersection typesThe Journal of Symbolic Logic, 1999
- Higher-order matching and tree automata1998
- Graph minors. V. Excluding a planar graphJournal of Combinatorial Theory, Series B, 1986
- A coherence theorem for canonical morphisms in cartesian closed categoriesJournal of Mathematical Sciences, 1982
- Completeness, invariance and λ-definabilityThe Journal of Symbolic Logic, 1982
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theoryJournal of Computer and System Sciences, 1967
- Algebraic automata and context-free setsInformation and Control, 1967
- Linear automaton transformationsProceedings of the American Mathematical Society, 1958
- The Mathematics of Sentence StructureThe American Mathematical Monthly, 1958