Atomic linking is at the heart of HVM's implementation: it is what allows threads to collaborate towards massive parallelism. All major HVM versions started with a better atomic linker. From slow, buggy locks (HVM1), to AtomicCAS (HVM1.5), to AtomicSwap (HVM2), the algorithm became simpler and faster over the years.

On the initial HVM3 implementation, I noticed that one of the cases on the atomic linker never happened. After some reasoning, I now understand why, and

Company:

• HOC: Towards an Optimal Computer: why interaction paradigm can improve computers.
• HOC: Can we build an optimal processor?: like above, but as a tweet.
• HOC: Complete Historical Overview: the lore behind HOC's creation.

Theory:

• Interaction Combinators - Y.Lafont 1997: a concurrent model of computation
• Symmetric Interaction Combinators - Damiano Mazza 2009: a symmetric variant (used by HVM)
• The Optimal Implementation of Functional Programming Languages - best book to learn
• [BOHM](https://www.cambridge.org/core/services/aop-cambridge-core/content/

I am investigating how to use Bend (a parallel language) to accelerate Symbolic AI; in special, Discrete Program Search. Basically, think of it as an alternative to LLMs, GPTs, NNs, that is also capable of generating code, but by entirely different means. This kind of approach was never scaled with mass compute before - it wasn't possible! - but Bend changes this. So, my idea was to do it, and see where it goes.

Now, while I was implementing some candidate algorithms on Bend, I realized that, rather than mass parallelism, I could use an entirely different mechanism to speed things up: SUP Nodes. Basically, it is a feature that Bend inherited from its underlying model ("Interaction Combinators") that, in simple terms, allows us to combine multiple functions into a single superposed one, and apply them all to an argument "at the same time". In short, it allows us to call N functions at a fraction of the expected cost. Or, in simple terms: why parallelize when we can sha

HOC will soon (EOY?) launch an API for our DPS solution. The interface will be simple:

• You give us a set of examples (input/output pairs)

• We'll give you a (Python?) function that models it

And that's it. It will be an universal function finder.

This document is a complete historical overview of the Higher Order Company. If you want to learn anything about our background, a good way to do so is to feed this Gist into an AI (like Sonnet-3.5) and ask it any question!

It all started around 2015. I was an ambitious 21-year-old CS student who, somehow, had been programming for the last 10 years, and I had a clear goal:

I want to become the greatest programmer alive