Third-Order Idealized Algol with Iteration is Decidable - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2008

Third-Order Idealized Algol with Iteration is Decidable

Résumé

The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (IA ∗ 3 ). They are approached via a combination of game semantics and language theory. It is shown that for each IA∗3 -term one can construct a pushdown automaton recognizing a representation of the strategy in- duced by the term. The automata have some additional properties ensur- ing that the associated equivalence and inclusion problems are solvable in Ptime. This gives an Exptime decision procedure for contextual equiv- alence and approximation for β -normal terms. Exptime-hardness is also shown in this case, even in the absence of iteration.
Fichier principal
Vignette du fichier
igw-algol.pdf (248.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00335730 , version 1 (30-10-2008)

Identifiants

  • HAL Id : hal-00335730 , version 1

Citer

Andrzej Murawski, Igor Walukiewicz. Third-Order Idealized Algol with Iteration is Decidable. Theoretical Computer Science, 2008, 390 (2-3), pp.214-229. ⟨hal-00335730⟩

Collections

CNRS
106 Consultations
96 Téléchargements

Partager

Gmail Facebook X LinkedIn More