Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata

DOI10.1007/978-3-642-33512-9_2zbMath1310.68138OpenAlexW1801913226MaRDI QIDQ4899139

Sylvain Salvati, Igor Walukiewicz

Publication date: 7 January 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-33512-9_2

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Simply typed fixpoint calculus and collapsible pushdown automata ⋮ Krivine machines and higher-order schemes ⋮ Streett Automata Model Checking of Higher-Order Recursion Schemes ⋮ The IO and OI hierarchies revisited

This page was built for publication: Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata