[Haskell-beginners] Noobie attempt to process log output into dependency graph

[John Lusk]

Ha! Fixed! And committed to the GitHub repo mentioned previously, if
anybody's interested.

I spent too much time on it, but I couldn't let it go and now I have to
brag.

John.

On Thu, Dec 15, 2016 at 4:25 PM, John Lusk <johnlusk4 at gmail.com> wrote:

> Thanks!!
>
> John.
>
> On Thu, Dec 15, 2016 at 4:23 PM, Imants Cekusins <imantc at gmail.com> wrote:
>
>> > f :: [input] -> state -> outputs
>>
>> .. or with state monad m it could be a combination of
>>
>> f :: [input] -> m outputs
>>
>> f :: [input] -> outputs  - for intermediate results where state is not R/W
>>
>>
>> state + IO is not too difficult. here is a very good explanation
>> <http://stackoverflow.com/questions/3640120/combine-state-with-io-actions>
>> I understood the last one - Use liftIO - best
>>
>> _______________________________________________
>> Beginners mailing list
>> Beginners at haskell.org
>> http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners
>>
>>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/beginners/attachments/20161216/50ddff38/attachment.html>