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.
Domaines
Logique en informatique [cs.LO]
Origine : Fichiers produits par l'(les) auteur(s)