Sciweavers

Share
PPDP
1999
Springer

A Calculus for Interaction Nets

8 years 11 months ago
A Calculus for Interaction Nets
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 Polytechnique, 91128 Palaiseau Cedex, France Interaction nets are graph rewriting systems which are a generalisation of proof nets for classical linear logic. ar chemical abstract machine (CHAM) is a term rewriting system which corresponds to classical linear logic, via the Curry-Howard isomorphism. We can obtain a textual calculus for interaction nets which is surprisingly similar to linear CHAM based on the multiplicative fragment of classical linear logic. In this paper we introduce a framework based on the linear CHAM to model interaction net reduction. We obtain a textual calculus for interaction nets that is closer to the graphical representation than previous attempts.
Maribel Fernández, Ian Mackie
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where PPDP
Authors Maribel Fernández, Ian Mackie
Comments (0)
books