Efficient and Insightful Generalization
How OCaml type checker works -- or what polymorphism and garbage collection have in common There is more to Hindley-Milner type inference than the Algorithm W. In 1988, Didier Rémy was looking to speed up the type inference in Caml and discovered an elegant method of type generalization. Not only it is fast, avoiding scanning the type environment. It smoothly extends to catching of locally-declare
Continuations and Delimited Control
Introduction to programming with shift and reset Implementations of delimited control in OCaml, Haskell and Scheme A substructural type system for delimited continuations Streams and Iteratees How to remove a dynamic prompt: static and dynamic delimited continuation operators are equally expressible An argument against call/cc Generators: yield = exceptions + non-determinism Generic Zipper: the co
ML Programming
How OCaml type checker works -- or what polymorphism and garbage collection have in common BER MetaOCaml -- OCaml dialect for multi-stage programming Direct implementation of delimited continuations for byte- and native-code OCaml Eff Directly in OCaml Generating code with polymorphic let: A Ballad of Value Restriction, Copying and Sharing Domain-specific languages (DSLs) embedded in OCaml Typecla
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
