A modern supercompiler for call-by-value functional languages - mazeppa-dev/mazeppa

The EGRAPHS community discusses e-graphs and related technologies for program optimization, verification, and synthesis.

Can we build an optimal processor?

In 1990, Lamping proved optimal λ-calculus evaluation can only be done via graphical interaction systems, because, for any order of evaluation (in a syntax tree), there is a sub-optimal counter-example.

In 1997, Lafont…

With performance optimizations seemingly having lost their relevance in an era of ever-increasing hardware performance, there are still many good reasons to spend some time optimizing code. In a re…

We present some very general grammars in which each re-writing rule is of the type: “replace such and such sequence of trees by such and such another sequence of trees”. Within the framework of programming in first-order logic, we propose axioms for these...

Delimited continuations in byte-code and native OCaml - zinid/delimcc

High-quality browsable Linux kernel syscall tables for multiple architectures

CF Bolz-Tereick wrote some excellent posts in which they introduce a small IR and optimizer and extend it with allocation removal. We also did a live stream together in which we did some more heap optimizations.

PDF | We study the structure of language hierarchies and their reduction by two forms of metacomputation in order to overcome the time and space... | Find, read and cite all the research you need on ResearchGate

[русский]



Go has good support for calling into assembly, and a lot of the fast cryptographic code in the stdlib is carefully optimized assembly, bringing speedups of over 20 times.


However, writing assembly code is hard, reviewing it is possibly harder…

This paper presents the Functional Machine Calculus (FMC) as a simple model of higher-order computation with "reader/writer" effects: higher-order mutable store, input/output, and probabilistic...

I have spent some time in online spaces dedicated to the discussion of Guix. As such, I am familiar with a lot of the mistakes new Guix users make, and I would like to go over some of the most common ones now. Please note that this list isn't final...

Compose NYC 2019
Speaker: James Koppel

Every problem can be solved by many designs. Often the relation between two designs is that one is a transformation of another. When we understand how to mechanically transform designs, we can more easily explore the…