Past attempts have been made to apply Girard's linear logic to Lafont's interaction nets by treating ``symbols'' as logical rules, however, failed to come to a significant explanation. In this paper, we try to model ``symbols'' as external axioms and use ``tensor'' to describe partition of auxiliary ports. We show that our solution leads to a very natural logical interpretation of the computation on interaction nets.
Index Terms:
Proof-nets, Parallel programming models
Citation:
Linpeng Huang, Yongqiang Sun, "Interaction Nets Revisited," apdc, pp.108, 1997 Advances in Parallel and Distributed Computing Conference (APDC '97), 1997