Higher-order Type-level Programming in Haskell

Поделиться
HTML-код
  • Опубликовано: 27 дек 2024

Комментарии • 4

  • @raehik
    @raehik 8 месяцев назад

    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 5 лет назад

    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 3 года назад

    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 года назад +2

      looks like an embedded vim or emacs instance, would also like to know how to do that though