This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
DERSHOWITZ N.: “Orderings for term-rewriting systems” Proc 20th Symposium on Foundations of Computer Science, pp 123–131 (1979). also Theorical Computer Science 17-3 (1982).
DERSHOWITZ N.: “Computing with rewrite systems” Preliminary draft (1982)
FAY M.: “First order unification in equational theory” Proc. 4th Workshop on Automata Deduction Texas (1979).
HUET G.: “Confluent reductions: abstract properties and applications to term rewriting systems” J. Assoc. Comp. Mach. 27-4, pp 797–821 (1980).
HULLOT J. M.: “Canonical forms and unification” Proc. 5th Workshop on Automated Deduction Les Arcs (1980).
JOUANNAUD J.P. KIRCHNER C. KIRCHNER H.: “Incremental unification in equational theories”. Proc. of the Allerton conference (1982).
JOUANNAUD J.P. KIRCHNER C. KIRCHNER H.: “Incremental construction of unification algorithms in equationnal theories”. Internal report 83-R-008. Centre de Recherche en Informatique de Nancy (1983).
JOUANNAUD J.P., LESCANNE P., REINIG F.: “Recursive decomposition ordering” in “Formal description of programming concepts 2”. Ed. BJORNER D., North Holland (1982).
JOUANNAUD J.P.: “Confluent and Coherent sets of reductions with equations. Application to proofs in data types”. Proc. of the 8th Colloquium on Trees in algebra and programming. To appear in LNCS (1983).
KNUTH D. BEND IX P.: “Simple word problems in universal algebras” in “Computational problems in abstract algebra” Leech J. ed. Pergamon Press, pp 263–297 (1970).
KIRCHNER C, KIRCHNER H.: “Contribution à la résolution d'équations dans les algèbres libres et les variétés équationnelles d'algèbres”. Thèse de doctorat de spécialité, C. R. I. N., Nancy (1982).
KIRCHNER C., KIRCHNER H., JOUANNAUD J.P.: “Algebraic manipulations as a unification and matching strategy for linear equations in signed binary trees”. Proc. IJCAI 81 Vancouver (1981).
KAMIN, LEVY J.J.: “Attempts for generalizing the recursive path ordering”. To be published.
LANKFORD D.S.: “Canonical inference”. Report ATP-32, dpt. Math. and comp. sciences, Univ. of Texas at Austin (1975).
LANKFORD D.S.: “A unification algorithm for abelian group theory” Report MTP-1. Math. dep., Louisiana Tech. U. (1979).
LIVESEY M. and SIEKMANN J.: “Unification of sets” Report 3/76, Institut fur Informatik 1, Univ. Karlsruhe, (1977).
MARTELLI A. and MONTANARI U.: “An efficient unification algorithm”. T.O.P.L.A.S., Vol. 4, No. 2, pp 258–282. (1982).
PLOTKIN G.: “Building in equational theories” Machine Intelligence 7, pp 73–90 (1972).
PETERSON G. E. and STICKEL M.E.: “Complete sets of reductions for equational theories with complete unification algorithms” J.ACM 28, no.2, pp 233–264 (1981).
RAULEFS P. and SIEKMANN J.:”Unification of idempotent functions” Report, Institut fur Informatik 1, Univ. Karlsruhe, (1978).
SIEKMANN J. and SZABO P.:”Universal unification” Report, Institut fur Informatik 1, Univ. Karlsruhe, (1982).
STICKEL M.E.: “A unification algorithm for associative-commutative functions”. J.ACM 28, no.3, pp 423–434 (1981).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jouannaud, J.P., Kirchner, C., Kirchner, H. (1983). Incremental construction of unification algorithms in equational theories. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036921
Download citation
DOI: https://doi.org/10.1007/BFb0036921
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12317-0
Online ISBN: 978-3-540-40038-7
eBook Packages: Springer Book Archive