Two-level game semantics, intersection types, and recursion schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7392 LNCS, Issue PART 2, 2012, Pages 325-336

  Ong, C H Luke ^a   Tsukada, Takeshi ^b,c  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b TOHOKU UNIVERSITY   (Japan)

^c JSPS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; ROBOTS; SEMANTICS;

CARTESIAN CLOSED CATEGORY; GAME SEMANTICS; HIGHER ORDER MODELING; INTERSECTION TYPES; RECURSION SCHEMES; SUBJECT EXPANSIONS; TYPE SYSTEMS; WINNING STRATEGY;

MODEL CHECKING;

EID: 84884176454     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31585-5_31     Document Type: Conference Paper

References (10)

1. Ong, C.H.L.: On model-checking trees generated by higher-order recursion schemes. In: LICS, pp. 81-90. IEEE Computer Society (2006)
2. Hyland, J.M.E., Ong, C.H.L.: On full abstraction for PCF: I, II, and III. Inf. Comput. 163(2), 285-408 (2000)
3. Kobayashi, N.: Types and higher-order recursion schemes for verification of higher-order programs. In: Shao, Z., Pierce, B.C. (eds.) POPL, pp. 416-428. ACM (2009)
4. Salvati, S.: On the membership problem for non-linear abstract categorial grammars. Journal of Logic, Language and Information 19(2), 163-183 (2010)
5. Kobayashi, N., Ong, C.H.L.: A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In: LICS, pp. 179-188. IEEE Computer Society (2009)
6. Hague, M., Murawski, A.S., Ong, C.H.L., Serre, O.: Collapsible pushdown automata and recursion schemes. In: LICS, pp. 452-461 (2008)
7. Salvati, S., Walukiewicz, I.: Krivine Machines and Higher-Order Schemes. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 162-173. Springer, Heidelberg (2011)
8. Nielson, F.: Two-level semantics and abstract interpretation. Theor. Comput. Sci. 69(2), 117-242 (1989)
9. Kobayashi, N.: A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 260-274. Springer, Heidelberg (2011)
10. Tsukada, T., Kobayashi, N.: Untyped Recursion Schemes and Infinite Intersection Types. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 343-357. Springer, Heidelberg (2010)