Order-sorted Equational Unification Revisited

DOI10.1016/j.entcs.2012.11.010zbMath1291.68220OpenAlexW2018282539WikidataQ113318032 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 programmingorder-sorted unification

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (10)

Order-Sorted Parameterization and Induction ⋮ On First-Order Model-Based Reasoning ⋮ Twenty years of rewriting logic ⋮ On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories ⋮ Variants and satisfiability in the infinitary unification wonderland ⋮ Strict coherence of conditional rewriting modulo axioms ⋮ Programming and symbolic computation in Maude ⋮ Regular expression order-sorted unification and matching ⋮ A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems ⋮ Symbolic computation in Maude: some tapas

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

This page was built for publication: Order-sorted Equational Unification Revisited