In my latest filesystem-themed post I discussed a technique to perform distributed resource management more safely. This time I'll explain how one might effectively combine _Reed-Solomon coding_ and _cyclic redundancy checks_. The first gives us redundancy…

This article describes a new level of fortification supported in GCC. This new level detects more buffer overflows and bugs which mitigates security issues in applications at run time

C Compiler written in Vim script. Contribute to rhysd/8cc.vim development by creating an account on GitHub.

Ramkumar Ramachandra's personal website

A Brainfuck interpreter written in Agda. Contribute to wouter-swierstra/Brainfuck development by creating an account on GitHub.

Visualizing Rust codebases in a few seconds. Contribute to lava-xyz/rust-ontologist development by creating an account on GitHub.

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