Varieties of ”If-Then-Else“

DOI10.1137/0212047zbMATH Open0518.68010OpenAlexW1972401918MaRDI QIDQ3667922FDOQ3667922

Authors: 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

control flowequational logic

Mathematics Subject Classification ID

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

Cited In (24)

• Algebraic properties of if-then-else and commutative three-valued tests
• Adas and the equational theory of if-then-else
• A matching process modulo a theory of categorical products
• Guard modules
• Discrete decision theory: manipulations
• Generators, indecomposables and free algebras
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Reduction of Hilbert-type proof systems to the if-then-else equational logic
• Equations for if-then-else
• Monoids of non-halting programs with tests
• Discriminator varieties and symbolic computation
• Fundamental properties of infinite trees
• Stochastic Decision Theory
• Monoids with tests and the algebra of possibly non-halting programs
• Axiomatization of if-then-else over possibly non-halting programs and tests
• Data types over multiple-valued logics
• Title not available (Why is that?)
• Boolean product representations of algebras via binary polynomials
• Completion for unification
• Axiomatization of a functional logic language
• Axiomatisation des tests
• A note on the logic of signed equations
• On algebraic specifications of computable algebras with the discriminator technique
• Semigroups with if-then-else and halting programs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3667922)