A complete, co-inductive syntactic theory of sequential control and state


We present a new co-inductive syntactic theory, <i>eager normal form bisimilarity</i>, for the untyped call-by-value lambda calculus extended with continuations and mutable references.We demonstrate that the associated bisimulation proof principle is easy to use and that it is a powerful tool for proving equivalences between recursive imperative higher… (More)
DOI: 10.1145/1190216.1190244



Citations per Year

Citation Velocity: 7

Averaging 7 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.