HackerTube

composable allocators

Over 1 hour×Play all on YouTube
CppCon 2015: Andrei Alexandrescu “std::allocator...”1:12:27

CppCon 2015: Andrei Alexandrescu “std::allocator...”

196K views • 11 years ago
CppCon
Andrei Alexandrescu's CppCon 2015 talk argues that std::allocator is badly designed. He proposes building high-performance allocators from small composable, templated pieces.
Demo: Implicit Context1:01:40

Demo: Implicit Context

28K views • 11 years ago
Jonathan Blow
Jonathan Blow gives a formal, hour-long demo of his Jai compiler focused on the implicit context feature. The context carries things like allocators through a program without explicit parameter passing, and the talk walks through the code.
Lenses, Folds, and Traversals1:54:46

Lenses, Folds, and Traversals

54K views • 13 years ago
Edward Kmett
Edward Kmett's talk to the NY Haskell User Group on the lens library, building from fmap and function composition up to lenses, folds and traversals. It shows how these composable combinators access and modify parts of data structures.
WE MUST ADD STRUCTURE TO DEEP LEARNING BECAUSE...1:49:11

WE MUST ADD STRUCTURE TO DEEP LEARNING BECAUSE...

101K views • 2 years ago
Machine Learning Street Talk
Machine Learning Street Talk interviews Paul Lessard about Categorical Deep Learning, which uses category theory and monads to make neural network architectures more interpretable and composable. They also discuss neural networks' limits in reasoning and unbounded computation.