Advertisement

Label-selective λ-calculus syntax and confluence

  • Hassan Aït-Kaci
  • Jacques Garrigue
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 761)

Abstract

We introduce an extension of λ-calculus, called label-selective λ-calculus, in which arguments of functions are selected by labels. The set of labels includes numeric positions as well as symbolic keywords. While the latter enjoy free commutation, the former must comply with relative precedence in order to preserve currying. This extension of λ-calculus is conservative in the sense that when the set of labels is the singleton {1}, it coincides with λ-calculus. The main result of this paper is that the label-selective λ-calculus is confluent. In other words, argument selection and reduction commute.

Keywords

λ-Calculus record calculus concurrency communication 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Martin Abadi, Luca Cardelli, Pierre-Louis Curien, and Jean-Jacques Lévy. Explicit substitutions. In Proceedings of the Seventeenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1990).Google Scholar
  2. 2.
    Hassan Aït-Kaci and Jacques Garrigue. Label-selective λ-calculus. PRL Research Report 31, Digital Equipment Corporation, Paris Research Laboratory, Rueil-Mailmaison, France (May 1993).Google Scholar
  3. 3.
    Hassan Aït-Kaci and Kathleen Milsted. Concurrent label-selective λ-calculus. PRL research report, Digital Equipment Corporation, Paris Research Laboratory, Rueil-Malmaison, France (forthcoming).Google Scholar
  4. 4.
    Hassan Aït-Kaci and Andreas Podelski. Towards a meaning of LIFE. PRL Research Report 11, Digital Equipment Corporation, Paris Research Laboratory, Rueil-Malmaison, France (1991). (Revised, October 1992; to appear in the Journal of Logic Programming).Google Scholar
  5. 5.
    Gérard Boudol. Towards a lambda-calculus for concurrent and communicating systems. In Proceedings of TAPSOFT'89, pages 149–161, Berlin, Germany (1989). Springer-Verlag. LNCS 351.Google Scholar
  6. 6.
    Laurent Dami. A name-based calculus for extensible objects and functions. Draft manuscript (1993). Centre Universitaire d'Informatique, Genève, Switzerland.Google Scholar
  7. 7.
    N. G. de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation. Indag. Math., 34:381–392 (1972).Google Scholar
  8. 8.
    Jacques Garrigue and Hassan Aït-Kaci. Typed label-selective λ-calculus. PRL research report, Digital Equipment Corporation, Paris Research Laboratory, Rueil-Mailmaison, France (forthcoming).Google Scholar
  9. 9.
    J. Roger Hindley and Jonathan P. Seldin. Introduction to Combinators and λ-Calculus, volume 1 of London Mathematical Society Student Texts. Cambridge University Press, Cambridge, UK (1986).Google Scholar
  10. 10.
    Gérard Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM, 27(4):797–821 (October 1980).Google Scholar
  11. 11.
    Peter J. Landin. The mechanical evaluation of expressions. Computer Journal, 6(4):308–320 (1965).Google Scholar
  12. 12.
    Henry Ledgard. ADA: An Introduction, Ada Reference Manual(July 1980). Springer-Verlag, New York, NY (1981).Google Scholar
  13. 13.
    Robin Milner. Functions as processes. Rapport de Recherche 1154, INRIA, Le Chesnay, France (February 1990).Google Scholar
  14. 14.
    Robin Milner. The polyadic π-calculus: A tutorial. LFCS Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, Edinburgh, UK (October 1991).Google Scholar
  15. 15.
    Atsushi Ohori. A compilation method for ML-style polymorphic records. In Proceedings of the Ninetheenth ACM Symposium on Principles of Programming Languages, pages 154–165 (January 1992).Google Scholar
  16. 16.
    Guy L. Steele. Common LISP: The Language. Digital Press (1984).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Hassan Aït-Kaci
    • 1
  • Jacques Garrigue
    • 2
  1. 1.Paris Research LaboratoryDigital Equipment CorporationRueil-MalmaisonFrance
  2. 2.Department of Information ScienceThe University of TokyoTokyoJapan

Personalised recommendations