2012/11/17 by Eugen Jiresch
Computer Science · #cs.LO
paper · pdf · doi:10.4204/eptcs.101.2
published as EPTCS 101, 2012, pp. 12-24 · In Proceedings LINEARITY 2012, arXiv:1211.3480
arxiv created 2012/11/17 · arxiv updated 2012/11/20
We extend the textual calculus for interaction nets by generic rules and propose constraints to preserve uniform confluence. Furthermore, we discuss the implementation of generic rules in the language inets, which is based on the lightweight interaction nets calculus.