Abstract
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.
Keywords
- Operator Shift
- Behavioral Theory
- Label Transition System
- Reduction Rule
- Lambda Calculus
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download conference paper PDF
References
Abramsky, S., Ong, C.-H.L.: Full abstraction in the lazy lambda calculus. Information and Computation 105, 159–267 (1993)
Ariola, Z.M., Herbelin, H., Sabry, A.: A type-theoretic foundation of delimited continuations. Higher-Order and Symbolic Computation 20(4), 403–429 (2007)
Bierman, G.: A Computational Interpretation of the λμ-Calculus. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 336–345. Springer, Heidelberg (1998)
Biernacka, M., Biernacki, D.: Context-based proofs of termination for typed delimited-control operators. In: López-Fraguas, F.J. (ed.) PPDP 2009, pp. 289–300. ACM Press, Coimbra (2009)
Biernacka, M., Biernacki, D., Danvy, O.: An operational foundation for delimited continuations in the CPS hierarchy. Logical Methods in Computer Science 1(2:5), 1–39 (2005)
Biernacki, D., Danvy, O., Millikin, K.: A dynamic continuation-passing style for dynamic delimited continuations. Technical Report BRICS RS-05-16, DAIMI, Department of Computer Science. Aarhus University, Aarhus, Denmark (May 2005)
Biernacki, D., Lenglet, S.: Applicative bisimulations for delimited-control operators (January 2012), http://arxiv.org/abs/1201.0874
Danvy, O., Filinski, A.: Abstracting control. In: Wand, M. (ed.) LFP 1990, pp. 151–160. ACM Press, Nice (1990)
David, R., Py, W.: λμ-calculus and Böhm’s theorem. Journal of Symbolic Logic 66(1), 407–413 (2001)
Filinski, A.: Representing monads. In: Boehm, H.-J. (ed.) POPL 1994, pp. 446–457. ACM Press, Portland (1994)
Gordon, A.D.: Bisimilarity as a theory of functional programming. Theoretical Computer Science 228(1-2), 5–47 (1999)
Howe, D.J.: Proving congruence of bisimulation in functional programming languages. Information and Computation 124(2), 103–112 (1996)
Kameyama, Y., Hasegawa, M.: A sound and complete axiomatization of delimited continuations. In: Shivers, O. (ed.) ICFP 2003. SIGPLAN Notices, vol. 38(9), pp. 177–188. ACM Press, Uppsala (2003)
Lassen, S.B.: Relational reasoning about contexts. In: Gordon, A.D., Pitts, A.M. (eds.) Higher Order Operational Techniques in Semantics, pp. 91–135. Cambridge University Press (1998)
Lassen, S.B.: Eager normal form bisimulation. In: Panangaden, P. (ed.) LICS 2005, pp. 345–354. IEEE Computer Society Press, Chicago (2005)
Lassen, S.B.: Normal form simulation for McCarthy’s amb. In: Escardó, M., Jung, A., Mislove, M. (eds.) MFPS 2005. ENTCS, vol. 155, pp. 445–465. Elsevier Science Publishers, Birmingham (2005)
Lassen, S.B., Levy, P.B.: Typed normal form bisimulation for parametric polymorphism. In: Pfenning, F. (ed.) LICS 2008, pp. 341–352. IEEE Computer Society Press, Pittsburgh (2008)
Lenglet, S., Schmitt, A., Stefani, J.-B.: Howe’s Method for Calculi with Passivation. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 448–462. Springer, Heidelberg (2009)
Merro, M., Biasi, C.: On the observational theory of the CPS-calculus: (extended abstract). ENTCS 158, 307–330 (2006)
Milner, R.: Fully abstract models of typed λ-calculi. Theoretical Computer Science 4(1), 1–22 (1977)
Morris, J.H.: Lambda Calculus Models of Programming Languages. PhD thesis, Massachusets Institute of Technology (1968)
Parigot, M.: λμ-Calculus: An Algorithmic Interpretation of Classical Natural Deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS (LNAI), vol. 624, pp. 190–201. Springer, Heidelberg (1992)
Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. In: Marcinkowski, J. (ed.) LICS 2007, pp. 293–302. IEEE Computer Society Press, Wroclaw (2007)
Sangiorgi, D., Walker, D.: The Pi-Calculus: A Theory of Mobile Processes. Cambridge University Press (2001)
Støvring, K., Lassen, S.B.: A complete, co-inductive syntactic theory of sequential control and state. In: Felleisen, M. (ed.) POPL 2007. SIGPLAN Notices, vol. 42(1), pp. 161–172. ACM Press, New York (2007)
Thielecke, H.: Categorical Structure of Continuation Passing Style. PhD thesis. University of Edinburgh, Edinburgh, Scotland (1997) ECS-LFCS-97-376
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biernacki, D., Lenglet, S. (2012). Applicative Bisimulations for Delimited-Control Operators. In: Birkedal, L. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2012. Lecture Notes in Computer Science, vol 7213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28729-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-28729-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28728-2
Online ISBN: 978-3-642-28729-9
eBook Packages: Computer ScienceComputer Science (R0)