Monoids of non-halting programs with tests
From MaRDI portal
Publication:1646607
DOI10.1007/s00012-018-0490-3zbMath1400.08003OpenAlexW2797333242MaRDI QIDQ1646607
Publication date: 25 June 2018
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00012-018-0490-3
Theory of programming languages (68N15) Applications of universal algebra in computer science (08A70) Semigroups in automata theory, linguistics, etc. (20M35) Other algebras related to logic (03G25)
Related Items
Algebraic properties of if-then-else and commutative three-valued tests ⋮ On the structure of \(C\)-algebras through atomicity and \texttt{if-then-else}
Cites Work
- Unnamed Item
- Actions of Boolean rings on sets
- Adas and the equational theory of if-then-else
- Comparison semigroups and algebras of transformations.
- A transformational characterization of if-then-else
- The algebra of conditional logic
- Triples and compact sheaf representation
- Agreeable semigroups.
- Sets with \(B\)-action and linear algebra
- Monoids with tests and the algebra of possibly non-halting programs
- Domain and Antidomain Semigroups
- Varieties of ”If-Then-Else“
- On the Axiomatization of “If-Then-Else”
- Equational Bases for If–Then–Else
- Equality-Test and If-Then-Else Algebras: Axiomatization and Specification
- A Cayley Theorem for Boolean Algebras
- Conditional Expressions with Equality Tests
- Axiomatization of if-then-else over possibly non-halting programs and tests
- On notation for ordinal numbers
- SEMIGROUPS WITH if–then–else AND HALTING PROGRAMS
This page was built for publication: Monoids of non-halting programs with tests