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: Johann Höchtl <big.john@b...>
Subject: Re: [Caml-list] ocaml complexity


leary@nwlink.com wrote:

>On Wed, Jun 13, 2001 at 08:21:27AM -0700, Brian Rogoff wrote:
>
>>Perhaps we users should start writing
>>tutorials, rather than asking INRIAns, as I'd rather that they work on 
>>growing the language.
>>
>
>Aye.  Would Michel Mauny be agreeable to having his "Functional
>Programming Using Caml Light" be the starting point for a "Learning OCaml"
>project, say on sourceforge?  Are there any better tutorials on ML that
>might be borrowed from with permission?
>
I found the introduction of Caltechs Compiler Design Laboratory

http://www.cs.caltech.edu/cs134/cs134b/
direct link:
http://www.cs.caltech.edu/cs134/cs134b/book.pdf

for a beginner (what i am) the most valuable one.

I agree, that the mathematical foundations are sooner or later a great 
aid for a deeper insight in what FP is all about.
However, a beginner can easily get scared of to much formalism.

lG,
  Johann

>
>
>-------------------
>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
>
>


-------------------
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