Saturday, 24 April 2010

Compiler development: part 3

The OCaml Journal just published an article about HLVM:

"This article continues our series on compiler development using HLVM. An example is provided that breaks the current compiler. The bug is investigated using different techniques and a well-known solution is implemented. The resulting compiler is then tested on a substantially more complicated symbolic computation and is found to obtain the correct result. Moreover, the time taken to perform this symbolic computation using HLVM is found to be very competitive despite the fact that HLVM was not at all designed for this purpose...."

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

OCaml meeting 2010 debriefing

Members of the OCaml community met with the core developers at this year's OCaml Meeting 2010 on April 16th. Attendance was up to the maximum capacity of 80 people this year! The meeting was funded by the 11 corporate members of the CAML Consortium that now includes MLState as a new addition this year.

Slides and references for the lectures given by Xavier Leroy, Sylvain Le Gall, Stefano Zacchiroli, Julien Robert, Guillaume Von Tokarski, Sylvain Conchon, Jean-Christophe Filliâtre, Fabrice Le Fessant, Gerd Stolpmann, Dario Teixeira, Daniel Bünzli, David Rajchenbach-Teller, Philippe Wang, Jérémie Dimino, William Le Ferrand and Anil Madhavapeddy are available here.

Of particular interest was the keynote speech by Xavier Leroy (read the slides) about the forthcoming OCaml 3.12 release that introduces lots of exciting new features to the OCaml programming language such as first-class modules.

Saturday, 10 April 2010

The A* algorithm

The OCaml Journal just published an article about path finding:

"The A* algorithm is often used for route finding in game AI and is a generalization of Dijkstra's shortest-path algorithm from graph theory. This article describes a simple implementation of the A* algorithm written in OCaml that makes extensive use of the module system including higher-order modules (functors) in order to provide a reusable implementation of this algorithm that is generic over the kinds of graphs that it can handle. Finally, an example application is provided that finds a route around a hill...."

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

Thursday, 8 April 2010

Unix systems programming in OCaml

The English translation of the introductory book Unix systems programming in OCaml by Xavier Leroy and Didier Rémy was just completed and is now freely available on-line.

This book is an excellent complement to our own OCaml for Scientists book.