  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.
