[Caml-list] Ocaml in depth?

[Rick Bischoff <bischoff@rickjr.org>]

Hello all,

      I'm a undergrad student with my nose in a lot of languages, but
      unfortunately i was raised on C/C++...  OCaml and the other
      ML dialects are very interesting to me, but
      I have a few doubts and questions!

      (1) The only "real" examples I see in the tutorials and books,
      etc, are "parsing" problems.  This seems to be the topic at the
      functional programming contests at lot (with a high probability
      at least);  are there any other good examples?

      (2) How can I learn better to escape my simpleton method of
      writing C code in Caml?

      (3) Why do functions return (int -> int) -> int -> int when
      the real type is (int -> int) -> (int -> int).  I find that
      confusing (again, I am a simpleton)

      (4) What is the difference between saying:

          let bob =
              function [] -> []
                       h :: t -> h
          ;;

          and

          let fun john lst =
              match lst with
                    [] -> []
              |     h::t -> h
          ;;

          (I don't know if my syntax is right here, but I am a....)
-- 
Best regards,
 Rick                          mailto:bischoff@rickjr.org

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