Evaluation Trees for Proposition Algebra

DOI10.1007/978-3-319-23506-6_6zbMath1444.03110arXiv1504.08321OpenAlexW1711691713MaRDI QIDQ3449625

Alban Ponse, Jan A. Bergstra

Publication date: 4 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.08321

zbMATH Keywords

conditional compositionshort-circuit evaluationevaluation treeproposition algebrashort-circuit logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Other algebras related to logic (03G25)

Related Items (2)

An independent axiomatisation for free short-circuit logic ⋮ Non-commutative propositional logic with short-circuit evaluation

Cites Work

• Unnamed Item
• Unnamed Item
• Program algebra for sequential code
• Proposition Algebra and Short-Circuit Logic
• Proposition algebra
• A Couple of Novelties in the Propositional Calculus
• Laws of programming
• A propositional logic with 4 values: true, false, divergent and meaningless

This page was built for publication: Evaluation Trees for Proposition Algebra