Bisimulations for Delimited-Control Operators
Open Access
- 24 May 2019
- journal article
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Logical Methods in Computer Science
- Vol. ume 15, Is
Abstract
We present a comprehensive study of the behavioral theory of an untyped $\lambda$-calculus extended with the delimited-control operators shift and reset. To that end, we define a contextual equivalence for this calculus, that we then aim to characterize with coinductively defined relations, called bisimilarities. We consider different styles of bisimilarities (namely applicative, normal-form, and environmental) within a unifying framework, and we give several examples to illustrate their respective strengths and weaknesses. We also discuss how to extend this work to other delimited-control operators.Keywords
All Related Versions
This publication has 33 references indexed in Scilit:
- A Sound and Complete Bisimulation for Contextual Equivalence in $\lambda $ -Calculus with Call/cc2016
- Normal Form Bisimulations for Delimited-Control Operators2012
- The Higher-Order, Call-by-Value Applied Pi-CalculusLecture Notes in Computer Science, 2009
- Polymorphic Delimited Continuations2007
- Complete Lattices and Up-To TechniquesLecture Notes in Computer Science, 2007
- Proving Congruence of Bisimulation in Functional Programming LanguagesInformation and Computation, 1996
- Classical logic, storage operators and second-order lambda-calculusAnnals of Pure and Applied Logic, 1994
- Full Abstraction in the Lazy Lambda CalculusInformation and Computation, 1993
- Fully abstract models of typed λ-calculiTheoretical Computer Science, 1977
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975