Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation

November 29, 2016 Β· Declared Dead Β· πŸ› Log. Methods Comput. Sci.

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors AndrΓ©s AristizΓ‘bal, Dariusz Biernacki, SergueΓ― Lenglet, Piotr Polesiuk arXiv ID 1611.09626 Category cs.PL: Programming Languages Citations 14 Venue Log. Methods Comput. Sci. Last Checked 2 months ago
Abstract
We present sound and complete environmental bisimilarities for a variant of Dybvig et al.'s calculus of multi-prompted delimited-control operators with dynamic prompt generation. The reasoning principles that we obtain generalize and advance the existing techniques for establishing program equivalence in calculi with single-prompted delimited control. The basic theory that we develop is presented using Madiot et al.'s framework that allows for smooth integration and composition of up-to techniques facilitating bisimulation proofs. We also generalize the framework in order to express environmental bisimulations that support equivalence proofs of evaluation contexts representing continuations. This change leads to a novel and powerful up-to technique enhancing bisimulation proofs in the presence of control operators.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Programming Languages

Died the same way β€” πŸ‘» Ghosted