Abstract
We present some results on a game-semantic approach to verifying infinite structures that are generated by higher-order recursion schemes. The key idea is a certain Transference Principle from the structure generated by a given recursion scheme to an auxiliary computation tree, which is itself generated by a related order-0 recursion scheme. By a structural analysis of the computation tree based on the innocent game semantics of the recursion scheme, we can infer certain properties of the generated structure by appropriate algorithmic analysis of the computation tree. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Ong, C. H. L. (2006). Some results on a game-semantic approach to verifying finitely-presentable infinite structures (extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4207 LNCS, pp. 31–40). Springer Verlag. https://doi.org/10.1007/11874683_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
