Recently, encodings in interaction nets of the call-by-name and call-by-value strategies of the -calculus have been proposed. The purpose of these encodings was to he gap between ...
We define an observational equivalence for Lafont’s interaction combinators, which we prove to be the least discriminating non-trivial congruence on total nets (nets admitting ...
: This paper presents a compiler for interaction nets, which, just like term rewriting systems, are user-definable rewrite systems which offer the ability to specify and program. I...
We present a restriction of the solos calculus which is stable under reduction and expressive enough to contain an encoding of the pi-calculus. As a consequence, it is shown that ...
: This paper summarizes how an algebra for mobile systems, the -calculus, can be applied as unified formal foundation to service oriented architectures (SOA). The concepts accounte...