Version française
Home     About     Download     Resources     Contact us    
Browse thread
Re: [Caml-list] ocaml complexity
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: John R Harrison <johnh@i...>
Subject: Re: [Caml-list] ocaml complexity

| > The intro in the HOL-Light manual is quite good.  Also quite good is:
|
| [....]
|
| Do you have a link to the HOL-Light manual?

See the following URL (there's a link to the manual near the bottom):

  http://www.cl.cam.ac.uk/users/jrh/hol-light/index.html

Most of the CAML tutorial material here was compressed from an earlier
lecture course I gave based on CAML. You might also find the notes for
this course interesting:

  http://www.cl.cam.ac.uk/Teaching/Lectures/funprog-jrh-1996/index.html

This starts with basic lambda calculus theory before getting into real
CAML programming, so it might not appeal to many programmers. (Indeed, it
didn't appeal to most of the students, as I recall.) But this approach
does help to emphasize the fundamental theoretical simplicity of core ML.
And there are some quite nice programming examples near the end.

John.
-------------------
Bug reports: http://caml.inria.fr/bin/caml-bugs  FAQ: http://caml.inria.fr/FAQ/
To unsubscribe, mail caml-list-request@inria.fr  Archives: http://caml.inria.fr