Major Version Numbers are Not Sacred
https://tom.preston-werner.com/2022/05/23/major-version-numbers-are-not-sacred
https://tom.preston-werner.com/2022/05/23/major-version-numbers-are-not-sacred
Preston-Werner
Major Version Numbers are Not Sacred
The Long Way to Deforestation: A Type Inference and Elaboration Technique for Removing Intermediate Data Structures
https://dl.acm.org/doi/pdf/10.1145/3674634
https://dl.acm.org/doi/pdf/10.1145/3674634
Practical Design Patterns
: Opaque Pointers and Objects in Chttps://interrupt.memfault.com/blog/opaque-pointers
Interrupt
Practical Design Patterns: Opaque Pointers and Objects in C
An overview of the opaque pointer pattern in C. How to create objects in C.
A formal kernel memory-ordering model
https://lwn.net/Articles/718628/
https://lwn.net/Articles/718628/
Adding row polymorphism to Damas-Hindley-Milner
https://bernsteinbear.com/blog/row-poly/
https://bernsteinbear.com/blog/row-poly/
Max Bernstein
Adding row polymorphism to Damas-Hindley-Milner
Intro to HM
Using Circular Programs for Higher-Order Syntax
https://emilaxelsson.github.io/documents/axelsson2013using.pdf
https://emilaxelsson.github.io/documents/axelsson2013using.pdf
What Not to Do When Writing an Interpreter for Specialisation
https://www.researchgate.net/publication/2648244_What_Not_to_Do_When_Writing_an_Interpreter_for_Specialisation
https://www.researchgate.net/publication/2648244_What_Not_to_Do_When_Writing_an_Interpreter_for_Specialisation
ResearchGate
(PDF) What Not to Do When Writing an Interpreter for Specialisation
PDF | A partial evaluator, given a program and a known “static” part of its input data, outputs a specialised or residual program in which computations... | Find, read and cite all the research you need on ResearchGate
Computability and Complexity: From a Programming Perspective
http://hjemmesider.diku.dk/~neil/comp2book2007/book-whole.pdf
http://hjemmesider.diku.dk/~neil/comp2book2007/book-whole.pdf
Checking Polynomial Time Complexity with Types
https://link.springer.com/chapter/10.1007/978-0-387-35608-2_31
https://link.springer.com/chapter/10.1007/978-0-387-35608-2_31
SpringerLink
Checking Polynomial Time Complexity with Types
Light Affine Logic (LAL) is a logical system due to Girard and Asperti offering a polynomial time cut-elimination procedure. It can be used as a type system for lambda-calculus, ensuring a well-typed program has a polynomial time bound on any input. Types…
Category Theory Illustrated
https://abuseofnotation.github.io/category-theory-illustrated/05_logic/
https://abuseofnotation.github.io/category-theory-illustrated/05_logic/
A deep dive into Linux’s new mseal syscall
https://blog.trailofbits.com/2024/10/25/a-deep-dive-into-linuxs-new-mseal-syscall/
https://blog.trailofbits.com/2024/10/25/a-deep-dive-into-linuxs-new-mseal-syscall/
The Trail of Bits Blog
A deep dive into Linux’s new mseal syscall
If you love exploit mitigations, you may have heard of a new system call named mseal landing into the Linux kernel’s 6.10 release, providing a protection called “memory sealing.” Beyond notes from the authors, very little information about this mitigation…
minotaur-oopsla24.pdf
948 KB
Minotaur
: A SIMD-Oriented Synthesizing SuperoptimizerLessons learned from a successful Rust rewrite
https://gaultier.github.io/blog/lessons_learned_from_a_successful_rust_rewrite.html
https://gaultier.github.io/blog/lessons_learned_from_a_successful_rust_rewrite.html
On Deciding Typing in Bidirectional Martin-Löf Type Theory
https://types2024.itu.dk/slides/S3/TYPES2023-Lennon-Bertrand-Krishnaswami.pdf
https://types2024.itu.dk/slides/S3/TYPES2023-Lennon-Bertrand-Krishnaswami.pdf
Proof of the geometric Langlands conjecture
https://people.mpim-bonn.mpg.de/gaitsgde/GLC/
https://people.mpim-bonn.mpg.de/gaitsgde/GLC/
Prismatic Category Theory
https://golem.ph.utexas.edu/category/2024/08/prismatic_category_theory.html
https://golem.ph.utexas.edu/category/2024/08/prismatic_category_theory.html