Consistency of Equational Enrichments

We consider the problem of proving correctness of equational definitions of functions over an initial model of a Horn-equational theory. A new model-theoretic criteria of consistency of such enrichments as well as some syntactical sufficient conditions are suggested.

[1]  Martin Gogolla,et al.  Algebraic and Operational Semantics of Specifications Allowing Exceptions and Errors , 1984, Theor. Comput. Sci..

[2]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 1 , 1985, EATCS Monographs on Theoretical Computer Science.

[3]  José Meseguer,et al.  Models and Equality for Logical Programming , 1987, TAPSOFT, Vol.1.

[4]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[5]  Maurice Nivat,et al.  Resolution of Equations in Algebraic Structures , 1989 .

[6]  J. Goguen,et al.  Order-Sorted Equational Computation , 1989 .