Hybridizing a Logical Framework

Electronic Notes in Theoretical Computer Science

Volumn 174, Issue 6, 2007, Pages 135-148

  Reed, Jason ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Hybrid logic; logical frameworks; substructural logics

Indexed keywords

HYBRID LOGIC; LOGICAL FRAMEWORKS; SUBSTRUCTURAL LOGICS;

COMPUTABILITY AND DECIDABILITY; ENCODING (SYMBOLS); FORMAL LANGUAGES; HYBRID COMPUTERS;

TEMPORAL LOGIC;

EID: 34249290753     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.11.030     Document Type: Article

References (32)

1. Andreoli J.M. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation 2 (1992) 297-347
2. Areces C., Blackburn P., and Marx M. Hybrid logics: Characterization, interpolation and complexity. Journal of Symbolic Logic 66 (2001) 977-1010
3. Awodey, S. and A. Bauer, Propositions as [Types], Technical report, Institut Mittag-Leffler (2001)
4. Blackburn P. Representation, reasoning, and relational structures: a hybrid logic manifesto. Logic Journal of IGPL 8 (2000) 339-365
5. Braüner, T. and V. de Paiva, Towards constructive hybrid logic, Elec. Proc. of Methods for Modalities 3 (2003)
6. Braüner, T. and V. de Paiva., Intuitionistic hybrid logic (2006), to appear
7. Cervesato I., and Pfenning F. A linear logical framework. Inf. Comput. 179 (2002) 19-75
8. Cervesato, I., F. Pfenning, D. Walker and K. Watkins, A concurrent logical framework I: Judgments and properties, Technical Report CMU-CS-02-101, Department of Computer Science (2003)
9. Cervesato, I., F. Pfenning, D. Walker and K. Watkins, A concurrent logical framework II: Examples and applications, Technical Report CMU-CS-02-102, Department of Computer Science (2003)
10. Chadha R., Macedonio D., and Sassone V. A Hybrid Intuitionistic Logic: Semantics and Decidability. Journal of Logic and Computation 16 (2006) 27
11. Chang, B.-Y.E., K. Chaudhuri and F. Pfenning, A judgmental analysis of linear logic, Technical Report CMU-CS-03-131, Carnegie Mellon University (2003)
12. Gabbay, D., Labelled deductive systems, Technical Report 90-22, University of Munich (1990)
13. Galmiche D., and Méry D. Semantic Labelled Tableaux for Propositional BI. Journal of Logic and Computation 13 (2003) 707-753
14. Girard J. Linear logic. Theoretical Computer Science 50 (1987) 1-102
15. Harper R., Honsell F., and Plotkin G. A framework for defining logics. Journal of the Association for Computing Machinery 40 (1993) 143-184
16. Harper R., and Pfenning F. On Equivalence and Canonical Forms in the LF Type Theory. AC Transactions on Computational Logic 6 (2005) 61-101
17. Ishtiaq S.S., and Pym D.J. A relevant analysis of natural deduction. Journal of Logic and Computation 8 (1998) 809-838
18. Jia, L. and D. Walker, Modal proofs as distributed programs, Technical Report TR-671-03, Princeton University (2003)
19. McCreight, A. and C. Schürmann, A meta linear logical framework (2003), draft manuscript. URL http://www.itu.dk/people/carsten/papers/mllf.pdf
20. Moody, J., Modal logic as a basis for distributed computation, Technical Report CMU-CS-03-194, Carnegie Mellon University (2003)
21. Murphy, T., VII, K. Crary, R. Harper and F. Pfenning, A Symmetric Modal Lambda Calculus for Distributed Computing, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04)-Volume 00 (2004), pp. 286-295
22. O'Hearn P., and Pym D. The logic of bunched implications. Bulletin of Symbolic Logic 5 (1999) 215-244
23. Pfenning, F., Intensionality, extensionality, and proof irrelevance in modal type theory, in: J. Halpern, editor, Proceedings of the 16th Annual Symposium on Logic in Computer Science (LICS'01) (2001), pp. 221-230
24. Pfenning, F. and C. Schürmann, System description: Twelf - a meta-logical framework for deductive systems, in: H. Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction (CADE-16) (1999), pp. 202-206
25. Pientka, B. and F. Pfenning, Termination and reduction checking in the logical framework, in: Workshop on Automation of Proofs by Mathematical Induction, 2000
26. Rasga J., Sernadas A., Sernadas C., and Vigano L. Fibring labelled deduction systems. Journal of Logic and Computation 12 (2002) 443-473
27. Reed, J., Canonical forms in a hybrid logical framework (2006), draft manuscript. URL http://www.cs.cmu.edu/~jcreed/papers/cfhlf.pdf
28. Rohwedder, E. and F. Pfenning, Mode and termination checking for higher-order logic programs, in: H.R. Nielson, editor, Proceedings of the European Symposium on Programming (1996), pp. 296-310
29. Schürmann, C., Automating the meta-theory of deductive systems, Technical Report CMU-CS-00-146, Department of Computer Science, Carnegie Mellon University (2000)
30. Schürmann, C. and F. Pfenning, A coverage checking algorithm for LF, in: D. Basin and B. Wolff, editors, Proceedings of the Theorem Proving in Higher Order Logics 16th International Conference, LNCS 2758 (2003), pp. 120-135
31. Viganò L. Labelled Non-Classical Logics (2000), Kluwer Academic Publishers
32. Wright, D. and C. Baker-Finch, Usage Analysis with Natural Reduction Types, in: Proceedings of the Third International Workshop on Static Analysis (1993), pp. 254-266