Programming Deadlock
Build Time Reflection with C++ (2023) https://youtu.be/fXh2hVsFDso
Compiler-neutral Internal Program Representation for C++
https://github.com/GabrielDosReis/ipr
https://github.com/GabrielDosReis/ipr
GitHub
GitHub - GabrielDosReis/ipr: Compiler-neutral Internal Program Representation for C++
Compiler-neutral Internal Program Representation for C++ - GabrielDosReis/ipr
Embracing (and also Destroying) Variant Types Safely (C++)
https://youtu.be/va9I2qivBOA
https://youtu.be/va9I2qivBOA
YouTube
Embracing (and also Destroying) Variant Types Safely - Andrei Alexandrescu - CppCon 2021
https://cppcon.org/
https://github.com/CppCon/CppCon2021
---
Designing and implementing a variant type (such as `std::variant` itself) in C++, at first, seems a rather inane topic. It turns out, however, that a variant type's performance or lack thereof,…
https://github.com/CppCon/CppCon2021
---
Designing and implementing a variant type (such as `std::variant` itself) in C++, at first, seems a rather inane topic. It turns out, however, that a variant type's performance or lack thereof,…
In-Memory and Persistent Representations of C++
https://youtu.be/39wlNRk-nAg
https://youtu.be/39wlNRk-nAg
YouTube
In-memory and Persistent Representations of C++ - Gabriel Dos Reis - CppCon 2021
https://cppcon.org/
https://github.com/CppCon/CppCon2021
---
C++ Modules are a tooling opportunity. For example, a common implementation strategy for compilers is to save on disk the abstract semantics graph (ASG) obtained from elaborating a module interface…
https://github.com/CppCon/CppCon2021
---
C++ Modules are a tooling opportunity. For example, a common implementation strategy for compilers is to save on disk the abstract semantics graph (ASG) obtained from elaborating a module interface…
👍2
C and C++ Prioritize Performance over Correctness
https://research.swtch.com/ub
https://research.swtch.com/ub
A survey of adaptable grammars
https://akira.ruc.dk/~henning/publications/SigplNot90.pdf
https://akira.ruc.dk/~henning/publications/SigplNot90.pdf
How we built a SIMD JIT compiler for SQL in QuestDB
https://questdb.io/blog/2022/01/12/jit-sql-compiler/
https://questdb.io/blog/2022/01/12/jit-sql-compiler/
QuestDB
How we built a SIMD JIT compiler for SQL in QuestDB | QuestDB
QuestDB 6.2.0 brings a brand new JIT (Just-in-Time) compiler as a part of the SQL engine. This post describes our storage model, how we built a JIT compiler for SQL and our plans for improving it in future.
❤1🤨1
Pre-RFC: Sandboxed, deterministic, reproducible, efficient Wasm compilation of proc macros (Rust)
https://internals.rust-lang.org/t/pre-rfc-sandboxed-deterministic-reproducible-efficient-wasm-compilation-of-proc-macros/19359
https://internals.rust-lang.org/t/pre-rfc-sandboxed-deterministic-reproducible-efficient-wasm-compilation-of-proc-macros/19359
Rust Internals
Pre-RFC: Sandboxed, deterministic, reproducible, efficient Wasm compilation of proc macros
Feature Name: proc_macro_sandbox Start Date: 2023-08-20 Summary Procedural macro crates can opt-in to precompilation to WebAssembly as part of the publish process. The crate compiles locally (as already done by cargo publish) and then is securely verified…
🔥1
Railway Oriented Programming: Error Handling with Monads (F#)
https://fsharpforfunandprofit.com/rop/
https://fsharpforfunandprofit.com/rop/
Fsharpforfunandprofit
Railway Oriented Programming
Slides and videos explaining a functional approach to error handling
👍1
1712.01044.pdf
1.6 MB
Reclaiming Memory for Lock-Free Data Structures:
There has to be a Better Way
There has to be a Better Way
👍1
Positive Supercompilation for a Higher Order Call-by-value Language
https://arxiv.org/pdf/1005.5278.pdf
https://arxiv.org/pdf/1005.5278.pdf
👍1
The Expression Problem, Trivially!
https://i.cs.hku.hk/~bruno/papers/Modularity2016.pdf
https://i.cs.hku.hk/~bruno/papers/Modularity2016.pdf
Souper: a superoptimizer for LLVM IR. It uses an SMT solver to help identify missing peephole optimizations in LLVM's midend optimizers.https://github.com/google/souper
GitHub
GitHub - google/souper: A superoptimizer for LLVM IR
A superoptimizer for LLVM IR. Contribute to google/souper development by creating an account on GitHub.
👍1
Writing custom C++20 coroutine systems
https://www.chiark.greenend.org.uk/~sgtatham/quasiblog/coroutines-c++20/
https://www.chiark.greenend.org.uk/~sgtatham/quasiblog/coroutines-c++20/
Philosophy of coroutines
https://www.chiark.greenend.org.uk/~sgtatham/quasiblog/coroutines-philosophy/
https://www.chiark.greenend.org.uk/~sgtatham/quasiblog/coroutines-philosophy/
Rethinking Supercompilation
https://ndmitchell.com/downloads/paper-rethinking_supercompilation-29_sep_2010.pdf
https://ndmitchell.com/downloads/paper-rethinking_supercompilation-29_sep_2010.pdf
❤1👍1
A not-so-quick introduction to the C++ allocator model
https://quuxplusone.github.io/blog/2023/06/02/not-so-quick-pmr/
https://quuxplusone.github.io/blog/2023/06/02/not-so-quick-pmr/
Arthur O’Dwyer
A not-so-quick introduction to the C++ allocator model
My paper P1144R8 “std::is_trivially_relocatable”
has, in the past few months, been joined by three(!) papers out of Bloomberg:
has, in the past few months, been joined by three(!) papers out of Bloomberg:
The Power of Prolog
https://www.metalevel.at/prolog/facets
https://www.metalevel.at/prolog/facets
www.metalevel.at
Facets of Prolog
N-Queens Problem in Prolog
https://youtu.be/l_tbL9RjFdo?si=7-au55mZ9pvvs5B0
https://youtu.be/l_tbL9RjFdo?si=7-au55mZ9pvvs5B0
YouTube
N-Queens in Prolog
Prolog lets us easily find solutions for this famous puzzle, also for quite large boards. Notably, we can use the same program to test, complete and generate solutions. The code is available from: https://www.metalevel.at/queens/
👍1