In the previous post, I discussed designing combinator libraries that compose some property over unions. It is only fitting to throw records in the mix. type U = | A of int | B of float | C of string let UFormat = ( UnionCase A I[...]

Discriminated unions or sum types are a natural way to model logical OR. Often you have a property that distributes over OR. Say, in F# (used throughout the article, though the ideas should apply equally well to any ML), you can write a combinator of the[...]

To try out something different, I took a shot at writing a pretty-printing module. Of all the papers I found on the subject, perhaps the most accessible is A prettier printer by Wadler. In particular the algebra of documents presented in the paper is very[...]

There is still time to submit your F# talk/presentation/report/demo proposal to ML 2010, co-located with ICFP in Baltimore, MD, USA!

ML is a family of programming languages that includes dialects known as Standard ML, Objective Caml, and F#. The development of these languages has inspired a large amount of computer science research, both practical and theoretical. This workshop aims to[...]