A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking
[chapter]
2013
Lecture Notes in Computer Science
This paper is about two models of computation that underpin recent developments in the algorithmic verification of higher-order computation. Recursion schemes are in essence the simply-typed lambda calculus with recursion, generated from first-order symbols. Collapsible pushdown automata are a generalisation of pushdown automata to higher-order stacks -which are iterations of stack of stacks -that contain symbols equipped with links. We study and compare the expressive power of the two models
doi:10.1007/978-3-642-37064-9_3
fatcat:vmzogjyskfahbeklhyssyajvuy