Abstract
This paper presents a game model of Second-order Intuitionistic Multiplicative Affine Logic (IMAL2). We extend Lamarche’s essential nets to the second-order affine setting and use them to show that the model is fully and faithfully complete.
On leave from Nicholas Copernicus University, Toruń, Poland.
http://www.comlab.ox.ac.uk/oucl/work/luke.ong.html
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramsky, S.: Semantics of Interaction: an introduction to Game Semantics. Semantics and Logics of Computation. Cambridge Univ. Press, 1–32
Abramsky, S., Jagadeesan, R.: Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic 59 (1994) 543–574
Abramsky, S., Lenisa, M.: A Fully-complete PER Model for ML Polymorphic Types. In Proceedings of CSL2000, Annual Conference of the European Association of Computer Science Logic, August 2000, Fischbachau, Germany. LNCS Vol. 1862, Springer-Verlag, 2000
Asperti, A.: Light affine logic. In Proc. LICS’98. IEEE Computer Society (1998)
Danos, V., Regnier, L.: The Structures of Multiplicatives. Archive for Mathematical Logic, Vol. 28, 1989, 181–203
Girard, J.-Y.: Quantifiers in Linear Logic II. Preprint, équipe de Logique de Paris VII, 1991
Girard, J.-Y.: Light linear logic. Information & Computation 143 (1998) 175–204
Hughes, D. H. D.: Games and definability for System F. In Proceedings of 12th IEEE Symposium on Logic in Computer Science, 1997, IEEE Computer Science Society
Hyland, J. M. E., Ong, C.-H. L.: On Full Abstraction for PCF: I, II & III. Information & Computation (2000) 130 pp, in press
Ker, A. D., Nickau, H., Ong, C.-H. L.: A universal innocent game model for the Böhm tree lambda theory. In Proceedings of the 8th Annual Conference on the EACSL, Madrid, Spain, September 1999, LNCS, Vol. 1683 Springer-Verlag, 1999, 405–419
Lamarche, F.: Proof Nets for Intuitionistic Linear Logic 1: Essential Nets. Preprint ftp-able from Hypatia, 1994
Murawski, A. S., Ong, C.-H. L.: Exhausting Strategies, Joker Games and Full Completeness for IMLL with Unit. In Proc. 8th Conf. CTCS’99. ENTCS 29 (1999)
Murawski, A. S., Ong, C.-H. L.: Discreet Games, Light Affine Logic and PTIME Computation. In Proceedings of CSL2000, Annual Conference of the European Association of Computer Science Logic, Fischbachau, Germany. LNCS Vol. 1862, Springer-Verlag, 2000, 427–441
Murawski, A. S., Ong, C.-H. L.: Dominator Trees and Fast Verification of Proof Nets. In Proceedings of 15th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 2000, 181–191
Nickau, H., Ong, C.-H. L.: Games for System F. Working paper, 1999
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Murawski, A.S., Luke Ong, C.H. (2001). Evolving Games and Essential Nets for Affine Polymorphism. In: Abramsky, S. (eds) Typed Lambda Calculi and Applications. TLCA 2001. Lecture Notes in Computer Science, vol 2044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45413-6_28
Download citation
DOI: https://doi.org/10.1007/3-540-45413-6_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41960-0
Online ISBN: 978-3-540-45413-7
eBook Packages: Springer Book Archive