Term Rewriting and Applications

DOI10.1007/B135673zbMath1078.68668OpenAlexW2504734884MaRDI QIDQ5703846

Joe Hendrix, José Meseguer, Manuel Clavel

Publication date: 11 November 2005

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

Full work available at URL: https://doi.org/10.1007/b135673

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (8)

Metalevel algorithms for variant satisfiability ⋮ On First-Order Model-Based Reasoning ⋮ Twenty years of rewriting logic ⋮ On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories ⋮ Sufficient completeness verification for conditional and constrained TRS ⋮ A metamodel of access control for distributed environments: applications and properties ⋮ Variant-Based Satisfiability in Initial Algebras ⋮ Metalevel Algorithms for Variant Satisfiability

Uses Software

• Maude
• AProVE
• ITP
• SCC
• CARIBOO

This page was built for publication: Term Rewriting and Applications