/explore
|
You are here 
|
stefansf.de | ||
| | | | |
www.ralfj.de
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
In this post, I show how to find the least fixed point of a finite-height lattice |
|
| | | | | ||
| | | | |
tmandry.gitlab.io
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... |
|
| | | | | ||
| | | | |
schmud.de
When the personal computer went from being a "bicycle for the mind" to a surveilled shopping mall. |
|
| | | |||
