Skip to main content
SpringerLink
Log in

Towards a meaning of LIFE

  • Invited Lecture
  • Conference paper
  • First Online:
Programming Language Implementation and Logic Programming (PLILP 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 528))

Abstract

LIFE (Logic, Inheritance, Functions, Equations) is an experimental programming language proposing to integrate three orthogonal programming paradigms proven useful for symbolic computation. From the programmer's standpoint, it may be perceived as a language taking after logic programming, functional programming, and object-oriented programming. ?From a formal perspective, it may be seen as an instance (or rather, a composition of three instances) of a Constraint Logic Programming scheme due to Hvhfeld and Smolka refining that of Jaffar and Lassez.

We start with an informal overview demonstrating LIFE as a programming language, illustrating how its primitives offer rather unusual, and perhaps (pleasantly) startling, conveniences. The second part is a formal account of LIFE's object unification seen as constraint-solving over specific domains. We build on work by Smolka and Rounds to develop type-theoretic, logical, and algebraic renditions of a calculus of order-sorted feature approximations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hassan Aït-Kaci. A Lattice-Theoretic Approach to Computation Based on a Calculus of Partially-Ordered Types. PhD thesis, University of Pennsylvania, Philadelphia, PA, 1984.

    Google Scholar 

  2. Hassan Aït-Kaci. An algebraic semantics approach to the effective resolution of type equations. Theoretical Computer Science, 45:293–351, 1986.

    Google Scholar 

  3. Hassan Aït-Kaci and Roger Nasr. LOGIN: A logic programming language with built-in inheritance. Journal of Logic Programming, 3:185–215, 1986.

    Google Scholar 

  4. Hassan Aït-Kaci and Roger Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51–89, 1989.

    Google Scholar 

  5. Hassan Aït-Kaci, Roger Nasr, and Patrick Lincoln. Le Fun: Logic, equations, and Functions. In Proceedings of the Symposium on Logic Programming (San Francisco, CA), pages 17–23, Washington, DC, 1987. IEEE, Computer Society Press.

    Google Scholar 

  6. Hassan Aït-Kaci and Andreas Podelski. Towards the meaning of LIFE. PRL Research Report 11, Digital Equipment Corporation, Paris Research Laboratory, Rueil-Malmaison, France, 1991.

    Google Scholar 

  7. Hassan Aït-Kaci and Andreas Podelski. Functions as passive constraints in LIFE. PRL Research Report 13, Digital Equipment Corporation, Paris Research Laboratory, Rueil-Malmaison, France, 1991.

    Google Scholar 

  8. William F. Clocksin and Christopher S. Mellish. Programming in Prolog. Springer-Verlag, Berlin, Germany, 2nd edition, 1984.

    Google Scholar 

  9. Jochen Dörre and William C. Rounds. On subsumption and semiunification in feature algebras. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science (Philadelphia, PA), pages 301–310, Washington, DC, 1990. IEEE, Computer Society Press.

    Google Scholar 

  10. Markus Höhfeld and Gert Smolka. Definite relations over constraint languages. LILOG Report 53, IWBS, IBM Deutschland, Stuttgart, Germany, October 1988, To appear in the Journal of Logic Programming.

    Google Scholar 

  11. Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In Proceedings of the 14th ACM Symposium on Principles of Programming Languages, Munich, W. Germany, January 1987.

    Google Scholar 

  12. Richard O'Keefe. The Craft of Prolog. MIT Press, Cambridge, MA, 1990.

    Google Scholar 

  13. Gert Smolka. A feature logic with subsorts. LILOG Report 33, IWBS, IBM Deutschland, Stuttgart, Germany, May 1988.

    Google Scholar 

  14. Gert Smolka. Feature constraint logics for unification grammars. IWBS Report 93, IWBS, IBM Deutschland, Stuttgart, Germany, November 1989. To appear in Journal of Logic Programming.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Digital Equipment Corporation, Paris Research Laboratory, 85 avenue Victor Hugo, 92500, Rueil-Malmaison, France

    Hassan Aït-Kaci

  2. L. I. T. P., Universiti de Paris 7, 2 place Jussieu, 75251, Paris Cedex 05, France

    Andreas Podelski

Authors
  1. Hassan Aït-Kaci
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Podelski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Maluszyński Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aït-Kaci, H., Podelski, A. (1991). Towards a meaning of LIFE. In: Maluszyński, J., Wirsing, M. (eds) Programming Language Implementation and Logic Programming. PLILP 1991. Lecture Notes in Computer Science, vol 528. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54444-5_104

Download citation

  • DOI: https://doi.org/10.1007/3-540-54444-5_104

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54444-9

  • Online ISBN: 978-3-540-38362-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation