Mateusz Kowalczyk fuuzetsu at fuuzetsu.co.uk writes:
I always thought [hayoo] was just Hoogle with more indexed docs.
Wait - there's a semantic difference:
hoogle does understand type signatures
(e.g., it can specialize them, or flip arguments of functions)
while hayoo just treats signatures
I must stress that OpenUnion1.hs described (briefly) in the paper
is only one implementation of open unions, out of many possible.
For example, I have two more implementations. A year-old version of
the code implemented open unions *WITHOUT* overlapping instances or
Typeable.
On Thu, Aug 22, 2013 at 9:23 PM, Mateusz Kowalczyk
fuuze...@fuuzetsu.co.uk wrote:
On 22/08/13 19:30, jabolo...@google.com wrote:
Hi,
I noticed Hayoo appears as a link in the toolbox of
http://hackage.haskell.org and also that Hayoo seems to display better
results than Hoogle. For example,
Hi all
Using the Conduit library is it possible to write the function:
eitherSrc :: MonadResource m
= Source m a - Source m b - Source m (Either a b)
which combines two sources into new output source such that data being
produced aysnchronously by the original two sources will
On Fri, Aug 23, 2013 at 10:12:27AM +0200, Erik Hesselink wrote:
Note that the 'normal' hoogle indexes all (?) of hackage. But by
default it only searches the haskell platform. You can add a package
with '+' to search in that package. E.g. PublicKey +crypto-api.
If the idea behind this, that
You can build this up using the = operator[1] in stm-conduit, something
like:
eitherSrc :: MonadResourceBase m
= Source (ResourceT m) a - Source (ResourceT m) b - Source
(ResourceT m) (Either a b)
eitherSrc src1 src2 = do
join $ lift $ Data.Conduit.mapOutput Left src1 =
Hi everybody,
There is something I do not understand in the way typeclass constraints are
inferred.
1/ Take the following function definition:
sum' [] = []
sum' (x:xs) = x + sum' xs
GHCI correctly gives:
:t sum'
sum' :: Num [a] = [[a]] - [a]
So it has inferred that the type list has to
Hi TP,
The difference is that in your second example, you have specified the
type signature
p :: a - ExpQ
so GHC checks whether p has this type, and correctly objects that it
doesn't. If you leave off the type signature, as you did for sum', the
right thing will be inferred.
Hope this helps,
On 23 August 2013 19:23, TP paratribulati...@free.fr wrote:
Hi everybody,
There is something I do not understand in the way typeclass constraints are
inferred.
1/ Take the following function definition:
sum' [] = []
sum' (x:xs) = x + sum' xs
You haven't specified a type signature here,
Adam Gundry wrote:
If you leave off the type signature, as you did for sum', the
right thing will be inferred.
Thanks Adam and Ivan. Very stupid question...
TP
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Fri, 2013-08-23 at 08:06 +, o...@okmij.org wrote:
It will
arbitrarily pick the first match in the former and fail to compile
in
the latter case.
Of course we can have duplicate layers. In that case, the dynamically
closest
handler wins -- which sounds about right (think of reset
It's a bit pointless, if I have to know the package, where I want to
search in.
Yeah! It does sound a bit pointless. Hoogle should search everything
by default, and then you can refine your search by clicking on the '+'
or '-' on the packages that appear on the left menu.
Jose
--
Jose
On 23/08/13 14:57, jabolo...@google.com wrote:
It's a bit pointless, if I have to know the package, where I want to
search in.
Yeah! It does sound a bit pointless. Hoogle should search everything
by default, and then you can refine your search by clicking on the '+'
or '-' on the packages
Dear all,
our monthly Haskell Meeting will take place next week, Monday the 26th
of August, at 19h30 in Munich. Please note that we will meet this time
at the Max-Emanuel-Brauerei[1]. Last time, much more people showed up
than registered and our table was pretty cramped: thus, if you plan to
On 13-08-22 04:04 PM, Petr Pudlák wrote:
Or, if there are no such definitions, where would be a good place to add
them?
If they are to be added to the base libraries, the Data.Monoid module
would be my choice.
I did wish I had the AppMonoid instance on several occasions, when
using
Hi,
I am using GHC version 6.12.1.
What is optghc ?
I can't find that information anywhere...
Thanks,
Jose
--
Jose Antonio Lopes
Ganeti Engineering
Google Germany GmbH
Dienerstr. 12, 80331, München
Registergericht und -nummer: Hamburg, HRB 86891
Sitz der Gesellschaft: Hamburg
See also this thread from two years ago:
http://www.haskell.org/pipermail/haskell-cafe/2011-June/091294.html
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi,
Are there any Haskell or FP meetups near Lund, Sweden? I will be living
there from October.
Cheers,
--
Carlo Hamalainen
http://carlo-hamalainen.net
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hello,
The word combinator is used several times in the Haskell community. e.g.
parser combinator, combinator library etc.
Is it exactly the same term that is used in the combinatory logic ?
A combinator is a higher-order function that uses *only function
application* and earlier defined
On Fri, Aug 23, 2013 at 9:09 PM, damodar kulkarni kdamodar2...@gmail.comwrote:
Hello,
The word combinator is used several times in the Haskell community. e.g.
parser combinator, combinator library etc.
Is it exactly the same term that is used in the combinatory logic ?
A combinator is a
Jason Dagit dag...@gmail.com writes:
Where can I find a formal and precise definition of the term
combinator,
A function that uses nothing but its arguments.
as a term used by the Haskell community to describe something?
I find that Haskellers often use combinator to mean a
21 matches
Mail list logo
