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

@inproceedings{Stvring2007ACC,
  title={A complete, co-inductive syntactic theory of sequential control and state},
  author={Kristian St\ovring and S\oren B. Lassen},
  booktitle={POPL},
  year={2007}
}
We present a new co-inductive syntactic theory, eager normal form bisimilarity, 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-order programs.The theory is modular in the sense that eager normal form bisimilarity for each of the calculi extended with continuations and/or… CONTINUE READING
Highly Cited
This paper has 43 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 29 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Game semantics using function inventories

P. B. Levy
Talk given at Geometry of Computation 2006 , Marseille • 2006
View 6 Excerpts
Highly Influenced

Bisimilarity as a Theory of Functional Programming

Theor. Comput. Sci. • 1999
View 7 Excerpts
Highly Influenced

Bisimulation in Untyped Lambda Calculus: Böhm Trees and Bisimulation up to Context

Electr. Notes Theor. Comput. Sci. • 1999
View 9 Excerpts
Highly Influenced

Constraining Control

View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…