Functional interpretations of linear and intuitionistic logic

Authors:
Paulo Oliva
Affiliations:
Department of Computer Science, Queen Mary, University of London, London E1 4NS, UK
Venue:
Information and Computation
Year:
2010

Citing 4
Cited 0

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper surveys 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 exponential games. We discuss how the several choices for the interpretation of the modalities correspond to various well-known functional interpretations of intuitionistic logic, including Godel's Dialectica interpretation and Kreisel's modified realizability.