Computational Interpretations of Classical Linear Logic

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 Godel's Dialectica interpretation and Kreisel's modified realizability.