A linear logical framework

Information and Computation

Volumn 179, Issue 1, 2002, Pages 19-75

  Cervesato, Iliano ^a   Pfenning, Frank ^b  

^a ITT INDUSTRIES   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; ENCODING (SYMBOLS); FORMAL LANGUAGES; LOGIC PROGRAMMING; SEMANTICS; THEOREM PROVING;

DEDUCTIVE SYSTEMS; LINEAR LOGIC; LINEAR TYPE THEORY; META REPRESENTATION LANGUAGE;

FORMAL LOGIC;

EID: 0037175760     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.2951     Document Type: Article

References (55)

1. S. Abramsky, Computational interpretations of linear logic, Theoret. Comput. Sci. 111 (1993), 3-57.
2. A. Barber, "Dual Intuitionistic Linear Logic," Technical report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University if Edinburg, 1996.
3. H. P. Barendregt, "The Lambda-Calculus: Its Syntax and Semantics," North-Holland, Amsterdam, 1980.
4. H. Barendregt, Lambda calculi with types, in "Handbook of Logic in Computer Science" (S. Abramtsky, D. M. Gabbay, and T. S. E. Maibaum, Eds.). Vol. II, pp. 118-309, Oxford Univ. Press, Oxford, (1992).
5. N. Benton, G. M. Bierman, J. Martin, E. Hyland, and V. de Paiva, A term calculus for intuitionistic linear logic, in "Proceedings of the International Conference on Typed Lambda Calculi and Applications" (M. Bezem and J. F. Groote, Eds.), Lecture Notes in Computer Science, Vol. 664, pp. 75-90, Springer-Verlag, Berlin/New York, 1993.
6. I. Cervesato, "A Linear Logical Framework," Ph. D. thesis, Dipartimento di Informatice, Universitá di Torino, February, 1996.
7. I. Cervesato, Proof-theoretic foundation of compilation in logic programming languages, in "Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming-JICSLP'98, Manchester, UK, 16-19 June 1998" (J. Jaffar, Ed.). pp. 115-129, MIT Press, Cambridge, MA.
8. I. Cervesato, J. S. Hodas, and F. Pfenning, Efficient resource management for linear logic proof search, Theoret. Comput. Sci. 232, (2000), 133-163.
9. I. Cervesato and F. Pfenning, The linear logical framework LLF, available at http://www.cs.cmu.edu/~fp/11f/.
10. I. Cervesato and F. Pfenning, Linear higher-order pre-unification, in "Proceedings of the Twelfth Annual Symposium on Logic in Computer Science (LICS'97), Warsaw, Poland, June 1997" (G. Winskel, Ed.), pp. 422-433, IEEE Comput. Soc. Press, Los Alamitos, CA.
11. I. Cervesato and F. Pfenning, "A Linear Spine Calculus," Technical Report CMU-CS-97-125, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, April 1997.
12. J. Lal Chirimar, "Proof Theoretic Approach to Specification Languages," Ph.D. thesis, University of Pennsylvania, May 1995.
13. D. Clément, J. Despeyroux, T. Despeyroux, and G. Kahn, A simple applicative language: Mini-ML, in "Proceedings of the 1986 Conference on LISP and Functional Programming," pp. 13-27, Assoc. Comput. Mach., New York, 1986.
14. T. Coquand, An algorithm for testing conversion in type theory, in "Logical Frameworks" (G. Huet and G. Plotkin, Eds.), pp. 255-279, Cambridge Univ. Press, Cambridge, UK, 1991.
15. L. M. M. Damas, "Type Assignment in Programming Languages," Ph.D. thesis, University of Edinburgh, 1985.
16. N. Dershowitz and J. P. Jouannaud, "Handbook of Theoretical Computer Science," Vol. B. Chap. Rewrite Systems, pp. 243-320 MIT Press, Cambridge, MA. 1990.
17. R. Dyckhoff, Contraction-free sequent calculi for intuitionistic logic, J. Symbolic Logic 57 (1992), 795-807.
18. A. Felty, Encoding dependent types in an intuitionistic logic, in "Logical Frameworks" (G. Huet and G. D. Plotkin, Eds.), pp. 214-251, Cambridge Univ. Press, Cambridge, UK, 1991.
19. R. O. Gandy, Proofs of strong normalization, in"To H. B. Curry: Essay in Combinatory Logic, Lambda Calculus and Formalism" (J. P. Seldin and J. R.Hindley, Eds.), pp. 457-477, Academic Press, San Diego, 1980.
20. H. Geuvers, "Logics and Type Systems," Ph.D. thesis, Katholieke Universiteit Nijmegen, 1993.
21. J.-Y. Girard, Linear logic, Theoret. Comput. Sci. 50, (1987), 1-102.
22. J.-Y. Girard, On the unity of logic, Ann. Pure Appl. Logic 59 (1993), 201-217.
23. M. J. Gordon, R. Milner, and C. R. Wadsworth, "Edinburgh LCF," Lecture Notes in Computer Science, Vol. 78, Springer-Verlag, Berlin/New York, 1979.
24. M. J. C. Gordon and T. F. Melham, "Introduction to HOL: A Theorem Proving Environment for Higher-order Logic," Cambridge Univ. Press, Cambridge, UK, 1993.
25. J. Hannan and D. Miller, From operational semantics to abstract machines: Preliminary results, in "Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, Nice, France, 1990" (M. Wand, Ed.), pp. 323-332.
26. R. Harper, A simplified account of polymorphic references, Inform. Process. Lett. 51, (1994), 201-206.
27. R. Harper, F. Honsell, and G. Plotkin, A framework for defining logics, J. Assoc. Comput. Mach. 40 (1993), 143-184.
28. J. Hodas and D. Miller, Logic programming in a fragment of intuitionistic linear logic, Inform. and Comput. 110, (1994), 327-365.
29. J. Hodas and D. Miller, A preliminary version appeared in "Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, Amsterdam, The Netherlands, July 1991," pp. 32-42.
30. J. S. Hodas, "Logic Programming in Intuitionistic Linear Logic: Theory, Design, and Implementation," Ph.D. thesis, Department of Computer and Information Science, University of Pennyslavania, 1994,
31. S. Ishtiaq and D. Pym, A relevant analysis of natural deduction, J. Logic Comput. 8, 6 (1998).
32. X. Leroy and P. Weis, Polymorphic type inference and assignment, in "Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, Orlando, FL, January 21-23, 1991," pp. 291-302, Assoc. Comput. Mach., New York.
33. P. Lincoln and J. Mitchell, Operational aspects of linear lambda calculus, in "Seventh Annual Symposium on Logic in Computer Science, Santa Cruz, California, June 1992," pp. 235-246, IEEE Comput. Soc. Press, Los Alamits, CA.
34. S. Michaylov and F. Pfenning, Natural semantics and some of its meta-theory in Elf, "Proceedings of Second International Workshop on Extensions of Logic Programming, Stockholm, Sweden, January 1991," (L.-H. Eriksson, L. Hallnäs, and P. Schroeder-Heister, Eds.), Lecture Notes in Artificial Intelligence, Vol. 596, pp. 299-344, Springer-Verlag, Berlin/New York.
35. D. Miller, A multiple-conclusion meta-logic, in "Ninth Annual IEEE Symposium on Logic in Computer Science, Paris, France, July 1994" (S. Abrahamsky, Ed.). pp. 272-281.
36. D. Miller, G. Plotkin, and D. Pym, A relevant analysis of natural deduction, Talk given at the Workshop on Logical Frameworks, Båstad, Sweden, May 1992.
37. R. Milner, M. Tofte, R. Harper, and D. McQueen, "The Definition of Standard ML," Revised, MIT Press, Cambridge, MA, 1997.
38. F. Pfenning, Logical frameworks, available at http://www.cs.cmu/edu/~fp/lfs.html.
39. F. Pfenning, Logic programming in the LF logical framework, in "Logical Frameworks" (G. Huet and G. Plotkin, Eds.), pp. 149-181, Cambridge Univ. Press, Cambridge, MA, 1991.
40. F. Pfenning, Computation and deduction, Unpublished lectures notes, revised May 1994, April 1996, May 1992.
41. F. Pfenning (1992), A proof of the Church-Rosser theorem and its representation in a logical framework. Technical Report CMU-CS-92-186, Department of Computer Science, Carnegie Mellon University, available at http://www.cs.cmu.edu/~fp/papers/cr92.ps.gz.
42. F. Pfenning, Elf: A meta-language for deductive systems, in "Proceedings of the 12th International Conference on Automated Deduction, Nancy, France, June 1994" (A. Bundy, Ed.), System abstract. Lecture Notes in Artificial Intelligence, pp. 811-815, Springer-Verlag, Berlin/New York.
43. F. Pfenning, "Structural Cut Elimination in Linear Logic," Technical Report CMU-CS-94-222, Department of Computer Science, Carnegie Mellon University, December 1994.
44. F. Pfenning, Structural cut elimination, in "Proceedings of the Tenth Annual Symposium on Logic in Computer Science, San Diego, California, June 1995" (D. Kozen, Ed.), pp. 156-166, IEEE Comput. Soc. Press. Los Alamitos, CA, 1995.
45. F. Pfenning, The practice of logical frameworks, in "Proceedings of the Colloquium on Trees in Algebr and Programming, Linköping, Sweden, April 1996" (H. Kirchner, Ed.). Invited Talk. Lecture Notes in Computer Science, Vol. 1059, pp. 119-134, Springer-Verlag, Berlin/New York.
46. F. Pfenning, Structural cut elimination I. intuitionistic and classical logic, Inform. and Comput. 157 (2000), 84-141.
47. F. Pfenning and C. Schürmann, The Twelf project, available at http://www.cs.cmu.edu/~twelf/.
48. F. Pfenning and C. Schürmann, Automated theorem proving in a simple meta-logic for LF, in "Proceedings of the 15th Conference on Automated Deduction - CADE-15, Lindau, Germany, July 1998" (C. Kirchner and H. Kirchner, Eds.), Lecture Notes in Artificial Intelligence, Vol. 1421, pp. 286-300, Springer-Verlag, Berlin/New York.
49. F. Pfenning and C. Schürmann, System description: Twelf-a meta-logical framework for deductive systems, in "Proceedings of the 16th International Conference on Automated Deducation (CADE-16), Trento, Italy, July, 1999" (H. Ganzinger, Ed.), Lecture Notes in Artificial Intelligence, Vol. 1632, pp. 202-206, Springer-Verlag, Berlin/New York.
50. A. Salvesen, The Church-Rosser theorem for LF with βη-reduction, Unpublished notes to a talk given at the First Workshop on Logical Frameworks in Antibes, France, May 1990.
51. M. Tofte, Type inference for polymorphic references, Inform. and Comput. 89 (1990), 1-34.
52. A.S. Troelstra, Strong normalization for typed terms with surjective pairing, Notre Dame J. Formal Logic 27 (1986), 547-550.
53. M. VanInwegen, "The Machine-Assisted Proof of Programming Language Properties," Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania, 1996.
54. P. Wadler, Linear types can change the world, in "IFIP TC 2 Working Conference on Programming Concepts and Methods, Sea of Gallilee, Israel, April 1990" (M. Broy and C. B. Jones, Eds.), pp.561-581, North-Holland, Amsterdam.
55. A.K. Wright and M. Felleisen, A syntactic approach to type soundness, Inform. and Comput. 115 (1994), 38-94.