2012/10/09 by Aleksandar S. Dimovski
Computer Science · #cs.FL #cs.GT #cs.LO #cs.PL
paper · pdf · doi:10.4204/eptcs.96.8
published as EPTCS 96, 2012, pp. 99-112 · In Proceedings GandALF 2012, arXiv:1210.2028
arxiv created 2012/10/09 · arxiv updated 2012/10/10
In this paper we revisit the regular-language representation of game semantics of second-order recursion free Idealized Algol with infinite data types. By using symbolic values instead of concrete ones we generalize the standard notion of regular-language and automata representations to that of corresponding symbolic representations. In this way terms with infinite data types, such as integers, can be expressed as finite symbolic-automata although the standard automata interpretation is infinite. Moreover, significant reductions of the state space of game semantics models are obtained. This enables efficient verification of terms, which is illustrated with several examples.