Rust and Haskell, sitting in a tree
summary
Compares concrete Rust features to Haskell origins: shows type inference working on literals and vectors but notes Rust requires function annotations for ownership checks; demonstrates traits and trait bounds via Display/Show and first/last generics; implements Shape enum + surface to compare pattern matching; uses iterators with closures for map/filter then collect, claiming equivalent performance to an imperative loop as a zero-cost abstractions example; mentions Rust RFC for generic associated types (merged August) and explains closures infer a single type from first use.
AI-written summary · about
chapters (8)
- 0:00Intro
- 0:48About me
- 4:36Type Inference
- 11:37Traits
- 14:25Type Classes
- 19:32Map and Filter
- 20:51Rust Functions
- 23:17Closures
related talks
41mFunctional Rust - An Exploration
35mLet’s Talk About Rust
56mThe Tale of Troy
38mType-level interfaces in Haskell & Rust: pragmatic type-level programming
25mIntro and Overview to Rust
49mThe Eternal Sunshine of the Spotless Programming Language
40mRust’s approach of getting things right
31mFunctional programming guerilla in the land of Rust