"Here's how to read something and then print that: >>=". Sure, like `getLine >>= putStrLn`. Technically speaking, that's correct. But this doesn't generalize at all.
Maybe I want to greet the user by name. How do I read the name, prepend "Hello, " to it, and then print that? This is a totally natural thing to want to do, and is very straightforward in Java. But our Haskell newbie hits a wall - none of your cases cover it!
Here's how I might write that today, without using do notation: `getLine >>= (return . (++) "Hello, ") >>= putStrLn`. Look at that - it's totally nuts, and I would not attempt to explain that to a Haskell neophyte.
Using do-notation, you can make things nicer:
do
name <- getLine
putStrLn $ "Hello, " ++ name
but this introduces a bunch of new syntax to learn: the difference between let-in and let and <-, how do-notation works, etc.I don't have a better approach than what you suggest. I suspect that this stuff simply can't be made easy.
Don't write point-free code here. Here's a fairly simple version:
getLine >>= \name -> putStrLn ("Hello, " ++ name)
The only novel thing there is the >>= operator itself. You don't even have to introduce return there; you can introduce return later. getLine >>= putStrLn
case by doing greet name = putStrLn ("Hello, " ++ name)
main = getLine >>= greet
(Edited to include the definition of main) main = do
let greet name = putStrLn ("Hello, " ++ name)
getLine >>= greet
For whatever reason, I didn't learn about the magic let syntax in do-notation until relatively late. Anyways this is very elegant, but not something I could have generated early on, especially because it mixes two different sequencing syntaxes (do-notation and >>=).It would be much better as
main = let greet name = putStrLn ("Hello, " ++ name)
in getLine >>= greet fmap ("Hello, " ++) getLine >>= putStrLn
I learned this because hlint suggested it to me. Using hlint is a very good idea, even for beginners.For a simple "greet" program, this isn't perhaps any neater or cleaner but fmap is a powerful tool with lots of practical uses.
echo = forever $ getLine >>= putStrLn
This also works with do notation, if you'd want to make the greet example looping. greetLoop = forever $ do
name <- getLine
putStrLn ("Hello, " ++ name)
This is a very powerful concept. In mainstream imperative programming languages, you can't assign "statements" to variables or return them from functions or pass them as parameters. def forever
loop do yield end
end
forever do
name = gets
puts "Hello, name"
end
or even template <typename F>
void forever(const F& fn) { for (;;) fn(); }
int main()
{
forever([]
{
std::string str;
getline(std::cin, str);
std::cout << "Hello, " << str << '\n';
});
}
looks a lot like the above code to me.This becomes more apparent when using monads for non-IO applications like parsing. It's difficult (but not impossible, of course) to implement things like backtracking or non-determinism by writing lots of closures in an imperative programming language, they don't compose as nicely. There are parser combinator libraries (similar to Parsec) done in other languages of course, but some of them even implement monads in the language they work in. I recall seeing "class Monad" written in Python, I think it was in the pyparsec library.
A pointfree solution - if you want one - would be more in the form of:
getLine >>= putStrLn . ("Hello, " ++)
It's really mostly about getting used reading pointfree style, but
there's certainly an overuse of pointfree style in some Haskell code,
then it gets pointless.And my coworkers yesterday were complaining that ClojureScript looked like Brainfuck...
And if you did write code like that, Haskell's hlint tool would make suggestions to turn it neat and readable using fmap.
fmap ("Hello, " ++) getLine >>= putStrLn
This isn't necessarily better either, I'd write this using do-notation.I understood every bit of that code, I just think it's ugly and hard to read and there are better ways to get the same done.
getLine >>= ( ("Hello, " ++) >>> putStrLn )
putStrLn . ("Hello, " ++) =<< getLine(1) Any function with interacts with the world is called an IO function and has the result type "IO something". e.g. "IO String" for getLine (because it returns a String). Functions and expressions which does not interact with the world are called 'pure'. IO is a type constructor, but for now it makes sense to think of it as a "tag" on result values which guarantees we cannot mix IO-functions with pure functions. If we could call IO functions inside pure functions, the whole idea of pure would dissolve. The IO "tag" allows the compiler to enforce that this can't happen.
(2) A function which calls IO functions uses 'do'-notation:
somefun = do
putStrLn "Hello"
putStrLn "World"
Each line is a single IO function call (with arguments which are pure expressions). Each line in the do-block should be indented to the same level. (Only in the case where the function consist of just a single IO-call can the 'do' be left out, which is why you can write 'main = putStrLn "hello World"'). The do-notation guarantees that the operations are executed sequentially. The return value of the function is the return value of the last operation in the do-block.If you want to use the return value of an IO function, you use a left-arrow (<-) to read it into a variable. Eg.
somefun = do
putStrLn "What is your name?"
name <- getLine
putStrLn ("Hello, " ++ name)
Note that you cannot simplify the two lines to: X putStrLn ("Hello, " ++ getLine)
The above breaks the rule that each IO function call have to be on a separate line in the do-block. IO-function calls can not be nested in expressions, they have to be sequential.(3) Calling pure functions. You cannot call IO function from pure code, but you can call pure functions from IO-code. This is done via 'let':
somefun = do
putStrLn "What is your name?"
name <- getLine
let name2 = reverse name
putStrLn ("Olleh, , " ++ name2)
Note how the let syntax is distinctly different from the left-arrow syntax. The let syntax just assigns the result of a pure expression to a variable. The arrow syntax "extracts" a pure value from an IO value. The result of getLine is 'IO string' but the arrow "untags" it so the type of name is just "String", and it can be used as part of a pure expression.(4) Returning pure values. The return type of a IO function has to be IO something. In the above example the return type is 'IO ()' since this is the result type of the last operation, putStrLn. But what if we want to return say the reversed name? The reversed name is a pure value, so this is will not compile:
somefun = do
putStrLn "What is your name?"
name <- getLine
let name2 = reverse name
putStrLn ("Olleh, " ++ name2)
X name2
We have to turn the String into an "IO String", because the result type of an IO function has to be "IO something". This is done with the "return" operation, which turns a pure value into the corresponding IO value.
The name "return" is unfortunate since it looks equivalent to "return" in imperative languages. But in Haskell "return" doesn't actually exit the function. The function exits after the last operation regardless of the use of "return". The only thing "return" does is to "tag" a pure value so we can return it from an IO function: somefun = do
putStrLn "What is your name?"
name <- getLine
let name2 = reverse name
putStrLn ("Olleh, " ++ name2)
return name2
Here's the outline of what the middle of a tutorial could look like, following this advice:
Here's how to print a string (putStr, putStrLn). Here's how to print something other than a string (show, print). Here's how to print two somethings in a row (>>). Here's how to read something and print that (>>=). Here's how to print something in a function other than main (:: IO ()). Here's how to read something in a function other than main (:: IO a, >>= again, return). Oh by the way, it turns out that pattern (return, >>=) is so common that Haskell gives it a special syntax (do notation). For instance, it works with the previously introduced Maybe. And with List. Remember typeclasses? You can write functions that work with IO, Maybe, and List (Monad m => ...).
Even when actually talking about monads, the explanation should come first, and the term should come later. "It turns out these operations are a common enough pattern that Haskell gives them special syntax..." comes across much more sanely than "now we're going to introduce something [complicated] called a monad".