Third-order Idealized Algol with iteration is decidable
The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (<strong>IA</strong><sup>*</sup><sub>3</sub>). They are approached via a combination of game semantics and language theory. It is sh...
Main Authors: | Murawski, A, Walukiewicz, I |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Elsevier
2008
|
Subjects: |
Similar Items
-
Games for complexity of second-order call-by-name programs
by: Murawski, A
Published: (2005) -
Syntactic control of concurrency
by: Ghica, D, et al.
Published: (2006) -
Digraph measures: Kelly decompositions, games, and orderings
by: Hunter, P, et al.
Published: (2008) -
Functions with local state: regularity and undecidability
by: Murawski, A
Published: (2005) -
Angelic semantics of fine-grained concurrency
by: Ghica, D, et al.
Published: (2008)