サクサク読めて、アプリ限定の機能も多数！
トップへ戻る
CES 2025
www.timphilipwilliams.com
Introduction It is well known that the list comprehension notation from functional programming bares more than a passing resemblance to SQL queries: SELECT c.name, o.price FROM customer c, orders o WHERE c.pk_cust_id = o.fk_cust_id List comprehensions offer a declarative query syntax that is very SQL-like and readable, but also much more compositional than SQL, for example we can nest comprehensio
This post was originally titled “Generic recursion schemes for GADTs using fixed points of higher-order functors” – but that doesn’t really explain why one would go to all the trouble of writing code this way. The answer, of course, is that we obtain various proofs of correctness embedded within our static types. For example, we have a proof that our traversals are correct and that our syntax AST
このページを最初にブックマークしてみませんか？
『www.timphilipwilliams.com』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
