Abstract Continuation Semantics for a Biologically-Inspired Formalism

We investigate the abstractness of a continuation semantics for a calculus inspired by DNA computing. This semantic investigation is given in the framework of complete metric spaces, and uses the weak abstractness criterion introduced by us in recent work. We prove that the denotational semantics designed with continuations is weakly abstract with respect to the operational semantics of our calculus which involves multiparty synchronization. We show that the expected concurrency laws are satisfied in this semantics for the calculus under investigation.