LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Full abstraction in the lazy lambda calculus
Information and Computation
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relational reasoning about contexts
Higher order operational techniques in semantics
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
A sound and complete axiomatization of delimited continuations
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Eager Normal Form Bisimulation
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Head Normal Form Bisimulation for Pairs and the \lambda\mu-Calculus
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
A complete, co-inductive syntactic theory of sequential control and state
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Environmental Bisimulations for Higher-Order Languages
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Normal Form Simulation for McCarthy's Amb
Electronic Notes in Theoretical Computer Science (ENTCS)
Applicative bisimulations for delimited-control operators
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
We define a notion of normal form bisimilarity for the untyped call-by-value λ -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.