scientific article; zbMATH DE number 3911679
From MaRDI portal
Publication:3687683
Recommendations
Cited in
(70)- Partial evaluation and \(\omega\)-completeness of algebraic specifications
- On the existence of free models in abstract algebraic institutions
- Toward formal development of programs from algebraic specifications: Implementations revisited
- Quasi-varieties in abstract algebraic institutions
- An algebraic semantics approach to the effective resolution of type equations
- Algebraic specifications of computable and semicomputable data types
- The equational theory of parameterized specifications
- Modular algebraic specification of some basic geometrical constructions
- Full abstraction and limiting completeness in equational languages
- Soundness and completeness of the Birkhoff equational calculus for many-sorted algebras with possibly empty carrier sets
- Conditional rewriting logic as a unified model of concurrency
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Final algebras, cosemicomputable algebras and degrees of unsolvability
- Order-sorted inductive types
- Which data types have -complete initial algebra specifications?
- A recursive second order initial algebra specification of primitive recursion
- Behavioural approaches to algebraic specifications. A comparative study
- A completeness theorem for the expressive power of higher-order algebraic specifications
- The behavior-realization adjunction and generalized homomorphic relations
- Swinging types=functions+relations+transition systems
- A hidden agenda
- Detecting equivalence of modular specifications with categorical diagrams
- Logical foundations of CafeOBJ
- Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
- Bisimulation of automata
- Automatic proofs by induction in theories without constructors
- A hidden Herbrand theorem: Combining the object and logic paradigms
- The data type variety of stack algebras
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Proving operational termination of membership equational programs
- Generalized rewrite theories, coherence completion, and symbolic methods
- Metalevel algorithms for variant satisfiability
- On the complexity of reasoning in Kleene algebra
- Methods for proving termination of rewriting-based programming languages by transformation
- Towards behavioral Maude: behavioral membership equational logic
- Finite Basis Theorems for Relatively Congruence-Distributive Quasivarieties
- scientific article; zbMATH DE number 23020 (Why is no real title available?)
- scientific article; zbMATH DE number 30668 (Why is no real title available?)
- Bisimulation and Hidden Algebra
- scientific article; zbMATH DE number 1522144 (Why is no real title available?)
- scientific article; zbMATH DE number 1522507 (Why is no real title available?)
- scientific article; zbMATH DE number 1525070 (Why is no real title available?)
- scientific article; zbMATH DE number 1555491 (Why is no real title available?)
- Higher-order equational logic for specification, simulation and testing
- Divergence phenomena during completion
- Proving and rewriting
- On behavioural abstraction and behavioural satisfaction in higher-order logic
- Operational termination of membership equational programs: the order-sorted way
- On the connection between narrowing and proof by consistency
- Mechanical analysis of reliable communication in the alternating bit protocol using the Maude invariant analyzer tool
- scientific article; zbMATH DE number 6287652 (Why is no real title available?)
- Formal Methods in Software and Systems Modeling
- Order-sorted unification
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
- Completeness and confluence of order-sorted term rewriting
- Conditional rewriting logic: Deduction, models and concurrency
- A declarative framework for object-oriented programming with genetic inheritance
- On behavioural abstraction and behavioural satisfaction in higher-order logic
- Free objects and equational deduction for partial conditional specifications
- Observational specifications and the indistinguishability assumption
- Algebra of self-replication
- Strict coherence of conditional rewriting modulo axioms
- Modal logic and algebraic specifications
- A complete finite axiomatisation of the equational theory of common meadows
- Behavioral abstraction is hiding information
- A unifying logical foundation for initial algebra semantics and induction
- Data types over multiple-valued logics
- On completeness of narrowing strategies
- Equational completion in order-sorted algebras
- A functorial framework for constraint normal logic programming
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 Q3687683)
