GCC's new fortification level
: The gains and costshttps://developers.redhat.com/articles/2022/09/17/gccs-new-fortification-level
Red Hat Developer
GCC's new fortification level: The gains and costs | Red Hat Developer
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
An introduction to auto-vectorization with LLVM
https://artagnon.com/computing/compilers/intro-vec
https://artagnon.com/computing/compilers/intro-vec
Artagnon
An introduction to auto-vectorization with LLVM | artagnon.com
Ramkumar Ramachandra's personal website
Visualizing Rust codebases in a few seconds
https://github.com/lava-xyz/rust-ontologist
https://github.com/lava-xyz/rust-ontologist
GitHub
GitHub - lava-xyz/rust-ontologist: Visualizing Rust codebases in a few seconds
Visualizing Rust codebases in a few seconds. Contribute to lava-xyz/rust-ontologist development by creating an account on GitHub.
👍2
A modern supercompiler for call-by-value functional languages
https://github.com/mazeppa-dev/mazeppa
https://github.com/mazeppa-dev/mazeppa
GitHub
GitHub - mazeppa-dev/mazeppa: A modern supercompiler for call-by-value functional languages
A modern supercompiler for call-by-value functional languages - mazeppa-dev/mazeppa
👍7🔥2
EGRAPHS Community
E-graphs are data structures for working with large equivalence classes of programs; they have recently been employed to build new kinds of program optimizers and synthesizers.
https://egraphs.org/
E-graphs are data structures for working with large equivalence classes of programs; they have recently been employed to build new kinds of program optimizers and synthesizers.
https://egraphs.org/
egraphs.org
EGRAPHS
The EGRAPHS community discusses e-graphs and related technologies for program optimization, verification, and synthesis.
🔥1
Compiling to categories
http://conal.net/papers/compiling-to-categories/
http://conal.net/papers/compiling-to-categories/
conal.net
Compiling to categories
👍1
Abstract Interpretation: From 0, 1, To ∞
https://cs.nyu.edu/~pcousot/publications.www/CSV-2023-cousot.pdf
https://cs.nyu.edu/~pcousot/publications.www/CSV-2023-cousot.pdf
Can we build an optimal processor?
https://twitter.com/VictorTaelin/status/1806690584670679387
https://twitter.com/VictorTaelin/status/1806690584670679387
X (formerly Twitter)
Taelin (@VictorTaelin) on X
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…
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…
C++ Design Patterns for Low-Latency Applications
https://hackaday.com/2024/07/13/c-design-patterns-for-low-latency-applications/
https://hackaday.com/2024/07/13/c-design-patterns-for-low-latency-applications/
Hackaday
C++ Design Patterns For Low-Latency Applications
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…
🔥4
Metamorphosis grammars
https://link.springer.com/chapter/10.1007/BFb0031371
https://link.springer.com/chapter/10.1007/BFb0031371
SpringerLink
Metamorphosis grammars
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
https://github.com/zinid/delimcc
https://github.com/zinid/delimcc
GitHub
GitHub - zinid/delimcc: Delimited continuations in byte-code and native OCaml
Delimited continuations in byte-code and native OCaml - zinid/delimcc
A Linux kernel syscall implementation tracker
https://syscalls.mebeim.net/?table=x86/64/x64/latest
https://syscalls.mebeim.net/?table=x86/64/x64/latest
syscalls.mebeim.net
Linux syscall tables
High-quality browsable Linux kernel syscall tables for multiple architectures
🔥7
Abstract interpretation in the Toy Optimizer
https://bernsteinbear.com/blog/toy-abstract-interpretation/
https://bernsteinbear.com/blog/toy-abstract-interpretation/
Max Bernstein
Abstract interpretation in the Toy Optimizer
CF Bolz-Tereick wrote some excellent posts in which they introduce a small IR and optimizer and extend it with allocation removal. We also did a live stream together in which we did some more heap optimizations.
👍1
Reduction of Language Hierarchies
https://www.researchgate.net/publication/2819049_Reduction_of_Language_Hierarchies
https://www.researchgate.net/publication/2819049_Reduction_of_Language_Hierarchies
ResearchGate
(PDF) Reduction of Language Hierarchies
PDF | We study the structure of language hierarchies and their reduction by two forms of metacomputation in order to overcome the time and space... | Find, read and cite all the research you need on ResearchGate
👍1
jot2022-mvs.pdf
600.7 KB
Implementation Strategies for Mutable Value Semantics
The Functional Machine Calculus
https://arxiv.org/abs/2212.08177
https://arxiv.org/abs/2212.08177
arXiv.org
The Functional Machine Calculus
This paper presents the Functional Machine Calculus (FMC) as a simple model of higher-order computation with "reader/writer" effects: higher-order mutable store, input/output, and probabilistic...
🤯3