Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems
From MaRDI portal
Publication:1803659
DOI10.1006/inco.1993.1016zbMath0796.68144OpenAlexW2073492176MaRDI QIDQ1803659
Joseph A. Goguen, José Meseguer
Publication date: 29 June 1993
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/982793f01cc78d62257cc7dc31c7165fad791952
Related Items
Another look at parameterization for oder-sorted algebraic specifications ⋮ Specification and verification of object-oriented programs using supertype abstraction ⋮ Modular algebraic specification of some basic geometrical constructions ⋮ Inheritance hierarchies: Semantics and unifications ⋮ Parameterisation for abstract structured specifications ⋮ Weak Bisimulation as a Congruence in MSOS ⋮ Principles of proof scores in CafeOBJ ⋮ Rewriting logic as a semantic framework for concurrency: a progress report ⋮ Typed homomorphic relations extended with subtypes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Specification and proof in membership equational logic ⋮ Semantics of order-sorted specifications ⋮ Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally ⋮ On the algebra of structured specifications ⋮ Structural induction in institutions ⋮ Order-sorted unification ⋮ Variant-Based Satisfiability in Initial Algebras ⋮ Metalevel Algorithms for Variant Satisfiability ⋮ A hidden agenda ⋮ Relating CASL with other specification languages: the institution level. ⋮ Maude: specification and programming in rewriting logic ⋮ An algebraic semantics of higher-order types with subtypes ⋮ Symbolic computation in Maude: some tapas
