#1897: Ambiguous types and rejected type signatures
+---
Reporter: guest|Owner: chak
Type: bug | Status: reopened
Priority: normal
#2944: Mutually recursive equality constraints
--+-
Reporter: MartijnVanSteenbergen | Owner:
Type: bug| Status: new
Priority: normal
#2945: trace history should not be context/resume specific but global
-+--
Reporter: phercek | Owner:
Type: feature request | Status: new
Priority: normal
#2945: trace history should not be context/resume specific but global
--+-
Reporter: phercek | Owner:
Type: feature request | Status: new
Priority: normal
#2739: GHC API crashes on template haskell splices
-+--
Reporter: waern |Owner: nominolo
Type: bug | Status: assigned
Priority: normal|
#2937: source file that compiled fine fails to recompile after touching it (yes,
another one)
-+--
Reporter: rwbarton |Owner: igloo
Type: merge | Status: new
#2946: tracing should be controled by a global flag (it should not be resume
context specific)
-+--
Reporter: phercek | Owner:
Type: feature request | Status: new
#2368: ASSERT failed! file coreSyn/CorePrep.lhs line 669
--+-
Reporter: batterseapower |Owner: igloo
Type: bug| Status: new
Priority:
#2935: A lazy (~) pattern cannot bind existential type variables happens for
non-existential GADTs
-+--
Reporter: ganesh|Owner:
Type: bug | Status:
#2931: Template Haskell: Quoting single letter identifier leads to a parse error
at end of input.
--+-
Reporter: int-e |Owner: igloo
Type: merge | Status: new
#2944: Mutually recursive equality constraints
+---
Reporter: MartijnVanSteenbergen|Owner: igloo
Type: merge| Status: new
Priority: normal |
#2944: Mutually recursive equality constraints
---+
Reporter: MartijnVanSteenbergen |Owner: igloo
Type: merge | Status: new
Priority: normal
#2552: SCC annotation behavior differs between toplevel and non-toplevel
--+-
Reporter: Rauli |Owner:
Type: bug| Status: new
Priority: normal
#2947: infix precedence of backtick functions defined in ghci is not reported by
:info
-+--
Reporter: EyalLotem | Owner:
Type: bug | Status: new
#2947: infix precedence of backtick functions defined in ghci is not reported by
:info
--+-
Reporter: EyalLotem | Owner:
Type: bug | Status: new
#2947: infix precedence of backtick functions defined in ghci is not reported by
:info
--+-
Reporter: EyalLotem | Owner:
Type: bug | Status: new
#2948: the type of System.Posix.Process.executeFile is not general enough
-+--
Reporter: nr| Owner:
Type: bug | Status: new
Priority: normal
#2919: ghc panic while compiling Crypto
--+-
Reporter: wchogg| Owner:
Type: bug | Status: new
Priority: normal| Milestone:
Component: Compiler |
I agree that's odd. Are you using -O? Can you give us a reproducible test
case?
(The only think I can think is that the line
|Gc{} - Tm (grspe r)
will build a thunk for (grspe r), and depending on the context I suppose you
might get a lot of those.)
Thanks
Simon
|
[Redirecting to GHC users]
Andres,
Nice example. It's another instance of a problem that keeps coming up with
type families. Details here:
http://hackage.haskell.org/trac/ghc/ticket/1897#comment:10
The rest of the ticket gives other examples. It's not clear what the Right
Thing to do is.
Hi (and hello everybody),
I read the FAQ, I searched down till Nov 2008, but did not find anything.
I hope I didn't miss a FAQ or somewhat. (If so, please apologize!)
My (freshly installed) GHCi 6.10.1 runs on Windows XP on Intel Dual Core.
I used the .msi of the Webpage some two weeks ago.
I
Simon Marlow wrote:
I agree with most of what you say - there should be a way to get access
to the history after :trace has finished. Perhaps the right way is just
to have a single global trace history.
Please submit a feature request, with a proposal for the user interface,
to the GHC bug
I reproduced the error on my setup (GHC 6.10.1 on WS2003), and received SEH
exception 0xC0FD, which is STATUS_STACK_OVERFLOW A new guard page for
the stack cannot be created. It looks like something is overflowing the OS
stack or improperly bumping the guard page at the end of the allocated
* Heiko Studt st...@fmi.uni-passau.de [2009-01-13 16:15:51+0100]
Hi (and hello everybody),
I read the FAQ, I searched down till Nov 2008, but did not find anything.
I hope I didn't miss a FAQ or somewhat. (If so, please apologize!)
My (freshly installed) GHCi 6.10.1 runs on Windows XP on
Hello Brian and All,
I'm curious if anyone here attempted building LambdaVM on non-GNU
system. I'm using OpenSolaris/x86 and build fails with:
== Recursively making `depend' for ways: '' ...
PWD = /export/home/karel/vcs/lambdavm/libraries/Cabal
PPS: Why does your mailinglist not set the Reply-To header?
@Roman Cheplyaka: Sorry for double mailing.
Am 13.01.2009 schrieb Roman Cheplyaka:
| f x y z = a + b*c + b + fun c
| where a = x * y + z
| b = c * fun x
| c = a * b
| fun x = x * x + 1
The query
Hello,
short followup, when I also removed Cabal from libraries/Makefile
SUBDIRS, then the build has gone well and I'm able to compile and run
simple Haskell testing programs.
Great work, indeed! I'm looking forward to seeing LambdaVM merged to the
standard GHC.
Thanks!
Karel
Karel Gardas
multirec-0.2: Generic programming with systems of recursive datatypes
=
Many generic programs require information about the recursive positions
of a datatype. Examples include the generic fold, generic rewriting or
the Zipper
zipper-0.1: Generic zipper for systems of recursive datatypes
=
The zipper is a data structure that allows typed navigation on a value.
It maintains a subterm as a current point of focus. The rest of the value
is the context. Focus and
Hi !
Can someone tell me where to download the *data* and *concurrent *packages.
I need them to build FranTk1.1 package (
http://www.dcs.gla.ac.uk/~meurig/FranTk/news.html)
Thanks in advance!
BFT
frantk.conf file :
Package
{name = FranTk,
import_dirs =
Hello,
On Tuesday 13 January 2009 18:26, bft wrote:
Hi !
Can someone tell me where to download the *data* and *concurrent *packages.
I recall data and concurrent packages from some years back, but I would assume
that they are merged into the base package nowadays where GHC-6.10.1 is the
Hi,
Although it will not help you to know who your grandparent was it is always
better to know what
reason is behind particular formalism that you use. And the better you know it
the further you go
with it. So after seeing reappearing questions on the nature and role of
fundamental concepts in
As a demo for the first day of class, I thought I'd try to write a
simple shell in Haskell, in part so I can show algebraic data types
and monads on the first day, but also to convince potential skeptics
that functional languages can do systemsy things.
All the usual functional stuff is going
So where do I as a practicing programmer and researcher go to learn all
this stuff? My background is theoretical physics (PhD, 1993) so I'm no
stranger to math. I've been using Haskell off and on since Haskell 1.4,
and while I see lots of theoretical discussions on this list, I have yet
to find
Have a look at John Goerzen's HSH and Thomas Hartman's HSHHelpers:
http://software.complete.org/software/wiki/hsh/
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HSH
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HSHHelpers
regards,
Bas
Hi,
Am 12.01.2009 um 14:37 schrieb Henning Thielemann:
On Mon, 12 Jan 2009, Jan Christiansen wrote:
I am not sure whether this would be a good idea. The original
version makes a lot of suggestions which are not satisfiable but
it is not at all trivial to decide which are satisfiable and
Hi
convert b 0 = []
convert b n = n `mod` b : convert b (n `div` b)
convert b = unfoldr (\n - if n 0 then Just (n `mod` b, n `div` b) else
Nothing)
To my untrained eyes the second looks more complex... It can't be
implemented in the HLint list recursion functions I've got at the
moment
Henning Thielemann wrote:
I have seen several libraries where all functions of a monad have the
monadic result (), e.g. Binary.Put and other writing functions. This is
a clear indicator, that the Monad instance is artificial and was only
chosen because of the 'do' notation.
I completely
On Tue, Jan 13, 2009 at 10:16:32AM +, ChrisK wrote:
Henning Thielemann wrote:
I have seen several libraries where all functions of a monad have the
monadic result (), e.g. Binary.Put and other writing functions. This is
a clear indicator, that the Monad instance is artificial and was only
Hi.
I have some doubts about errno handling in a Concurrent Haskell program.
Let's suppose that GHC non threaded runtime is used, so that each
Haskell thread is bound to an OS thread.
Let's suppose there are two threads running (`A` and `B`).
Thread `A` calls a function `f`, that, in turn,
Galchin, Vasili ha scritto:
[...]
I would like to help to develope any wrappers around POSIX API.
^^^ you are suggesting to change current wrapper API?
No, but I don't understand why to link code that seems to be not used.
P.S.: is the problem I have reported riproducible?
Dear list members,
I tried Text.JSON from hackage and did an initial test to see how well
it performs. I created a single JSON file of roughly 6 MB containing a
single JSON array with 30906 JSON objects and used the following code
to parse it:
module Main where
import System.IO
import
Max Bolingbroke wrote:
2009/1/12 Jan-Willem Maessen jmaes...@alum.mit.edu:
On Jan 12, 2009, at 9:01 AM, Duncan Coutts wrote:
No because the current definition are recursive and ghc cannot inline
recursive functions.
Then the map can be inlined at the call site and the 'f' inlined into
Manlio Perillo wrote:
I have some doubts about errno handling in a Concurrent Haskell program.
Let's suppose that GHC non threaded runtime is used, so that each
Haskell thread is bound to an OS thread.
Let's suppose there are two threads running (`A` and `B`).
Thread `A` calls a function
Andrew Coppin wrote:
Does it suggest unfoldr too?
I think Neil's idea to have this customizable is a good one.
It's often a matter of taste.
I would rarely want to use unfoldr, and I wouldn't want HList
to bother me about it. Instead, I prefer to use iterate for both
of Andrew's examples:
Levi Greenspan greenspan.l...@googlemail.com writes:
Now I wonder why Text.JSON is so slow in comparison and what can be
done about it. Any ideas? Or is the test case invalid?
I haven't used JSON, but at first glance, I'd blame String IO. Can't
you decode from ByteString?
-k
--
If I haven't
Haskeline is designed to remove the readline dependency, because Windows
does not have readline. So rlwrap is useless there.
Ah, I hadn't considered Windows support--that makes sense. Thanks,
that answers my questions.
AHH
One nice thing would be to write something like rlwrap
that would
2009/1/13 Simon Marlow marlo...@gmail.com:
GHC should indeed be doing so. I'm working (on and off) to work out
some suitable heuristics and put the transformation into ghc -O2.
There are a few wrinkles that still need sorting out, but preliminary
indications are that it decreases the runtime
Simon Marlow ha scritto:
Manlio Perillo wrote:
I have some doubts about errno handling in a Concurrent Haskell program.
Let's suppose that GHC non threaded runtime is used, so that each
Haskell thread is bound to an OS thread.
Let's suppose there are two threads running (`A` and `B`).
Last night I was thinking on what makes monads so hard to take, and came to
a conclusion: the lack of a guided tour on the implemented monads.
Let's take the Writer monad documentation: all it says is:
Inspired by the paper Functional Programming with Overloading and
Higher-Order Polymorphism,
ketil:
Levi Greenspan greenspan.l...@googlemail.com writes:
Now I wonder why Text.JSON is so slow in comparison and what can be
done about it. Any ideas? Or is the test case invalid?
I haven't used JSON, but at first glance, I'd blame String IO. Can't
you decode from ByteString?
On Tue, Jan 13, 2009 at 6:03 AM, Mauricio briqueabra...@yahoo.com wrote:
Haskeline is designed to remove the readline dependency, because Windows
does not have readline. So rlwrap is useless there.
Ah, I hadn't considered Windows support--that makes sense. Thanks,
that answers my
Hi,
Ive seen many times the monad topic coming around on the cafe and plentiful
tutorials on monads have been published. However, as a complete Haskell
newbie coming from OOP, I felt monads were not particularly difficult to
grasp, and very exciting to work with.
During my experiments with
On Tue, 2009-01-13 at 12:56 -0200, Rafael Gustavo da Cunha Pereira Pinto
wrote:
Last night I was thinking on what makes monads so hard to take, and
came to a conclusion: the lack of a guided tour on the implemented
monads.
...
Inspired by the paper Functional Programming with Overloading
On page 102: partial function application is named currying
I thought currying or to curry means converting
f :: (a,b) -c
into
g :: a - b - c
by applying curry (mmm, are Asian people good at Haskell? :-)
g = curry f
___
Haskell-Cafe
The term 'currying' means both of these things:
- Converting an uncurried function to a 'curriable' one
- Partially applying a 'curriable' function
2009/1/13 Peter Verswyvelen bugf...@gmail.com:
On page 102: partial function application is named currying
I thought currying or to curry
Jonathan Cast jonathancc...@fastmail.fm wrote:
On Tue, 2009-01-13 at 12:56 -0200, Rafael Gustavo da Cunha Pereira Pinto
wrote:
Inspired by the paper Functional Programming with Overloading and
Higher-Order Polymorphism,
Mark P Jones
Yes, I've read it twice, and it is a nice explanation that yes, the reader
monad is an application and is a monad. How do I use it? Why not the
function itself? How would the plumbing work in a real world example?
BTW, the article is really great as an brief introduction to monad
transformers.
Ah. That explains my confusion. But isn't that ambiguous terminology? There
must be some reason for it to be that way?
On Tue, Jan 13, 2009 at 5:05 PM, Eugene Kirpichov ekirpic...@gmail.comwrote:
The term 'currying' means both of these things:
- Converting an uncurried function to a
I agree completely. There is not nearly enough documentation on
packaging in haskell and too many hackage packages are broken or do
not install. I know several people are working on improving this but
they seem do be doing so rather quietly. Could someone briefly outline
what improvements are
Jonathan Cast wrote:
On Tue, 2009-01-13 at 12:56 -0200, Rafael Gustavo da Cunha Pereira
Pinto wrote:
Inspired by the paper Functional Programming with Overloading and
Higher-Order Polymorphism, Mark P Jones
(http://web.cecs.pdx.edu/~mpj/pubs/springschool.html)
Advanced
My experience from using GHC under Windows XP is very similar. Many
packages (especially those involving bindings to C packages) are at
least painful to build.
Regarding encoding package: it compiles fine for me:
C:\Documents and Settings\Methariuscabal install encoding
Resolving dependencies...
Well, the number one thing is to use Cabal and the cabal-install tool.
That is the simplest way to avoid headaches.
Regarding libraries in general, the platform project is underway, aiming
to bless a set of stable, batteries included packages, saving
duplicated work determining which, say, json
On Tue, 2009-01-13 at 16:22 +, Sittampalam, Ganesh wrote:
Jonathan Cast wrote:
On Tue, 2009-01-13 at 12:56 -0200, Rafael Gustavo da Cunha Pereira
Pinto wrote:
Inspired by the paper Functional Programming with Overloading and
Higher-Order Polymorphism, Mark P Jones
What could be done is letting the community rate the quality of the modules
for each platform? Maybe with user comments? Like amazon.com (so we
hackazon.org ;-) And using lambdas instead of stars for giving the rating
:)
On Tue, Jan 13, 2009 at 6:13 PM, Don Stewart d...@galois.com wrote:
2009/1/13 Peter Verswyvelen bugf...@gmail.com:
On page 102: partial function application is named currying
I thought currying or to curry means converting
f :: (a,b) -c
Confusion over these terms is commonplace. See, for example, the
discussion here: http://lambda-the-ultimate.org/node/2266
--
There's a 'stability' field on cabal description files. Maybe
it could appear after the name on the main listing. Or, all
packages marked as 'Stable' at that field could get a beautifull
color.
I agree completely. There is not nearly enough documentation on
packaging in haskell and too many
Robin Green wrote:
On Mon, 12 Jan 2009 21:04:35 +0100 (CET)
Henning Thielemann lemm...@henning-thielemann.de wrote:
On Mon, 12 Jan 2009, Andrew Coppin wrote:
convert b = unfoldr (\n - if n 0 then Just (n `mod` b, n `div`
b) else Nothing)
I have the nice function 'toMaybe'
I have seen several libraries where all functions of a monad have the
monadic result (), e.g. Binary.Put and other writing functions. This is
a clear indicator, that the Monad instance is artificial and was only
chosen because of the 'do' notation.
Maybe that was the initial reason, but I've
John == John Goerzen jgoer...@complete.org writes:
John That's great. Even better if accompanied by a patch ;-)
Heh, one of the things which prevents me advancing with my own Haskell
project is lack of enough skills to provide bindings for one C-lib and
here I see the same pattern...It looks I
Mauricio == Mauricio briqueabra...@yahoo.com writes:
Mauricio I've been doing a lot of low level sqlite3 lately (it's going
Mauricio to be on a hackage package as soon as I finish my current
Mauricio work).
Have you done any work with BLOBs?
Mauricio As long as I clearly isolate and test the
I didn't knew Wadler's papers (I save all papers I read into a external USB
HD, so I can read them later!), and at a first glance it is really good.
Then again, instead of creating another monad tutorial, what about a
Haskell monads reference guide, and some worked examples?
Some of this work
Gour wrote:
John == John Goerzen jgoer...@complete.org writes:
John That's great. Even better if accompanied by a patch ;-)
Heh, one of the things which prevents me advancing with my own Haskell
project is lack of enough skills to provide bindings for one C-lib and
here I see the same
Judah Jacobson ha scritto:
[...]
(For those interested: rlwrap is available in cygwin.
It used to work very well on old ghci, when line
editing wasn't available.)
This does sound useful; the main difficulty is that when a program has
stdin piped from another process it may behaved
2009/1/13 Andrew Coppin andrewcop...@btinternet.com:
One of the wonderful things about Haskell is that almost any time anybody
posts code, at least one person will think up an alternative but equivilent
way of achieving the same goal - sometimes by radically different steps.
Maybe we should
Hi,
Any idea why ghc 6.10.1 is still in Testing repository on archlinux?
Peter.
Don Stewart wrote:
Arch Haskell News: Jan 11 2009
--cut--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Colin Adams wrote:
2009/1/13 Andrew Coppin andrewcop...@btinternet.com:
One of the wonderful things about Haskell is that almost any time anybody
posts code, at least one person will think up an alternative but equivilent
way of achieving the same goal - sometimes by radically different
Hello
SF == Sigbjorn Finne writes:
SF Hi, a new release of the 'json' package is now available via hackage,
SF version 0.4.1
SF http://hackage.haskell.org/cgi-bin/hackage-scripts/package/json
I tried to upgrade it via cabal on mac os x linux (both use ghc 6.10.1)
and it fails with
I am trying to figure out a clean way to add authentication and
authorization in a webservice. The services of the web services are
implemented as Haskell functions. The request to the service contains the
user authentication information. I want to authenticate the user by
verifying his
Mauricio I've been doing a lot of low level sqlite3 lately (it's going
Mauricio to be on a hackage package as soon as I finish my current
Mauricio work).
Have you done any work with BLOBs?
No. Only sqlite3_exec with INSERT, SELECT stuff,
and saving everything that needs structure in
On Tue, Jan 13, 2009 at 8:47 PM, Alex Ott alex...@gmail.com wrote:
Hello
SF == Sigbjorn Finne writes:
SF Hi, a new release of the 'json' package is now available via hackage,
SF version 0.4.1
SF http://hackage.haskell.org/cgi-bin/hackage-scripts/package/json
I tried to upgrade it via
Alex == Alex Ott alex...@gmail.com writes:
Alex Hello For Emacs users it could be interesting - I wrote small
Alex module for more comfortable work with HLint from Emacs. It has
Alex same functionality as compilation-mode - navigation between
Alex errors, etc.
Thank you for it.
Alex Module is
Johannes == Johannes Waldmann waldm...@imn.htwk-leipzig.de writes:
Johannes see
Johannes http://article.gmane.org/gmane.comp.lang.haskell.libraries/10490
Thanks.
Is it just a 'fix' or HSQL will be properly maintained as well?
Sincerely,
Gour
--
Gour | Zagreb, Croatia | GPG key: C6E7162D
Mauricio == Mauricio briqueabra...@yahoo.com writes:
Mauricio No. Only sqlite3_exec with INSERT, SELECT stuff,
Mauricio and saving everything that needs structure in pseudo-xml
Mauricio strings. Not that efficient, but easy to change to blobs when
Mauricio everything is ready and tested.
I
Don Stewart wrote:
Well, the number one thing is to use Cabal and the cabal-install tool.
That is the simplest way to avoid headaches.
I'm sure cabal works very well for many people, but for anyone who
has used Debian based distributions for some time, cabal really
does seem like a backward
On Mon, 2009-01-12 at 21:48 +, Robin Green wrote:
convert b = unfoldr (\n - if n 0 then Just (n `mod` b, n `div`
b) else Nothing)
I have the nice function 'toMaybe' which simplifies this to:
unfoldr (\n - toMaybe (n0) (n `mod` b, n `div` b))
I would use the more general
On Tue, 13 Jan 2009 19:35:57 +0100, Rafael Gustavo da Cunha Pereira Pinto
rafaelgcpp.li...@gmail.com wrote:
I didn't knew Wadler's papers (I save all papers I read into a external
USB
HD, so I can read them later!), and at a first glance it is really good.
Then again, instead of creating
mle+cl:
Don Stewart wrote:
Well, the number one thing is to use Cabal and the cabal-install tool.
That is the simplest way to avoid headaches.
I'm sure cabal works very well for many people, but for anyone who
has used Debian based distributions for some time, cabal really
does seem
Version 0.1.1 of the split library is now on Hackage, which provides a
wide range of strategies and a unified combinator framework for
splitting lists with respect to some sort of delimiter.
This version:
* fixes a couple Haddock bugs that were preventing the documentation
from building on
Johannes http://article.gmane.org/gmane.comp.lang.haskell.libraries/10490
Is it just a 'fix' or HSQL will be properly maintained as well?
Just a fix for Setup.hs and *.cabal, and no changes to the real code
(w.r.t. version -1.7 presently available from hackage)
J.W.
Hello,
From Hoogle (my friend) *intercalate* ::
ByteStringhttp://hackage.haskell.org/packages/archive/bytestring/0.9.1.4/doc/html/Data-ByteString.html#t%3AByteString-
[
ByteStringhttp://hackage.haskell.org/packages/archive/bytestring/0.9.1.4/doc/html/Data-ByteString.html#t%3AByteString]
Don Stewart wrote:
mle+cl:
Don Stewart wrote:
Well, the number one thing is to use Cabal and the cabal-install tool.
That is the simplest way to avoid headaches.
I'm sure cabal works very well for many people, but for anyone who
has used Debian based distributions for some time, cabal
vigalchin:
Hello,
From Hoogle (my friend)
intercalate :: [1]ByteString - [[2]ByteString] - [3]ByteString [4]Source
O(n) The [5]intercalate function takes a [6]ByteString and a list of
[7]ByteStrings and concatenates the list after interspersing the first
Colin Adams colinpaulad...@googlemail.com writes:
One of the wonderful things about Haskell is that almost any time anybody
posts code, at least one person will think up an alternative but equivilent
way of achieving the same goal - sometimes by radically different steps.
Maybe we should
Many thanks for the replies.
Using 'modify' cleans the syntax up nicely.
With regard to using 'iterate' as shown by David here:
mcSimulate :: Double - Double - Word64 - [Double]
mcSimulate startStock endTime seedForSeed = fst expiryStock : mcSimulate
startStock endTime newSeedForSeed
where
On Tue, Jan 13, 2009 at 11:21 AM, Tim Newsham news...@lava.net wrote:
I have seen several libraries where all functions of a monad have the
monadic result (), e.g. Binary.Put and other writing functions. This is
a clear indicator, that the Monad instance is artificial and was only
chosen
Hi folks,
I've pushed to the Git repo a bunch of new code for HDBC-postgresql.
Specifically, it:
1) Removes autoconf in favor of Duncan's Setup.lhs that should work on
all combinations of GHC 6.8, GHC 6.10, POSIX, and Windows
2) Adds support for UTF-8 encoding of strings
3) Adds support for
Hi.
During a tentative (quite unsuccessfull) to convert a simple Python
script that prints on stdout a directory and all its subdirectory [1] in
a good Haskell (mostly to start to do real practice with the language),
I came across this blog post:
On Tue, 2009-01-13 at 16:33 +0100, Regis Saint-Paul wrote:
Hi,
I’ve seen many times the monad topic coming around on the cafe and plentiful
tutorials on monads have been published. However, as a complete Haskell
newbie coming from OOP, I felt monads were not particularly difficult to
Rafael Gustavo da Cunha Pereira Pinto schrieb:
Yes, I've read it twice, and it is a nice explanation that yes, the
reader monad is an application and is a monad. How do I use it? Why not
the function itself? How would the plumbing work in a real world example?
Hi Rafael,
First of all, I agree
1 - 100 of 132 matches
Mail list logo
