Verifying the Unification Algorithm in LCF

Verifying the Unification Algorithm in LCF (1985)

by Lawrence C. Paulson

Venue:	Science of Computer Programming
Citations:	8 - 0 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Verifying the Unification Algorithm in LCF	user correction - Legacy Corrections
AUTHOR NAME	Lawrence C. Paulson	SVM HeaderParse 0.1
AUTHOR AFFIL	Computer Laboratory	SVM HeaderParse 0.2
AUTHOR ADDR	Corn Exchange Street; Cambridge CB2 3QG	SVM HeaderParse 0.1
ABSTRACT	Manna and Waldinger's theory of substitutions and unification has been verified using the Cambridge LCF theorem prover. A proof of the monotonicity of substitution is presented in detail, as an example of interaction with LCF. Translating the theory into LCF's domaintheoretic logic is largely straightforward. Well-founded induction on a complex ordering is translated into nested structural inductions. Correctness of unification is expressed using predicates for such properties as idempotence and most-generality. The verification is presented as a series of lemmas. The LCF proofs are compared with the original ones, and with other approaches. It appears di#cult to find a logic that is both simple and flexible, especially for proving termination.	user correction - Legacy Corrections
YEAR	1985	INFERENCE
VENUE	Science of Computer Programming	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
PAGES	143--169	INFERENCE
VOLUME	5	INFERENCE
TECH	Report 50	INFERENCE
CITATIONS	26 found	ParsCit 1.0