A linear spine calculus

Journal of Logic and Computation

Volumn 13, Issue 5, 2003, Pages 639-688

  Cervesato, Iliano ^a   Pfenning, Frank ^b  

^a ITT INDUSTRIES   (United States)

^b Carnegie Mellon University ^*  (United States)

Author keywords

Linear lambda calculus; Term assignment systems; Uniform provability

Indexed keywords

ALGORITHMS; LOGIC PROGRAMMING; PROLOG (PROGRAMMING LANGUAGE); THEOREM PROVING;

LINEAR SPINE CALCULUS; TERM ASSIGNMENT SYSTEMS; UNIFORM PROVABILITY;

DIFFERENTIATION (CALCULUS);

EID: 0344152241     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/13.5.639     Document Type: Article

References (35)

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 1, 375-416, 1991.
2. A. Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University of Edinburgh, 1996.
3. H. P. Barendregt. The Lambda-Calculus: Its Syntax and Semantics. North-Holland, 1980.
4. I. Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Università di Torino February 1996.
5. I. Cervesato and F. Pfenning. A linear logical framework. Information and Computation, 179, 19-75, 2002.
6. I. Cervesato and F. Pfenning. Linear higher-order pre-unification. Technical Report CMU-CS-97-160, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, July 1997.
7. 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.
8. A. Church. A formulation of a simple theory of types. Journal of Symbolic Logic, 5, 56-68, 1940.
9. N. G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indagationes Mathematics, 34, 381-392, 1972.
10. N. Dershowitz and J.-P. Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter Rewrite Systems, pp. 243-320. MIT Press, 1990.
11. G. Dowek, G. Huet, and B. Werner. On the definition of the eta-long normal from in type systems of the cube. In Informal Proceedings of the Workshop on Types for Proofs and Programs, Herman Geuvers, ed. Nijmegen, The Netherlands, May 1993.
12. R. Dyckhoff and L. Pinto. Cut-elimination and a permutation-free sequent calculus for intuitionistic logic. Studia Logica, 60, 107-118, 1998.
13. R. Dyckhoff and L. Pinto. Permutability of proofs in intuitionistic sequent calculi. Theoretical Computer Science, 212, 141-155, 1999.
14. R. Dyckhoff and C. Urban. Strong normalization of Herbelin's explicit substitution calculi with substitution propagation. In Proceedings of the Fourth Workshop on Explicit Substitutions Theory and Applications - WESTAPP 01, P. Lescanne, ed., pp. 26-45, Utrecht, the Netherlands, 2001. Logic Group Preprint series No 210, Institute of Philosophy, University of Utrecht, ISBN 90-393-2764-5.
15. N. Ghani. Eta-expansions in dependent type theory - the calculus of constructions. In Proceedings of the Third International Conference on Typed Lambda Calculus and Applications (TLCA'97), Nancy, France. P. de Groote and J.R. Hindley, eds, pp. 164-180, volume 1210 of Lecture Notes in Computer Science, Springer-Verlag, 1997.
16. J.-Y Girard. Linear logic. Theoretical Computer Science, 50, 1-102, 1987.
17. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40, 143-184, 1993.
18. H. Herbelin. A λ-calculus structure isomorphic to Genzten-style sequent calculus structure. In Computer Science Logic, Eighth Workshop - CSL'94, Kazimierz, Poland. L. Pacholski and J. Tiuryn, eds, pp. 61-75, volume 933 of Lecture Notes in Computer Science, Springer Verlag, 1994.
19. J. Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic. Information and Computation, 110, 327-365, 1994. A preliminary version appeared in the Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, pp. 32-42, Amsterdam, The Netherlands, July 1991.
20. W. A. Howard. The formulae-as-types notion of construction. Unpublished manuscript, 1969. Reprinted in To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, J. P. Seldin and J. R. Hindley, eds, pp. 479-490, Academic Press, 1980.
21. G. Huet. The constructive engine. In A Perspective in Theoretical Computer Science, R. Narasimhan, ed. World Scientific Publishing, 1989. Commemorative Volume for Gift Siromoney.
22. S. Ishtiaq and D. Pym. A relevant analysis of natural deduction. Journal of Logic and Computation, 8, 809-838, 1998.
23. C. B. Jay and N. Ghani. The virtues of eta-expansion. Journal of Functional Programming, 2, 135-154, 1995.
24. S. Michaylov and F. Pfenning. An empirical study of the runtime behavior of higher-order logic programs. In Proceedings of the Workshop on the λProlog Programming Language, D. Miller, ed., pp. 257-271, Philadelphia, Pennsylvania, July 1992. University of Pennsylvania. Available as Technical Report MS-CIS-92-86.
25. D. Miller, A logic programming language with lambda-abstraction, function variables, and simple unification. In Proceedings of the International Workshop on Extensions of Logic Programming, Tübingen, Germany. P. Schroeder-Heister, ed., pp. 253-281, volume 475 of Lecture Notes in Artificial Intelligence, Springer-Verlag, 1991.
26. D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1, 497-536, 1991.
27. D. Miller. A multiple-conclusion meta-logic. In Ninth Annual IEEE Symposium on Logic in Computer Science, Paris, France. S. Abramsky, ed., pp. 272-281, 1994.
28. D. Miller. Lambda Prolog: An introduction to the language and its logic. Current draft available from, 2001.
29. D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51, 125-157, 1991.
30. G. Nadathur. The metalanguage lambda prolog and its implementation. In Proceedings of the Fifth International Symposium on Functional and Logic Programming - FLOPS 2001, Tokyo, Japan. H. Kuchen and K. Ueda, eds, pp. 1-20, volume 2024 of Lecture Notes in Computer Science, Springer Verlag, 2001.
31. F. Pfenning. Unification and anti-unification in the Calculus of Constructions. In Sixth Annual IEEE Symposium on Logic in Computer Science, pp. 74-85, Amsterdam, The Netherlands, July 1991.
32. F. Pfenning. Elf: A meta-language for deductive systems. In Proceedings of the Twelvth International Conference on Automated Deduction, Nancy France. A. Bundy, ed., pp. 811-815, volume 814 of Lecture Notes in Artificial Intelligence, Springer-Verlag, 1994. System abstract.
33. F. Pfenning and C. Schürmann. System description: Twelf - a meta-logical framework for deductive systems. In Proceedings of the Sixteenth International Conference on Automated Deduction (CADE-16), Trento, Italy. H. Gazinger, ed, pp. 202-206, volume 1632 of Lecture Notes in Artificial Intelligence, Springer-Verlag, 1999.
34. J. Espírito Santo. Revisiting the correspondence between cut elimination and normalisation. In Proceedings of the Twenty-seventh International Colloquium on Automata, Languages and Programming - ICALP' 2000, Geneva, Switzerland. U. Montanari, J. D. P. Rolim, and E. Welzl, eds, pp. 600-611, volume 1853 of Lecture Notes in Computer Science, Springer Verlag, 2000.
35. H. Schwichtenberg. Termination of permutative conversions in intuitionistic Gentzen calculi. Theoretical Computer Science, 212, 247-260, 1999.