On sufficient completeness of conditional specifications

DOI10.1007/3-540-54317-1_97MaRDI QIDQ5881283zbMATH OpenOpenAlexFDO

Authors Wadoud Bousdira, J. L. Rémy

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_97

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Abstract data types; algebraic specification (68Q65)

Recommendations

• Sufficient completeness verification for conditional and constrained TRS
• A proof system for conditional algebraic specifications
• On sufficient-completeness and related properties of term rewriting systems
• Completeness of combinations of conditional constructor systems
• scientific article; zbMATH DE number 4049024

Cites work

• Abstract data types and software validation
• scientific article; zbMATH DE number 3833280 (Why is no real title available?)
• scientific article; zbMATH DE number 3871335 (Why is no real title available?)
• scientific article; zbMATH DE number 3913659 (Why is no real title available?)
• scientific article; zbMATH DE number 3930339 (Why is no real title available?)
• scientific article; zbMATH DE number 4050972 (Why is no real title available?)
• scientific article; zbMATH DE number 3688683 (Why is no real title available?)
• scientific article; zbMATH DE number 3776841 (Why is no real title available?)
• scientific article; zbMATH DE number 125892 (Why is no real title available?)
• scientific article; zbMATH DE number 4776 (Why is no real title available?)
• On sufficient-completeness and related properties of term rewriting systems
• Proofs by induction in equational theories with constructors
• Simplifying conditional term rewriting systems: Unification, termination and confluence
• The algebraic specification of abstract data types

Cited in

(5)

• scientific article; zbMATH DE number 4049024 (Why is no real title available?)
• Sufficient completeness verification for conditional and constrained TRS
• Term Rewriting and Applications
• Completeness of combinations of conditional constructor systems
• A proof system for conditional algebraic specifications

This page was built for publication: On sufficient completeness of conditional specifications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5881283)