Equational Bases for If–Then–Else
From MaRDI portal
Publication:3801055
DOI10.1137/0216033zbMath0654.68029OpenAlexW2089622083MaRDI QIDQ3801055
Publication date: 1987
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0216033
Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Equational logic, Mal'tsev conditions (08B05)
Related Items
Monoids of non-halting programs with tests ⋮ Boolean product representations of algebras via binary polynomials ⋮ Equations for if-then-else ⋮ Reduction of Hilbert-type proof systems to the if-then-else equational logic ⋮ Discriminator varieties and symbolic computation ⋮ Adas and the equational theory of if-then-else ⋮ Monoids with tests and the algebra of possibly non-halting programs ⋮ On algebraic specifications of computable algebras with the discriminator technique ⋮ Data types over multiple-valued logics ⋮ SEMIGROUPS WITH if–then–else AND HALTING PROGRAMS ⋮ Axiomatization of if-then-else over possibly non-halting programs and tests ⋮ Unnamed Item
This page was built for publication: Equational Bases for If–Then–Else