No label defined (Q3817577)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4090769
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4090769 |
Statements
1988
0 references
theory of programming languages
0 references
conditional term rewriting systems
0 references
equational axiomatization
0 references
2-sorted
0 references
algebras
0 references
0.9336276054382324
0 references
0.8474829196929932
0 references
0.8172409534454346
0 references
0.8102748394012451
0 references
0.8080105781555176
0 references
[For the entire collection see Zbl 0639.00039.] An equational axiomatization of ``if-then-else'' that can be used to prove properties of programs by purely equational methods is given. Two sorts of if-then-else are dealt with: bool*bool*bool\(\to bool\) and bool*data*data*\(\to data\). Axiomatization consists of 11 axioms for the \(data=bool\) sort of if-then-else and 8 axioms for the general case. The combined axiom system is complete for the suitable class of 2-sorted (bool and data) algebras with n operations except two sorts of if-then- else. When additional operations on data are allowed, one has to add axioms for the constant ``undefined'' and distributivity of additional operations with respect to if-then-else. Proofs are not included. Several open problems are stated.
0 references