Logic in Computer Science, Symposium on (2008)
June 24, 2008 to June 27, 2008
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2008.45
We present a logic for algebraic effects, based on the algebraic representation of computational effects by operations and equations. We begin with the a-calculus, a minimal calculus which separates values, effects, and computations and thereby canonises the order of evaluation. This is extended to obtain the logic, which is a classical first-order multi-sorted logic with higher-order value and computation types, as in Levy's call-by-push-value, a principle of induction over computations, a free algebra principle, and predicate fixed points. This logic embraces Moggi's computational lambda calculus, and also, via definable modalities, Hennessy-Milner logic, and evaluation logic, though Hoare logic presents difficulties.
algebraic operations, call-by-push-value, computational effects, computational lambda-calculus, program logics
M. Pretnar and G. Plotkin, "A Logic for Algebraic Effects," 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008)(LICS), Pittsburgh, PA, 2008, pp. 118-129.