scientific article

zbMath0498.03018MaRDI QIDQ3962973

Joseph A. Goguen, José Meseguer

Publication date: 1982

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

equational logicabstract data typesmany-sorted algebramany-sorted logicrules of deduction

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Data structures (68P05) Structure theory of algebraic structures (08A05) Equational classes, universal algebra in model theory (03C05) Foundations, relations to logic and deductive systems (18A15)

Related Items (40)

Structured theory presentations and logic representations ⋮ Structured algebraic specifications: A kernel language ⋮ On solving the equality problem in theories defined by Horn clauses ⋮ Crypt-equivalent algebraic specifications ⋮ Rewriting with a nondeterministic choice operator ⋮ Generalized algebraic theories and contextual categories ⋮ Actors, actions, and initiative in normative system specification ⋮ Kripke models and the (in)equational logic of the second-order \(\lambda\)-calculus ⋮ A completeness theorem for the expressive power of higher-order algebraic specifications ⋮ Inheritance hierarchies: Semantics and unifications ⋮ Unification theory ⋮ Higher-order order-sorted algebras ⋮ Proof theory of higher-order equations: Conservativity, normal forms and term rewriting. ⋮ Parametrization for order-sorted algebraic specification ⋮ Observational implementation of algebraic specifications ⋮ Equational completion in order-sorted algebras ⋮ Algebraic specification of concurrent systems ⋮ Horn clause programs with polymorphic types: Semantics and resolution ⋮ Completion for unification ⋮ Context induction: A proof principle for behavioural abstractions and algebraic implementations ⋮ Semantics of order-sorted specifications ⋮ Soundness and completeness of the Birkhoff equational calculus for many-sorted algebras with possibly empty carrier sets ⋮ Higher-order equational logic for specification, simulation and testing ⋮ An order-sorted logic for knowledge representation systems ⋮ Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations ⋮ AC-unification race: The system solving approach, implementation and benchmarks ⋮ Final algebras, cosemicomputable algebras and degrees of unsolvability ⋮ Universal algebra in higher types ⋮ A semi-algorithm for algebraic implementation proofs ⋮ An improved general \(E\)-unification method ⋮ Order-sorted unification ⋮ Extensional models for polymorphism ⋮ Formalization of universal algebra in Agda ⋮ Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories ⋮ Some fundamental algebraic tools for the semantics of computation: II. Signed and abstract theories ⋮ A systematic study of models of abstract data types ⋮ Kripke-style models for typed lambda calculus ⋮ On conservative extensions of syntax in system development ⋮ Logical debugging ⋮ An algebraic semantics of higher-order types with subtypes

This page was built for publication: