1
Principia Mathematica is modern and insightful
Notes on Chapter 1 of Principia Mathematica
Oleg Kiselyov
- Popular posts
- 8
- Total points
- 1,328
- HN comments
- 489
- Rank
- #1,483 personal
Visit okmij.org → On Hacker News Nov 2014 – Aug 2026
Software Engineering 6Programming Languages 6History & Retro Computing 2Systems & Performance 1Math & Algorithms 1
2
A dream of an ultimate OS (1995)
A vision of an OS that recognizes that any user activity and most of the system activities are nothing but queries, which ought to be treated uniformly and implemented efficiently once and for all; database as a file system; A paper submitted to MacHack'95
3
How the OCaml type checker works (2022)
A short guide on OCaml type checker, describing the surprisingly elegant algorithm for generalization, which generalizes to first-class polymorphism, MLF and local types. Polymorphism and regions have much in common.
4
Compilers: Incrementally and Extensibly (2024)
The materials for the course on compilers: built incrementally and fully in tagless-final style
5
Higher-kinded bounded polymorphism in OCaml (2021)
How bounded higher-kinded polymorphism arises in practice, and how to express it in OCaml, in several different ways. Some ways are rather concise -- but less widely known.
6
Implementing and Understanding Type Classes (2014)
Describing three strategies of implementing type classes, aiming to clarify their behavior
7
Monads in Scheme
An example of a monadic programming in Scheme that juxtaposes Haskell code for a state monad with the corresponding Scheme code.
8
An argument against call/cc (2012)
Why a programming language should not offer a primitive to capture undelimited continuations (call/cc).