Higher-Order Automata, Pushdown Systems, and Set Constraints - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2001

Higher-Order Automata, Pushdown Systems, and Set Constraints

Résumé

We introduce a natural notion of automata, pushdown systems, and set constraints in increasing order of expressiveness, on simply-typed-terms. We show that recognizability of ground terms, and testing emptiness of higherorder automata and pushdown systems, as well as the satisfiability of higher-order set constraints, are decidable in non-deterministic double exponential time. This uses a first-order clause format on shallow higher-order patterns, and automated deduction techniques based on ordered resolution with splitting.
Fichier principal
Vignette du fichier
rr-lsv-2001-9.pdf (2.5 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03204006 , version 1 (23-04-2021)

Identifiants

  • HAL Id : hal-03204006 , version 1

Citer

Jean Goubault-Larrecq. Higher-Order Automata, Pushdown Systems, and Set Constraints. [Research Report] LSV-01-9, LSV, ENS Cachan. 2001, pp.15. ⟨hal-03204006⟩
15 Consultations
32 Téléchargements

Partager

Gmail Facebook X LinkedIn More