SALVATI, Sylvain; WALUKIEWICZ, Igor

Métadonnées

Licence d’utilisation du document

SALVATI, Sylvain
Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]

WALUKIEWICZ, Igor
Laboratoire Bordelais de Recherche en Informatique [LaBRI]

Langue

Communication dans un congrès

Ce document a été publié dans

Krivine Machines and Higher-Order Schemes, Krivine Machines and Higher-Order Schemes, ICALP, 2011. 2011, vol. 6756, p. 162-173

Résumé en anglais

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.< Réduire

URI

https://oskar-bordeaux.fr/handle/20.500.12278/197944

Project ANR

Frontières de la reconnaissabilité - ANR-10-BLAN-0202

Origine

Importé de hal

Unités de recherche

Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800