On Fri, 27 Mar 2009, Jason Dusek wrote:
2009/03/27 John Lato jwl...@gmail.com:
I could follow the rest of this, but I don't understand why
'head' is necessary. Couldn't you always replace it with a
case statement, with undefined on [] if necessary?
How would that be any different from
On Thu, 26 Mar 2009, wren ng thornton wrote:
Thomas Hartman wrote:
Luke, does your explanation to Guenther have anything to do with
coinduction? -- the property that a producer gives a little bit of
output at each step of recursion, which a consumer can than crunch in
a lazy way?
It has
Most breakage caused by new HTTP package is due to the renaming from
Response to Response_String and Request to Request_String. I think it was
not a good idea to do that. There could have well be two types named
Response from different modules, one with a type parameter and the other
one
On Thu, 26 Mar 2009, Jules Bean wrote:
There are programming styles which avoid using 'head'. You are free to use
those if you don't like it. I myself am content to use 'head' on lists which
I know are guaranteed to be non-empty.
Since I became aware that viewl (Data.Sequence) and uncons
On Thu, 26 Mar 2009, Xiao-Yong Jin wrote:
So I have another question. Is the following function safe
and legitimate?
safeDiv :: (Exception e, Integral a) =
a - a - Either e a
safeDiv x y = unsafePerformIO . try . evaluate $ div x y
I believe it should be okay to use this
On Wed, 25 Mar 2009, wren ng thornton wrote:
Extensible exceptions are impressive, but the existence of exceptions
outside of type annotations says something about purity.
Did I already promote explicit-exceptions package? :-)
___
Haskell-Cafe
On Thu, 26 Mar 2009, Heinrich Apfelmus wrote:
Luke Palmer wrote:
Yeah, make a trie. Here's a quick example.
Nice!
There was a thread about this question a few years ago, with some very
interesting developments like the blueprint technique by Bertram
Felgenhauer.
On Wed, 25 Mar 2009, Jonathan Cast wrote:
On Wed, 2009-03-25 at 07:39 -0400, Xiao-Yong Jin wrote:
Could you elaborate more about why this kind of breakage
wouldn't happen if 'try' is used in an IO monad as intended?
It would. But it would happen in IO, which is allowed to be
On Tue, 24 Mar 2009, Xiao-Yong Jin wrote:
invMat :: Matrix - Matrix
You won't be able to invert all the matrix, mathematically.
And computationally, even a larger set of matrix might fail
to be inverted because of the finite precision. It is
relatively easier and more efficient to spot such
On Tue, 24 Mar 2009, Daniel Yokomizo wrote:
If we try the other approach, we need to express the totality of
invMat by restricting its domain, so we can add, for example, a
phantom type to Matrix to signal it is invertible. As you need to
construct the Matrix before trying to invert it you can
On Tue, 24 Mar 2009, Xiao-Yong Jin wrote:
Jake McArthur j...@pikewerks.com writes:
Xiao-Yong Jin wrote:
| The problem is that there will be many functions using such
| a function to invert a matrix, making this inversion
| function return Either/Maybe or packing it in a monad is
| just a big
On Tue, 24 Mar 2009, Eelco Lempsink wrote:
The results of the Haskell logo competition are in!
You can view them at
http://www.cs.cornell.edu/w8/~andru/cgi-perl/civs/results.pl?num_winners=1id=E_d21b0256a4fd5ed7algorithm=beatpath
Congratulations Jeff Wheeler!
Is there also a measure of
On Tue, 24 Mar 2009, Eelco Lempsink wrote:
The results of the Haskell logo competition are in!
You can view them at
http://www.cs.cornell.edu/w8/~andru/cgi-perl/civs/results.pl?num_winners=1id=E_d21b0256a4fd5ed7algorithm=beatpath
Congratulations Jeff Wheeler!
And ... please maintain the
On Tue, 24 Mar 2009, Xiao-Yong Jin wrote:
Thanks for all the replies. Now I understand more about
Exceptions and Errors. I guess all I need is to compose a
larger monad, after all. I need to learn how to make
two different stacks of monad transformers cooperate
seamlessly, though.
Until
On Mon, 23 Mar 2009, nicolas.pouillard wrote:
Excerpts from Henning Thielemann's message of Sun Mar 22 23:58:44 +0100 2009:
On Sun, 22 Mar 2009, nicolas.pouillard wrote:
It sounds like a nice idea, it would be great to have a straight-io package
to play a bit more with explicit exceptions
On Mon, 23 Mar 2009, nicolas.pouillard wrote:
Excerpts from Henning Thielemann's message of Mon Mar 23 11:06:20 +0100 2009:
Yes
Then what do you mean by lifting to LazyIO to SIO actions?
Do you mean
liftSIO :: SIO a - LazyIO.T a
which says that we only lift computations that explicitly
On Mon, 23 Mar 2009, Xiao-Yong Jin wrote:
Hi,
I just feel it is not comfortable to deal with exceptions
only within IO monad, so I defined
tryArith :: a - Either ArithException a
tryArith = unsafePerformIO . try . evaluate
and it works quite good as
map (tryArith . (div 5)) [2,1,0,5]
On Sun, 22 Mar 2009, nicolas.pouillard wrote:
Excerpts from Henning Thielemann's message of Sat Mar 21 22:27:08 +0100 2009:
Maybe you know of my packages lazy-io and explicit-exception which also
aim at lazy I/O and asynchronous exception handling.
I was indeed aware of these two packages
On Sun, 22 Mar 2009, nicolas.pouillard wrote:
It sounds like a nice idea, it would be great to have a straight-io package
to play a bit more with explicit exceptions in things like 'IO'.
Maybe I should then restrict lifting to LazyIO to SIO actions. That would
not make LazyIO safe, but
On Sun, 22 Mar 2009, Achim Schneider wrote:
Anonymous Anonymous temp.pub...@gmail.com wrote:
Hello,
I'm new to haskell, I'm wondering how can you write a function that
will do the following:
fromIntToString :: Int - String
this is a cast function to cast an Int to a String. I know such
On Fri, 20 Mar 2009, Nicolas Pouillard wrote:
Hi folks,
We have good news (nevertheless we hope) for all the lazy guys standing there.
Since their birth, lazy IOs have been a great way to modularly leverage all the
good things we have with *pure*, *lazy*, *Haskell* functions to the real world
On Fri, 20 Mar 2009, Jon Fairbairn wrote:
::Haskell
See the lamp in logo 33 at
http://www.haskell.org/logos/poll.html
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, 17 Mar 2009, Melanie_Green wrote:
What are the limitations of list comprehension. I want to use
listcomprehension to output the pattern below. So a mixture of a's and
newline characters. The part im stuck at is creating arguments in the
listcomprehension to stop at some point then
On Tue, 17 Mar 2009, John Meacham wrote:
May I recommend 'approval voting' as an alternative? It doesn't require
ordering, has nice theoretial properties, and is dead simple to
implement. everyone just votes yes on the ones they approve of, you add
up the numbers and the highest one wins.
On Mon, 16 Mar 2009, Peter Verswyvelen wrote:
The DSP package on Hackage seems to contain complex polynomial functions.
It seems these functions are completely independent of the other DSP functions,
so this
package could be split of?
The matrix stuff is also independent. If you split off
On Sun, 15 Mar 2009, Ryan Ingram wrote:
unsafeInterleaveIO allows embedding side effects into a pure
computation. This means you can potentially observe if some pure
value has been evaluated or not; the result of your code could change
depending how lazy/strict it is, which is very hard to
On Sun, 15 Mar 2009, Claus Reinke wrote:
import Data.IORef
import Control.Exception
main = do
r - newIORef 0
let v = undefined
handle (\(ErrorCall _)-print hireturn 42) $ case f v of
0 - return 0
n - return (n - 1)
y - readIORef r
print y
I don't see what this has to do
On Mon, 16 Mar 2009, Matthew Donadio wrote:
Thy polynomial and matrix libraries weren't really developed to be stand
alone libraries. I was developing some DSP libraries that required
polynomial and matrix math, so I implemented what I needed so I could test
the DSP. Both libraries work
Peter Verswyvelen schrieb:
ouch, I was confusing the mtl and transformers package...
so basically transformers is a better replacement for mtl?
or does mtl offer things transformers does not?
transformers and monad-fd are cleanly separated, transformers is Haskell
98 and monad-fd uses
On Fri, 13 Mar 2009, Mark Spezzano wrote:
1. Don’t bother. Just use Integer.
2. Use the type
data Natural = Zero | Succ !Natural
3. Use the following definition taken from the Gentle Introduction to Haskell
98
newtype Natural = MakeNatural Integer
This option looks like non-negative
On Sat, 14 Mar 2009, Martijn van Steenbergen wrote:
Henning Thielemann wrote:
Of course, style is a matter of taste. So there are as many good styles as
programmers and there won't be an official style guide, I'm afraid.
While that is true, it's no valid reason to not have a style guide
On Fri, 13 Mar 2009, Wolfgang Jeltsch wrote:
Am Freitag, 13. März 2009 09:21 schrieb Roman Cheplyaka:
* Alexander Dunlap alexander.dun...@gmail.com [2009-03-12 20:01:57-0700]
Also, a lot of functions just take
Integers so it would be more of a pain to use.
AFAIK there are very few
On Sat, 14 Mar 2009, Peter Verswyvelen wrote:
I was using the transformers but still had to implement the Applicative
instance of State
This package contains an applicative instance for StateT but not for State
In 'transformers' State is a type synonym for StateT Identity and thus
does not
On Fri, 13 Mar 2009, Benjamin L.Russell wrote:
Why not ask new users to identify letters in a random bitmapped image
of a string, as is commonly done?
I assume, because those images are
1) not accessible by blind people
2) can be decoded by spammers, since they know how the images are
On Mon, 9 Mar 2009, Alexander Dunlap wrote:
- uvector, storablevector and vector are all designed for dealing with
arrays. They *can* be used for characters/word8s but are not
specialized for that purpose, do not deal with Unicode at all, and are
probably worse at it. They are better for
On Tue, 10 Mar 2009, ariep wrote:
Problem instance
In my code, I use some monad transformers. I used to use the mtl package,
but I recently switched to the combination transformers/monads-tf
(mainly for the Applicative instances).
The same code also uses the haskeline library, for
On Tue, 10 Mar 2009, Manlio Perillo wrote:
After a quick search with Google, it seems that there is not yet an
official document for Style Guide for Haskell Code.
I was only able to found:
http://www.cs.caltech.edu/courses/cs11/material/haskell/misc/haskell_style_guide.html
On Tue, 10 Mar 2009, Conor McBride wrote:
Apologies for crossposting. Please forward this message
to individuals or lists who may be interested. In addition
to the recently advertised PhD position at Strathclyde on
Reusability and Dependent Types, I am delighted to
advertise the following PhD
On Wed, 11 Mar 2009, R J wrote:
foldl and foldr are defined as follows:
foldr :: (a - b - b) - b - [a] - b
foldr f e [] = e
foldr f e (x : xs) = f x (foldr f e xs)
foldl :: (b - a - b) - b - [a] - b
foldl f e [] = e
foldl f e (x
On Thu, 12 Mar 2009, Peter Verswyvelen wrote:
I think. Or is it defined in some other package?
The 'transformers' package has those instances.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Thu, 12 Mar 2009, Andrew Wagner wrote:
Can you expand on this a bit? I'm curious why you think this.
http://haskell.org/haskellwiki/Type_classes_are_for_reusability
We recently had a thread about that. I can't find it now.
___
Haskell-Cafe
How long will the Wiki account registration be disabled? Would it be
possible to ask a question, that real Haskellers could easily answer, but
a spambot cannot? E.g. What's Haskell's surname?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Sun, 8 Mar 2009, Felipe Lessa wrote:
On Sun, Mar 8, 2009 at 9:34 PM, Bjorn Buckwalter
bjorn.buckwal...@gmail.com wrote:
(For my current needs the formats accepted by read are sufficient,
but I want reasonable error handling (Maybe or Either) instead of an
exception on bad inputs.)
Why
On Sat, 7 Mar 2009, Gü?nther Schmidt wrote:
is the above mentioned book still *the* authority on the subject?
I bought the book, read about 10 pages and then put it back on the shelf. Um.
In my app I have to deal with 4 csv files, each between 5 - 10 mb, and some
static data.
I had put all
On Sat, 7 Mar 2009, Bryan O'Sullivan wrote:
On Sat, Mar 7, 2009 at 10:23 PM, Alexander Dunlap alexander.dun...@gmail.com
wrote:
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
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, starting out with the text
and link above, plus a link to the stream fusion paper (I
On Mon, 9 Mar 2009, Bulat Ziganshin wrote:
Hello Sebastian,
Monday, March 9, 2009, 1:08:50 PM, you wrote:
i think we should make 2-stage voting, like in F1
after 1st stage we will know which logos are most popular and
therefore are real candidates, so we can select among them
Sounds
On Sun, 8 Mar 2009, Trent W. Buck wrote:
Eric Kow ko...@darcs.net writes:
One of the darcs team members, Thorkil Naur, felt that in my enthusiasm I
was not being sufficiently forthright about darcs's shortcomings.
As for me, I tend to start any review with a list of all the problems I
have
On Sat, 7 Mar 2009, Duncan Coutts wrote:
On Fri, 2009-03-06 at 19:16 +, Chris Kuklewicz wrote:
Not likely.
I did define my own (private) class for regular expressions, to abstract over
String, the ByteStrings, and Seq Char. But it is used in one place and is a
wart that should be
On Fri, 6 Mar 2009, Ed McCaffrey wrote:
Hello,
I'm turning a project involving music into a startup, and I will be using
Haskell for most
and possibly all of it. I had an angel investor interested until the market
collapse forced
him to turn his focus away from new investments. Other
On Wed, 4 Mar 2009, John Lato wrote:
John A. De Goes schrieb:
Elsewhere, laziness can be a real boon, so I don't understand your
question, Why have laziness in Haskell at all?
As I have written, many libaries process their data lazily (or could be
changed to do so without altering their
John A. De Goes schrieb:
Elsewhere, laziness can be a real boon, so I don't understand your
question, Why have laziness in Haskell at all?
As I have written, many libaries process their data lazily (or could be
changed to do so without altering their interface) but their interface
can forbid
On Tue, 3 Mar 2009, Brandon S. Allbery KF8NH wrote:
On 2009 Mar 2, at 23:13, Andrew Hunter wrote:
a) Hide Prelude.() and define a simple that builds the AST term I want.
b) Come up with a new symbol for it that doesn't look totally awful.
I guess aesthetics differ; I'd use e.g. $$, where
On Tue, 3 Mar 2009, Peter Verswyvelen wrote:
Now, does a similar theory exist of functions that always have one
input and one output, but these inputs and outputs are *always*
tuples? Or maybe this does not make any sense?
I don't think one can forbid currying. It's just a question, whether
On Mon, 2 Mar 2009, John Lato wrote:
Hello,
I am not a super-geek (at least, not compared to others on this list),
but I'll take a try at this anyway. The benefits of iteratees mostly
depend on differences between lazy and strict IO (see ch. 7 of Real
World Haskell for more on this).
Maybe
On Wed, 25 Feb 2009, Luke Palmer wrote:
On Wed, Feb 25, 2009 at 10:38 AM, Dusan Kolar ko...@fit.vutbr.cz wrote:
I have a function a computation of which is quite expensive, it is
recursively
dependent on itself with respect to some other function values - we can
roughly
Is still someone on haskell.org ?
-- Forwarded message --
Date: Thu, 19 Feb 2009 21:40:08 +0100 (CET)
From: Henning Thielemann lemm...@henning-thielemann.de
To: f...@haskell.org
Subject: advancePtr for ForeignPtr
I want to have an advancePtr on ForeignPtr in order create
On Mon, 23 Feb 2009, Felipe Lessa wrote:
On Mon, Feb 23, 2009 at 10:12 AM, Henning Thielemann
lemm...@henning-thielemann.de wrote:
Is still someone on haskell.org ?
Sorry, I don't know :).
I meant f...@haskell.org
Do I have to use 'touchForeignPtr' as finalizer of the subarray's
On Fri, 20 Feb 2009, Louis Wasserman wrote:
Hmmm. That's probably a better framework to draw on for the general array
interface.
For a list of all such low-level arrays, see:
http://www.haskell.org/haskellwiki/Storable_Vector
StorableVectors can also be manipulated in ST
On Thu, 19 Feb 2009, Sterling Clover wrote:
Thanks for the update on plugins! I look forward to trying them out from the
GHC mainline at some point. I don't think that units as I envision them would
need to mess with the type system directly, but could be implemented simply
as a static
On Fri, 20 Feb 2009, Wolfgang Jeltsch wrote:
Am Freitag, 20. Februar 2009 00:38 schrieben Sie:
Wolfgang Jeltsch schrieb:
Am Donnerstag, 19. Februar 2009 00:17 schrieben Sie:
Do you mean this one: http://haskell.org/haskellwiki/Numeric_Prelude?
There is currently no code for this, is
Wolfgang Jeltsch schrieb:
Am Donnerstag, 19. Februar 2009 00:17 schrieben Sie:
Do you mean this one: http://haskell.org/haskellwiki/Numeric_Prelude?
There is currently no code for this, is there?
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/numeric-prelude
On Thu, 19 Feb 2009, Wolfgang Jeltsch wrote:
Am Donnerstag, 19. Februar 2009 00:17 schrieben Sie:
Do you mean this one: http://haskell.org/haskellwiki/Numeric_Prelude?
There is currently no code for this, is there?
???
On Tue, 17 Feb 2009, Sterling Clover wrote:
Something that hit me tonight: Last GSoC gave us GHC compiler plugins.
Never heard of it. Sometimes I thought it would be nice to modify or
extend GHCs error messages by libraries in order make they feel more like
domain specific languages. E.g.
On Tue, 17 Feb 2009, Wolfgang Jeltsch wrote:
Now, a package only for one class with one method seems like overkill.
However, it could serve as a start for a package of all kinds of algebraic
structures. So I called the package “algebra” and put it on Hackage.
So if someone wants to implement
On Tue, 17 Feb 2009, Okasaki, C. DR EECS wrote:
The discussion of randomly permuting a list comes up every few years. Here’s
what I wrote last time (2005):
... How about putting it on the Wiki?___
Haskell-Cafe mailing list
On Mon, 16 Feb 2009, Louis Wasserman wrote:
Overnight I had the following thought, which I think could work rather well.
The most basic
implementation of the idea is as follows:
class MonadST s m | m - s where
liftST :: ST s a - m a
instance MonadST s (ST s) where ...
instance MonadST s m
On Mon, 16 Feb 2009, Louis Wasserman wrote:
I just posted stateful-mtl and pqueue-mtl 1.0.2, making use of the new approach
to
single-threaded ST wrapping. I discovered while making the modifications to
both packages that
the MonadSTTrans type class was unnecessary, enabling a cleaner
Peter Verswyvelen schrieb:
I'm having trouble understanding the explanation of the meaning of the
signature of runST at
http://en.wikibooks.org/wiki/Haskell/Existentially_quantified_types
Is this one better
http://haskell.org/haskellwiki/Monad/ST ?
On Sun, 15 Feb 2009, Louis Wasserman wrote:
I follow. The primary issue, I'm sort of wildly inferring, is that use of STT
-- despite being
pretty much a State monad on the inside -- allows access to things like mutable
references?
I assume that ST must always be the most inner monad, like
On Sat, 14 Feb 2009, Daniel Fischer wrote:
Am Samstag, 14. Februar 2009 16:37 schrieb Heinrich Apfelmus:
For the full exposition, see
http://apfelmus.nfshost.com/random-permutations.html
Excellent work, thanks.
Interesting read.
Btw. a further development of the PFP library is also
Corey O'Connor wrote:
I released a new version of data-spacepart that resolved some of the
issues with the previous release. One issue I had was the previous
release used the version numbering scheme I use at work:
[date].[release] Which does not appear to work as well as the
traditional X.Y.Z
Daniel Kraft wrote:
Hi,
I noticed last year Haskell.org was a mentoring organization for
Google's Summer of Code, and I barely noticed some discussion about it
applying again this year :)
I participated for GCC in 2008 and would like to try again this year;
while I'm still active for GCC
I think the recent discussion about advanced markup for Haddock
documentation could yield a Summer of code project. I still like my
suggestion to use Haskell code as description for math formulas and I like
Wolfgang's idea to use an existing tool like Template Haskell for
conversion from
Daniel Kraft wrote:
Hi,
I just came across a problem like this: Suppose I've got two related
functions that do similar things, and I want to call them the same...
Like in:
foobar :: String - Int - Int
foobar :: Int - String - Int
(Bad example, but I hope you got the point.)
Robin Green wrote:
I think we can fairly safely discount the commercial relevance of any
language ranking which places LOGO so highly.
It may be that a lot of people *know* LOGO (or claim to know it), but
that does not mean that is used a lot for commercial programming.
If we discuss here
On Fri, 13 Feb 2009, Daniel Kraft wrote:
Henning Thielemann wrote:
DoCon?
hm, I've only read a little on their webpage; what I was thinking of was to
implement a very basic package just to do some symbolic integration or
equation solving to be embedded in some other calculation
On Fri, 13 Feb 2009, Achim Schneider wrote:
What about making a SoC out of the problem? A mathematical markup
language that is easily written as well as valid Haskell, executable
within reason, compilable into mathML (think backticks) and would
revolutionise the typeset quality of literate
On Fri, 13 Feb 2009, John A. De Goes wrote:
In any case, no one has really addressed the original poster's question: No,
name overloading is not possible in Haskell, and surprisingly, there are no
blocking technical issues why this must be the case.
Prefixing names with module names is good
On Mon, 9 Feb 2009, Edsko de Vries wrote:
Hi,
Is there a nice way to write
down :: Focus - [Focus]
down p = concat [downPar p, downNew p, downTrans p]
down = concat . sequence [downPar, downNew, downTrans]
given the Reader like Monad instance of ((-) a).
Wolfgang Jeltsch schrieb:
This reminds me of an idea which I had some time ago. The idea is to write
all
your documentation in Template Haskell, possibly using quasiquoting to
support Haddock-like syntax. Then you could write math as ordinary Haskell
expressions and embed these
Heinrich Apfelmus schrieb:
Henning Thielemann wrote:
I want for long to write math formulas in a paper in Haskell. Actually,
lhs2TeX can do such transformations but it is quite limited in handling
of parentheses and does not support more complicated transformations
(transforming prefix
Wolfgang Jeltsch wrote:
TeX is not so great for mathematics and especially not for conversion into
MathML (which would be needed for HTML output). The TeX math language
provides rather little semantic information. As input language for the
concrete software named TeX this is mostly okay since
Khudyakov Alexey wrote:
I think MathML is much less accessible than images. Yes, there are problems
with them but any browser is able to display them save for text based ones.
MathML on contrary doesn't have much support. According to wikipedia only
recent versions of gecko based browsers and
On Mon, 12 Jan 2009, Duncan Coutts wrote:
On Mon, 2009-01-12 at 15:06 +0100, Henning Thielemann wrote:
It has to be manually transformed into a version that is not recursive
at the top level:
map :: (a - b) - [a] - [b]
map f = go
where
go [] = []
go (x:xs) = f x : go xs
I have written a small overview, how mutually recursive modules are
currently supported and how they can be avoided:
http://haskell.org/haskellwiki/Mutually_recursive_modules
Please add information about other compilers and more ideas on breaking
cycles.
On Thu, 5 Feb 2009, Manlio Perillo wrote:
Yitzchak Gale ha scritto:
Ah, OK. Thanks. Now we have a well-defined problem. :)
Good :).
I have used this example to describe how to avoid big integers at all:
http://haskell.org/haskellwiki/Integers_too_big_for_floats
---BeginMessage---
Simon Peyton-Jones wrote:
| By the way: it is possible to use a private constructor (via some
| special GHC flag?).
| I would like to do a quick performance check using the existing
| fromRational specialization by constructing a Rational directly.
|
| I know that Haskell
---BeginMessage---
Don Stewart wrote:
andrewcoppin:
So we've got HAppS, Happstack, WASH, Turbinado, probably others... Does
anybody know how all these relate to each other? Where their strengths
and weaknesses lie?
A comparative analysis of the 10+ Haskell web frameworks would be
On Thu, 5 Feb 2009, Don Stewart wrote:
andrewcoppin:
Jochem Berndsen wrote:
The HAppS project has been abandoned, see
http://groups.google.com/group/HAppS/msg/d128331e213c1031 .
The Happstack project is intended to continue development. For more
details, see http://happstack.com/faq.html .
---BeginMessage---
Marc Weber wrote:
the cabal file:
flag bytestring
Default: False
Description: enable this to use Bytestrings everywhere instead of
strings
[... now libs and executables: ...]
if flag(bytestring)
cpp-options: -DUSE_BYTESTRING
No, it's a very
---BeginMessage---
Rafael Gustavo da Cunha Pereira Pinto wrote:
interesting to look at real matrix code that people have written and
think about what would be needed in a library to make it easier to
write.
--
Dan
What I miss most is a data structure with O(1) (amortized)
---BeginMessage---
Paulo Tanimoto wrote:
Pretty cool, thanks for releasing this into the wild. I remember
looking into this about a year ago. By the way, have you seen Matt's
DSP library?
http://haskelldsp.sourceforge.net/
He's got LU and others in there, if my memory serves me. The last
Yitzchak Gale schrieb:
Manlio Perillo wrote:
However there is still a *big* problem: it is inefficient.
Here is a Python version of the Chudnovsky algorithm [1] for computing Pi:
http://paste.pocoo.org/show/102800/
On my system it takes 10 seconds.
Here is an Haskell version:
Peter Verswyvelen schrieb:
3) hg addrem
this adds new files and removes deleted files from local repos.
forgetting to add files is a common problem, and is really tricky since
no record is made of these files, so if after a couple of versions if a
developer finds out a file was missing, the
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 with this style is that you can get lots of conflicts from
your VCS if you have multiple
Brent Yorgey schrieb:
I am very pleased to announce the 0.2 release of the diagrams package,
an embedded domain-specific language for creating simple graphics in a
compositional style. This release includes a number of significant
new features, including:
* support for arbitrary straight
$ ghc +RTS -M16m -c30 -RTS -e 'concat $ repeat bla'
This breaks down after a while, also if I increase the memory restriction:
...
ablablablablablablablablablablablablablablablablablablablablablaHeap exhausted;
Current maximum heap size is 15998976 bytes (15 Mb);
use `+RTS -Msize' to increase
On Tue, 27 Jan 2009, Jonathan Cast wrote:
To show that there's nothing wrong with concat per se, try this version
instead:
ghc +RTS -M16m -c30 -RTS -e 'print $ concat $ repeat bla'
This should print forever without any problems.
You are right, this works. My example was extracted from a
On Tue, 27 Jan 2009, Henning Thielemann wrote:
On Tue, 27 Jan 2009, Jonathan Cast wrote:
To show that there's nothing wrong with concat per se, try this version
instead:
ghc +RTS -M16m -c30 -RTS -e 'print $ concat $ repeat bla'
This should print forever without any problems.
You
801 - 900 of 2035 matches
Mail list logo
