Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1993: Foundations of Software Technology and Theoretical Computer Science pp 139–150Cite as

Higher-order and semantic unification

  • Conference paper
  • First Online:

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

Abstract

We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard unification procedure, with slight modifications, can be used to solve the satisfiability problem in combinatory logic with a convergent set of algebraic axioms R, thus resulting in a complete higher-order unification procedure for R. Furthermore, we use the system of transformation rules to provide a syntactic characterization for R which results in decidability of semantic unification.

This research was supported in part by the U. S. National Science Foundation under Grants CCR-90-07195 and CCR-90-24271.

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. V. Breazu-Tannen. Combining Algebra and Higher-order Types. In Proc. of the Third Annual IEEE Symposium on Logic in Computer Science, pages 82–90, 1988.

    Google Scholar 

  2. J. Chabin and P. Réty. Narrowing Directed by a Graph of Terms. In Proc. of the Fourth Int. Conference on Rewriting Techniques and Applications, Como, Italy, April, 1991. Vol. 488, pages 112–123, of Lecture Notes in Computer Science, Springer Verlag, 1990.

    Google Scholar 

  3. Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 6, pages 243–320, North-Holland, Amsterdam, 1990.

    Google Scholar 

  4. Nachum Dershowitz, Subrata Mitra and G. Sivakumar. Equation Solving in Conditional AC-Theories. In Proceedings of the Second International Conference on Algebraic and Logic Programming, Nancy, France, October 1990. Vol. 463, pages 283–297, of Lecture Notes in Computer Science, Springer Verlag (1990).

    Google Scholar 

  5. Nachum Dershowitz, Subrata Mitra, and G. Sivakumar. Decidable matching for convergent systems. In Proceedings of the Eleventh Conference on Automated Deduction, pages 589–602, Saratoga Springs, NY, June 1992. Vol. 607 of Lecture Notes in Artificial Intelligence, Springer-Verlag, Berlin.

    Google Scholar 

  6. Nachum Dershowitz and G. Sivakumar. Solving Goals in Equational Languages. In Proceedings of the First International Workshop Conditional Term Rewriting System, Orsay, France, July 1987. Vol. 308, pages 45–55, of Lecture Notes in Computer Science, Springer Verlag (1987).

    Google Scholar 

  7. D. J. Dougherty. Adding Algebra to the Untyped Lambda Calculus. In Proc. of the Fourth Int. Conference on Rewriting Techniques and Applications, Como, Italy, April, 1991. Vol. 488, pages 37–48, of Lecture Notes in Computer Science, Springer Verlag, 1990.

    Google Scholar 

  8. D. J. Dougherty. Higher-order unification via combinators. Theoretical Computer Science 114, pages 273–298.

    Google Scholar 

  9. Daniel J. Dougherty and Patricia Johann. A Combinatory Logic Approach to Higher-order E-unification. In Proc. of the Eleventh Conference on Automated Deduction, Saratoga Springs, New York, June, 1992. Vol. 607, pages 79–93, of Lecture Notes in Computer Science, Springer Verlag, 1992.

    Google Scholar 

  10. Jean-Marie Hullot. Canonical forms and unification. In R. Kowalski, editor, Proc. of the Fifth International Conference on Automated Deduction, pages 318–334, Les Arcs, France, July 1980. Vol. 87 of Lecture Notes in Computer Science, Springer, Berlin.

    Google Scholar 

  11. T. Nipkow and Z. Qian. Modular Higher-order E-Unification. In Proc. of the Fourth Int. Conference on Rewriting Techniques and Applications, Como, Italy, April, 1991. Vol. 488, pages 200–214, of Lecture Notes in Computer Science, Springer Verlag, 1990.

    Google Scholar 

  12. Pierre Réty. Improving Basic Narrowing Techniques. In P. Lescanne,. editor, Proc. of the Second International Conference on Rewriting Techniques and Applications, pages 228–241, Bordeaux, France, May 1987. Vol. 256 of Lecture Notes in Computer Science, Springer, Berlin.

    Google Scholar 

  13. Wayne Snyder. Higher Order E-Unification. In Proceedings of the Tenth Int. Conference on Automated Deduction, Kaiserslautern, FRG, July 1990. Vol. 449, pages 573–587, of Lecture Notes in Computer Science, Springer Verlag, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Illinois, 1304 West Springfield Avenue, 61801, Urbana, IL, USA

    Nachum Dershowitz & Subrata Mitra

Authors
  1. Nachum Dershowitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Subrata Mitra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rudrapatna K. Shyamasundar

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dershowitz, N., Mitra, S. (1993). Higher-order and semantic unification. In: Shyamasundar, R.K. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1993. Lecture Notes in Computer Science, vol 761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57529-4_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-57529-4_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57529-0

  • Online ISBN: 978-3-540-48211-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation