Higher Order Company: developing a massively parallel language, proof checker, and runtime using interaction nets/combinators (higherorderco.com)
from armchair_progamer@programming.dev to programming_languages@programming.dev on 17 May 2024 19:44

Interaction combinators were devised by Yves Lafont. Interaction combinators compose to form interaction nets like how SKI combinators compose to form lambda terms. Interaction nets are a model of computation like lambda calculus or Turing machines. In fact, any lambda term can be translated into an interaction net. The key property of interaction nets, unlike Turing machines, is that you can reduce separate parts of an interaction net (i.e. evaluate separate parts of the program it encodes) in parallel, without data races or locks.

For more info, see:

The above repos are in very early stages and the team/company has previous attempts that they ended up rewriting:


threaded - newest