A Machine-Checked Model of MGU Axioms: Applications of Finite Maps and Functional Induction
نویسندگان
چکیده
The most general unifier (MGU) of a pair of terms can be specified by four axioms. In this paper we generalize the standard presentation of the axioms to specify the MGU of a list of equational constraints and we formally verify that the unification algorithm satisfies the axioms. Our constraints are equalities between terms in a language of simple types. We model substitutions as finite maps from the Coq library Coq.FSets.FMapInterface. Since the unification algorithm is general recursive we show termination using a lexicographic ordering on lists of constraints. Coq’s method of functional induction is the main proof technique used in proving the axioms.
منابع مشابه
A Machine Checked Model of Idempotent MGU Axioms For a List of Equational Constraints
Machine checked proofs of type inference algorithms often axiomatize MGU behavior as a set of axioms. Idempotent MGUs for a list of equational constraints are needed to reason about the correctness of Wand’s type inference algorithm and our extension of it. To characterize the behavior of idempotent MGUs, we propose a set of seven axioms; four of which have been proven in our earlier paper, whe...
متن کاملA Machine Checked Model of Idempotent MGU Axioms For Lists of Equational Constraints
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...
متن کاملDesign Optimization and Construction of Double-Sided Linear Induction Motor
Linear induction motors have single and double-sided structures which are used in special applications, according to their advantages and disadvantages. Due to advantages such as lack of normal forces in double-sided type, these motors are more controllable and popular than the single-sided type, especially for transportation applications. In literature, single-sided linear induction motors ha...
متن کاملGeneralized Regular Fuzzy Irresolute Mappings and Their Applications
In this paper, the notion of generalized regular fuzzy irresolute, generalized regular fuzzy irresolute open and generalized regular fuzzy irresolute closed maps in fuzzy topological spaces are introduced and studied. Moreover, some separation axioms and $r$-GRF-separated sets are established. Also, the relations between generalized regular fuzzy continuous maps and generalized regular fuzzy ...
متن کاملFINITE-TIME PASSIVITY OF DISCRETE-TIME T-S FUZZY NEURAL NETWORKS WITH TIME-VARYING DELAYS
This paper focuses on the problem of finite-time boundedness and finite-time passivity of discrete-time T-S fuzzy neural networks with time-varying delays. A suitable Lyapunov--Krasovskii functional(LKF) is established to derive sufficient condition for finite-time passivity of discrete-time T-S fuzzy neural networks. The dynamical system is transformed into a T-S fuzzy model with uncertain par...
متن کامل