The following pages link to (Q3221381):
Displaying 50 items.
- Inheritance hierarchies: Semantics and unifications (Q1124313) (← links)
- On a conjecture of Bergstra and Tucker (Q1124321) (← links)
- Algebraic processing of programming languages (Q1129126) (← links)
- Polymorphic rewriting conserves algebraic strong normalization (Q1176244) (← links)
- Foundations of rule-based design of modular systems (Q1176249) (← links)
- Horn clause programs with polymorphic types: Semantics and resolution (Q1177936) (← links)
- Specification styles in distributed systems design and verification (Q1177943) (← links)
- Classes of finite relations as initial abstract data types. I (Q1179266) (← links)
- Context induction: A proof principle for behavioural abstractions and algebraic implementations (Q1179807) (← links)
- An agent calculus with simple actions where the enabling and disabling are derived operators (Q1183473) (← links)
- Some fundamental algebraic tools for the semantics of computation. III: Indexed categories (Q1183597) (← links)
- Modularising the specification of a small database system in extended ML (Q1184686) (← links)
- Semantics of order-sorted specifications (Q1185014) (← links)
- Soundness and completeness of the Birkhoff equational calculus for many-sorted algebras with possibly empty carrier sets (Q1185017) (← links)
- Algebraization of quantifier logics, an introductory overview (Q1189899) (← links)
- Temporal theories as modularisation units for concurrent system specification (Q1192604) (← links)
- An order-sorted logic for knowledge representation systems (Q1193487) (← links)
- A semi-algorithm for algebraic implementation proofs (Q1199928) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- Denotational semantics of an object-oriented programming language with explicit wrappers (Q1261310) (← links)
- Term-rewriting systems with rule priorities (Q1262749) (← links)
- An algebraic generalization of Frege structures -- binding algebras (Q1274449) (← links)
- Models for the substitution axiom of UNITY logic (Q1313738) (← links)
- Contextual rewriting as a sound and complete proof method for conditional LOG-specifications (Q1323311) (← links)
- An algebraic semantics of higher-order types with subtypes (Q1323318) (← links)
- OBSCURE, a specification language for abstract data types (Q1323328) (← links)
- Toward formal development of programs from algebraic specifications: Parameterisation revisited (Q1323357) (← links)
- The verification of modules (Q1329200) (← links)
- Behavioural approaches to algebraic specifications. A comparative study (Q1338907) (← links)
- Another look at parameterization for oder-sorted algebraic specifications (Q1342863) (← links)
- Functorial theory of parameterized specifications in a general specification framework (Q1346622) (← links)
- On pushout consistency, modularity and interpolation for logical specifications (Q1350924) (← links)
- Actors, actions, and initiative in normative system specification (Q1353968) (← links)
- Verifying a distributed list system: A case history (Q1355754) (← links)
- A completeness theorem for the expressive power of higher-order algebraic specifications (Q1362341) (← links)
- Many-sorted algebras in congruence modular varieties (Q1363439) (← links)
- Essential concepts of algebraic specification and program development (Q1377322) (← links)
- On the complexity of specification morphisms (Q1389688) (← links)
- Order-sorted algebraic specifications with higher-order functions (Q1391097) (← links)
- May I borrow your logic? (Transporting logical structures along maps) (Q1391728) (← links)
- Proof systems for structured specifications with observability operators (Q1391730) (← links)
- Institutions for logic programming (Q1391732) (← links)
- TTL: A modular language for hardware/software systems design. (Q1400574) (← links)
- Proof theory of higher-order equations: Conservativity, normal forms and term rewriting. (Q1401983) (← links)
- Algebraic models of correctness for abstract pipelines. (Q1426058) (← links)
- Sketches and computations over fields. (Q1565815) (← links)
- Object-oriented hybrid systems of coalgebras plus monoid actions (Q1575271) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- Detecting equivalence of modular specifications with categorical diagrams (Q1583247) (← links)
- Compositional SOS and beyond: A coalgebraic view of open systems (Q1603820) (← links)
