Computational interpretations of classical linear logic

Authors:
Paulo Oliva
Affiliations:
Department of Computer Science, Queen Mary, University of London, London, UK
Venue:
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Year:
2007

Citing 4
Cited 2

Linear logic

Theoretical Computer Science
Questions and answers: a category arising in linear logic complexity theory, and set theory

Proceedings of the workshop on Advances in linear logic
A Dialectica-like Model of Linear Logic

Category Theory and Computer Science
Modified Realizability Interpretation of Classical Linear Logic

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science

Hybrid Functional Interpretations

CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Functional interpretations of intuitionistic linear logic

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We survey several computational interpretations of classical linear logic based on two-player one-move games. The moves of the games are higher-order functionals in the language of finite types. All interpretations discussed treat the exponential-free fragment of linear logic in a common way. They only differ in how much advantage one of the players has in the exponentials games. We discuss how the several choices for the interpretation of the modalities correspond to various well-known functional interpretations of intuitionistic logic, including Gödel's Dialectica interpretation and Kreisel's modified realizability.