Coloring terms to control equational reasoning

DOI10.1023/A:1005772217686MaRDI QIDQ1367077zbMATH OpenOpenAlexFDO

Authors Dieter Hutter

Publication date 17 September 1997

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1005772217686

zbMATH Keywords

inductive theorem proving

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 4155899
• A colored version of the \(\lambda\)-calculus
• Foundations of coloring algebra with consequences for feature-oriented programming
• Constraint and satisfiability reasoning for graph coloring
• Coloring Theories
• Coloring the rationals in reverse mathematics
• scientific article; zbMATH DE number 38327
• The method of colored graphs for simplifying expressions with indices
• Using graph coloring in an algebraic compiler
• A generalization of the algebra of color

Cited in

(5)

• Formal software development in the Verification Support Environment (VSE)
• INKA: The next generation
• A case study in the mechanical verification of fault tolerance
• A pragmatic approach to reuse in tactical theorem proving
• Proving theorems by reuse

This page was built for publication: Coloring terms to control equational reasoning

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