- Beginners - Haskell.org

13 Jul '18

Hi, I'm trying to make sense of the type class `Read`. It feels to be like a function performing casting to me, similar to what you have in C and Java. The weird thing is that the casting doesn't have to make sense, type-wise. So `read "5" :: Int` produce the integer 5 which make sense but `read "(3,'a')" :: Int` doesn't make sense to me but ghci accepts it! This is seeing Read as a function, as it's a type class i suspect I'm missing something. Quite possibly quite a lot... Why is the type class called `Read`? What am I missing above? // Patrik Iselind

3 5

Two small questions from the section "Making a safe RPN calculator" in LYAH
by Olumide 11 Jul '18

11 Jul '18

Dear List, Question 1: In the section "Making a safe RPN calculator" of LYAH (Chapter 14 -- http://learnyouahaskell.com/for-a-few-monads-more#useful-monadic-functions) there is an expression: read numberString:xs, take from the last line of the function foldingFunction :: [Double] -> String -> [Double] foldingFunction (x:y:ys) "*" = (x * y):ys foldingFunction (x:y:ys) "+" = (x + y):ys foldingFunction (x:y:ys) "-" = (y - x):ys foldingFunction xs numberString = read numberString:xs My first question is why is the read function called before the cons operator? Question 2: The same section of the book also introduces the reads function which is used to implement the readMaybe function and a refactored foldingFunction readMaybe :: (Read a) => String -> Maybe a readMaybe st = case reads st of [(x,"")] -> Just x _ -> Nothing foldingFunction :: [Double] -> String -> Maybe [Double] foldingFunction (x:y:ys) "*" = return ((x * y):ys) foldingFunction (x:y:ys) "+" = return ((x + y):ys) foldingFunction (x:y:ys) "-" = return ((y - x):ys) foldingFunction xs numberString = liftM (:xs) (readMaybe numberString) I'd like to know why the foldingFunction returns Nothing in the following example: ghci> foldingFunction [] "1 wawawawa" Nothing Considering that reads "1 wawawawa" does not return Nothing, as follows ghci> reads "1 wawawawa" :: [(Double,String)] [(1.0," wawawawa")] Regards, - Olumide

2 1

Haskell for Imperative Programmers
by Olivier Revollat 10 Jul '18

10 Jul '18

Hi, I've been using imperative languages for 20 years now :) I'm a beginner in haskell and I love the paradigm shift you feel when you come from imperative programming. I found interesting articles like : https://wiki.haskell.org/Haskell_IO_for_Imperative_Programmers Do you have any other ressources like that ? I'm not looking for how to use haskell in imperative style (e.g. with "do" notation, ...) no no ! I'm looking articles who explain how NOT TO USE imperative style with haskell, and help thinking the paradigm shift ... Thanks :)

5 8

Storing the time difference between two Monotonic time results
by Awsaf Rahman 09 Jul '18

09 Jul '18

Hello, I am trying to time a function I have written in haskell using the clock package in the following way: *start <- getTime Monotonic* *evaluate(something)* *end <- getTime Monotonic* *fprint (timeSpecs % "\n") start end* Now what I want is to store the time difference between *start* and *end. *Is there a way I can do that? Regards Awsaf

2 5

Where to report an unfriendly feature (if not a bug) in `stack ghci`?
by Jeffrey Brown 09 Jul '18

09 Jul '18

I don't know whether this is a problem with stack or with GHCI. But suppose you've got a bunch of modules loaded, and the prompt is hard to read, so you set it to something simpler like "> ". If you then use ":{" to enter a multi-line block of code, the module names appear again at the prompt, making the block you're entering very difficult to read. Here's an example: ) Ok, 55 modules loaded. Loaded GHCi configuration from /tmp/haskell-stack-ghci/d770186e/ghci-script *Vivid.UGens.UserInteraction Vivid Vivid.Actions Vivid.Actions.Class Vivid.Acti ons.IO Vivid.Actions.NRT Vivid.Actions.Scheduled Vivid.ByteBeat Vivid.Envelopes Vivid.NoPlugins Vivid.OSC Vivid.OSC.Util Vivid.Randomness Vivid.SCServer Vivid .SCServer.Connection Vivid.SCServer.State Vivid.SCServer.Types Vivid.SynthDef V ivid.SynthDef.FromUA Vivid.SynthDef.Literally Vivid.SynthDef.ToSig Vivid.SynthD ef.Types Vivid.SynthDef.TypesafeArgs Vivid.UGens Vivid.UGens.Algebraic Vivid.UG ens.Analysis Vivid.UGens.Args Vivid.UGens.Buffer Vivid.UGens.Conversion Vivid.U Gens.Convolution Vivid.UGens.Delays Vivid.UGens.Demand Vivid.UGens.Dynamics Viv id.UGens.Envelopes Vivid.UGens.Examples Vivid.UGens.FFT Vivid.UGens.Filters Viv id.UGens.Filters.BEQSuite Vivid.UGens.Filters.Linear Vivid.UGens.Filters.Nonlin ear Vivid.UGens.Filters.Pitch Vivid.UGens.Generators.Chaotic Vivid.UGens.Genera tors.Deterministic Vivid.UGens.Generators.Granular Vivid.UGens.Generators.Singl eValue Vivid.UGens.Generators.Stochastic Vivid.UGens.InOut Vivid.UGens.Info Viv id.UGens.Maths Vivid.UGens.Multichannel Vivid.UGens.Random Vivid.UGens.Reverbs Vivid.UGens.SynthControl Vivid.UGens.Triggers Vivid.UGens.Undocumented Vivid.UG ens.UserInteraction> :set prompt "> " > 3+1 4 > :{ *Vivid.UGens.UserInteraction Vivid Vivid.Actions Vivid.Actions.Class Vivid.Acti ons.IO Vivid.Actions.NRT Vivid.Actions.Scheduled Vivid.ByteBeat Vivid.Envelopes Vivid.NoPlugins Vivid.OSC Vivid.OSC.Util Vivid.Randomness Vivid.SCServer Vivid .SCServer.Connection Vivid.SCServer.State Vivid.SCServer.Types Vivid.SynthDef V ivid.SynthDef.FromUA Vivid.SynthDef.Literally Vivid.SynthDef.ToSig Vivid.SynthD ef.Types Vivid.SynthDef.TypesafeArgs Vivid.UGens Vivid.UGens.Algebraic Vivid.UG ens.Analysis Vivid.UGens.Args Vivid.UGens.Buffer Vivid.UGens.Conversion Vivid.U Gens.Convolution Vivid.UGens.Delays Vivid.UGens.Demand Vivid.UGens.Dynamics Viv id.UGens.Envelopes Vivid.UGens.Examples Vivid.UGens.FFT Vivid.UGens.Filters Viv id.UGens.Filters.BEQSuite Vivid.UGens.Filters.Linear Vivid.UGens.Filters.Nonlin ear Vivid.UGens.Filters.Pitch Vivid.UGens.Generators.Chaotic Vivid.UGens.Genera tors.Deterministic Vivid.UGens.Generators.Granular Vivid.UGens.Generators.Singl eValue Vivid.UGens.Generators.Stochastic Vivid.UGens.InOut Vivid.UGens.Info Viv id.UGens.Maths Vivid.UGens.Multichannel Vivid.UGens.Random Vivid.UGens.Reverbs Vivid.UGens.SynthControl Vivid.UGens.Triggers Vivid.UGens.Undocumented Vivid.UG ens.UserInteraction| f = let y = 3 *Vivid.UGens.UserInteraction Vivid Vivid.Actions Vivid.Actions.Class Vivid.Acti ons.IO Vivid.Actions.NRT Vivid.Actions.Scheduled Vivid.ByteBeat Vivid.Envelopes Vivid.NoPlugins Vivid.OSC Vivid.OSC.Util Vivid.Randomness Vivid.SCServer Vivid .SCServer.Connection Vivid.SCServer.State Vivid.SCServer.Types Vivid.SynthDef V ivid.SynthDef.FromUA Vivid.SynthDef.Literally Vivid.SynthDef.ToSig Vivid.SynthD ef.Types Vivid.SynthDef.TypesafeArgs Vivid.UGens Vivid.UGens.Algebraic Vivid.UG ens.Analysis Vivid.UGens.Args Vivid.UGens.Buffer Vivid.UGens.Conversion Vivid.U Gens.Convolution Vivid.UGens.Delays Vivid.UGens.Demand Vivid.UGens.Dynamics Viv id.UGens.Envelopes Vivid.UGens.Examples Vivid.UGens.FFT Vivid.UGens.Filters Viv id.UGens.Filters.BEQSuite Vivid.UGens.Filters.Linear Vivid.UGens.Filters.Nonlin ear Vivid.UGens.Filters.Pitch Vivid.UGens.Generators.Chaotic Vivid.UGens.Genera tors.Deterministic Vivid.UGens.Generators.Granular Vivid.UGens.Generators.Singl eValue Vivid.UGens.Generators.Stochastic Vivid.UGens.InOut Vivid.UGens.Info Viv id.UGens.Maths Vivid.UGens.Multichannel Vivid.UGens.Random Vivid.UGens.Reverbs Vivid.UGens.SynthControl Vivid.UGens.Triggers Vivid.UGens.Undocumented Vivid.UG ens.UserInteraction| in y + 1 *Vivid.UGens.UserInteraction Vivid Vivid.Actions Vivid.Actions.Class Vivid.Acti ons.IO Vivid.Actions.NRT Vivid.Actions.Scheduled Vivid.ByteBeat Vivid.Envelopes Vivid.NoPlugins Vivid.OSC Vivid.OSC.Util Vivid.Randomness Vivid.SCServer Vivid .SCServer.Connection Vivid.SCServer.State Vivid.SCServer.Types Vivid.SynthDef V ivid.SynthDef.FromUA Vivid.SynthDef.Literally Vivid.SynthDef.ToSig Vivid.SynthD ef.Types Vivid.SynthDef.TypesafeArgs Vivid.UGens Vivid.UGens.Algebraic Vivid.UG ens.Analysis Vivid.UGens.Args Vivid.UGens.Buffer Vivid.UGens.Conversion Vivid.U Gens.Convolution Vivid.UGens.Delays Vivid.UGens.Demand Vivid.UGens.Dynamics Viv id.UGens.Envelopes Vivid.UGens.Examples Vivid.UGens.FFT Vivid.UGens.Filters Viv id.UGens.Filters.BEQSuite Vivid.UGens.Filters.Linear Vivid.UGens.Filters.Nonlin ear Vivid.UGens.Filters.Pitch Vivid.UGens.Generators.Chaotic Vivid.UGens.Genera tors.Deterministic Vivid.UGens.Generators.Granular Vivid.UGens.Generators.Singl eValue Vivid.UGens.Generators.Stochastic Vivid.UGens.InOut Vivid.UGens.Info Viv id.UGens.Maths Vivid.UGens.Multichannel Vivid.UGens.Random Vivid.UGens.Reverbs Vivid.UGens.SynthControl Vivid.UGens.Triggers Vivid.UGens.Undocumented Vivid.UG ens.UserInteraction| :} > f 4 > -- Jeff Brown | Jeffrey Benjamin Brown Website <https://msu.edu/~brown202/> | Facebook <https://www.facebook.com/mejeff.younotjeff> | LinkedIn <https://www.linkedin.com/in/jeffreybenjaminbrown>(spammy, so I often miss messages here) | Github <https://github.com/jeffreybenjaminbrown>

