Simply typed fixpoint calculus and collapsible pushdown automata

DOI10.1017/S0960129514000590zbMath1364.68132OpenAlexW2142927307MaRDI QIDQ2973243

Sylvain Salvati, Igor Walukiewicz

Publication date: 3 April 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129514000590

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18)

Related Items (5)

Recursion Schemes and the WMSO+U Logic ⋮ Cost Automata, Safe Schemes, and Downward Closures ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Complexity of the Diagonal Problem for Recursion Schemes

Cites Work

• Applications of infinitary lambda calculus
• The IO- and OI-hierarchies
• LCF considered as a programming language
• On full abstraction for PCF: I, II and III
• A call-by-name lambda-calculus machine
• A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
• Krivine Machines and Higher-Order Schemes
• A Saturation Method for Collapsible Pushdown Systems
• An automata-theoretical characterization of the OI-hierarchy
• Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata
• Using Models to Model-Check Recursive Schemes
• Indexed Grammars—An Extension of Context-Free Grammars

This page was built for publication: Simply typed fixpoint calculus and collapsible pushdown automata