3 votes

Is there an efficient algorithm to check for duplicator-invariant equivalence on symmetric interaction combinators?

This does not answer your main question but concerns the following point: I'm looking for an equivalence on interaction nets that implies lambda calculus read-back equivalence, but that also ...
Damiano Mazza's user avatar

Only top scored, non community-wiki answers of a minimum length are eligible