abstract_machines

>

Backus-Naur Form: Syntax Specification for Language Design - An introduction to Backus-Naur Form notation for formally specifying programming language syntax

Database Normal Forms: Eliminating Redundancy Through Systematic Decomposition - An introduction to database normalisation theory from First Normal Form through Boyce-Codd Normal Form, with practical examples and historical context.

Async Iterators in Rust

Classic Papers - Reducibility Among Combinatorial Problems - Karp's 21 NP-complete problems and why reductions matter for algorithms and complexity

Async Iterators in JavaScript - Using async generators, for-await loops, and streams to handle data incrementally

Computational Reversibility and Landauer’s Limit - Why erasing bits costs energy, and how reversible computing tries to avoid it

Sequence Maps for Modelling State Machines

Notes on Girard's Linear Logic - The foundational 1987 paper introducing linear logic

∃ 10 Dec 2024

> help

↑/↓ navigate • enter open • esc clear