On Computational Interpretations of the Modal Logic S4 IIIa. Termination, Confluence, Conservativity of λevQ (1996)

by Jean Goubault-Larrecq
Venue:INSTITUT FUR LOGIK, KOMPLEXITAT UND DEDUKTIONSSYSTEME, UNIVERSITAT
Citations:8 - 4 self

Documents Related by Co-Citation

40 A Confluent Calculus of Substitutions – T Hardin, J-J Lévy - 1989
390 Explicit substitutions – M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy - 1996
18 and Valeria de Paiva. Intuitionistic necessity revisited – G M Bierman - 1996
6 On computational interpretations of the modal logic S4 II. The evQ-calculus – Jean Goubault-Larrecq - 1996
5 Confluence and preservation of strong normalization in an explicit substitutions calculus – C A Munoz Hurtado - 1996
33 From oe to AE a journey through calculi of explicit substitutions – P Lescanne - 1994
8 On Computational Interpretations of the Modal Logic S4 I. Cut Elimination – Jean Goubault-larrecq - 1996
633 Modal Logic: An Introduction – B F Chellas - 1980
12 On a modal -calculus for S4 – Frank Pfenning, Hao-Chi Wong - 1995
5 Efficient Algebraic Operations on Programs – Neil D. Jones - 1991
28 A Computational Interpretation of Modal Proofs – Simone Martini, Andrea Masini - 1994
14 Coming to Terms with Modal Logic: On the interpretation of modalities in typed -calculus – T Borghuis - 1995
58 A case for runtime code generation – D Keppel, S J Eggers, R R Henry - 1991
13 Monad as modality – S Kobayashi - 1997
175 Logic Programming in the LF Logical Framework – Frank Pfenning - 1991
63 Semantical analysis of modal logic I, normal propositional calculi – S Kripke - 1963
54 Lightweight Run-Time Code Generation – Mark Leone, Peter Lee - 1994
97 A simple applicative language: Mini-ML – D Clement, J Despeyroux, T Despeyroux, G Kahn - 1986
126 On the meanings of the logical constants and the justifications of the logical laws – Per Martin-Löf - 1996