Theoretical Computer Science
The Structure of Exponentials: Uncovering the Dynamics of Linear Logic Proofs
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
Light Dialectica Program Extraction from a Classical Fibonacci Proof
Electronic Notes in Theoretical Computer Science (ENTCS)
Modified Realizability Interpretation of Classical Linear Logic
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Computational interpretations of classical linear logic
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Dialectica Interpretation with Fine Computational Control
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Hi-index | 0.00 |
We show how different functional interpretations can be combined via a multi-modal linear logic. A concrete hybrid of Kreisel's modified realizability and Gödel's Dialectica is presented, and several small applications are given. We also discuss how the hybrid interpretation relates to variants of Dialectica and modified realizability with non-computational quantifiers.