4 citations · 11 across the 15 of their papers we have counts for
14 papers · 1 filter
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…
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…
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…
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…
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…
Optimal Reduction without Oracle?
Anton Salikhmetov
We suggest an approach to solve the problem of matching fans in interaction net implementations of optimal reduction for the pure untyped lambda calculus without use of any additio…