The language that isn't
summary
Compares monomorphization cost (bigger binaries, slower compiles) with indirection of virtual tables and argues for anonymous enums that let the compiler auto-derive Display for closed sets; proposes allowing type inference only for private functions during development; wants pattern matching to traverse Box/Arc via autoderef and a marker trait that declares a cheap clone; pushes for parity in error presentation with rust analyzer and a stateful compiler that recognizes repeated failed edits.
AI-written summary · about
chapters (18)
- 0:00Introduction
- 4:15Python vs Rust
- 8:55Virtual Tables
- 10:30Trade Objects
- 12:05Multiple Trade Objects
- 12:45Inum
- 13:35Anonymous enums
- 16:55Variables
- 18:20Types
- 19:30Pattern matching
- 20:10Autodraf
- 20:55Inheritance
- 21:50Composition
- 22:30Full path
- 24:25ref
- 24:55supertrade
- 25:55translators
- 26:15clone
related talks
25mType System Tips for the Real World
33mRust and Haskell, sitting in a tree
26mThe Freedom of Static Typing
37mDuck-Tape Chronicles: Rust/C++ Interop
19mRust Without Tears: A Guide to Avoiding Common Traps
46mKeynote: Rust is not about memory safety
43mLow-level optimization of algebraic and similar structures
23mFunctional Programming in C++ (Run time vs Compile time types)