/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 stefansf.de
Endiana Jones: Raiders of the Lost Byte Order
| | www.ralfj.de
Pointers Are Complicated III, or: Pointer-integer casts exposed
39.3 parsecs away

Travel
| | In my previous blog post on pointer provenance, I have shown that not thinking carefully about pointers can lead to a compiler that is internally inconsistent: programs that are intended to...
| | danilafe.com
Implementing and Verifying "Static Program Analysis" in Agda, Part 4: The Fixed-Point Algorithm
44.1 parsecs away

Travel
| | In this post, I show how to find the least fixed point of a finite-height lattice
| | tmandry.gitlab.io
How Rust optimizes async/await II: Program analysis - Tyler Mandry
36.5 parsecs away

Travel
| | In Part 1, we covered how async fns in Rust are compiled to state machines. We saw that the internal compiler implementation uses generators and the yield statement to facilitate this transformation. We also saw that the optimal way to lay out one of these state machines in memory is using an enum-like representation, similar to the following: enum SumGenerator{Unresumed{xs: Vec},Suspend0{xs: Vec,iter0: Iter<'self,i32>,sum: i32 },Suspend1{xs: Vec,iter1: Iter<'self,i32>,sum: i32 },Returned}Each variable s...
| | huonw.github.io
Finding Closure in Rust | Huon on the internet
60.0 parsecs away

Travel
| Closures in Rust are powerful and flexible, building on traits, generics and ownership.