Evolving Games and Essential Nets for Affine Polymorphism
暂无分享,去创建一个
[1] C.-H. Luke Ong,et al. A Universal Innocent Game Model for the Böhm Tree Lambda Theory , 1999, CSL.
[2] S. Abramsky. Semantics of Interaction: an introduction to Game Semantics , 1997 .
[3] Andrew M. Pitts,et al. Semantics and Logics of Computation: List of Contributors , 1997 .
[4] Radha Jagadeesan,et al. Games and Full Completeness for Multiplicative Linear Logic , 1994, J. Symb. Log..
[5] Andrzej S. Murawski,et al. Discreet Games, Light Affine Logic and PTIME Computation , 2000, CSL.
[6] Samson Abramsky,et al. A Fully Complete PER Model for ML Polymorphic Types , 2000, CSL.
[7] Andrzej S. Murawski,et al. Dominator trees and fast verification of proof nets , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).
[8] Vincent Danos,et al. The structure of multiplicatives , 1989, Arch. Math. Log..
[9] Kousha Etessami,et al. Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997 , 1997, LICS.
[10] Andrea Asperti. Light affine logic , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).
[11] Jean-Yves Girard,et al. Light Linear Logic , 1998, Inf. Comput..
[12] Dominic J. D. Hughes. Games and definability for system F , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.
[13] Andrzej S. Murawski,et al. Exhausting Strategies, Joker Games and Full Completeness for IMLL with Unit (Preliminary Version) , 1999 .
[14] C.-H. Luke Ong,et al. On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..
[15] Andrzej S. Murawski,et al. Exhausting strategies, joker games and full completeness for IMLL with Unit , 2003, Theor. Comput. Sci..