Skip to Main content Skip to Navigation

Krivine machines and higher-order schemes

Sylvain Salvati 1, 2 Igor Walukiewicz 2 
1 SIGNES - Linguistic signs, grammar and meaning: computational logic for natural language
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : We propose a new approach to analysing higher-order recursive schemes. Many results in the literature use automata models generalising pushdown automata, most notably higher-order pushdown automata with collapse (CPDA). Instead, we propose to use the Krivine machine model. Compared to CPDA, this model is closer to lambda-calculus, and incorporates nicely many invariants of computations, as for example the typing information. The usefulness of the proposed approach is demonstrated with new proofs of two central results in the field: the decidability of the local and global model checking problems for higher-order schemes with respect to the mu-calculus.
Document type :
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Sylvain Salvati Connect in order to contact the contributor
Submitted on : Thursday, April 28, 2011 - 8:48:25 PM
Last modification on : Saturday, June 25, 2022 - 8:29:33 PM
Long-term archiving on: : Thursday, March 30, 2017 - 9:56:05 AM


Files produced by the author(s)


  • HAL Id : inria-00589407, version 1



Sylvain Salvati, Igor Walukiewicz. Krivine machines and higher-order schemes. [Research Report] 2011, pp.17. ⟨inria-00589407⟩



Record views


Files downloads