Skip to main content
SpringerLink
Log in

Implementing higher-order functions in an algebraic specification language with narrowing

  • Conference paper
  • First Online:
Book cover Programming Language Implementation and Logic Programming (PLILP 1992)

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

  • 156 Accesses

Abstract

The presented HO-RAP system combines λ-calculus with Horn clause specifications interpreted by rewriting and narrowing techniques. Therefore, higher-order programming becomes available for the prototyper together with logic programming features introduced via narrowing. Still unification is first-order and accordingly not satisfactory with regard to functional equality.

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

References

  1. E. Astesiano, M. Cerioli: On the existence of initial models for partial (higher-order) conditional specifications. In: J. Diaz, F. Orejas (eds.): TAPSOFT '89, Vol. 1, Lecture Notes in Computer Science 351, Springer, Berlin, 1989, 74–88.

    Google Scholar 

  2. M. Hanus: Compiling Logic Programs with Equality. In Proc. PLILP 90, Linköping, Sweden, Lecture Notes in Computer Science 456, Springer, Berlin, 1990, 387–401.

    Google Scholar 

  3. H. Hußmann: Rapid Prototyping for Algebraic Specifications — RAP — System User's Manual. Universität Passau, MIP — 8504, Research Report, Passau, 1985.

    Google Scholar 

  4. H. Hußmann: Unification in Conditional-Equational Theories. Universität Passau, MIP — 8502, Research Report, 2nd edition, Passau, 1986.

    Google Scholar 

  5. J.-P. Jouannaud, M. Okada: Executable Higher-Order Algebraic Specification Languages. Proc. 6th IEEE Symp. Logic in Computer Science, Amsterdam 1991.

    Google Scholar 

  6. D. Miller: A Logic Programming Language with Lambda-Abstraction, Function Variables and Simple Unification. Journal of Logic Computation, Volume 1, No.4, 1991, 497–536.

    Google Scholar 

  7. B. Möller, A. Tarlecki, M. Wirsing: Algebraic Specification of Reachable Higher-Order Algebras. In: D. Sannella, A. Tarlecki (eds.): Recent Trends in Data Type Specification: 5th Workshop on Specification of Abstract Data Types-Selected Papers. Lecture Notes in Computer Science 332, Springer, Berlin, 1988, 154–169.

    Google Scholar 

  8. B. Reus: Algebraische Spezifikation mit Funktionen höherer Ordnung. Diploma Thesis, Fakultät für Mathematik und Informatik, Passau, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität München, Leopoldstraße 11B, D-8000, München 40, Germany

    Bernhard Reus

Authors
  1. Bernhard Reus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Maurice Bruynooghe Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reus, B. (1992). Implementing higher-order functions in an algebraic specification language with narrowing. In: Bruynooghe, M., Wirsing, M. (eds) Programming Language Implementation and Logic Programming. PLILP 1992. Lecture Notes in Computer Science, vol 631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55844-6_160

Download citation

  • DOI: https://doi.org/10.1007/3-540-55844-6_160

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55844-6

  • Online ISBN: 978-3-540-47297-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation