Re: beginning with ML

Jon Harrop <usenet@xxxxxxxxxxxxxx> wrote:
Vesa Karvonen wrote:
Jon:
Have you tried OCaml, Scala and F#?

I've tried O'Caml. That was many years ago.

What did you write?

My first O'Caml project was a (simple) compiler for an ML-style (H-M
type inference, GC, variant types, ...) scripting language design.

-Vesa Karvonen
.

Relevant Pages

  • Re: OT: More Antilock brakes
    ... the type inference always completes. ... the user then to specify a type signature to help the compiler, ... There is actually another theoretic problem with H-M type systems: ...
    (comp.lang.lisp)
  • Re: More static type fun.
    ... what type inference buys for you is complaints from the compiler ... I thought it was pretty funny too. ...
    (comp.lang.lisp)
  • Re: More static type fun.
    ... This is what type inference ... this is what separates HM type systems from the inferior ... the compiler will let you run it, ... complex data structure, of course.) ...
    (comp.lang.lisp)
  • Re: OT: More Antilock brakes
    ... >> a) Computers can prove bogus code is wrong with a higher success ... > a few thousand lines of real code in languages with type inference, ... when the C or Java compiler fails to prove ... I'm interested not in those cases where the compiler says `this is ...
    (comp.lang.lisp)
  • Re: OT: More Antilock brakes
    ... In a follow-up post you referred to Hindley-Milner type inference. ... a few thousand lines of real code in languages with type inference, ... when the C or Java compiler fails to prove ... matter how bizarre that grammar may be. ...
    (comp.lang.lisp)