Proposition algebra and short-circuit logic

  • Authors:

  • Jan A. Bergstra;Alban Ponse

  • Affiliations:

  • Section Theory of Computer Science, Informatics Institute, Faculty of Science, University of Amsterdam, The Netherlands;Section Theory of Computer Science, Informatics Institute, Faculty of Science, University of Amsterdam, The Netherlands

  • Venue:
  • FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is only evaluated if the first argument does not suffice to determine the value of the expression. In programming, short-circuit evaluation is widely used. We review proposition algebra [2010], an algebraic approach to propositional logic with side effects that models short-circuit evaluation. Proposition algebra is based on Hoare's conditional [1985], which is a ternary connective comparable to if-then-else. Starting from McCarthy's notion of sequential evaluation [1963] we discuss a number of valuation congruences on propositional statements and we introduce Hoare-McCarthy algebras as the structures that model these congruences. We also briefly discuss the associated short-circuit logics, i.e., the logics that define these congruences if one restricts to sequential binary connectives.