Abstract

First-order unification algorithms (Robinson, 1965) are traditionally implemented via general recursion, with separate proofs for partial correctness and termination. The latter tends to involve counting the number of unsolved variables and showing that this total decreases each time a substitution enlarges the terms. There are many such proofs in the literature, for example, (Manna & Waldinger, 1981; Paulson, 1985; Coen, 1992; Rouyer, 1992; Jaume, 1997; Bove, 1999). This paper

Citations

829	A Machine–oriented Logic Based on the Resolution Principle - Robinson - 1965
196	Cayenne - a language with dependent types - Augustsson - 1998
144	LEGO proof development system: User's manual - Luo, Pollack - 1992
97	Computation and Reasoning: A Type Theory for Computer Science - Luo - 1994
81	Proving properties of programs by structural induction - Burstall - 1969
71	The zipper - Huet - 1997
59	Inductive families - Dybjer - 1994
39	Inductively defined types in the calculus of constructions - Pfenning, Paulin-Mohring
37	The Implementation of ALF--a Proof Editor Based on Martin-L"of's Monomorphic Type Theory with Explicit Substitution - Magnusson - 1994
35	A.: A finite axiomatization of inductive-recursive definitions - Dybjer, Setzer - 1999
33	Waldinger: Deductive Synthesis of the Unification Algorithm - Manna, R - 1981
21	Inductively Defined Functions in Functional Programming Languages”, LFCS - Burstall - 1987
21	Verifying the unification algorithm - Paulson - 1985
19	Interactive Program Derivation - Coen - 1992
12	Développement de l’algorithme d’unification dans le calcul des constructions - Rouyer - 1992
3	Unication : a Case Study in Transposition of Formal Properties - Jaume - 1997
1	Programming in Martin-of Type Theory. Unification: A non-trivial Example - Bove - 1999
1	First-Order Unification by Structural Recursion 17 - McBride - 1999