mads_hartmann

3 ms·

1. 1.▲
   Benchmarking interpreters written in OCaml(engineering.issuu.com)

   5 points by mads_hartmann 11y ago|0 comments
2. 2.▲
   by mads_hartmann 12y ago

   The following implementation comes closer to the original semantics of the ADT implementation. type _ value' = | GBool : bool -> bool value' | GInt : int -> int value' type _ expr' = | GValue :
3. 3.▲
   by mads_hartmann 12y ago

   Well spotted, you're absolutely right. My hunch is that it's doable to maintain the semantics but I need to play around with the example a bit to know for sure.
4. 4.▲
   Detecting use cases for GADTs in OCaml(mads-hartmann.com)

   53 points by mads_hartmann 12y ago|21 comments
5. 5.▲
   by mads_hartmann 12y ago

   The grey boxes are the input to the REPL. You should be able to just copy paste the contents of any of the boxes. The green boxes are the output of the REPL.
6. 6.▲
   by mads_hartmann 12y ago

   OCaml has an extremely predictable memory usage. Part III of Real World OCaml covers this is great detail[1] GC pauses haven't hurt us really. We usually just spawn a ton of processes so if one process pauses a bit to GC we won't
7. 7.▲
   by mads_hartmann 12y ago

   Yeah, most of the services that I work on in my team at issuu are written in OCaml :)