activity
20102019
most citedToken-passing Optimal Reduction with Embedded Read-back

4 citations · 11 across the 15 of their papers we have counts for

collaborators

15 papers

q-fin.GN2019

Elementary Microeconomics of the Talmudic Rule

Anton Salikhmetov

This paper takes a look at the Talmudic rule aka the 1/N rule aka the uniform investment strategy from the viewpoint of elementary microeconomics. Specifically, we derive the cardi…

cs.LO2018

Lambda Calculus with Explicit Read-back

Anton Salikhmetov

This paper introduces a new term rewriting system that is similar to the embedded read-back mechanism for interaction nets presented in our previous work, but is easier to follow t…

cs.LO2018

Upward confluence in the interaction calculus

Anton Salikhmetov

The lambda calculus is not upward confluent, one of counterexamples known thanks to Plotkin. This paper investigates upward confluence in the interaction calculus. Can an interacti…

cs.LO2017

An impure solution to the problem of matching fans

Anton Salikhmetov

We propose an algorithm to solve the problem of matching fans in interaction net implementations of optimal reduction for the pure untyped lambda calculus without use of any additi…

cs.LO2017★ 1 cited

Parallel needed reduction for pure interaction nets

Anton Salikhmetov

Reducing interaction nets without any specific strategy benefits from constant time per step. On the other hand, a canonical reduction step for weak reduction to interface normal f…

cs.LO2017

A better model of computation for digital physics?

Anton Salikhmetov

This note is meant to invite the reader to consider interaction nets, a relatively recently discovered model of computation, as a possible alternative for cellular automata which a…