Skip to main content
SpringerLink
Log in

Metastructures vs. attributed variables in the context of extensible unification

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

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

Abstract

We relate two mechanisms which aim at the extension of logic programming languages. The first mechanism directly extends syntactic unification through the introduction of a data type, whose (unification) semantics are specified through user-defined predicates. The second mechanism was utilized for the implementation of coroutining facilities, and was independently derived with optimal memory management for various Prolog extensions in mind. Experience from the application of both mechanisms to the realization of CLP languages, without leaving the logic programming context, enables us to reveal similarities and the potential with respect to this task. Constructive measures that narrow or close the gap between the two conceptual schemes are provided.

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

  • Aho A.V., Hopcroft J.E., Ullman J.D.: Data Structures and Algorithms, Addison-Wesley, Reading, MA, 1983.

    Google Scholar 

  • Carlsson M.: Freeze, Indexing, and Other Implementation Issues in the WAM, in Lassez J.L.(ed.), Logic Programming — Proceedings of the 4th International Conference — Volume 1, MIT Press, Cambridge, MA, 1987.

    Google Scholar 

  • Carlsson M., Widen J.: Sicstus Prolog Users Manual, Swedish Institute of Computer Science, SICS/R-88/88007C, 1990.

    Google Scholar 

  • Holzbaur C.: Specification of Constraint Based Inference Mechanisms through Extended Unification, Dept. of Medical Cybernetics & Artificial Intelligence, University of Vienna, Dissertation, 1990.

    Google Scholar 

  • Huitouze S.le: A new data structure for implementing extensions to Prolog, in Deransart P. and Maluszunski J.(eds.), Programming Language Implementation and Logic Programming, Springer, Heidelberg, 136–150, 1990.

    Google Scholar 

  • Jaffar J., Michaylov S.: Methodology and Implementation of a CLP System, in Lassez J.L.(ed.), Logic Programming — Proceedings of the 4th International Conference — Volume 1, MIT Press, Cambridge, MA, 1987.

    Google Scholar 

  • Neumerkel U.: Extensible Unification by Metastructures, Proc. META90, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Austrian Research Institute for Artificial Intelligence, and Department of Medical Cybernetics and Artificial Intelligence, University of Vienna, Freyung 6, A-1010, Vienna, Austria

    Christian Holzbaur

Authors
  1. Christian Holzbaur
    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

Holzbaur, C. (1992). Metastructures vs. attributed variables in the context of extensible unification. 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_141

Download citation

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

  • 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