Typed Lambda Calculi and Applications

DOI10.1007/B135690MaRDI QIDQ5704028zbMATH OpenOpenAlexFDO

Authors

Publication date 11 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b135690

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40) Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1722657
• scientific article; zbMATH DE number 2087432
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• The diagonal problem for higher-order recursion schemes is decidable
• scientific article; zbMATH DE number 2206111

Cited in

(9)

• Decidable properties of monadic recursive schemas with a depth parameter
• scientific article; zbMATH DE number 1722657 (Why is no real title available?)
• The diagonal problem for higher-order recursion schemes is decidable
• scientific article; zbMATH DE number 2087432 (Why is no real title available?)
• Krivine machines and higher-order schemes
• Streett Automata Model Checking of Higher-Order Recursion Schemes
• On the expressive power of higher-order pushdown systems
• Monadic Second-Order Classes of Forests with a Monadic Second-Order 0-1 Law
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Typed Lambda Calculi and Applications

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