scientific article; zbMATH DE number 3784848
From MaRDI portal
Publication:3962973
Cited in
(41)- 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
- 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
- Inheritance hierarchies: Semantics and unifications
- Unification theory
- 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
- 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
- Logical debugging
- An algebraic semantics of higher-order types with subtypes
- Structured theory presentations and logic representations
- Actors, actions, and initiative in normative system specification
- Kripke models and the (in)equational logic of the second-order -calculus
- A completeness theorem for the expressive power of higher-order algebraic specifications
- Proof theory of higher-order equations: Conservativity, normal forms and term rewriting.
- Formalization of universal algebra in Agda
- Higher-order equational logic for specification, simulation and testing
- Higher-order order-sorted algebras
- Order-sorted unification
- Forcing, transition algebras, and calculi
- Extensional models for polymorphism
- A systematic study of models of abstract data types
- Kripke-style models for typed lambda calculus
- On conservative extensions of syntax in system development
- Parametrization for order-sorted algebraic specification
- Observational implementation of algebraic specifications
- Equational completion in order-sorted algebras
- Algebraic specification of concurrent systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962973)
