A formal kernel memory-ordering model
https://lwn.net/Articles/718628/
https://lwn.net/Articles/718628/
๐3๐ฅ2
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
โค3๐2
Using Circular Programs for Higher-Order Syntax
https://emilaxelsson.github.io/documents/axelsson2013using.pdf
https://emilaxelsson.github.io/documents/axelsson2013using.pdf
๐1
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
๐1
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
๐ฅ1
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โฆ
๐1
Category Theory Illustrated
https://abuseofnotation.github.io/category-theory-illustrated/05_logic/
https://abuseofnotation.github.io/category-theory-illustrated/05_logic/
๐3
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โฆ
๐2
Lessons 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
๐3๐ฟ3
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
๐1๐ค1
Proof of the geometric Langlands conjecture
https://people.mpim-bonn.mpg.de/gaitsgde/GLC/
https://people.mpim-bonn.mpg.de/gaitsgde/GLC/
๐1
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
๐ฅ1
marking-popl24.pdf
1.4 MB
Total Type Error Localization and Recovery with Holes
Symbol Versions in NetBSD Libraries
https://wiki.netbsd.org/symbol_versions/
https://wiki.netbsd.org/symbol_versions/
Chad Strings - The Chad way to handle strings in C.
https://github.com/skullchap/chadstr
https://github.com/skullchap/chadstr
GitHub
GitHub - skullchap/chadstr: Chad Strings - The Chad way to handle strings in C.
Chad Strings - The Chad way to handle strings in C. - skullchap/chadstr
๐ฟ5๐4๐ค2