- Beginners - Haskell.org

Re: [Haskell-beginners] understanding function signature alignement
by simkestuff＠gmail.com 10 Aug '18

10 Aug '18

> > Thanks, it is still a bit fuzzy to me ... I understand what you did but what confuses me is that when i look at function with signature like f :: Monad m => c -> m d I always think that return type is somehow restricted in comparison to input because it demands that output type is wraped inside something (monad in this case). For such signature to fit id signature (a -> a) , c type shoud be also wraped inside monad but it is not case here... Anyhow, I still have to figure it out thanks

2 2

understanding function signature alignement
by simkestuff＠gmail.com 09 Aug '18

09 Aug '18

Hello, I'm going through Haskellbook and while doing some exercises I'm stack with trying to explain myself how types matches in this examples: meh :: Monad m => [a] -> (a -> m b) -> m [b] meh [] _ = pure [] meh (x:xs) f = (:) <$> f x <*> meh xs f flipType :: (Monad m) => [m a] -> m [a] flipType xs = meh xs id What puzzles me is how id function which is of type (a->a) can fit here where meh function is requesting function of type (a->m b)? The function (a -> m b) is function that says give me anything and I will give back anything wrapped up into some monad structure; id ( a -> a) on other hand says give me anything and I will return it back to you. So, to me, the first function is somehow more restricted than id function because it puts limitation on what output of that function can be and I'm struggling to understand how id function can fit here. I hope someone can help me how to reason about these functions here? thanks

3 2

Best way to trig an IO action on a condition.
by PICCA Frederic-Emmanuel 29 Jul '18

29 Jul '18

Hello, Now that I know how to fork a process the right way :) I would like to trig this process when a list of file exist on the system. I can not use inotify since my files are on an nfs sytem. So I would like your advices in order to create a Condition which wait for the presence of these files and when this condition is fullliled, trigg the action. Thanks for your help. Frederic.

2 1

Where is the accumulator in the expression foldr (<=<) return (replicate x oveKnight)? -- from LYAH example
by Olumide 26 Jul '18

26 Jul '18

Dear List, Chapter 13 of LYAH (http://learnyouahaskell.com/for-a-few-monads-more#useful-monadic-functions) has the following code block import Data.List inMany :: Int -> KnightPos -> [KnightPos] inMany x start = return start >>= foldr (<=<) return (replicate x oveKnight) What I'd like to know is where the accumulator of foldr is in this example. Regards, - Olumide

4 3

forkProcess behaviour
by PICCA Frederic-Emmanuel 25 Jul '18

25 Jul '18

Hello, I try to write a service which execute an IO using forkProcess This service contain a web server whcih avwait for job published by users. for each job, I create a forkProcess of this job. I need to fork the process in order to change the uid and gid of the process for each of the job dependencing on who request the job. I have a least two questions 1) is this forkProcess a fork of all the current process, or is it just an executin of the IO in another process id ? I ask this because sometime one of my job hang and a process keep running. Since the original process is binded to a port, it is not possible to restart the server, saying that the port is already in use. 2 ) How can I catch the exceptions thrown from the child process in order to process them in the parent process. thanks for your help answering these questions. Frederic

3 9

The type class Read
by mrx 13 Jul '18

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