scientific article
From MaRDI portal
Publication:3719824
zbMath0591.68041MaRDI QIDQ3719824
José Meseguer, Jean-Pierre Jouannaud, Joseph A. Goguen
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
equational logiccompleteness theoremrewriting systemsmany-sorted algebraconditional equationsimplicational classsubsort relation
Abstract data types; algebraic specification (68Q65) Equational logic, Mal'tsev conditions (08B05) Equational classes, universal algebra in model theory (03C05) Categories of algebras (08C05)
Related Items
A complete semantics of \(\mathbb{K}\) and its translation to Isabelle ⋮ Completeness and confluence of order-sorted term rewriting ⋮ Meta-rule synthesis from crossed rewrite systems ⋮ Compatibility of order-sorted rewrite rules ⋮ Equational logic and categorical semantics for multi-languages ⋮ Toward formal development of programs from algebraic specifications: Implementations revisited ⋮ On the Specification and Verification of Model Transformations ⋮ Modular algebraic specification of some basic geometrical constructions ⋮ José Meseguer: Scientist and Friend Extraordinaire ⋮ Weak Bisimulation as a Congruence in MSOS ⋮ Proving and rewriting ⋮ Abstract data type systems ⋮ On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories ⋮ Equational completion in order-sorted algebras ⋮ Code selection by inversion of order-sorted derivors ⋮ Inheritance as implicit coercion ⋮ Order-sorted completion: The many-sorted way ⋮ Specification and proof in membership equational logic ⋮ Semantics of order-sorted specifications ⋮ Conditional rewriting logic as a unified model of concurrency ⋮ Strict coherence of conditional rewriting modulo axioms ⋮ A semantic approach to order-sorted rewriting ⋮ Order-sorted unification ⋮ Order-Sorted Rewriting and Congruence Closure ⋮ Schematization of infinite sets of rewrite rules generated by divergent completion processes ⋮ Generator induction in order sorted algebras ⋮ Automatic proofs by induction in theories without constructors ⋮ Relating CASL with other specification languages: the institution level. ⋮ Automata-driven automated induction
