I'll start with Japanese. Time to learn Japanese. And maybe some Chinese. Man...and Arabic, too. What would I be doing right now? Oh, you know. Just checking the feed on the ol' 拙者はフランス人でござる. Ha! That guy cracks me up. Seems like every Lundi he has a new gem.
So, anyway. OCaml. I've been taking a pretty good crack at it. Here's something hopefully concise and kinda of neat. It's almost entirely stolen from the ever-awesome OCaml Tutorial.
type binary_tree = Leaf of int | Tree of binary_tree * binary_tree;;
Okay. So what we're saying is we have a new type -- its a little bit like a struct in C. So, let's see...A binary tree is a Leaf of int ...okay. So far, so good...*or* it could be a Tree of ..uhh..what? crap.
But bear with me, here.
# Leaf 12;;
- : binary_tree = Leaf 12
Neat. I've made a new leaf of 12. Looks like the VM knows it's a binary tree...somehow.
# Tree (Leaf 13, Leaf 9);;
- : binary_tree = Tree (Leaf 13, Leaf 9)
Anyway, yeah. Recursive data structures. Among the many cool things I'm trying to get a solid grasp on.