|
You are here |
pavpanchekha.com | ||
| | | | |
www.philipzucker.com
|
|
| | | | | E-Graph My E-Graph Blog Posts Union Finds Reference union finds Union find arrays and ints Variations Applications Hash Cons E-matching Equality Saturation Proof Production E Graph Tactics Applications PEG Program Expression Graphs Tree Automata Egglog First class sets GATs Lambda Encoding Contextual EGraphs Equational Logic Theories AC CHR egraphs Misc | |
| | | | |
afnan.io
|
|
| | | | | In 1936, Alonzo Church invented a universal model of computation called "lambda calculus." This system expresses computation as reductions on lambda expressions, which are basically just functions and variables. The system is simple but incredibly expressive, and serves as the foundation for programming languages such as Haskell and Idris. The significance of having a universal model of computation is that it provides a way of solving any problem that can be expressed in the system, and changes the problem from "how can I calculate this" to "can I express this properly?" Lambda calculus is also Turing complete, and even more impressively, was invented in the 1930s independently of Turing. | |
| | | | |
lucassifoni.info
|
|
| | | | | [AI summary] The author documents the first part of migrating a custom mini-language called Ovo2 from TypeScript to Elixir, detailing its design requirements for data transformation and its lambda-based syntax. | |
| | | | |
text.marvinborner.de
|
|
| | | This article describes a variadic extension to the default fixed-point combinator namely the Y-combinator. We do this by translating the Scheme code from a paper to bruijn (pure lambda calculus). | ||