Varieties of ”If-Then-Else“

DOI10.1137/0212047zbMath0518.68010OpenAlexW1972401918MaRDI QIDQ3667922

Ralph Tindell, Stephen L. Bloom

Publication date: 1983

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0212047

zbMATH Keywords

equational logiccontrol flow

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)

Related Items

Guard modules ⋮ Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Discrete decision theory: manipulations ⋮ Monoids of non-halting programs with tests ⋮ Generators, indecomposables and free algebras ⋮ Axiomatization of a functional logic language ⋮ A matching process modulo a theory of categorical products ⋮ 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 ⋮ Completion for unification ⋮ Discriminator varieties and symbolic computation ⋮ Unnamed Item ⋮ 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 ⋮ Algebraic properties of if-then-else and commutative three-valued tests ⋮ Data types over multiple-valued logics ⋮ Stochastic Decision Theory ⋮ A note on the logic of signed equations ⋮ SEMIGROUPS WITH if–then–else AND HALTING PROGRAMS ⋮ Fundamental properties of infinite trees ⋮ Axiomatisation des tests ⋮ Axiomatization of if-then-else over possibly non-halting programs and tests

This page was built for publication: Varieties of ”If-Then-Else“