Recognizability in the Simply Typed Lambda-Calculus

DOI10.1007/978-3-642-02261-6_5MaRDI QIDQ3638274zbMATH OpenOpenAlexFDO

Authors S. 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

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

Recommendations

• A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
• A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
• scientific article; zbMATH DE number 149520
• Word operation definable in the typed -calculus
• scientific article; zbMATH DE number 475247

Cites work

• A Game-Theoretic Approach to Deciding Higher-Order Matching
• Algebraic automata and context-free sets
• Automated Deduction – CADE-19
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Completeness, invariance and λ-definability
• Graph minors. V. Excluding a planar graph
• Higher Order   Matching is Undecidable
• scientific article; zbMATH DE number 1223619 (Why is no real title available?)
• scientific article; zbMATH DE number 1984520 (Why is no real title available?)
• scientific article; zbMATH DE number 1361533 (Why is no real title available?)
• Linear Automaton Transformations
• On the expressive power of abstract categorial grammars: Representing context-free formalisms
• The emptiness problem for intersection types
• The Mathematics of Sentence Structure

Cited in

(15)

• Simply-typed underdeterminism
• The IO and OI hierarchies revisited
• Simply typed fixpoint calculus and collapsible pushdown automata
• Finite combinatory logic with intersection types
• scientific article; zbMATH DE number 475247 (Why is no real title available?)
• An alternate proof of Statman's finite completeness theorem
• Domains for Higher-Order Games
• Semantic evaluation; intersection types and complexity of simply typed lambda calculus
• A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
• Profinite lambda-terms and parametricity
• Pregrammars and intersection types
• Implicit automata in typed -calculi I: aperiodicity in a non-commutative logic
• Syntactically and semantically regular languages of -terms coincide through logical relations
• The categorical contours of the Chomsky-Schützenberger representation theorem
• On the expressive power of schemes

This page was built for publication: Recognizability in the Simply Typed Lambda-Calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638274)