2 2

How does forever works ?
by Olivier Revollat 09 Jul '18

09 Jul '18

>From what I understand, this code main = forever $ do putStrLn "OK !" is equivalent to this one : main = do putStrLn "OK !" main In the second case, it's a simple recursion, so far so good ... but when I look at the implementation of "forever" i can't wrap my head around : http://hackage.haskell.org/package/base-4.11.1.0/docs/src/Control.Monad.htm… forever <http://hackage.haskell.org/package/base-4.11.1.0/docs/src/Control.Monad.htm…> a <http://hackage.haskell.org/package/base-4.11.1.0/docs/src/Control.Monad.htm…> = let a' <http://hackage.haskell.org/package/base-4.11.1.0/docs/src/Control.Monad.htm…> = a <http://hackage.haskell.org/package/base-4.11.1.0/docs/src/Control.Monad.htm…> *> <http://hackage.haskell.org/package/base-4.11.1.0/docs/src/GHC.Base.html#%2A…> a' <http://hackage.haskell.org/package/base-4.11.1.0/docs/src/Control.Monad.htm…> in a' <http://hackage.haskell.org/package/base-4.11.1.0/docs/src/Control.Monad.htm…> How does this works ? How does this make an infinite loop ? I understand that *> discard his right argument but it doesn't help me understand how forever implement an infinite loop ...

