Skip to main content
SpringerLink
Log in

Regular substitution sets: A means of controlling E-unification

  • Regular Papers
  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1995)

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

Included in the following conference series:

Abstract

A method for selecting solution constructors in narrowing is presented. The method is based on a sort discipline that describes regular sets of ground constructor terms as sorts. It is extended to cope with regular sets of ground substitutions, thus allowing different sorts to be computed for terms with different variable bindings. An algorithm for computing signatures of equationally defined functions is given that allows potentially infinite overloading. Applications to formal program development are sketched.

This work was partially funded by the BMFT project KORSO, contract ITS9001A7.

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. Bachmair, L., Ganzinger, H., On restrictions of ordered paramodulation with simplification, Proc. 10th CADE, LNAI 449, Jul 1990

    Google Scholar 

  2. Bockmayr, A., Beiträge zur Theorie des logisch-funktionalen Programmierens, Dissertation, University Karlsruhe, 1991

    Google Scholar 

  3. Burghardt, J., Eine feinkörnige Sortendisziplin und ihre Anwendung in der Programmkonstruktion, Dissertation, GMD Report 212, Oldenbourg, 1993

    Google Scholar 

  4. Burghardt, J., A fine-grain sort discipline and its application to formal program construction, in: M. Broy, S. Jähnichen (eds.), KORSO-Correct software by formal methods, LNCS, to appear

    Google Scholar 

  5. Comon, H., Equational formulas in order-sorted algebras, Proc. ICALP, Warwick, Springer, July 1990

    Google Scholar 

  6. Echahed, R., On completeness of narrowing strategies, LNCS 298, 1988

    Google Scholar 

  7. Fribourg, L., A narrowing procedure for theories with constructors, Proc. 7. CADE, LNCS 170, p. 259–279, 1984

    Google Scholar 

  8. Heinz, B., Lemma discovery by anti-unification of regular sorts, TU Berlin, Technical Report 94-21, 1994

    Google Scholar 

  9. Hölldobler, S., Foundations of equational programming, LNAI 353, Aug 1989

    Google Scholar 

  10. Leitsch, A., Deciding Horn clauses by hyperresolution, Proc. 2nd Workshop in Computer Science Logic, LNCS 440, p. 225–241, 1989

    Google Scholar 

  11. Mishra, P., Towards a theory of types in PROLOG, Proc. 1984 Int. Symp. on Logic Programming

    Google Scholar 

  12. Schmidt-Schauß, M., Computational aspects of an order-sorted logic with term declarations, Univ. Kaiserslautern, Dissertation, April 1988b

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GMD Forschungsinstitut für Rechnerarchitektur und Softwaretechnik, German National Research Center for Computer Science, Rudower Chaussee 5, D-12489, Berlin

    Jochen Burghardt

Authors
  1. Jochen Burghardt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jieh Hsiang

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Burghardt, J. (1995). Regular substitution sets: A means of controlling E-unification. In: Hsiang, J. (eds) Rewriting Techniques and Applications. RTA 1995. Lecture Notes in Computer Science, vol 914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59200-8_71

Download citation

  • DOI: https://doi.org/10.1007/3-540-59200-8_71

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation