Sequent combinators: A Hilbert system for the lambda calculus

Mathematical Structures in Computer Science

Volumn 10, Issue 1, 2000, Pages 1-

  Goguen, Healfdene ^a   Goubault Larrecq, Jean ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84966620235     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129599002911     Document Type: Article

References (40)

1. This paper was submitted by invitation for inclusion in the special issue in honor of Professor Roger Hindley's 60th birthday.
2. Abadi, M., Cardelli, L., Curien, P.-L. and Levy, J.-J. (1991) Explicit substitutions. Journal of Functional Programming 1 4 375–416.
3. Barendregt, H. (1984) The Lambda Calculus, Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics 103 North-Holland Publishing Company, Amsterdam.
4. Bierman, G. and de Paiva, V. (1992) Intuitionistic necessity revisited. In: Logic at Work, Amsterdam, the Netherlands.
5. Church, A. (1940) A formulation of the simple theory of types. Journal of Symbolic Logic 5 56–68.
6. Church, A. (1956) Introduction to Mathematical Logic, Princeton University Press.
7. Curien, P.-L. (1993) Categorical Combinators, Sequential Algorithms and Functional Programming, Pitman, second edition.
8. Curry, H. B. and Feys, R. (1958) Combinatory Logic, volume 1, North Holland.
9. Dershowitz, N. (1987) Termination of rewriting. Journal of Symbolic Computation 3 69–116.
10. Diller, A. (1988). Compiling Functional Languages, J. Wiley.
11. Dougherty, D. J. (1993) Higher-order unification via combinators. Theoretical Computer Science 114 2 273–298.
12. Dowek, G., Hardin, T. and Kirchner, C. (1995) Higher-order unification via explicit substitutions. In: Proceedings of the 10th Annual IEEE Symposium on Logics in Computer Science (LICS’95) 366–374.
13. Gentzen, G. (1969) Investigations into logical deduction. In: Szabo, M. E. (ed.) The Collected Works of Gerhard Gentzen, North Holland.
14. Girard, J.-Y., Lafont, Y. and Taylor, P. (1989) Proofs and Types, Cambridge University Press. Goguen, H. (1995) Typed operational semantics. In: Proceedings of the 2nd International Conference on Typed Lambda-Calculi and Applications (TLCA’95). Springer-Verlag Lecture Notes in Computer Science 902 186–200.
15. Goguen, H. and Luo, Z. (1993) Inductive data types: Well-ordering types revisited. In: Huet, G. and Plotkin, G. (eds.) Logical Environments, Cambridge University Press 198–218.
16. Gonthier, G., Abadi, M. and Levy, J.-J. (1992) The geometry of optimal lambda reduction. In: Conference record of the 19th ACM Symposium on Principles of Programming Languages (POPL’92), ACM Press 15–26.
17. Gonthier, G., Abadi, M. and Levy, J.-J. (1992) Linear logic without boxes. In: Proceedings of the 7th Annual IEEE Symposium on Logics in Computer Science (LICS’92) 223–234.
18. Goubault-Larrecq, J. (1996) On computational interpretations of the modal logic S4 I. Cut elimination. Technical Report 1996–35, Universitat Karlsruhe.
19. Goubault-Larrecq, J. (1996) On computational interpretations of the modal logic S4 II. The 2evQ-calculus. Technical Report 1996–34, Universitat Karlsruhe.
20. Goubault-Larrecq, J. (1997) On computational interpretations of the modal logic S4 IIIb. Confluence, termination of 2evQH. Research Report RR-3164, INRIA.
21. Goubault-Larrecq, J. (1998) A few remarks on SKInT. Research Report RR-3475, INRIA. (Submitted.)
22. Goubault-Larrecq, J. (1998) A proof of weak termination of typed λσ-calculi. In: Proceedings of the TYPES’96 Workshop, Aussois, France. Preliminary version as INRIA Research Report RR-3090, January 1997.
23. Goubault-Larrecq, J. and Mackie, I. (1997) Proof Theory and Automated Deduction, Applied Logic Series 6, Kluwer. ISBN 0-7923-4593-2.
24. Griffin, T. G. (1990) A formulas-as-types notion of control. In: Conference record of the 17th Annual ACM Symposium on Principles of Programming Languages (POPL’90), San Francisco, California 47–58.
25. Hardin, T. (1989) Confluence results for the pure strong categorical logic CCL. Lambda-calculi as subsystems of CCL. Theoretical Computer Science 65 3 291–342.
26. Hardin, T. and Levy, J.-J. (1989) A confluent calculus of substitutions. In: France-Japan A.I. and Computer Science Symposium.
27. Hindley, J. R. (1977) Combinatory reductions and lambda reductions compared. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik 23 169–180.
28. Huet, G. (1977) Confluent reductions: Abstract properties and applications to term rewriting systems. In: 18th Annual Symposium on Foundations of Computer Science (FOCS’77), IEEE 30–45.
29. Hughes, J. (1982) Supercombinators, a new implementation method for applicative languages. Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming (LFP’82) 1–10.
30. Johnsson, T. (1984) Efficient compilation of lazy evaluation. ACM Conference on Compiler Construction 58–69.
31. Kamareddine, F. and Rios, A. (1997) Extending a 2-calculus with explicit substitution which preserves strong normalisation into a confluent calculus on open terms. Journal of Functional Programming 7 4 395–420.
32. Kennaway, R. and Sleep, R. (1988) Director strings as combinators. ACM Transactions on Programming Languages and Systems 10 4 602–626.
33. Lambek, J. and Scott, P. J. (1989) Introduction to Higher Order Categorical Logic, Cambridge University Press.
34. Lamping, J. (1990) An algorithm for optimal lambda-calculus reductions. In: Conference record of the 17th ACM Symposium on Principles of Programming Languages (POPL’90), ACM Press 16–30. Mellies, P.-A. (1995) Typed λ-calculi with explicit substitutions may not terminate. In: Proceedings of the 2nd International Conference on Typed Lambda-Calculi and Applications (TLCA’95). Springer-Verlag Lecture Notes in Computer Science 902 328–334.
35. Murthy, C. R. (1991) Classical proofs as programs: How, when and why. In: Proceedings of the First Annual Symposium on Constructivity in Computer Science.
36. Peyton-Jones, S. (1986) The Implementation of Functional Programming Languages, Prentice-Hall.
37. Plotkin, G. D. (1975) Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science 1 (2) 125–159.
38. Turner, D. A. (1979) A new implementation technique for applicative languages. Software – Practice and Experience 9 31–49.
39. Wand, M. and Friedman, D. P. (1986) The mystery of the tower revealed: A non-reflexive description of the reflexive tower. In: Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming (LFP’86) 298–307.
40. Yokouchi, H. (1989) Church-Rosser theorem for a rewriting system on categorical combinators. Theoretical Computer Science 65 3 271–290.