Another neat OCaml feature: the type of a partially applied printf call reflects the format string used! Not many statically typed languages have this property.
miniblog.
Related Posts
I really like the MELPA model of packaging directly from git. It solves the problem of forgetting to release something -- just merge a PR and you're done.
It also makes version number bumps much less important.
You could go even further in a statically typed language and also figure out when breaking changes occur.
Noodling with an interpreter for a statically typed language with reified types (e.g. a list knows what type it contains).
Currently I have a single representation of types in both the runtime and the type checker. I think that's a good thing?
Too many languages introduce themselves as e.g. "Foo is a statically typed functional language", focusing on the basic characteristics.
I'd rather learn why Foo is special. What is Foo great for? Get me excited about what I could do with it!