ENTCS
2006
13 years 4 months ago
2006
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 ...
ECEASST
2008
13 years 4 months ago
2008
: 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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
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 ...
PPDP
1999
Springer
13 years 8 months ago
1999
Springer
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
TLCA
2005
Springer
13 years 10 months ago
2005
Springer
Two common misbeliefs about encodings of the λ-calculus in interaction nets (INs) are that they are good only for strategies that are not very well understood (e.g. optimal reduct...
RTA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...