3
votes
Accepted
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 ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
interaction-combinators × 3interaction-nets × 2
cc.complexity-theory × 1
lambda-calculus × 1
functional-programming × 1
ct.category-theory × 1
concurrency × 1
process-algebra × 1