Order-sorted Equational Unification Revisited

DOI10.1016/j.entcs.2012.11.010zbMath1291.68220WikidataQ113318032 ScholiaQ113318032MaRDI QIDQ5166637

José Meseguer, Joe Hendrix

Publication date: 27 June 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2012.11.010

zbMATH Keywords

rule-based programming; order-sorted unification

Mathematics Subject Classification ID

68Q42: Grammars and rewriting systems

Related Items

Variants and satisfiability in the infinitary unification wonderland, Strict coherence of conditional rewriting modulo axioms, Regular expression order-sorted unification and matching, 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, On First-Order Model-Based Reasoning, Order-Sorted Parameterization and Induction

Uses Software

• Maude
• Maude-NPA

Cites Work

• Order-sorted unification
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Unification in sort theories and its applications
• An Efficient Unification Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item