Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems
From MaRDI portal
Publication:1803659
DOI10.1006/INCO.1993.1016zbMATH Open0796.68144OpenAlexW2073492176MaRDI QIDQ1803659FDOQ1803659
Authors: José Meseguer, Joseph Goguen 
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
Recommendations
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- A Framework for Order-Sorted Algebra
- Order-sorted algebraic specifications with higher-order functions
- Order-sorted algebraic specifications with higher-order functions
- Order-sorted equational unification revisited
- scientific article; zbMATH DE number 3949706
- scientific article
- Order-Sorted Rewriting and Congruence Closure
- scientific article; zbMATH DE number 1113861
- scientific article; zbMATH DE number 4056995
Cited In (26)
- Symbolic computation in Maude: some tapas
- Equivalences among various logical frameworks of partial algebras
- Rewriting logic as a semantic framework for concurrency: a progress report
- Structural induction in institutions
- Modular algebraic specification of some basic geometrical constructions
- Principles of proof scores in CafeOBJ
- Homomorphism preserving algebraic specifications require hidden sorts
- Order-sorted unification
- Title not available (Why is that?)
- Inheritance hierarchies: Semantics and unifications
- Weak bisimulation as a congruence in MSOS
- Specification and verification of object-oriented programs using supertype abstraction
- Specification and proof in membership equational logic
- An algebraic semantics of higher-order types with subtypes
- A hidden agenda
- Parameterisation for abstract structured specifications
- On the algebra of structured specifications
- Another look at parameterization for oder-sorted algebraic specifications
- Semantics of order-sorted specifications
- Variant-Based Satisfiability in Initial Algebras
- Maude: specification and programming in rewriting logic
- Metalevel algorithms for variant satisfiability
- Relating CASL with other specification languages: the institution level.
- Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally
- Title not available (Why is that?)
- Typed homomorphic relations extended with subtypes
This page was built for publication: Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803659)
