Тёмный

Higher-order Type-level Programming in Haskell 

ACM SIGPLAN
Подписаться 9 тыс.
Просмотров 3,7 тыс.
50% 1

Опубликовано:

 

29 сен 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 4   
@raehik
@raehik 5 месяцев назад
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
@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 2 года назад
looks like an embedded vim or emacs instance, would also like to know how to do that though
@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.
Далее
The Haskell Unfolder Episode 14: higher-kinded types
41:54
50m Small Bike vs Car FastChallenge
00:22
Просмотров 3 млн
Barno
00:22
Просмотров 720 тыс.
@rae: All about `deriving` in GHC
17:29
Просмотров 2,2 тыс.
Being Competent With Coding Is More Fun
11:13
Просмотров 82 тыс.
Andrew Kelley   Practical Data Oriented Design (DoD)
46:40