On Sun, Mar 14, 2010 at 12:26 PM, michael rice nowg...@yahoo.com wrote:
Is there a library function that will create two lists from one based on a
predicate, one list for all elements that satisfy the predicate and one for
all that do not? Don't want to reinvent the wheel.
Michael
On Sun, May 2, 2010 at 9:24 PM, Ivan Miljenovic
ivan.miljeno...@gmail.com wrote:
On 3 May 2010 14:17, aditya siram aditya.si...@gmail.com wrote:
I'm a little confused about this too. I've seen many functions defined like:
f x = (\s - ...)
which is a partial function because it returns a
One issue that comes up is that when you fork a package, data can no
longer be freely exchanged between libraries using the original
package's datatypes and libraries using the forked package's
datatypes. Something that might help here is the concept of
extension or friend packages or modules:
On Wed, Aug 4, 2010 at 9:21 AM, Henning Thielemann
schlepp...@henning-thielemann.de wrote:
Ivan Lazar Miljenovic schrieb:
Yitzchak Gale g...@sefer.org writes:
While useful, I think its ubiquity to simplicity ratio is not
high enough to justify either depending on MissingH
just for that, or
I think you're looking for Data.List.isInfixOf.
Alex
On Thu, Apr 24, 2008 at 7:40 PM, Dan Weston [EMAIL PROTECTED] wrote:
cetin tozkoparan wrote:
I wrote this code and Can it be less?
[2,4,5] list is sub list of [3,7,*2,4,5*,9] list and return True but not
of [3,7,*4,2,5*,9] list ; return
On Fri, Oct 9, 2009 at 4:25 PM, David Menendez d...@zednenem.com wrote:
On Fri, Oct 9, 2009 at 6:47 PM, staafmeister g.c.stave...@uu.nl wrote:
Daniel Peebles wrote:
I vaguely remember on IRC someone pointing out that the Parsec monad
broke one of the laws. I think return _|_ x === _|_ which
On Mon, Oct 26, 2009 at 12:52 AM, Michael Mossey m...@alumni.caltech.edu
wrote:
Before I ask my main question, incidentally has anyone noticed that the GHCI
prompt, on Windows XP, now has auto-completion! (since 6.10) Awesome!
I'm trying to install System.Console.Readline on Windows XP. I
The type of liftA2 :: Applicative f =(a - b - c) - f a - f b - f
c. Thus, the type of liftA2 (==) :: (Eq b, Applicative f) = f b - f
b - f Bool. In your case, f :: a - b, so liftA2 (==) :: (Eq b) = (a
- b) - (a - b) - (a - Bool). (==) takes two arguments, so you're
left with the type (liftA2 (==))
On Sun, Nov 29, 2009 at 5:37 AM, Duncan Coutts
duncan.cou...@googlemail.com wrote:
On Thu, 2009-11-26 at 16:40 -0500, David Menendez wrote:
The problem with this solution is that it doesn't scale. If we have M
packages providing types and N packages providing classes, then we
need M*N
On Sun, Nov 29, 2009 at 4:41 PM, Duncan Coutts
duncan.cou...@googlemail.com wrote:
On Sun, 2009-11-29 at 09:55 -0800, Alexander Dunlap wrote:
On Sun, Nov 29, 2009 at 5:37 AM, Duncan Coutts
duncan.cou...@googlemail.com wrote:
On Thu, 2009-11-26 at 16:40 -0500, David Menendez wrote
On Sat, Dec 5, 2009 at 3:00 PM, Michael Snoyman mich...@snoyman.com wrote:
On Sun, Dec 6, 2009 at 12:55 AM, Henning Thielemann
lemm...@henning-thielemann.de wrote:
On Sun, 6 Dec 2009, Michael Snoyman wrote:
I think there are plenty of examples like web servers. A text editor with
plugins?
On Sun, Dec 6, 2009 at 10:40 PM, Alexander Dunlap
alexander.dun...@gmail.com wrote:
On Sat, Dec 5, 2009 at 3:00 PM, Michael Snoyman mich...@snoyman.com wrote:
On Sun, Dec 6, 2009 at 12:55 AM, Henning Thielemann
lemm...@henning-thielemann.de wrote:
On Sun, 6 Dec 2009, Michael Snoyman wrote
On Tue, Dec 29, 2009 at 11:34 AM, Gregory Propf gregorypr...@yahoo.com wrote:
I'm trying out the dynamic linking in GHC 6.12 and getting this message a lot
for different libraries. I assume I need to rebuild them with different ghc
options in the cabal files and have tried -shared, -dynamic
On Tue, Dec 29, 2009 at 11:52 PM, Jason Dusek jason.du...@gmail.com wrote:
HPath is a command line utility to grab the Haskell source
for a given identifier:
:; dist/build/hpath/hpath HPath.Path.parse 2/dev/null
parse :: String - Either ParseError Path
parse s =
On Wed, Dec 30, 2009 at 8:39 PM, Peter Green kinch1...@me.com wrote:
I'm a Haskell neophyte, so may be missing something obvious in the problem
outlined below. I'm fairly proficient in Python + have some limited
experience in OCaml and F#, so know just enough to be be dangerous, but not
nearly
On Wed, Dec 30, 2009 at 5:52 PM, Edward Z. Yang ezy...@mit.edu wrote:
Hello all,
I am currently playing with the new cadre of failure libraries, and I'm
trying to figure out how to use the monadic version of Failure while
also getting the Try typeclass, which appears to be the standardized
On Wed, Dec 30, 2009 at 10:54 PM, Edward Z. Yang ezy...@mit.edu wrote:
Excerpts from Michael Snoyman's message of Thu Dec 31 00:43:52 -0500 2009:
What version of the packages are you using? Can you give the output of:
ghc-pkg list|grep failure
Sure thing:
(control-monad-failure-0.4),
On Tue, Mar 2, 2010 at 9:06 PM, Tom Hawkins tomahawk...@gmail.com wrote:
How do I track down an reference to an undefined value? My program
must not be using a library correctly because the program makes no
direct use of 'undefined'. Running with +RTS -xc yields:
GHC.Err.CAFTest:
On Sun, Aug 8, 2010 at 4:00 AM, Michael Snoyman mich...@snoyman.com wrote:
On Sun, Aug 8, 2010 at 1:03 PM, Tim Matthews tim.matthe...@gmail.com
wrote:
On Sun, Aug 8, 2010 at 9:20 PM, Michael Snoyman mich...@snoyman.com
wrote:
Quick update: I'm including the Stylish code in the hamlet
On Mon, Nov 29, 2010 at 2:48 PM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
On 30 November 2010 03:46, Joris Putcuyps joris.putcu...@gmail.com wrote:
Hello
Could it be done and would it be interesting, building 'ghc' using
cabal?
* 'lhc' does it
* Use 'cabal-rpm' and
On Sun, Dec 5, 2010 at 10:04 PM, Antoine Latter aslat...@gmail.com wrote:
Hi Haskell,
I've recently created the 'smallstring' package[1] and put it on
Hackage. The goal was to create a string-like type with as little
memory overhead as possible, and to have equality and comparison
operations
It would also be nice if you could plug it into the hierarchical
module system somewhere, perhaps renaming the module to
Data.Algorithm.RungeKutta or Numeric.RungeKutta or
Math.RungeKutta. This is pretty much the standard practice now, I
think.
Alex
On Sun, Apr 19, 2009 at 4:04 PM, Uwe
On Tue, Apr 21, 2009 at 8:34 PM, Richard O'Keefe o...@cs.otago.ac.nz wrote:
On 21 Apr 2009, at 7:39 pm, Jason Dagit wrote:
Not really. Obviously some programs use the feature, but let us
restrict to interesting programs that have been shared with the world
and have some potential to receive
On Sat, May 9, 2009 at 12:31 PM, michael rice nowg...@yahoo.com wrote:
Why doesn't this work?
Michael
data Maybe a = Nothing | Just a
instance Monad Maybe where
return = Just
fail = Nothing
Nothing = f = Nothing
(Just x) = f = f x
On Tue, May 12, 2009 at 9:59 AM, applebiz89 applebi...@hotmail.com wrote:
I have compiled each function independently and they have compiled the only
problem is the main function..
I keep getting the error 'films not defined' and I am not sure why
[code]
type Title = String
type Director
On Wed, May 13, 2009 at 12:54 AM, Serge LE HUITOUZE
slehuito...@telisma.com wrote:
Hi there,
I fail to build text-icu-0.1 on Windows, and would appreciate some help...
Thanks in advance!
Let me describe what I've done so for, and what results I got:
First, I got a version of ICU on my
On Thu, May 14, 2009 at 10:25 AM, Bryan O'Sullivan b...@serpentine.com wrote:
On Thu, May 14, 2009 at 10:18 AM, Bryan O'Sullivan b...@serpentine.com
wrote:
If one of you has the time to dig into this and send a patch that corrects
the problem, I'd welcome the help. As I'm sure you can tell, I
You need to include the containers package in your cabal file.
Alex
On Sat, May 16, 2009 at 4:44 PM, Vasili I. Galchin vigalc...@gmail.com wrote:
Yevgeni,
I am specifying base as a Cabal dependency ... dumb question ... I
have forgotten whether I need to import Data.Map also?
Vasili
, 2009 at 6:57 PM, Alexander Dunlap
alexander.dun...@gmail.com wrote:
You need to include the containers package in your cabal file.
Alex
On Sat, May 16, 2009 at 4:44 PM, Vasili I. Galchin vigalc...@gmail.com
wrote:
Yevgeni,
I am specifying base as a Cabal dependency ... dumb question
Since those types come out of the time library, and that library's
version *has* been bumped (I assume), couldn't you use Cabal to
condition on the version of the time library to determine whether or
not to have CPP set a -DTYPEABLE_IN_TIME flag, and then #ifdef out
your versions of the instances?
I believe you need to capitalize it correctly: HUnit.
Alex
On Thu, May 21, 2009 at 8:52 PM, Vasili I. Galchin vigalc...@gmail.com wrote:
my bad ... what about:
vigalc...@ubuntu:~/FTP/Haskell/Swish-0.2.1$ cabal configure
Configuring swish-0.2.1...
cabal: At least the following dependencies
On Sat, May 23, 2009 at 9:09 AM, Ian Lynagh ig...@earth.li wrote:
On Sat, Apr 25, 2009 at 11:18:43AM -0700, Alexander Dunlap wrote:
In the extensible exceptions paper[1], which I believe is the guide
behind the current Control.Exception in GHC 6.10, a SomeIOException
type is discussed so
On Sat, May 23, 2009 at 11:34 AM, Max Rabkin max.rab...@gmail.com wrote:
On Sat, May 23, 2009 at 7:31 PM, Mario Blažević mblaze...@stilo.com wrote:
Does anybody know of a pragma or another way to make a function *non-strict*
even
if it does always evaluate its argument? In other words, is
On Wed, May 27, 2009 at 3:24 PM, Bulat Ziganshin
bulat.zigans...@gmail.com wrote:
Hello Max,
Thursday, May 28, 2009, 2:14:19 AM, you wrote:
I absolutely agree about expected/inferred. I always forget which is
which, because I can figure both could apply to each.
That's actually true for me
On Sat, Jun 20, 2009 at 8:29 AM, Andrew Coppin
andrewcop...@btinternet.com wrote:
OK, so here's an interesting problem...
I've been coding away all day, but now my program is doing something slightly
weird. For a specific input, it summarily terminates. The registered
exception handler
On Tue, Jun 30, 2009 at 11:24 PM, Ketil Maldeke...@malde.org wrote:
You know, this might be the right time to start expanding our
vocabulary beyond seven bits. Since we're likely to keep mappend
around as an alias for some time, people would have a grace period to
adjust.
How about U+2295
On Wed, Jul 1, 2009 at 11:26 AM, Ross Patersonr...@soi.city.ac.uk wrote:
On Wed, Jul 01, 2009 at 10:55:39AM -0700, Bryan O'Sullivan wrote:
Okay, here's a tentative plan that will help to figure out the answer. I'll
build a fiddled base package that rewires the Monoid class to have (++) be
the
On Wed, Jul 1, 2009 at 10:11 PM, David Menendezd...@zednenem.com wrote:
In Wed, Jul 1, 2009 at 3:38 PM, Thomas Schillingnomin...@googlemail.com
wrote:
2009/7/1 David Leimbach leim...@gmail.com
Just because the compiler can figure out what I mean because it has a great
type system, I might
On Thu, Jul 2, 2009 at 3:36 AM, Jon Fairbairnjon.fairba...@cl.cam.ac.uk wrote:
Dan Doel dan.d...@gmail.com writes:
There was talk of adding a readMaybe a while ago, but apparently it
never happened.
As it is, you can use reads, read s becomes:
case reads s of
[(a, rest)] | all
swap :: Array (Int, Int) a - [Int] - Array (Int, Int) a
The lowercase a means that that type variable is polymorphic, i.e.
it can be any type.
Alex
On Thu, Jul 2, 2009 at 8:05 PM, Fernan Bolandofernanbola...@mailc.net wrote:
Hi
I have a function that swaps rows of an array of double
swap
On Fri, Jul 3, 2009 at 6:45 PM, John Kynewho...@gmail.com wrote:
Hi,
Currently I'm pretty printing code by building arrays of strings and calling
indent. For example:
instance JavaPrintableNamed AST.EnumeratedType where
javaLinesNamed parentName (AST.EnumeratedType memberDefinitions) =
On Fri, Jul 3, 2009 at 10:17 PM, Jason Dusekjason.du...@gmail.com wrote:
2009/07/03 George Pollard por...@porg.es:
This discussion points to a wider issue: at some stage we
should look at pulling all the nice new stuff into Haskell
prelude. I'm looking at you, Data.Foldable,Traversable.
On Sun, Jul 5, 2009 at 7:46 PM, Uwe Hollerbachuhollerb...@gmail.com wrote:
On 7/5/09, Paul L nine...@gmail.com wrote:
Previously you had lastOrNil taking m [a] as input, presumably
generated by mapM. So mapM is actually building an entire list before
it returns the argument for you to call
On Sun, Jul 26, 2009 at 6:12 PM, Peter Gammiepete...@gmail.com wrote:
Hello,
Mark and I would like to announce our test harness, which has features
complementary to existing harnesses.
TBC provides two main features:
- It attempts to compile and run all tests, even if some do not compile or
On Mon, Aug 3, 2009 at 4:44 PM, Don Stewartd...@galois.com wrote:
Following Simon M's advice, I look over the typical batteries
categories, using Python as input:
http://docs.python.org/library/index.html
The following things were missing from the current Platform. There are many.
How
On Wed, Aug 19, 2009 at 11:08 AM, Iain Barnettiainsp...@gmail.com wrote:
2009/8/19 David Leimbach leim...@gmail.com
Interesting... GHCI bug? Didn't the readline dependency go away not too
long ago? Could it be related?
I just tried this
Prelude putStrLn \£
ghc: panic! (the 'impossible'
On Sat, Aug 22, 2009 at 4:36 PM, Diego Souzadso...@bitforest.org wrote:
Hi all,
I wrote a small library in haskell do deal with oauth authentication. It
turns out it is my first library in haskell as well. As I'm beginner in
haskell, I'm asking for a review of someone more
On Sun, Aug 23, 2009 at 9:25 AM, Diego Souzadso...@bitforest.org wrote:
Hi Alex,
- In the Token datatype, you can automatically create the accessor
functions (oath_token, etc.) by using named fields:
I though about that too and I was not sure about what to do. The reason
I didn't use it is
On Fri, Aug 28, 2009 at 6:01 AM, Mitarmmi...@gmail.com wrote:
Hi!
Ups, missed save button and pressed send. ;-)
So I am not really sure if this is correct term for it but I am open
to better (search) terms.
I am wondering if it is possible to make a time constrained
computation. For
On Fri, Sep 4, 2009 at 6:08 PM, zaxisz_a...@163.com wrote:
I want to preload the module automatically when starting ghci. The module
located in ~/work directory contains some functions i use everyday.
Now i use an alias: alias ghci='ghci -i ~/money/Money.hs' which works fine.
However i feel
2009/9/6 Günther Schmidt gue.schm...@web.de:
Hi Edward,
I suppose you're right, I could have made this a little more detailed.
I keep reading in and processing data in an accumulating way, ie. lets say I
have a DB table (don't take this literally please, just an example), into
in-memory
On Mon, Sep 28, 2009 at 9:15 AM, Don Stewart d...@galois.com wrote:
tittoassini:
2009/9/28 Don Stewart d...@galois.com:
titto:
Hi,
I am looking for an unicode strings library, I found on hackage:
http://hackage.haskell.org/package/compact-string
I think
instance Bar (Ret c) = Foo c where
...
will do what you are asking.
Alex
On Tue, Sep 29, 2009 at 10:25 PM, DNM dnme...@gmail.com wrote:
Dan, thanks again for the response.
I changed my code to use type families to let each Cls instance (actually a
more complicated instance in my
Comments are started with -- followed by a character that is not a
symbol character. If it is followed by a symbol character (e.g. *)
then the -- plus the symbol (e.g. --*) parses as an operator
rather than a comment. p is not a symbol, so the -- starts a
comment.
For a precise description of
Oops...forgot the footnote. The lexical syntax part of the report is
at http://haskell.org/onlinereport/lexemes.html.
Alex
On Wed, Sep 30, 2009 at 7:56 PM, Alexander Dunlap
alexander.dun...@gmail.com wrote:
Comments are started with -- followed by a character that is not a
symbol character
On Wed, Aug 20, 2008 at 1:49 AM, Henning Thielemann
[EMAIL PROTECTED] wrote:
On Mon, 18 Aug 2008, [EMAIL PROTECTED] wrote:
G'day all.
Quoting Bjorn Buckwalter [EMAIL PROTECTED]:
I'd store the constants in a data structure along the lines of:
data AstroData a = AstroData
{ mu_Earth
On Sat, Aug 23, 2008 at 7:55 AM, Chris Eidhof [EMAIL PROTECTED] wrote:
Hey all,
I was playing around with type families, and I have a strange problem.
Suppose we have an alternative to an Either datatype:
data (:|:) a b = Inl a | Inr b
and a class Ix:
class Ix i where
type IxMap i ::
On Thu, 28 Aug 2008, Brandon S. Allbery KF8NH wrote:
On 2008 Aug 28, at 13:21, Tim Newsham wrote:
GNU ld supports pragmas which cause the use of certain functions to
output warnings at link time (try compiling a C program that uses gets()).
It occurs to me that this, either in compiler or
On Sun, Oct 5, 2008 at 5:38 PM, Chris Mears [EMAIL PROTECTED] wrote:
Jared Updike [EMAIL PROTECTED] writes:
Can someone else verify if this is a Mac/BSD only problem by compiling
and running my code? (Does the C executableworks work? Does the
Haskell executable noworks not work?) Can anyone
On Tue, Oct 14, 2008 at 2:14 PM, Jules Bean [EMAIL PROTECTED] wrote:
David Roundy wrote:
On Tue, Oct 14, 2008 at 05:20:35PM +0100, Jules Bean wrote:
Running a program on a different interpreter or compiler had better
not change its denotation, otherwise it [the denotation] is not much
use
On Sun, Oct 26, 2008 at 9:36 AM, John Lato [EMAIL PROTECTED] wrote:
Hello,
I was experimenting with using ghc-6.10.0.20081007 on a project, and
it seems that binary-0.4.3.1 has markedly worse performance in certain
cases. With the following simple test:
import qualified
On Sat, Nov 29, 2008 at 11:22 PM, Belka [EMAIL PROTECTED] wrote:
Hello!
START--
$ sudo runghc Setup configure --user
Configuring HCL-1.2...
$ sudo runghc Setup build
Preprocessing library HCL-1.2...
Preprocessing executables for
On Tue, Dec 2, 2008 at 2:56 AM, nml [EMAIL PROTECTED] wrote:
How about moving the messages for compiler to an additional file?
My motivation is that we often face a trade-off between
aesthetical(elegant code) and practical(efficient code).
Like pragmas and strictness annotations, I often feel
On Sat, Dec 6, 2008 at 12:22 PM, Paul Johnson [EMAIL PROTECTED] wrote:
I've just been looking at the Data.Map function fromListWith. According
to the docs, it has the type:
* fromListWith* :: Ord
http://www.haskell.org/ghc/docs/latest/html/libraries/base/Data-Ord.html#t%3AOrd
k = (a - a -
2008/12/11 Thomas DuBuisson thomas.dubuis...@gmail.com:
I see Lennart answered your question. For more fun you could also do this
with TypeFamilies, which are the new hot thing in Haskell type level logic.
Since you are just getting into MPTC, FunDeps etc I figured you'd be
interested.
On Sun, Dec 14, 2008 at 8:10 PM, Mario Blažević mblaze...@stilo.com wrote:
I'll take a swing at this one:
instance Container (Maybe x) [x] where
wrapper = isNothing
. . .
That isn't a sensible definition of 'wrapper', but I believe without
trying to compile it is completely legal. Which
2008/12/15 Mario Blazevic mblaze...@stilo.com:
Alexander Dunlap wrote:
On Sun, Dec 14, 2008 at 8:10 PM, Mario Blažević mblaze...@stilo.com
wrote:
I'll take a swing at this one:
instance Container (Maybe x) [x] where
wrapper = isNothing
. . .
That isn't a sensible definition of 'wrapper
2008/12/17 George Pollard por...@porg.es:
Might be interesting to try angling the ends of the stems to look
something more like the guillemot in [1]. I might try this in Gimp but
I'm no designer :P
Here is what I got; I think I chose the wrong yellow :) Based it on the
font Diavlo, which is
On Thu, Jan 1, 2009 at 12:36 AM, Max.cs max.cs.2...@googlemail.com wrote:
thanks!
suppose we have
data Tree a = Leaf a | Branch (Tree a) (Tree a) deriving Show
and how I could define a function foo :: a - Tree a that
foo a = Leaf a where a is not a type of Tree
foo b = b
Instead of declaring (/\) :: Eq a = Sentence a - Sentence a -
Sentence a, you could say (/\) :: Eq a - [a] - [a] - [a]. Then it
would work in both places. ([a] - [a] - [a] is a more general type
than [[Term a]] - [[Term a]] - [[Term a]], so functions with the
former type can be used in place of
On Wed, Feb 4, 2009 at 4:22 PM, Henning Thielemann
lemm...@henning-thielemann.de wrote:
On Wed, 4 Feb 2009, Simon Marlow wrote:
Ian Lynagh wrote:
On Fri, Jan 16, 2009 at 06:42:46AM -0800, eyal.lo...@gmail.com wrote:
Closed-unqualified import:
import Data.Map(Map, lookup)
One problem
On Thu, Feb 19, 2009 at 10:18 AM, Jamie Brandon jamii...@googlemail.com wrote:
Maybe this is of interest:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/gmap
The edison api is much more stable. The gmap api was already in place
when I started working on it but I would prefer to at
On Fri, Feb 20, 2009 at 6:40 AM, Achim Schneider bars...@web.de wrote:
wren ng thornton w...@freegeek.org wrote:
(b) allows
instances to have a fixed type for keys (like Data.Trie and
Data.IntMap have),
Can't we do some type magic to automagically select Data.Trie if the
key is a (strict)
On Sun, Feb 22, 2009 at 5:23 PM, Marc Weber marco-owe...@gmx.de wrote:
I usually use Data.Binary for serialization.
Sure. But you can't derive Data.Binary easily for NominalDiffTime.
That's the point. You can only do so by using toReal or by adding
data MyOwnPico = MyOwnPico only to create
I doubt there's an env variable, but you could do
$ alias ghc='ghc -Wall'
Alex
On Tue, Mar 3, 2009 at 7:07 PM, Erik de Castro Lopo
mle...@mega-nerd.com wrote:
Hi all,
Is there some environment variable I can set so that runghc can
be told to always use -Wall?
Cheers,
Erik
--
Hi all,
For a while now, we have had Data.ByteString[.Lazy][.Char8] for our
fast strings. Now we also have Data.Text, which does the same for
Unicode. These seem to be the standard for dealing with lists of bytes
and characters.
Now we also have the storablevector, uvector, and vector packages.
What problems are you encountering?
Alex
On Sun, Mar 8, 2009 at 11:58 AM, G?uenther Schmidt red...@fedoms.com wrote:
Hi Sterling,
sry, but I can't get it to work.
Günther
Sterling Clover schrieb:
You shouldn't need any extra tools for this. A combination of the
StandaloneDeriving and
of a larger data structure, this data structure
for instance also has a
newtype DischargeDate = DchrgDt LocalTime
deriving (Data,Typeable ...)
With my haskell work so far I was blessedly free of the need for deriving.
Until now ...
Günther
Alexander Dunlap schrieb:
What problems
On Mon, Mar 9, 2009 at 3:12 AM, Henning Thielemann
lemm...@henning-thielemann.de wrote:
On Mon, 9 Mar 2009, Claus Reinke wrote:
Given the close relationship between uvector and vector, it would
be very helpful if both package descriptions on hackage could point to a
common haskell wiki page,
2009/3/12 Mark Spezzano mark.spezz...@chariot.net.au:
Hi,
I was wondering what the best way to implement Natural number would be. Is
there a package which already does this?
Here are some options:
1. Don’t bother. Just use Integer.
2. Use the type
data Natural = Zero | Succ
Hi all,
I have noticed that in both Data.Binary and Data.Text (which is still
experimental, but still), the decode functions can be undefined
(i.e. bottom) if they encounter malformed input.
What is the preferred way to use these functions in a safe way? For
example, if one writes data to a disk
On Fri, Mar 20, 2009 at 3:24 AM, Colin Paul Adams
co...@colina.demon.co.uk wrote:
Bulat == Bulat Ziganshin bulat.zigans...@gmail.com writes:
Bulat Hello Colin,
Bulat Friday, March 20, 2009, 9:18:59 AM, you wrote:
How am I supposed to edit a page on the Haskell wiki?
If I click on
On Fri, Mar 20, 2009 at 7:31 AM, Colin Paul Adams
co...@colina.demon.co.uk wrote:
Alexander == Alexander Dunlap alexander.dun...@gmail.com writes:
Alexander On Fri, Mar 20, 2009 at 3:24 AM, Colin Paul Adams
Alexander co...@colina.demon.co.uk wrote:
Bulat == Bulat Ziganshin
On Fri, Mar 20, 2009 at 8:07 AM, Colin Paul Adams
co...@colina.demon.co.uk wrote:
Alexander == Alexander Dunlap alexander.dun...@gmail.com writes:
What Editing tab? -- Colin Adams Preston Lancashire
It's on the left-hand side of the page, at least on my screen. I guess
On Sun, Mar 15, 2009 at 9:13 PM, Bryan O'Sullivan b...@serpentine.com wrote:
On Sun, Mar 15, 2009 at 8:40 PM, Alexander Dunlap
alexander.dun...@gmail.com wrote:
I have noticed that in both Data.Binary and Data.Text (which is still
experimental, but still), the decode functions can
On Thu, Mar 26, 2009 at 5:23 PM, wren ng thornton w...@freegeek.org wrote:
Jules Bean wrote:
wren ng thornton wrote:
I have long been disappointed by a number of `error`s which shouldn't
be. For example, the fact that `head` and `div` are not total strikes me
as a (solvable) weakness of
On Mon, Apr 6, 2009 at 8:53 AM, Paul Keir pk...@dcs.gla.ac.uk wrote:
module Main where
data (:%^) a b = a :%^ b deriving (Show)
main = do
print $ 18 :%^ (Just 99)
print $ (,) 9 10
print $ 9 , 10
The last line in the code above causes a compile error.
Why does infix
On 13 August 2011 08:56, Tristan Ravitch travi...@cs.wisc.edu wrote:
I've wanted a slightly fancier status bar than xmobar for a while, so
I finally made one. It uses gtk2hs and dbus extensively, so if you
hate either of those things it probably isn't for you. Being written
in gtk, though,
On 14 August 2011 14:51, Tristan Ravitch travi...@cs.wisc.edu wrote:
On Sun, Aug 14, 2011 at 02:45:24PM -0700, Alexander Dunlap wrote:
I apologize if I'm missing something obvious here, but when I try to
run taffybar I get
Launching custom binary /home/alex/.cache/taffybar/taffybar-linux
specify a behavior for
equal values, I could guess that it was just an oversight or that it
was considered unimportant. But maybe someone more knowledgeable will
correct me.
Alexander Dunlap
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
90 matches
Mail list logo
