Friday, 6 August 2010

Data structures: Heaps

The OCaml Journal just published an article about data structures:

"A min-heap is a tree-based data structure that satisfies the constraint that the children at any given branch are always larger than their parent and, consequently, the minimum element is at the root. Heaps are most notable as an efficient way to implement priority queues which, in turn, underpin a variety of algorithms including some seen in previous OCaml Journal articles. This article examines skew heaps, leftist heaps, pairing heaps and binomial heaps. Higher-order modules are used to create reusable implementations..."

To read this article and more, subscribe to The OCaml Journal today!

Monday, 2 August 2010

OCaml 3.12 released!

A new version of the OCaml distribution was released today, OCaml 3.12.0. This release includes many exciting developments to the language as well as a multitude of other improvements:

  • Improved record patterns.
  • Explicit method override.
  • Local open.
  • Direct polymorphic recursion via type annotations.
  • First-class modules.
  • Named types as parameters to functions.