Normal Form Bisimulations for Delimited-Control Operators

Details Normal Form Bisimulations for Delimited-Control Operators Normal Form Bisimulations for Delimited-Control Operators

2012-02-27

arxiv.org/abs/1202.5959v2

Computer Science

Programming Languages

Scientific paper

We define a notion of normal form bisimilarity for the untyped call-by-value lambda calculus extended with the delimited-control operators shift and reset. Normal form bisimilarities are simple, easy-to-use behavioral equivalences which relate terms without having to test them within all contexts (like contextual equivalence), or by applying them to function arguments (like applicative bisimilarity). We prove that the normal form bisimilarity for shift and reset is sound but not complete w.r.t. contextual equivalence and we define up-to techniques that aim at simplifying bisimulation proofs. Finally, we illustrate the simplicity of the techniques we develop by proving several equivalences on terms.

Affiliated with

Also associated with

No associations

Rating

Normal Form Bisimulations for Delimited-Control Operators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Normal Form Bisimulations for Delimited-Control Operators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Normal Form Bisimulations for Delimited-Control Operators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-263712