3 votes

Is it possible to evaluate interaction combinators efficiently using a path-traveling strategy?

This has been a subject of investigation for the Implicit Computational Complexity (ICC) community recently. It is known that in certain cases, when the graph you want to evaluate is of a specific ...
user avatar
  • 676

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