Axiomatisation des tests

DOI10.1016/0304-3975(85)90007-6zbMath0573.68004OpenAlexW2070839466MaRDI QIDQ1062748

Christophe Benoit

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90007-6

zbMATH Keywords

completenessordered algebrasequational theoriesflat algebrasif-then-else equations

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Equational logic, Mal'tsev conditions (08B05) General topics in the theory of software (68N01) Ordered rings, algebras, modules (06F25) Equational classes, universal algebra in model theory (03C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some classes of interpretations
• Varieties of ”If-Then-Else“
• On the Axiomatization of “If-Then-Else”
• Infinite trees in normal form and recursive equations having a unique solution
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Complete Sets of Reductions for Some Equational Theories
• Tree-Manipulating Systems and Church-Rosser Theorems

This page was built for publication: Axiomatisation des tests