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
Proving congruence of bisimulation in functional programming languages
Information and Computation
Relational reasoning about contexts
Higher order operational techniques in semantics
Bisimilarity as a theory of functional programming
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
A Computational Interpretation of the lambda-µ-Calculus
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
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
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
A proof-theoretic foundation of abortive continuations
Higher-Order and Symbolic Computation
Typed Normal Form Bisimulation for Parametric Polymorphism
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Context-based proofs of termination for typed delimited-control operators
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Howe's Method for Calculi with Passivation
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Normal Form Simulation for McCarthy's Amb
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Observational Theory of the CPS-calculus
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
Applicative bisimulations for delimited-control operators
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Normal form bisimulations for delimited-control operators
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
| Hi-index | 0.00 |
We develop a behavioral theory for the untyped call-by-value λ-calculus extended with the delimited-control operators shift and reset. For this calculus, we discuss the possible observable behaviors and we define an applicative bisimilarity that characterizes contextual equivalence. We then compare the applicative bisimilarity and the CPS equivalence, a relation on terms often used in studies of control operators. In the process, we illustrate how bisimilarity can be used to prove equivalence of terms with delimited-control effects.