@MISC{Honda94replicationin, author = {Kohei Honda and Nobuko Yoshida}, title = {Replication in Concurrent Combinators}, year = {1994} }

Bookmark

OpenURL

Abstract

. We establish the behavioural representability of input prefix and replication, which are two basic operators of the asynchronous - calculus [5, 6] (cf. [2]), an offspring of ß-calculus [14, 11], in a system of concurrent combinators which is an extension of cc [7]. Systems of concurrent combinators are simple formal systems based on a finite number of atoms with fixed interaction rules and two connectives for term formation, namely, concurrent composition and name hiding. Since such a system does not own inductively defined syntactic constructs for prefix or replication, their representability using a fixed number of atoms is theoretically interesting, reminiscent of the similar results obtained by Schonfinkel and Curry in the context of the classical combinators. 1. Introduction The aim of the present paper is to establish the behavioural representability of input prefix and replication, which are two basic operators of the asynchronous -calculus [5, 2, 6], an offspring of ß-cal...