Types in Haskell

Posted by Linda Cohen on Stack Overflow See other posts from Stack Overflow or by Linda Cohen
Published on 2010-05-11T18:41:53Z Indexed on 2010/05/11 19:14 UTC
Read the original article Hit count: 209

Filed under:

haskell

|

inferred-type

|

type

|

type-inference

I'm kind of new in Haskell and I have difficulty understanding how inferred types and such works.

map :: (a -> b) -> [a] -> [b]
(.) :: (a -> b) -> (c -> a) -> c -> b

What EXACTLY does that mean?

foldr :: (a -> b -> b) -> b -> [a] -> b
foldl :: (a -> b -> a) -> a -> [b] -> a
foldl1 :: (a -> a -> a) -> [a] -> a

What are the differences between these?

And how would I define the inferred type of something like

foldr map

THANKS!

© Stack Overflow 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 inferred-type

C++ Little Wonders: The C++11 auto keyword redux

as seen on Geeks with Blogs - Search for 'Geeks with Blogs'
I’ve decided to create a sub-series of my Little Wonders posts to focus on C++. Just like their C# counterparts, these posts will focus on those features of the C++ language that can help improve code by making it easier to write and maintain. The index of the C# Little Wonders can be found here… >>> More
Unboxing to unknown type

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm trying to figure out syntax that supports unboxing an integral type (short/int/long) to its intrinsic type, when the type itself is unknown. Here is a completely contrived example that demonstrates the concept: // Just a simple container that returns values as objects struct DataStruct { … >>> More
Help with possible Haskell type inference quiz questions

as seen on Stack Overflow - Search for 'Stack Overflow'
foldr:: (a -> b -> b) -> b -> [a] -> b map :: (a -> b) -> [a] -> [b] mys :: a -> a (.) :: (a -> b) -> (c -> a) -> c -> b what is inferred type of: a.map mys :: b.mys map :: c.foldr map :: d.foldr map.mys :: I've tried to create mys myself using mys n… >>> More
Why doesn't C# allow for global inferred types i.e. using var?

as seen on Stack Overflow - Search for 'Stack Overflow'
I know it can't be done since using var can only be done for local variables. I'm just wondering if anyone has a theory why the C# team thought this should be so. e.g. what would be wrong with this: public class SomeClass { var someString = "hello"; //not cool public SomeClass() { … >>> More
Types in Haskell

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm kind of new in Haskell and I have difficulty understanding how inferred types and such works. map :: (a -> b) -> [a] -> [b] (.) :: (a -> b) -> (c -> a) -> c -> b What EXACTLY does that mean? foldr :: (a -> b -> b) -> b -> [a] -> b foldl :: (a -> b… >>> More