Regular substitution sets: A means of controlling E-unification

  • Jochen Burghardt
Regular Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 914)


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.


Horn Clause Derivation Tree Local Transformation Variable Binding Global Transformation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Bachmair, L., Ganzinger, H., On restrictions of ordered paramodulation with simplification, Proc. 10th CADE, LNAI 449, Jul 1990Google Scholar
  2. [2]
    Bockmayr, A., Beiträge zur Theorie des logisch-funktionalen Programmierens, Dissertation, University Karlsruhe, 1991Google Scholar
  3. [3]
    Burghardt, J., Eine feinkörnige Sortendisziplin und ihre Anwendung in der Programmkonstruktion, Dissertation, GMD Report 212, Oldenbourg, 1993Google Scholar
  4. [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 appearGoogle Scholar
  5. [5]
    Comon, H., Equational formulas in order-sorted algebras, Proc. ICALP, Warwick, Springer, July 1990Google Scholar
  6. [6]
    Echahed, R., On completeness of narrowing strategies, LNCS 298, 1988Google Scholar
  7. [7]
    Fribourg, L., A narrowing procedure for theories with constructors, Proc. 7. CADE, LNCS 170, p. 259–279, 1984Google Scholar
  8. [8]
    Heinz, B., Lemma discovery by anti-unification of regular sorts, TU Berlin, Technical Report 94-21, 1994Google Scholar
  9. [9]
    Hölldobler, S., Foundations of equational programming, LNAI 353, Aug 1989Google Scholar
  10. [10]
    Leitsch, A., Deciding Horn clauses by hyperresolution, Proc. 2nd Workshop in Computer Science Logic, LNCS 440, p. 225–241, 1989Google Scholar
  11. [11]
    Mishra, P., Towards a theory of types in PROLOG, Proc. 1984 Int. Symp. on Logic ProgrammingGoogle Scholar
  12. [12]
    Schmidt-Schauß, M., Computational aspects of an order-sorted logic with term declarations, Univ. Kaiserslautern, Dissertation, April 1988bGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Jochen Burghardt
    • 1
  1. 1.GMD Forschungsinstitut für Rechnerarchitektur und SoftwaretechnikGerman National Research Center for Computer ScienceBerlin

Personalised recommendations