Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

This is a really exciting area. See also the Cambria project [1] and the HN discussion from yesterday [2]. See [3,4] for a great introduction to category theory for programmers--we are all indebted to Milewski / Fong / Spivak / et al. for making this topic more accessible.

[1] https://www.inkandswitch.com/cambria.html

[2] https://news.ycombinator.com/item?id=24699615

[3] https://bartoszmilewski.com/2014/10/28/category-theory-for-p...

[4] http://brendanfong.com/programmingcats.html



So, how does Cambria differ from XSLT?

For anyone interested in computing pre-history, early twentieth century punched-card processing, before von Neumann, was all about taking (monoidal) data structures (encoded as a deck of cards) with historical values and either querying them or running updates (encoded as a second deck of cards) to produce freshly copied current values.

https://en.wikipedia.org/wiki/Unit_record_equipment


Whenever I see Milewski’s name I immediately think of this video: https://youtu.be/ADqLBc1vFwI

It’s a shame I don’t know that many people who’d enjoy it as much as I do!


A great find. Thanks.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: