Recognizability in the Simply Typed Lambda-Calculus

DOI10.1007/978-3-642-02261-6_5zbMath1246.03032OpenAlexW1501704892MaRDI QIDQ3638274

Sylvain Salvati

Publication date: 2 July 2009

Published in: Logic, Language, Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02261-6_5

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Combinatory logic and lambda calculus (03B40)

Related Items

An alternate proof of Statman's finite completeness theorem, Finite Combinatory Logic with Intersection Types, On the expressive power of schemes, Domains for Higher-Order Games, The IO and OI hierarchies revisited

Cites Work

• Graph minors. V. Excluding a planar graph
• On the expressive power of abstract categorial grammars: Representing context-free formalisms
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• The Mathematics of Sentence Structure
• Linear Automaton Transformations
• A Game-Theoretic Approach to Deciding Higher-Order Matching
• Completeness, invariance and λ-definability
• Higher Order   Matching is Undecidable
• The emptiness problem for intersection types
• Algebraic automata and context-free sets
• Automated Deduction – CADE-19
• Unnamed Item
• Unnamed Item
• Unnamed Item