4 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.LO2016★ 4 cited
Token-passing Optimal Reduction with Embedded Read-back
Anton Salikhmetov
We introduce a new interaction net implementation of optimal reduction for the pure untyped lambda calculus. Unlike others, our implementation allows to reach normal form regardles…
cs.LO2012★ 1 cited
Blind graph rewriting systems
Anton Salikhmetov
We consider a simple (probably, the simplest) structure for random access memory. This structure can be used to construct a universal system with nearly void processor, namely, we…