Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re^5: (Way OT) Type systems

by FoxtrotUniform (Prior)
on Oct 15, 2004 at 18:52 UTC ( #399615=note: print w/ replies, xml ) Need Help??

in reply to Re^4: (OT) "Learn one new language every year"? Yeah, right.
in thread (OT) "Learn one new language every year"? Yeah, right.

If you like Java's type checking, you'll love any language with a modern Hindley-Milner type system. (Haskell is one; I believe OCaml is another.) My mental model of this type systems keeps evolving; right now it's something like a lightweight OO system with easy and unambiguous multiple inheritance, augmented with recursive typing. Of course I despised it when I started writing Haskell -- I was used to the Lispy "lots of conses" method of functional programming -- but it's grown on me.

Yours in pedantry,
F o x t r o t U n i f o r m

Comment on Re^5: (Way OT) Type systems

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://399615]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (3)
As of 2015-10-10 09:35 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (255 votes), past polls