A judgmental reconstruction of modal logic

Mathematical Structures in Computer Science

Volumn 11, Issue 4, 2001, Pages 511-540

  Pfenning, Frank ^a   Davies, Rowan ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84945246255     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129501003322     Document Type: Article

References (28)

1. Aczel, P. (1999) The Russel-Prawitz modality. In: Fairtlough, M. (ed.) Informal Proceedings of the Workshop on Intuitionistic Modal Logics and Applications, Trento, Italy.
2. Alechina, N., de Paiva, V. and Ritter, E. (1998) Relating categorical and Kripke semantics for intuitionistic modal logics. In: Proceedings of the Conference on Advances in Modal Logic (AIML'98), Uppsala, Sweden, CSLI.
3. Avron, A., Honsell, F.A., Mason, I.A. and Pollack, R. (1992) Using typed lambda calculus to implement formal systems on a machine. Journal of Automated Reasoning 9 (3) 309–354. (A preliminary version appeared as University of Edinburgh Report ECS-LFCS-87-31)
4. Benton, P.N., Bierman, G.M. and de Paiva, V.C.V. (1998) Computational types from a logical perspective. Journal of Functional Programming 8 (2) 177–193.
5. Bierman, G. and de Paiva, V. (1996) Intuitionistic necessity revisited. Technical Report CSRP-96-10, School of Computer Science, University of Birmingham.
6. Davies, R. and Pfenning, F. (1996) A modal analysis of staged computation. In: Steele Jr., G. (ed.) Proceedings of the 23rd Annual Symposium on Principles of Programming Languages, St. Petersburg Beach, Florida, ACM Press 258–270.
7. Davies, R. and Pfenning, F. (2000) A modal analysis of staged computation. To appear in Journal of the ACM. (Preliminary version available as Technical Report CMU-CS-99-153, August 1999)
8. Despeyroux, J., Pfenning, F. and Schumann, C. (1997) Primitive recursion for higher-order abstract syntax. In: Hindley, R. (ed.) Proceedings of the Third International Conference on Typed Lambda Calculus and Applications (TLCA'97), Nancy, France. Springer-Verlag Lecture Notes in Computer Science 1210 147–163. (An extended version is available as Technical Report CMU-CS-96-172, Carnegie Mellon University)
9. Fairtlough, M. and Mendler, M. (1994) An intuitionistic modal logic with application to the formal verification of hardware. In: Pacholski, L. and Tiuryn, J. (eds.) Proceedings of the 8th Workshop on Computer Science Logic (CSL'94), Kazimierz, Poland. Springer-Verlag Lecture Notes in Computer Science 933 354–368.
10. Fairtlough, M. and Mendler, M. (1997) Propositional lax logic. Information and Computation 137 (1) 1–33.
11. Fairtlough, M., Mendler, M. and Walton, M. (1997) First-order lax logic as a framework for constraint logic programming. Technical Report MIP-9714, University of Passau, Passau, Germany.
12. Gentzen, G. (1935) Untersuchungen uber das logische SchlieBen. Mathematische Zeitschrift 39 176—210, 405–431. (English translation in Szabo, M. E. (ed.) (1969) The Collected Papers of Gerhard Gentzen, North-Holland 68-131.)
13. Goubault-Larrecq, J. (1996) On computational interpretations of the modal logic S4, parts I-III. Technical Reports 1996-33,34,35, Institut fur Logik, Komplexitat und Deduktionssysteme, Universitat Karlsruhe, Karlsruhe, Germany. Goubault-Larrecq, J. (1997) On computational interpretations of the modal logic S4, part IIIb. Technical Report 3164, INRIA, France.
14. Hodas, J. and Miller, D. (1994) Logic programming in a fragment of intuitionistic linear logic. Information and Computation. (A preliminary version appeared in the Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, Amsterdam, The Netherlands, July 1991, 32-42)
15. Kobayashi, S. (1997) Monad as modality. Theoretical Computer Science 175 29–74.
16. Martin-Lof, P. (1980) Constructive mathematics and computer programming. In: Logic, Methodology and Philosophy of Science VI, North-Holland 153–175.
17. Martin-Lof, P. (1994) Analytic and synthetic judgements in type theory. In: Parrini, P. (ed.) Kant and Contemporary Epistemology, Kluwer Academic Publishers 87–99.
18. Martin-Lof, P. (1996) On the meanings of the logical constants and the justifications of the logical laws. Nordic Journal of Philosophical Logic 1 (1) 11–60.
19. Martini, S. and Masini, A. (1994) A computational interpretation of modal proofs. In: Wansing, H. (ed.) Proof Theory of Modal Logics, Kluwer. (Workshop proceedings)
20. Miculan, M. (1997) Encoding Logical Theories of Programs, Ph. D. thesis, Dipartimento di Informatia, Universita degli Studi di Pisa.
21. Moggi, E. (1988) Computational lambda-calculus and monads. Technical Report ECS-LFCS-88-86, University of Edinburgh.
22. Moggi, E. (1989) Computational lambda calculus and monads. In: Proceedings of the Fourth Symposium on Logic in Computer Science, Asilomar, California. IEEE Computer Society Press 14–23.
23. Moggi, E. (1991) Notions of computation and monads. Information and Computation 93 (1) 55–92.
24. Pfenning, F. and Wong, H.-C. (1995) On a modal 2-calculus for S4. In: Brookes, S. and Main, M. (eds.) Proceedings of the Eleventh Conference on Mathematical Foundations of Programming Semantics, New Orleans, Louisiana. Electronic Notes in Theoretical Computer Science, Elsevier.
25. Prawitz, D. (1965) Natural Deduction, Almquist & Wiksell, Stockholm.
26. Sabry, A. and Wadler, P. (1997) A reflection on call-by-value. ACM Transactions on Programming Languages and Systems 19 (6) 916–941.
27. Vigano, L. (1997) A Framework for Non-Classical Logics, Ph. D. thesis, Universitat des Saarlandes.
28. Wickline, P., Lee, P., Pfenning, F. and Davies, R. (1998) Modal types as staging specifications for run-time code generation. ACM Computing Surveys 30.