2 2

Passing a file containing a list as an input
by Awsaf Rahman 06 Jul '18

06 Jul '18

Hello everyone! I am really struggling with Haskell I/O. I have written a mergesort program and as an input to that program I want to use a file containing a list of 1000 integers. Let's say the contents of the file look like this [120, 400, 500 , 20, 100 ..] How can I achieve that? I am trying to write a main function that takes the file as an input and passes the list to my mergesort function.. Regards Awsaf Rahman

3 3

Execution time of Mergesort
by Awsaf Rahman 05 Jul '18

05 Jul '18

Hello everyone! I am trying to find out the execution time of mergesort for a list size of 1 million integers. I have done the same in Erlang as well and the execution time in Erlang was around 0.93 seconds. I have implemented the program in almost the same way in Haskell as well but for some reason the Haskell implementation is taking around 12 seconds which doesn't seem right. Here is the implementation in Haskell: *{-# LANGUAGE OverloadedStrings #-}* *{-# LANGUAGE BangPatterns #-}* *import Control.Exception* *import Formatting* *import Formatting.Clock* *import System.Clock* *import Control.DeepSeq* *mergesort [] = []* *mergesort [x] = [x]* *mergesort xs = let (lhalf, rhalf) = splitAt (length xs `div` 2) xs* * in merge' (mergesort lhalf) (mergesort rhalf)* *merge' lhalf rhalf = merge lhalf rhalf []* *merge [] [] acc = reverse acc* *merge [] y acc = reverse acc ++ y* *merge x [] acc = reverse acc ++ x* *merge (l:ls) (r:rs) acc* * | l < r = merge ls (r:rs) (l:acc)* * | otherwise = merge rs (l:ls) (r:acc)* *toList :: String -> [Integer]* *toList input = read ("[" ++ input ++ "]")* *main = do* * file <- getLine* * contents <- readFile file* * let !unsortedlist = (toList contents)* * start <- getTime Monotonic* * evaluate(force (mergesort unsortedlist))* * end <- getTime Monotonic* * fprint (timeSpecs % "\n") start end* What am I doing wrong?

