Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramsky, S., Ong, C.-H.L.: Full abstraction in the lazy lambda calculus. Information and Computation 105, 159–267 (1993)
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. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol. 7213, pp. 119–134. Springer, Heidelberg (2012)
Biernacki, D., Lenglet, S.: Normal form bisimulations for delimited-control operators (February 2012), http://arxiv.org/abs/1202.5959
Danvy, O., Filinski, A.: A functional abstraction of typed contexts. DIKU Rapport 89/12, DIKU, Computer Science Department, University of Copenhagen, Copenhagen, Denmark (July 1989)
Danvy, O., Filinski, A.: Abstracting control. In: Wand, M. (ed.) LFP 1990, Nice, France, pp. 151–160. ACM Press (June 1990)
Filinski, A.: Representing monads. In: Boehm, H.-J. (ed.) POPL 1994, Portland, Oregon, pp. 446–457. ACM Press (January 1994)
Kameyama, Y., Hasegawa, M.: A sound and complete axiomatization of delimited continuations. In: Shivers, O. (ed.) ICFP 2003, Uppsala, Sweden. SIGPLAN Notices, vol. 38(9), pp. 177–188. ACM Press (August 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.: Bisimulation in untyped lambda calculus: Böhm trees and bisimulation up to context. In: Stephen Brookes, M.M., Jung, A., Scedrov, A. (ed.) MFPS 1999. ENTCS, New Orleans, LA, vol. 20, pp. 346–374. Elsevier Science (April 1999)
Lassen, S.B.: Eager normal form bisimulation. In: Panangaden, P. (ed.) LICS 2005, Chicago, IL, pp. 345–354. IEEE Computer Society Press (June 2005)
Lassen, S.B.: Normal form simulation for McCarthy’s amb. In: Escardó, M., Jung, A., Mislove, M. (eds.) MFPS 2005, Birmingham, UK. ENTCS, vol. 155, pp. 445–465. Elsevier Science Publishers (May 2005)
Lassen, S.B.: Head normal form bisimulation for pairs and the λμ-calculus. In: Alur, R. (ed.) LICS 2006, Seattle, WA, pp. 297–306. IEEE Computer Society Press (August 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)
Sangiorgi, D.: The lazy lambda calculus in a concurrency scenario. In: LICS 1992, Santa Cruz, California, pp. 102–109. IEEE Computer Society (June 1992)
Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. In: Marcinkowski, J. (ed.) LICS 2007, Wroclaw, Poland, pp. 293–302. IEEE Computer Society Press (July 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)
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). Normal Form Bisimulations for Delimited-Control Operators. In: Schrijvers, T., Thiemann, P. (eds) Functional and Logic Programming. FLOPS 2012. Lecture Notes in Computer Science, vol 7294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29822-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-29822-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29821-9
Online ISBN: 978-3-642-29822-6
eBook Packages: Computer ScienceComputer Science (R0)