Krivine Machines and Higher-Order Schemes
From MaRDI portal
Publication:3012917
DOI10.1007/978-3-642-22012-8_12zbMath1333.68111OpenAlexW2014771515MaRDI QIDQ3012917
Igor Walukiewicz, Sylvain Salvati
Publication date: 7 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.967.412
Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40)
Related Items
Typing Weak MSOL Properties ⋮ Simply typed fixpoint calculus and collapsible pushdown automata ⋮ Krivine machines and higher-order schemes ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Krivine machines and higher-order schemes
- Combinatory logic. With two sections by William Craig.
- The IO- and OI-hierarchies
- LCF considered as a programming language
- Pushdown processes: Games and model-checking
- A call-by-name lambda-calculus machine
- On the correctness of the Krivine machine
- Collapsible Pushdown Graphs of Level 2 are Tree-Automatic
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
- Collapsible Pushdown Automata and Recursion Schemes
- Foundations of Software Science and Computational Structures
- Automata, Languages and Programming