Local computation of β-reduction 1 A concrete presentation of Game Semantics 2
暂无分享,去创建一个
[1] C.-H. Luke Ong,et al. On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..
[2] Vincent Danos,et al. Local and asynchronous beta-reduction (an analysis of Girard's execution formula) , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.
[3] Naoki Kobayashi. Types and higher-order recursion schemes for verification of higher-order programs , 2009, POPL '09.
[4] C. Laneve,et al. Paths in the lambda-calculus , 1994, LICS 1994.
[5] C.-H. Luke Ong,et al. On Model-Checking Trees Generated by Higher-Order Recursion Schemes , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).
[6] Vincent Danos,et al. Game semantics and abstract machines , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[7] Colin Stirling. A Game-Theoretic Approach to Deciding Higher-Order Matching , 2006, ICALP.
[8] John Lamping. An algorithm for optimal lambda calculus reduction , 1989, POPL '90.
[9] Gordon D. Plotkin,et al. Call-by-Name, Call-by-Value and the lambda-Calculus , 1975, Theor. Comput. Sci..
[10] Vincent Danos,et al. Head Linear Reduction , 2004 .
[11] Radha Jagadeesan,et al. Full Abstraction for PCF , 1994, Inf. Comput..
[12] Russ Harmer. Innocent game semantics , 2006 .
[13] S. Abramsky. Game Semantics , 1999 .
[14] Samson Abramsky,et al. Call-by-Value Games , 1997, CSL.
[15] Pawel Urzyczyn,et al. Higher-Order Pushdown Trees Are Easy , 2002, FoSSaCS.
[16] Guy McCusker. Games and Full Abstraction for FPC , 2000, Inf. Comput..