marvinborner

9 ms·

61.
Infinitely Recursive Game of Life(oimo.io)
2 points by marvinborner 7mo ago|0 comments
62.
In Search of Wikipedia's Shrug Guy (2023)(defector.com)
2 points by marvinborner 7mo ago|0 comments
63.
Async Programming Is Just Inject Time(willhbr.net)
39 points by marvinborner 7mo ago|14 comments
64.
10% of Firefox crashes are caused by bitflips(mas.to)
921 points by marvinborner 7mo ago|485 comments
65.
GPT in 200 lines of dependency-free Python(gist.github.com)
6 points by marvinborner 8mo ago|1 comments
66.
List of predictions for autonomous Tesla vehicles by Elon Musk(en.wikipedia.org)
3 points by marvinborner 8mo ago|1 comments
67.
by marvinborner 8mo ago
Sean Barret's website: https://nothings.org/ (responsible for the famous single-file C libraries)
68.
Stb programming stream #0 [video](youtube.com)
1 points by marvinborner 8mo ago|1 comments
69.
by marvinborner 8mo ago
Even UTC+-0 I have seen rarely. AoE seems more common, especially for deadlines
70.
The 15-Game [video](youtube.com)
1 points by marvinborner 8mo ago|0 comments
71.
2026 MIT Integration Bee – Finals [video](youtube.com)
1 points by marvinborner 9mo ago|0 comments
72.
Self-Reproducing Programs [video](youtube.com)
3 points by marvinborner 9mo ago|1 comments
73.
by marvinborner 9mo ago
https://marvinborner.de
74.
Bluetooth Headphone Jacking: Full Disclosure of Airoha Race Vulnerabilities(insinuator.net)
6 points by marvinborner 10mo ago|2 comments
75.
Programming Party Tricks [video](youtube.com)
3 points by marvinborner 10mo ago|0 comments
76.
by marvinborner 10mo ago
Quadtrees are also quite useful for generating fractals. A very related project of mine, Lambda Screen [0], explores this by encoding these functional quadtrees directly in lambda calculus and rendering the structure based on Church boolean
77.
Case Study: Compiler Frontend via Effect Handlers(effekt-lang.org)
3 points by marvinborner 10mo ago|0 comments
78.
WhatsApp will become interoperable with other messaging apps in Europe(tuta.com)
102 points by marvinborner 10mo ago|88 comments
79.
by marvinborner 11mo ago
The annihilating interaction between abstraction and application nodes is well-known in the area of interaction net research to ~correspond to β-reduction, as is also explained in the associated research paper [1]. α-conversion is not requi
80.
by marvinborner 11mo ago
> While easy, it sadly doesn't preserve semantics. There is actually an easy way that does preserve semantics at least to WHNF - it's called closed reduction. Mackie has worked on it a bunch (see some resources [1]). An even si
81.
by marvinborner 11mo ago
This is quite different. Salvadori's work aims for optimal reduction of the full lambda calculus (which requires something called "bookkeeping"/"oracle"), while HOC works on optimal/parallel reduction of a
82.
Mystery of the Quintic [video](youtube.com)
2 points by marvinborner 11mo ago|0 comments
83.
by marvinborner 11mo ago
> then the numbers should not be stored as Peano integers a.k.a. base 1 in the first place That's my point though. The linked n-ary encoding by Mogensen, for example, does not suffer from such complexities. Depending on the reducer&
84.
by marvinborner 11mo ago
Thanks, added it to bruijn's standard library [0]. Looks like it has some very interesting properties! [0]: https://bruijn.marvinborner.de/std/Number_Tuple.bruijn.html
85.
by marvinborner 11mo ago
> Scott-Mogensen encoding just Scott encoding, Scott-Mogensen refers to a meta encoding of LC in LC. Scott's encoding is fine but requires fixpoint recursion for many operations as you said. Interestingly though, Mogensen's ter
86.
De Bruijn Numerals(text.marvinborner.de)
78 points by marvinborner 11mo ago|10 comments
87.
The Pinouts Book(pinouts.org)
9 points by marvinborner 11mo ago|0 comments
88.
De Bruijn Numerals(text.marvinborner.de)
2 points by marvinborner 11mo ago|0 comments
89.
by marvinborner 1y ago
Good idea, I like "caramelized"! However, I wouldn't define bruijn as being caramelized just yet. Personally, I view as syntactic sugar only syntax that's expanded to the target language by the parser/compiler. In b
90.
by marvinborner 1y ago
I don't know any quadtree/lowlevel encoding of LC that could be memoized like that. Though you could, for example, cache the reduction of any term by hash and substitute the matching hashes with its nf. This doesn't really wo

More ›