Skip to main content
SpringerLink
Log in
Book cover

International Conference on Current Trends in Theory and Practice of Computer Science

SOFSEM 1995: SOFSEM '95: Theory and Practice of Informatics pp 363–368Cite as

Implementation of higher-order unification based on calculus of explicit substitution

  • Contributed Papers
  • Conference paper
  • First Online:

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

Abstract

In this paper, we present several improvements of an algorithm for a higher-order unification based on the calculus of explicit substitutions. The main difference between our algorithm and the already known version is, that we try to postpone normalisation of λσ-terms as long as possible, i.e. until some information of these λσ-terms is necessary for the next step of the unification algorithm.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. Technical Report 54, Digital Systems Research Center, February 1990.

    Google Scholar 

  2. P. Borovanský. Implementation of higher-order unification based on calculus of explicit substitutions. Technical report (in preparation), CRIN & INRIA-Lorraine, France, 1995.

    Google Scholar 

  3. Gilles Dowek, Thérèse Hardin, and Claude Kirchner. Higher-order unification via explicit substitutions, extended abstract. In Dexter Kozen, editor, Proceedings of LICS'95, San Diego, June. 1995.

    Google Scholar 

  4. Claude Kirchner, Hélène Kirchner, and M. Vittek. Designing constraint logic programming languages using computational systems. In P. Van Hentenryck and V. Saraswat, editors, Principles and Practice of Constraint Programming. The Newport Papers., pages 131–158. 1995.

    Google Scholar 

  5. A. Ríos. Contributions à l'étude des λ-calculs avec des substitutions explicites. PhD thesis, U. Paris VII, 1993.

    Google Scholar 

Download references

Author information

Author notes

  1. Peter Borovanský

    Present address: Institute of Informatics, Comenius University, Bratislava

Authors and Affiliations

  1. CRIN & INRIA-Lorraine, B.P 239, F 54506, Vandoeuvre lès Nancy Cedex, France

    Peter Borovanský

Authors
  1. Peter Borovanský
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peter Borovanský .

Editor information

Miroslav Bartosek Jan Staudek Jirí Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Borovanský, P. (1995). Implementation of higher-order unification based on calculus of explicit substitution. In: Bartosek, M., Staudek, J., Wiedermann, J. (eds) SOFSEM '95: Theory and Practice of Informatics. SOFSEM 1995. Lecture Notes in Computer Science, vol 1012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60609-2_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-60609-2_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60609-3

  • Online ISBN: 978-3-540-48463-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation