Do any languages other than haskell/agda have a hindley-milner type system and type classes?

Posted by Jimmy Hoffa on Programmers See other posts from Programmers or by Jimmy Hoffa
Published on 2012-11-06T20:54:08Z Indexed on 2012/11/06 23:18 UTC
Read the original article Hit count: 312

Filed under:

haskell

|

agda

|

type-classes

In pondering what gives Haskell such a layer of mental pain in becoming proficient the main thing I can think of are the Monads, Applicatives, Functors, and gaining an intuition to know how a list or maybe will behave in regards to sequence or alternate or bind etc.

But why haven't other languages presented these same concepts given the usefulness of monads/applicatives/etc?

It occurs to me, type classes are the key, so the question is: Have any languages other than Haskell/Agda actually implemented type classes in the same or similar way?

© Programmers or respective owner

Related posts about haskell

Learning Haskell: How to remove an item from a List in Haskell

as seen on Stack Overflow - Search for 'Stack Overflow'
Trying to learn Haskell. I am trying to write a simple function to remove a number from a list without using built-in function (delete...I think). For the sake of simplicity, let's assume that the input parameter is an Integer and the list is an Integer list. Here is the code I have, Please tell me… >>> More
Using Data.Heap in Haskell, or reading Haskell docs for a beginner

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm trying to use Haskells Data.Heap module, but I'm incapable of even using it with integers. The only heap I've been capable of using is "empty", which does not take any arguments. Later on I'll figure out how to instance for my needs, but for now I'd be glad if I was even able to test it with… >>> More
What kind of things are easy in Haskell and hard in Scala, and vice versa?

as seen on Programmers - Search for 'Programmers'
There has been some intermingling of Scala and Haskell communities, and I have noticed now and then people commenting on stuff that's supposed to be easy in Haskell and hard and Scala. Less often (maybe because I read Scala questions, not Haskell ones), I see someone mentioning that something in Scala… >>> More
Haskell's cabal dependency problem with happy

as seen on Programmers - Search for 'Programmers'
I have problems installing ghc-mod on my linux machine. cabal worries about "happy" not being available in versione = 1.17: $ cabal install ghc-mod Resolving dependencies... [1 of 1] Compiling Main ( /tmp/haskell-src-exts-1.14.0-1357/haskell-src-exts-1.14.0/Setup.hs, /tmp/haskell-src-exts-1… >>> More
Understanding Haskell's fibonacci

as seen on Stack Overflow - Search for 'Stack Overflow'
fibs :: [Int] fibs = 0 : 1 : [ a + b | (a, b) <- zip fibs (tail fibs)] This generates the Fibonacci sequence. I understand the behaviour of the guards, of :, zip and tail, but I don't understand <-. What is it doing here? >>> More

Related posts about agda

"Strictly positive" in Agda

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm trying to encode some denotational semantics into Agda based on a program I wrote in Haskell. data Value = FunVal (Value -> Value) | PriVal Int | ConVal Id [Value] | Error String In Agda, the direct translation would be; data Value : Set where FunVal… >>> More
Do any languages other than haskell/agda have a hindley-milner type system and type classes?

as seen on Programmers - Search for 'Programmers'
In pondering what gives Haskell such a layer of mental pain in becoming proficient the main thing I can think of are the Monads, Applicatives, Functors, and gaining an intuition to know how a list or maybe will behave in regards to sequence or alternate or bind etc. But why haven't other languages… >>> More
I'm working on Peano Axioms in Agda and I've hit a bit of a sticking point

as seen on Stack Overflow - Search for 'Stack Overflow'
PA6 : ?{m n} -> m = n -> n = m is the axiom I am trying to solve and support, I've tried using a cong (from the core library) but am having troubles with the cong constructor PA6 = cong gets me nowhere, I know for cong I am required to supply a refl for equality and a type, but I'm, not… >>> More