Institute Output
The Ruliology of Lambdas
Stephen Wolfram
It’s a story of pure, abstract computation. In fact, historically, one of the very first. But even though it’s something I for one have used in practice for nearly half a century, it’s not something that in all my years of exploring simple computational systems and ruliology I’ve ever specifically studied. And, yes, it involves some fiddly technical details. But it’ll turn out that lambdas—like so many systems I’ve explored—have a rich ruliology, made particularly significant by their connection to practical computing.
Hypergraph rewriting and Causal structure of $\lambda$-calculus
Utkarsh Bajaj
Hypergraph rewriting is studied through categorical frameworks to establish foundational concepts of events and causality in graph rewriting systems. Novel concepts are introduced within double-pushout rewriting in adhesive categories. An algorithm is constructed to determine causal relations between events during λ-calculus evaluation, with extensions developed for arbitrary λ-expressions.
A Little Closer to Finding What Became of Moses Schönfinkel, Inventor of Combinators
Stephen Wolfram
For most big ideas in recorded intellectual history one can answer the question: “What became of the person who originated it?” But late last year I tried to answer that for Moses Schönfinkel, who sowed a seed for what’s probably the single biggest idea of the past century: abstract computation and its universality.
Where Did Combinators Come From? Hunting the Story of Moses Schönfinkel
Stephen Wolfram
Looking back a century it’s remarkable enough that Moses Schönfinkel conceptualized a formal system that could effectively capture the abstract notion of computation. And it’s more remarkable still that he formulated what amounts to the idea of universal computation, and showed that his system achieved it.