Abstract

Observationally equivalent programs are programs which are indistinguishable in all contexts, as far as their termination property is concerned. In this paper, we present rules preserving observational equivalence, for the parallel evaluation of programs using call/cc. These rules allow the capture of continuations in any applicative context and they prevent from aborting the whole computation when a continuation is applied in the extent of the call/cc by which it was reied. As a consequence, these results prove that one can design a functional language with rst-class continuations which has transparent constructs for parallelism. 1 Introduction Some programming languages, like Scheme and Standard ML of New Jersey, provide a control operator call/cc which gives the programmer the possibility to reify the current continuation as a rst-class object. When such a reied continuation is applied to a value v, the current computation is aborted and the execution resumes at the point wher...

Citations