Believe it or not, AJM's games model is a model of classical linear logic

22 November 2002

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

No. 10436871,p. 68-75
https://doi.org/10.1109/lics.1997.614933

Abstract

A general category of games is constructed. A subcategory of saturated strategies, closed under all possible codings in copy games, is shown to model reduction in classical linear logic.

Keywords

This publication has 13 references indexed in Scilit:

Game semantics and abstract machines
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
A new deconstructive logic: linear logic
The Journal of Symbolic Logic, 1997
Directed virtual reductions
Published by Springer Nature ,1997
Games and weak-head reduction for classical PCF
Published by Springer Nature ,1997
Projecting sequential algorithms on strongly stable functions
Annals of Pure and Applied Logic, 1996
Reversible, Irreversible and Optimal λ-machines
Electronic Notes in Theoretical Computer Science, 1996
A semantics of evidence for classical arithmetic
The Journal of Symbolic Logic, 1995
Full Abstraction for PCF (extended abstract)
Lecture Notes in Computer Science, 1994
A game semantics for linear logic
Annals of Pure and Applied Logic, 1992
Geometry of interaction 2: Deadlock-free algorithms
Lecture Notes in Computer Science, 1990