Membres associés du LCR -
(Logique,
Calcul et raisonnement), Laboratoire Informatique de Paris
Nord - LIPN.
Research Interests / Centres d'intérêt
Programming Languages (functional, logic, concurrency) :
Current work: comparison of different non-deterministic extensions of IN.
Interaction nets, introduced by Lafont, consists of a graph with
agents at the nodes, and a set of graph rewriting rules which specify
the interaction between two agents connected through their principal
ports (each agent has a unique principal port, and there is a unique
rule for each pair of agents). However, they are intrinsically
deterministic and this prevents from applying these techniques to
concurrent languages where non-determinism plays a key role.
Our aim is to increase the expressive power of the interaction net
framework, but remaining as close as possible to the original
definition. A first extension, called IN with asymmetric rules, would
be to allow two rules randomly chosen for the same left member. A
second extension, called IN extended with context rules, is to allow
a conditional selection between two rules depending on the context of
the left-hand side rule. In a third extension, called IN extended
with amb, we add one agent with two principal ports (used as inputs)
and two auxiliary ports.
We arrived to the following result: IN with asymmetric rules can be
implemented with IN extended with amb, which can be implemented
IN extended with context rules. IN with asymmetric rules can
implement infinity merge, but not angelic merge and fair merge. IN
extended with {\sf amb} can implement infinity and angelic merge but
not fair merge. IN extended with context rules can implement
infinity, angelic merge and fair merge.
Sylvain Lippi's Graphical interpretor in ²:
Links for Interaction Nets / Liens pour les réseaux d'interaction:
Mise à jour: 29 sept. 2043