A proof system for conditional algebraic specifications

DOI10.1007/3-540-54317-1_80OpenAlexW1524428713MaRDI QIDQ5881266

Michaël Rusinowitch, Emmanuel Kounalis

Publication date: 9 March 2023

Published in: Conditional and Typed Rewriting Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-54317-1_80

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Cites Work

• Proofs by induction in equational theories with constructors
• On sufficient-completeness and related properties of term rewriting systems
• Termination of rewriting
• Computing with rewrite systems
• Semantic confluence tests and completion methods
• Proving termination with multiset orderings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A proof system for conditional algebraic specifications