A Machine Checked Model of Idempotent MGU Axioms For Lists of Equational Constraints

Details A Machine Checked Model of Idempotent MGU Axioms For Lists of Equational Constraints A Machine Checked Model of Idempotent MGU Axioms For Lists of Equational Constraints

2010-12-22

arxiv.org/abs/1012.4892v1

EPTCS 42, 2010, pp. 24-38

Computer Science

Logic in Computer Science

In Proceedings UNIF 2010, arXiv:1012.4554

Scientific paper

10.4204/EPTCS.42.3

We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU), which also happens to be idempotent. All of our proofs have been formalized in the Coq theorem prover. Our proofs show that finite maps produced by the unification algorithm provide a model of the axioms characterizing idempotent MGUs of lists of constraints. The axioms that serve as the basis for our verification are derived from a standard set by extending them to lists of constraints. For us, constraints are equalities between terms in the language of simple types. Substitutions are formally modeled as finite maps using the Coq library Coq.FSets.FMapInterface. Coq's method of functional induction is the main proof technique used in proving many of the axioms.

Affiliated with

Also associated with

No associations

Rating

A Machine Checked Model of Idempotent MGU Axioms For Lists of Equational Constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Machine Checked Model of Idempotent MGU Axioms For Lists of Equational Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Machine Checked Model of Idempotent MGU Axioms For Lists of Equational Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-581925