Collapsible pushdown automata and labeled recursion schemes. equivalence, safety and effective selection - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Collapsible pushdown automata and labeled recursion schemes. equivalence, safety and effective selection

Résumé

Higher-order recursion schemes are rewriting systems for simply typed terms and they are known to be equiexpressive with collapsible pushdown automata (CPDA) for generating trees. We argue that CPDA are an essential model when working with recursion schemes. First, we give a new proof of the translation of schemes into CPDA that does not appeal to game semantics. Second, we show that this translation permits to revisit the safety constraint and allows CPDA to be seen as Krivine machines. Finally, we show that CPDA permit one to prove the effective MSO selection property for schemes, subsuming all known decidability results for MSO on schemes.
Fichier principal
Vignette du fichier
CS12.pdf (675.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00733467 , version 1 (08-03-2016)

Identifiants

Citer

Arnaud Carayol, Olivier Serre. Collapsible pushdown automata and labeled recursion schemes. equivalence, safety and effective selection. LICS 2012, Jun 2012, Dubrovnik, Croatia. pp.165-174, ⟨10.1109/LICS.2012.73⟩. ⟨hal-00733467⟩
205 Consultations
259 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More