Higher-order Type-level Programming in Haskell

  Рет қаралды 3,612

ACM SIGPLAN

ACM SIGPLAN

Күн бұрын

Пікірлер: 4
@raehik
@raehik 3 ай бұрын
great work & presentation, shame the implementation got put on hold! we now have workarounds to make emulating this not unpleasant (the defun library), but I'd love to see it in the base language. also dorchard jumpscare at 20:10
@statebased
@statebased 4 жыл бұрын
Very nice, yet that last comment was spot on: you want to have more than "just than just that dualism of abstraction". In effect you want as many higher order type level abstraction "splits" as you need, not just two, something similar to type indexing but at the meta-type level.
@KwanghoonChoi
@KwanghoonChoi 2 жыл бұрын
His slides are interesting. It seems to be a piece of Haskell program but with a slide title. How can it be done?
@ietsization
@ietsization Жыл бұрын
looks like an embedded vim or emacs instance, would also like to know how to do that though
The Dialectics of Type-Level Programming by Aaron Levin
41:05
Lambda World
Рет қаралды 6 М.
The Haskell Unfolder Episode 14: higher-kinded types
41:54
Well-Typed
Рет қаралды 1 М.
Your code can be beautiful AND fast (Higher order functions)
8:13
In Haskell, less is more
57:51
London Haskell
Рет қаралды 22 М.
@rae: All about `deriving` in GHC
17:29
Tweag
Рет қаралды 2,2 М.
[Haskell'23] The Evolution of Effects
1:06:11
ACM SIGPLAN
Рет қаралды 5 М.
Why I Chose Rust Over Zig
33:18
ThePrimeTime
Рет қаралды 9 М.