I am looking for implementation of optimal reduction for λ-calculus based on interaction nets ([McCarthy's amb][2] allowed) in a fashion of ["Token-Passing Nets: Call-by-Need for Free" by François-Régis Sinot][1]. Implementations of optimal reduction that I am aware of either assume a specific strategy for the interaction net reduction, or involve non-pure graph reductions rather than just interaction rules.

The reason why I am interested in such implementation is that I already have a [compiler][3] for interaction nets which is based on interaction calculus, but is agnostic to any notion of interface, thus unable to follow any strategy while reducing a configuration simply represented as a queue of active pairs.

 [1]: http://www.sciencedirect.com/science/article/pii/S1571066106000934
 [2]: http://www.sciencedirect.com/science/article/pii/S1571066105803639
 [3]: https://github.com/codedot/lambda/blob/gh-pages/system.js