On the public citation graph
Operational semantics for order-sorted algebra
0 signed · 114 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00264228openalex-snapshot
Rewrite systems on a lattice of types
inferredcites →https://doi.org/10.1007/bfb0012775openalex-snapshot
Universal realization, persistent interconnection and implementation of abstract modules
inferredcites →https://doi.org/10.1016/c2013-0-11758-8openalex-snapshot
A Many-Sorted Calculus Based on Resolution and Paramodulation
inferredcites →https://doi.org/10.1145/567067.567078openalex-snapshot
Computer experiments with the REVE term rewriting system generator
inferredcites →https://doi.org/10.1145/800017.800519openalex-snapshot
Completion of a set of rules modulo a set of equations
inferredcites →https://doi.org/10.1145/947864.947865openalex-snapshot
Completeness of many-sorted equational logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/j.1096-9942.1995.tb00006.xopenalex-snapshot
Using Dynamic Classes and Role Classes to Model Object Migration
inferred← citeshttps://doi.org/10.1006/inco.1994.1056openalex-snapshot
Equational Formulas with Membership Constraints
inferred← citeshttps://doi.org/10.1006/inco.2001.3036openalex-snapshot
Automata-Driven Automated Induction
inferred← citeshttps://doi.org/10.1006/jsco.1997.0187openalex-snapshot
Dynamically Typed Computations for Order-sorted Equational Presentations
inferred← citeshttps://doi.org/10.1006/jsco.1997.0188openalex-snapshot
A Semantic Approach to Order-sorted Rewriting
inferred← citeshttps://doi.org/10.1007/11784180_19openalex-snapshot
Fork Algebras as a Sufficiently Rich Universal Institution
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_117openalex-snapshot
A classification of many-sorted unification problems
inferred← citeshttps://doi.org/10.1007/3-540-17162-2_132openalex-snapshot
Bits and pieces of the theory of institutions
inferred← citeshttps://doi.org/10.1007/3-540-17162-2_133openalex-snapshot
Extended ML: An institution-independent framework for formal program development
inferred← citeshttps://doi.org/10.1007/3-540-17179-7_5openalex-snapshot
An implementation of OBJ2: An object-oriented language for abstract program specification
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_49openalex-snapshot
On parametric algebraic specifications with clean error handling
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_50openalex-snapshot
Toward formal development of programs from algebraic specifications: Implementations revisited
inferred← citeshttps://doi.org/10.1007/3-540-18420-1_50openalex-snapshot
Concurrent term rewriting as a model of computation
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_123openalex-snapshot
Operational semantics of OBJ-3
inferred← citeshttps://doi.org/10.1007/3-540-48483-3_14openalex-snapshot
Translating OBJ3 into CASL: The Institution Level
inferred← citeshttps://doi.org/10.1007/3-540-50325-0_11openalex-snapshot
Partial algebras, subsorting, and dependent types
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_57openalex-snapshot
OBJ: Programming with equalities, subsorts, overloading and parameterization
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_136openalex-snapshot
Order-sorted completion: The many-sorted way
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_40openalex-snapshot
Relation-sorted algebraic specifications with built-in coercers: Basic notions and results
inferred← citeshttps://doi.org/10.1007/3-540-52337-6_17openalex-snapshot
Many-sorted inferences in automated theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-52513-0_2openalex-snapshot
An algebraic approach to refinement
inferred← citeshttps://doi.org/10.1007/3-540-54009-1_7openalex-snapshot
Actor-oriented specification of deontic integrity constraints
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_109openalex-snapshot
Compatibility of order-sorted rewrite rules
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_81openalex-snapshot
Conditional rewriting logic: Deduction, models and concurrency
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_87openalex-snapshot
Meta-rule synthesis from crossed rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-55015-1_23openalex-snapshot
A formalization of objects using equational dynamic logic
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_30openalex-snapshot
Completeness and confluence of order-sorted term rewriting
inferred← citeshttps://doi.org/10.1007/3-540-56868-9_38openalex-snapshot
LAMBDALG: Higher order algebraic specification language
inferred← citeshttps://doi.org/10.1007/3-540-56868-9_5openalex-snapshot
A semantic approach to order-sorted rewriting
inferred← citeshttps://doi.org/10.1007/3-540-57867-6_8openalex-snapshot
Semantic constructions in the specification language Glider
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_11openalex-snapshot
Towards a provably correct compiler for OBJ3
inferred← citeshttps://doi.org/10.1007/3-540-58435-8_195openalex-snapshot
Prototyping object oriented specifications in an algebraic environment
inferred← citeshttps://doi.org/10.1007/3-540-60381-6_20openalex-snapshot
The transformation of term rewriting systems based on well-formedness preserving mappings
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_51openalex-snapshot
Equivalences among various logical frameworks of partial algebras
inferred← citeshttps://doi.org/10.1007/3-540-64299-4_26openalex-snapshot
Membership algebra as a logical framework for equational specification
inferred← citeshttps://doi.org/10.1007/3540539816_74openalex-snapshot
Structuring specifications in-the-large and in-the-small: Higher-order functions, dependent types and inheritance in SPECTRAL
inferred← citeshttps://doi.org/10.1007/3540539816_75openalex-snapshot
Actor-oriented system specification with dynamic logic
inferred← citeshttps://doi.org/10.1007/978-3-030-85315-0_10openalex-snapshot
A Complete Semantics of $$\mathbb {K}$$ and Its Translation to Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_1openalex-snapshot
José Meseguer: Scientist and Friend Extraordinaire
inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_24openalex-snapshot
Weak Bisimulation as a Congruence in MSOS
inferred← citeshttps://doi.org/10.1007/978-3-540-73147-4_3openalex-snapshot
Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-04164-8_8openalex-snapshot
On the Specification and Verification of Model Transformations
inferred← citeshttps://doi.org/10.1007/978-3-642-14808-8_20openalex-snapshot
Complete Calculi for Structured Specifications in Fork Algebra
inferred← citeshttps://doi.org/10.1007/978-3-662-21551-7_5openalex-snapshot
A semantic approach to order-sorted rewriting
inferred← citeshttps://doi.org/10.1007/978-3-662-49630-5_29openalex-snapshot
Order-Sorted Rewriting and Congruence Closure
inferred← citeshttps://doi.org/10.1007/bf00283329openalex-snapshot
Toward formal development of programs from algebraic specifications: Implementations revisited
inferred← citeshttps://doi.org/10.1007/bf01211433openalex-snapshot
Generator induction in order sorted algebras
inferred← citeshttps://doi.org/10.1007/bf01887203openalex-snapshot
Specifying the apple Macintosh ™ Toolbox event manager
inferred← citeshttps://doi.org/10.1007/bf02737104openalex-snapshot
Toward formal development of programs from algebraic specifications: Implementations revisited
inferred← citeshttps://doi.org/10.1007/bfb0014422openalex-snapshot
From abstract data types to logical frameworks
inferred← citeshttps://doi.org/10.1007/bfb0014436openalex-snapshot
Sort inheritance for order-sorted equational presentations
inferred← citeshttps://doi.org/10.1007/bfb0014969openalex-snapshot
Models and equality for logical programming
inferred← citeshttps://doi.org/10.1007/bfb0026103openalex-snapshot
Equational completion in order-sorted algebras extended abstract
inferred← citeshttps://doi.org/10.1007/bfb0030589openalex-snapshot
Specification and proof in membership equational logic
inferred← citeshttps://doi.org/10.1007/bfb0032066openalex-snapshot
Equational formulas in order-sorted algebras
inferred← citeshttps://doi.org/10.1007/bfb0052175openalex-snapshot
Roles and dynamic subclasses: A modal logic approach
inferred← citeshttps://doi.org/10.1007/bfb0057022openalex-snapshot
OOZE: An Object Oriented Z Environment
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90013-bopenalex-snapshot
Parametrization for order-sorted algebraic specification
inferred← citeshttps://doi.org/10.1016/0167-6423(86)90006-7openalex-snapshot
Cigale: A tool for interactive grammar construction and expression parsing
inferred← citeshttps://doi.org/10.1016/0167-6423(88)90002-0openalex-snapshot
Refined compiliation of pattern-matching for functional languages
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90007-8openalex-snapshot
Schematization of infinite sets of rewrite rules generated by divergent completion processes
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90034-fopenalex-snapshot
Equational completion in order-sorted algebras
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90105-qopenalex-snapshot
Order-sorted completion: the many-sorted way
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90182-fopenalex-snapshot
Conditional rewriting logic as a unified model of concurrency
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90322-7openalex-snapshot
Semantics of order-sorted specifications
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90027-zopenalex-snapshot
Programming with equalities, subsorts, overloading, and parametrization in OBJ
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90047-7openalex-snapshot
The term rewriting approach to automated theorem proving
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90062-xopenalex-snapshot
Automatic proofs by induction in theories without constructors
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90055-7openalex-snapshot
Inheritance as implicit coercion
inferred← citeshttps://doi.org/10.1016/b978-0-12-046370-1.50012-7openalex-snapshot
What Is Unification?
inferred← citeshttps://doi.org/10.1016/b978-0-12-046370-1.50013-9openalex-snapshot
Some Fixpoint Techniques in Algebraic Structures and Applications to Computer Science
inferred← citeshttps://doi.org/10.1016/b978-0-12-046371-8.50016-xopenalex-snapshot
Order-Sorted Equational Computation
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50006-xopenalex-snapshot
Equational Logic and Rewriting
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.09.005openalex-snapshot
Equational Logic and Categorical Semantics for Multi-Languages
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.03.012openalex-snapshot
WITHDRAWN: On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.12.026openalex-snapshot
Strict coherence of conditional rewriting modulo axioms
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00369-3openalex-snapshot
Relating CASL with other specification languages: the institution level
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00161-2openalex-snapshot
Abstract data type systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00206-6openalex-snapshot
Specification and proof in membership equational logic
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80110-1openalex-snapshot
A rewrite-based type discipline for a subset of computer algebra
inferred← citeshttps://doi.org/10.1017/s0960129500000517openalex-snapshot
An Oxford survey of order sorted algebra
inferred← citeshttps://doi.org/10.1109/32.277574openalex-snapshot
Using term rewriting to verify software
inferred← citeshttps://doi.org/10.1109/32.825766openalex-snapshot
Automatically checking an implementation against its formal specification
inferred← citeshttps://doi.org/10.1109/icci.1992.227637openalex-snapshot
Self-checking against formal specifications
inferred← citeshttps://doi.org/10.1109/icse.1989.714417openalex-snapshot
Stepwise Refinement Process With Modularity: An Algebraic Approach
inferred← citeshttps://doi.org/10.1109/icse.1990.63599openalex-snapshot
Software process a la Algebra: OBJ for OBJ
inferred← citeshttps://doi.org/10.1109/lics.1991.151659openalex-snapshot
A computation model for executable higher-order algebraic specification languages
inferred← citeshttps://doi.org/10.1109/real.1989.63555openalex-snapshot
A distributed real-time language and its operational semantics
inferred← citeshttps://doi.org/10.1137/1029061openalex-snapshot
Fundamentals of Algebraic Specification 1: Equations and Initial Semantics (H. Ehrig and B. Mahr)
inferred← citeshttps://doi.org/10.1145/1389449.1389463openalex-snapshot
Order-sorted dependency pairs
inferred← citeshttps://doi.org/10.1145/24714.24719openalex-snapshot
Remarks on remarks on many-sorted equational logic
inferred← citeshttps://doi.org/10.1145/74587.74611openalex-snapshot
Stepwise refinement process with modularity
inferred← citeshttps://doi.org/10.4204/eptcs.265.3openalex-snapshot
A Method to Translate Order-Sorted Algebras to Many-Sorted Algebras
inferred← citeshttps://doi.org/10.5075/epfl-thesis-1664openalex-snapshot
An incremental prototyping methodology for distributed systems based on formal specifications
inferred← citeshttps://doi.org/10.5555/100296.100298openalex-snapshot
Software process ag la algebra: OBJ for OBJ
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.