Re: [Haskell-cafe] about logical computation

> > hi, friends > > I am a Haskell newbie however i like it very much. After starting > > learn haskell, i donot find the corresponding "&", "|" , "~", "<<", > > ">>" logical computation of C language. > > import Data.Bits > > just its exports: > Perhaps you might like a *bit* more documentation t

Re: [Haskell-cafe] broken link in documentation

> Sorry if I use the mailing list for this, but in the documentation of > Control.Monad.RWS (and the other Control.Monad.* modules), the link > http://www.cse.ogi.edu/~mpj/ is broken. > If you're trying to find the correct link, perhaps it's this: http://web.cecs.p

[Haskell-cafe] ANNOUNCE: Extensible and Modular Generics for the Masses (EMGM) 0.1

ith Ralf Hinze. It was extended with work by Bruno Oliveira and Andres Löh. More details of the library functionality were explored by Alexey Rodriguez. We are very grateful to all of these people for the foundation on which this library was built. The current authors and maintainers of EMGM are:

Re: [Haskell-cafe] packages and QuickCheck

> My tests are making use of a nice console test runner I wrote that > supports both HUnit and QuickCheck (and is extensible to other test > providers by the user): > http://hackage.haskell.org/cgi-bin/hackage-scripts/package/test-framework. > The description looks great! I might have to try it ou

Re: [Haskell-cafe] packages and QuickCheck

> Thanks a bunch for these tips. I haven't used the flags feature of cabal > before, and i don't seem to be able to get it right. > This is also my first time, so I'm not sure exactly what I'm doing right. ;) I have: > > Flag test > Description: Enable testing > Default: False > > And I

Re: [Haskell-cafe] packages and QuickCheck

> How do folks like to package up QuickCheck tests for their libraries? In >>> the main library? As a separate repo & package? Same repo & separate >>> package? Keeping tests with the tested code allows testing of non-exported >>> functionality, but can add quite a lot of clutter. >>> >> >> I h

Re: [Haskell-cafe] packages and QuickCheck

> How do folks like to package up QuickCheck tests for their libraries? In > the main library? As a separate repo & package? Same repo & separate > package? Keeping tests with the tested code allows testing of non-exported > functionality, but can add quite a lot of clutter. > I have QuickChec

Re: [Haskell-cafe] mailing list choices?

> The Yahoo mailing list server is notoriously unreliable and randomly drops > mails and/or drops people from lists because their email server was > temporarily refusing mails (4xx SMTP responses not 5xx). I also find the > Yahoo groups web interface absolutely awful; mailman's list archives aren't

Re: [Haskell-cafe] Reducing code for efficient ShowS

> > That's an interesting idea. It appears to use the same idea as ShowS, but > > more generally with lists and not just strings. > > The difference-list approach to solving the appending problem is classic. > There's a variant for unification-based logic languages as well. Both are > functional ta

Re: [Haskell-cafe] Reducing code for efficient ShowS

> Why not use the dlist library: > >http://hackage.haskell.org/cgi-bin/hackage-scripts/package/dlist > > With something like (untested code): > > > xs +++ ys = showsxs `append` showsys > > x .++ ys = showChar x `cons` showsys > > xs ++. y = showsxs `snoc` showChar y >

[Haskell-cafe] Reducing code for efficient ShowS

It happens very often that I want to convert a number of values to strings and concatenate those strings into one. No surprise there, of course. Well, I'd prefer to do it efficiently and with as little code as necessary. > {-# LANGUAGE TypeSynonymInstances #-} > module ShowsDemo where Let's say I

Re: [Haskell-cafe] Re: Research language vs. professional language

> >> > This concept of `day-to-day work' is a curious one. Haskell is not a > >> > mature language, and probably shouldn't ever be one. > >> > >> I see where you are coming from here, but I think that train has > >> already started and can't be stopped. > > > > Yeah, it's too late. Too many people

Re: [Haskell-cafe] Libraries of standard QuickCheck properties

> > This is an interesting thought. Has there been any work towards > collecting > > properties written with QuickCheck (or similar) into a reusable chunk of > > some form? > > Yes, it's in development, called 'checkers'. code.haskell.org/checkers > Great! I especially like the Char generators. T

[Haskell-cafe] Libraries of standard QuickCheck properties

This in response to a comment on a GHC ticket [1]. I thought it was interesting enough to warrant general discussion. Comment (by JeremyShaw): > > > Also, where does the H98 report say all instances of Eq must be > transitive, reflexive, symmetric, and antisymmetric? It just says "The Eq > clas

Re: [Haskell-cafe] What's in a name?

> Andrew Coppin wrote: > > Now both packages can be installed at once, but when I say "import > > Data.Hashtable", GHC has no way to know which one I mean. That doesn't > sound > > too clever to me... > I agree, Andrew. The hierarchical module approach depends on a global resource for allocating n

[Haskell-cafe] Is www.haskell.org down?

I can't reach www.haskell.org , and I'm having withdrawal issues. Sean ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Moving "forall" over type constructors

Hi, > I just found out that it *is* possible to implement the inside function, > > namely as follows: > > > > > inside :: forall t. ((forall a. Wrapper (t a))-> Wrapper (forall a. (t > > > a))) > > > inside x = Wrapper f > > > where f :: forall a. (t a) > > > f = unwrap x > > > u

<    1   2   3