Timeless games

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

Volumn 1414, Issue , 1998, Pages 56-77

  Baillot, Patrick ^a   Danos, Vincent ^b   Ehrhard, Thomas ^a   Regnier, Laurent ^a  

^a AIX MARSEILLE UNIVERSITÉ   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

RECONFIGURABLE HARDWARE;

CLASSICAL LINEAR LOGIC; GAMES MODEL; NATURAL TIME; POLARIZATION STRUCTURES; RELATIONAL MODEL; SOURCE MODELING; STATIC MODEL; TARGET MODEL;

COMPUTER CIRCUITS;

EID: 84957708946     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028007     Document Type: Conference Paper

References (11)

1. Samson Abramsky and Radha Jagadeesan. Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic, 59:543-574, 1994.
2. 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 TACS’94, number 789 in Lecture Notes in Computer Science, pages 1-15, Sendai, Japan, April 1994. Springer-Verlag.
3. 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.
4. 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 12th Symposium on Logic in Computer Science, Warsaw, 1997. IEEE Computer Society Press.
5. Pierre-Louis Curien and Hugo Herbelin. Computing with abstract Bohm trees. Manuscript, 1996.
6. 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.
7. Thomas Ehrhard. Projecting sequential algorithms on strongly stable functions. Annals of Pure and Applied Logic, 77(3), February 1996.
8. Thomas Ehrhard. A relative PCF-definability result for strongly stable functions and some corollaries. To appear in Information and Computation, 1997.
9. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
10. 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.
11. Pasquale Malacaria. Personnal communication, 1993.