Advertisement

On the relation between the λμ-calculus and the syntactic theory of sequential control

  • Philippe de Groote
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 822)

Abstract

We construct a translation of first order λΜ-calculus [15] into a subtheory of Felleisen's λc-calculus [5, 6]. This translation preserves typing and reduction. Then, by constructing the inverse translation, we show that the two calculi are actually isomorphic.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    F. Barbanera and S. Berardi. Continuations and simple types: a strong normalization result. In Proceedings of the ACM SIGPLAN Workshop on Continuations. Report STAN-CS-92-1426, Stanford University, 1992.Google Scholar
  2. [2]
    F. Barbanera and S. Berardi. Extracting constructive content from classical logic via control-like reductions. In M. Bezem and J.F. Groote, editors, Proceedings of the International Conference on on Typed Lambda Calculi and Applications, pages 45–59. Lecture Notes in Computer Science, 664, Springer Verlag, 1993.Google Scholar
  3. [3]
    H.P. Barendregt. The lambda calculus, its syntax and semantics. North-Holland, revised edition, 1984.Google Scholar
  4. [4]
    Ph. de Groote. A CPS-translation of the λΜ-calculus. In Proceedings of the Colloquium on Trees in Algebra and Programming (CAAP'94). Lecture Notes in Computer Science, Springer Verlag, 1994.Google Scholar
  5. [5]
    M. Felleisen, D.P. Friedman, E. Kohlbecker, and B. Duba. A syntactic theory of sequential control. Theoretical Computer Science, 52:205–237, 1987.Google Scholar
  6. [6]
    M. Felleisen and R. Hieb. The revised report on the syntactic theory of sequential control and state. Theoretical Computer Science, 102:235–271, 1992.Google Scholar
  7. [7]
    J.-Y. Girard. A new constructive logic: Classical logic. Mathematical Structures in Computer Science, 1:255–296, 1991.Google Scholar
  8. [8]
    J.-Y. Girard, Y. Lafont, and P.Taylor. Proofs and Types, volume 7 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.Google Scholar
  9. [9]
    T. G. Griffin. A formulae-as-types notion of control. In Conference record of the seventeenth annual ACM symposium on Principles of Programming Languages, pages 47–58, 1990.Google Scholar
  10. [10]
    J.R. Hindley and J.P. Seldin. Introduction to combinators and λ-calculus. London Mathematical Society Student Texts. Cambridge University Press, 1986.Google Scholar
  11. [11]
    J.-L. Krivine. Lambda-calcul, types et modèles. Masson, 1990.Google Scholar
  12. [12]
    J. Lambek and P.J. Scott. An introduction to higher order categorical logic. Cambridge University Press, 1986.Google Scholar
  13. [13]
    C. R. Murthy. An evaluation semantics for classical proofs. In Proceedings of the sixth annual IEEE symposium on logic in computer science, pages 96–107, 1991.Google Scholar
  14. [14]
    C. R. Murthy. A computational analysis of Girard's translation and LC. In Proceedings of the seventh annual IEEE symposium on logic in computer science, pages 90–101, 1992.Google Scholar
  15. [15]
    M. Parigot. λΜ-Calculus: an algorithmic interpretation of classical natural deduction. In A. Voronkov, editor, Proceedings of the International Conference on Logic Programming and Automated Reasoning, pages 190–201. Lecture Notes in Artificial Intelligence, 624, Springer Verlag, 1992.Google Scholar
  16. [16]
    M. Parigot. Classical proofs as programs. In G. Gottlod, A. Leitsch, and D. Mundici, editors, Proceedings of the third Kurt Gödel colloquium — KGC'93, pages 263–276. Lecture Notes in Computer Science, 713, Springer Verlag, 1993.Google Scholar
  17. [17]
    M. Parigot. Strong normalization for second order classical natural deduction. In Proceedings of the eighth annual IEEE symposium on logic in computer science, pages 39–46, 1993.Google Scholar
  18. [18]
    D. Prawitz. Natural Deduction, A Proof-Theoretical Study. Almqvist & Wiksell, Stockholm, 1965.Google Scholar
  19. [19]
    S. Stenlund. Combinators λ-terms and proof theory. D. Reidel Publishing Company, 1972.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Philippe de Groote
    • 1
  1. 1.INRIA-Lorraine-CRIN-CNRS Campus ScientifiqueVand∄uvre-lès-Nancy CedexFrance

Personalised recommendations