Parallel Label-Selective lambda-calculus (LCEP)
Author
Salvador Lucas, Javier Oliver
Abstract
We present a new calculus to model parallel systems, the
Parallel Label-Selective lambda-calculus. The formalism arises from an
initial proposal by H. Ait-Kaci, the Label-Selective lambda-calculus,
that describes a language which is an extension to the lambda-calculus,
in which the function arguments are selected by labels. The set of labels
contains numerical positions and symbols. The Label-Selective
lambda-calculus exhibits an implicit parallelism between the execution
of the different channels but it is impossible to make a selection in the
same channel. We are going to extend its syntax by introducing
nondeterminism into the system evolution and thereby reflect the behaviour
of the parallel systems. The inclusion of new operators (the parallelism,
the sequence, the nondeterministic election and the replication) and the
introduction of new concepts (in particular, the concept of the tunnel)
will allow our calculus to easily express the modelization of the
parallelism.
Keywords
Parallelism, extensions of lambda-calculus, Process Algebras,
Functional Programming.