Order-sorted equational unification revisited
From MaRDI portal
Recommendations
Cites work
- An Efficient Unification Algorithm
- scientific article; zbMATH DE number 4056995 (Why is no real title available?)
- scientific article; zbMATH DE number 1189278 (Why is no real title available?)
- scientific article; zbMATH DE number 1348460 (Why is no real title available?)
- scientific article; zbMATH DE number 3413831 (Why is no real title available?)
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Order-sorted unification
- Unification in sort theories and its applications
Cited in
(19)- Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems
- Twenty years of rewriting logic
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems
- Symbolic computation in Maude: some tapas
- Programming and symbolic computation in Maude
- A partial evaluation framework for order-sorted equational programs modulo axioms
- Order-Sorted Rewriting and Congruence Closure
- On First-Order Model-Based Reasoning
- Order-Sorted Parameterization and Induction
- Dynamically-typed computations for order-sorted equational presentations
- AC unification through order-sorted AC1 unification
- A semantic approach to order-sorted rewriting
- Term Rewriting and Applications
- Order-sorted unification
- Variants and satisfiability in the infinitary unification wonderland
- Strict coherence of conditional rewriting modulo axioms
- Regular expression order-sorted unification and matching
- Equational completion in order-sorted algebras
This page was built for publication: Order-sorted equational unification revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166637)