Abstract
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized ALGOL (IA) by expressing sets of complete plays as regular languages. Being derived directly from the fully abstract game semantics for IA, our method of reasoning inherits its desirable theoretical properties. The method is mathematically elementary and formal, which makes it uniquely suitable for automation. We show that reasoning can be carried out using only a meta-language of extended regular expressions, a language for which equivalence is formally decidable.
Author supplied keywords
Cite
CITATION STYLE
Ghica, D. R., & McCusker, G. (2000). Reasoning about idealized ALGOL using regular languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1853, pp. 103–115). Springer Verlag. https://doi.org/10.1007/3-540-45022-x_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
