Krivine machines and higher-order schemesReport as inadecuate

Krivine machines and higher-order schemes - Download this document for free, or read online. Document in PDF available to download.

1 SIGNES - Linguistic signs, grammar and meaning: computational logic for natural language Université Michel de Montaigne - Bordeaux 3, 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 2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

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.

Author: Sylvain Salvati - Igor Walukiewicz -



Related documents