Abstract
Two models of classical linear logic are set up. First our recent version of AJM games model which will be our source model. Then the target model, polarized pointed relations, a variant of the plain relational model which is constructed in two steps: first the model of pointed relations, then the additional polarization structure which yields a proper duality. Then the natural time-forgetting map is shown to generate a lax functor from the source to the target. Finally a further refinement of the target model using bipolarities is sketched, giving a closer link with the games model for the interpretation of syntax. Thus a bridge is constructed that goes from a dynamic model to a static model of evaluation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Samson Abramsky and Radha Jagadeesan. Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic, 59:543–574, 1994.
Samson Abramsky, Radha Jagadeesan, and Pasquale Malacaria. Full abstraction for PCF (extended abstract). In Masami Hagiya and John C. Mitchell, editors, Theoretical Aspects of Computer Software. International Symposium TA CS'94, number 789 in Lecture Notes in Computer Science, pages 1–15, Sendai, Japan, April 1994. Springer-Verlag.
Samson Abramsky, Radha Jagadeesan, and Pasquale Malacaria. Full abstraction for PCF (submitted for publication. available by ftp on theory.doc.ic.ac.uk, November 1995.
Patrick Baillot, Vincent Danos, Thomas Ehrhard, and Laurent Regnier. Believe it or not, AJM's games model is a model of classical linear logic. In Proceedings of the 12 th Symposium on Logic in Computer Science, Warsaw, 1997. IEEE Computer Society Press.
Pierre-Louis Curien and Hugo Herbelin. Computing with abstract Böhm trees. Manuscript, 1996.
Vincent Danos, Hugo Herbelin, and Laurent Regnier. Games semantics and abstract machines. In Proceedings of the 11th Symposium on Logic in Computer Science, New Brunswick, 1996. IEEE Computer Society Press.
Thomas Ehrhard. Projecting sequential algorithms on strongly stable functions. Annals of Pure and Applied Logic, 77(3), February 1996.
Thomas Ehrhard. A relative PCF-definability result for strongly stable functions and some corollaries. To appear in Information and Computation, 1997.
Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.
F. Lamarche. Sequentiality, games and linear logic (announcement). In Workshop on Categorical Logic in Computer Science. Publications of the Computer Science Department of Aarhus University, DAIMI PB-397-II, 1992.
Pasquale Malacaria. Personnal communication, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baillot, P., Danos, V., Ehrhard, T., Regnier, L. (1998). Timeless games. In: Nielsen, M., Thomas, W. (eds) Computer Science Logic. CSL 1997. Lecture Notes in Computer Science, vol 1414. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028007
Download citation
DOI: https://doi.org/10.1007/BFb0028007
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64570-2
Online ISBN: 978-3-540-69353-6
eBook Packages: Springer Book Archive