2 3

Presentation
by Olivier Revollat 04 Jul '18

04 Jul '18

Hi, I'm a french (any other french here ?) web developper since 2001. I use PHP, Python essentially and I've been working with Haskell for a few month now ... I really like it even if it's quite hard to start. I like the mathematical aspect of the language. So hello everyone !

3 2

Design help to add imports to a (Java) template
by Hilco Wijbenga 02 Jul '18

02 Jul '18

Hi all, I'm working on a Haskell (Eta) tool to generate Java ADTs. I have the following definitions: data Line = Line Int Text [JavaImport] -- The Int represents the indentation level of this line. data Template = None | One Line | Many [Line] | Template (Reader Configuration Template) I then run it like this (incomplete, I hope you get the idea): main :: IO () main = putStr $ replace (importsGoHereKey `append` "\n") importsAsText templateAsText where config = Configuration (Copyright 2018 "Me") USE_GETTERS point' = javaClassTemplate point importsAsText = runReader (mapReader javaImportsToText (javaImports point')) config templateAsText = runReader (toText tab point') config Essentially, I use the template twice: once to extract the Java imports and once to generate the result Text. Then I replace a magic string in the result Text with the import code. It works but makes me sad. ;-) I will probably pull out the JavaImport list from Line and use something like State to keep track of the necessary imports. (Now that I understand Reader, maybe State is no longer a bridge too far.) My main issue is how to avoid the magic string. I thought about adding an extra entry to Template [something like Imports ((Set JavaImport) -> Text or maybe Template)] but then I don't know how to implement "instance Monoid Template". Similarly if I use something Reader like. Any design advice or ideas would be appreciated. If it's of any help, the full code is at [1] (it's tiny). Any and all comments are welcome, by the way: I'm still a Haskell beginner. Cheers, Hilco [1] https://github.com/hilcode/java-algebraic-data-types

1 0