3
votes
Accepted
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 ...
- 5,598
1
vote
What is an efficient algorithm to check for equivalence on symmetric interaction combinators?
This is NOT a complete answer yet, as I provide no proof. But, my rough understanding right now is that we can check if two ports are identical by moving a "signal" forward until the root ...
- 3,177
Only top scored, non community-wiki answers of a minimum length are eligible