Constraint-Lambda Calculi

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2309)


We introduce two forms of calculi that integrate constraint solving with functional programming. These are the Unrestricted, and the Restricted, Constraint-Lambda Calculi. Unlike previous attempts at combining constraint solving with lambda calculus, these are conservative extensions of traditional lambda calculi in terms of both term reduction and their denotational semantics. We establish a limited form of confluence for the unrestricted calculus and full confluence for the restricted one.


Constraint Programming Reduction Rule Constraint Solver Constraint Variable Denotational Semantic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    John Newsome Crossley, Pierre Lim, and Peter John Stuckey. Interface logic programming. Australian Computer Journal, 21(2):49–55, 1989.Google Scholar
  2. 2.
    John Newsome Crossley, Luis Mandel, and Martin Wirsing. Una extensión de constraints al cálculo lambda. In Segundo Congreso de Programación Declarativa, ProDe '93, Blanes, Girona, Spain, September 29–30, October 1 1993, pages 203–16. 1993. In Spanish.Google Scholar
  3. 3.
    John Newsome Crossley, Luis Mandel, and Martin Wirsing. First-order constrained lambda calculus. In Frontiers of Combining Systems, First International Workshop, number 3 in Applied Logics, pages 339–356. Kluwer Academic Publishers, 1996.Google Scholar
  4. 4.
    John Darlington, Yi-ke Guo, and Helen Pull. Introducing constraint functional logic programming. Technical report, Imperial College, Febuary 1991.Google Scholar
  5. 5.
    Bart Demoen, María García de la Banda, Warren Harvey, Kim Marriott, and Peter Stuckey. An overview of HAL. In Proceedings of Principles and Practice of Constraint Programming, pages 174–188. Asociation for Computing Machinery, 1999.Google Scholar
  6. 6.
    Matthias Hölzl. Constraint-Lambda Calculi: Theory and Applications. PhD thesis, Ludwig-Maximilians-Universität, München, 2001.Google Scholar
  7. 7.
    Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In Conference Record, 14th Annual ACM Symposium on Principles of Programming Languages, Munich, West Germany, 21–23 Jan 1987, pages 111–119. Association for Computing Machinery, 1987.Google Scholar
  8. 8.
    Luis Mandel. Constrained Lambda Calculus. PhD thesis, Ludwig-Maximilians-Universität, München, 1995.Google Scholar
  9. 9.
    Luis Mandel and María Victoria Cengarle. The disjunctive constrained lambda calculus. In Dines Bjørner, Manfred Broy, and Igor Vasilevich Pottosin, eds., Perspectives of Systems Informatics, (2nd. International Andrei Ershov Memorial Conference, Proceedings), volume 1181 of Lecture Notes in Computer Science, pages 297–309. Springer Verlag, 1996.Google Scholar
  10. 10.
    Luis Mandel, Martin Wirsing, and John Newsome Crossley. Cálculo lambda de primer orden con constraints y la propiedad Church-Rosser. In Primer Congreso Argentino de Ciencias de la Computacion, CACIC’95 Proceedings, Bahia Blanca, Argentina, pages 493–504. Universaidad Nacional de Sur, 1995. In Spanish.Google Scholar
  11. 11.
    David McAllester and Jeffrey Mark Siskind. Nondeterministic Lisp as a substrate for constraint logic programming. In Proceedings AAAI, pages 133–138, July 1993.Google Scholar
  12. 12.
    Dale Miller and Gopalan Nadathur. An overview of λ-prolog. In R. Kowalski and K. Bowen, eds., Proceedings of the Fifth International Conference on Logic Programming, pages 810–827, 1988.Google Scholar
  13. 13.
    Andy Mück, Thomas Streicher, and Hendrik C.R. Lock. A tiny constraint functional logic language and its continuation semantics. In Donald Sannella, ed., Programming languages and systems-ESOP’94, 5th European Symposium on Programming, Edinburgh, U.K., April 11–13, 1994 Proceedings, volume 788 of Lecture Notes in Computer Science, pages 439–453, Berlin, 1994. Springer-Verlag.Google Scholar
  14. 14.
    Gert Smolka. A foundation for higher-order concurrent constraint programming. In Jean-Pierre Jouannaud, ed., 1st International Conference on Constraints in Computational Logics, volume 845 of Lecture Notes in Computer Science, pages 50–72, Berlin, 1994. Springer-Verlag.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  1. 1.Institut für InformatikLudwig-Maximilians-UniversitätMünchenGermany
  2. 2.School of Computer Science and Software EngineeringMonash UniversityClaytonAustralia

Personalised recommendations