Adas and the equational theory of if-then-else
From MaRDI portal
Publication:690107
DOI10.1007/BF01190447zbMath0795.08006OpenAlexW1965089427MaRDI QIDQ690107
Publication date: 20 December 1993
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01190447
Applications of universal algebra in computer science (08A70) Semantics in the theory of computing (68Q55) General topics in the theory of software (68N01)
Related Items
Monoids of non-halting programs with tests ⋮ Equations for if-then-else ⋮ Monoids with tests and the algebra of possibly non-halting programs ⋮ Algebraic properties of if-then-else and commutative three-valued tests ⋮ Barycentric Algebras and Gene Expression ⋮ On the structure of \(C\)-algebras through atomicity and \texttt{if-then-else} ⋮ Convex sets and barycentric algebras ⋮ SEMIGROUPS WITH if–then–else AND HALTING PROGRAMS ⋮ Axiomatization of if-then-else over possibly non-halting programs and tests
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Actions of Boolean rings on sets
- The algebra of conditional logic
- Guard modules
- On modules over a semiring
- A representation of generalized Boolean rings
- \(p\)-rings and their boolean-vector representation
- Generalized ``Boolean theory of universal algebras. II. Identities and subdirect sums of functionally complete algebras
- Predicate Transformer Semantics
- Varieties of ”If-Then-Else“
- On the Axiomatization of “If-Then-Else”
- Equational Bases for If–Then–Else
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- The Theory of Representation for Boolean Algebras
This page was built for publication: Adas and the equational theory of if-then-else