#2189: hSetBuffering stdin NoBuffering doesn't work on Windows
---+
Reporter: FalconNL|Owner: igloo
Type: merge | Status: new
Priority:
#3076: Make genericLength tail-recursive so it doesn't overflow stack
-+--
Reporter: Syzygies | Owner:
Type: run-time performance bug | Status: new
#3075: validation requires a tool that is not included in utils
-+--
Reporter: nr|Owner: igloo
Type: bug | Status: new
Priority: normal|Milestone:
#3077: 'make' fails in utils (6.11)
---+
Reporter: nr | Owner:
Type: bug | Status: new
Priority: normal | Component: Build System
Version: 6.11|
#2189: hSetBuffering stdin NoBuffering doesn't work on Windows
---+
Reporter: FalconNL|Owner: igloo
Type: merge | Status: closed
Priority:
#3078: Erroneous warnings for -XPatternGuards
---+
Reporter: guest | Owner:
Type: bug | Status: new
Priority: normal | Component: Compiler
Version:
Claus Reinke wrote:
its loop unroller on this guy haven't succeeded. -funroll-loops and
-funroll-all-loops doesn't touch it,
That's because the C produced by GHC doesn't look like a loop to GCC.
This can be fixed but given that we are moving away from -fvia-C
anyway, it probably isn't
Hi Colin,
On Thu, Feb 05, 2009 at 11:27:05AM +, Colin Paul Adams wrote:
I am getting messages:
Board_representation.hs:407:0: Unrecognised pragma
Board_representation.hs:442:0: Unrecognised pragma
Board_representation.hs:458:0: Unrecognised pragma
I looked into the documentation
That was one of my questions in the optimization and rewrite rules
thread: shouldn't -fvia-C be supported (as a non-default option)
for at least as long as the alternative isn't a clear win in all cases?
The trouble with supporting multiple backends is that the cost in terms of
testing and
The implementation I'm thinking of is basically trivial. You just add
the information gathered from the pragmas onto the Ids, then have a
dedicated core pass that looks at the pragmas and does it's
worker/wrapper thing. The technology to do peeling/unrolling is
trivial and there already examples
My preferred spec would be roughly
{-# NOINLINE f #-}
as now
{-# INLINE f #-}
works as now, which is for non-recursive f only (might in future
be taken as go-ahead for analysis-based recursion unfolding)
{-# INLINE f PEEL n #-}
inline calls *into* recursive f (called loop peeling
2009/3/6 o...@okmij.org:
As Amr Sabry aptly observed more than a decade ago discussions of
purity and referential transparency usually lead to confusion and
disagreement. His JFP paper provided the needed rigor and argued that
Haskell even _with regular file (stream) IO_ is pure. As was
On Thu, 2009-03-05 at 20:11 -0800, o...@okmij.org wrote:
Before one invokes an equational theory or says that both these
expressions are just integer subtraction, let me clarify the
question: are f1 and f2 at least weakly observationally equivalent?
That is, for any program
Hi,
It seems every time I look at hackage there is yet another stringy datatype.
For lots of apps, the particular stringy datatype you use matters for
performance but not algorithmic reasons. Perhaps this is a good time for
someone to propose a stringy class?
Matthew
Am Freitag, 6. März 2009 13:33 schrieb Matthew Pocock:
Hi,
It seems every time I look at hackage there is yet another stringy
datatype. For lots of apps, the particular stringy datatype you use matters
for performance but not algorithmic reasons. Perhaps this is a good time
for someone to
2009/3/6 Wolfgang Jeltsch g9ks1...@acme.softbase.org:
Am Freitag, 6. März 2009 13:33 schrieb Matthew Pocock:
Hi,
It seems every time I look at hackage there is yet another stringy
datatype. For lots of apps, the particular stringy datatype you use matters
for performance but not algorithmic
I'd be more interested in a kitchen-sink List class. ByteString,
ByteString.Lazy, Text, [a], and the pending Text.Lazy all support the basic
operations of lists of a particular type. It'd be a fairly huge dictionary
by the current API design of those however. Its just a reiteration of the
classic
Am Freitag, 6. März 2009 17:31 schrieben Sie:
What name would you suggest?
If we wouldn’t have to care about compatibility, I would name the class String
and drop the type alias String.
It’s hard to come up with a good name since String is already taken. However,
things like StringLike,
On Fri, Mar 6, 2009 at 12:05 PM, Wolfgang Jeltsch
g9ks1...@acme.softbase.org wrote:
Am Freitag, 6. März 2009 17:31 schrieben Sie:
What name would you suggest?
If we wouldn’t have to care about compatibility, I would name the class String
and drop the type alias String.
It’s hard to come up
2009/3/6 David Menendez d...@zednenem.com:
On Fri, Mar 6, 2009 at 12:05 PM, Wolfgang Jeltsch
g9ks1...@acme.softbase.org wrote:
Am Freitag, 6. März 2009 17:31 schrieben Sie:
What name would you suggest?
If we wouldn’t have to care about compatibility, I would name the class
String
and drop
FULLY-FUNDED DOCTORAL STUDENTSHIPS IN
DEPENDENTLY-TYPED PROGRAMMING
AT OXFORD AND STRATHCLYDE
A new EPSRC-funded project on Reusability and Dependent Types
has just started, as a collaboration between the Functional
Programming Laboratory at the University of Nottingham (Thorsten
Altenkirch), the
I'd be more interested in a kitchen-sink List class. ByteString,
ByteString.Lazy, Text, [a], and the pending Text.Lazy all support the basic
operations of lists of a particular type. It'd be a fairly huge dictionary
by the current API design of those however. Its just a reiteration of the
On 2009 Mar 6, at 11:13, Wolfgang Jeltsch wrote:
Am Freitag, 6. März 2009 13:33 schrieb Matthew Pocock:
It seems every time I look at hackage there is yet another stringy
datatype. For lots of apps, the particular stringy datatype you use
matters
for performance but not algorithmic reasons.
On 2009 Mar 6, at 12:24, David Menendez wrote:
How about CharSequence?
I'd be tempted on first sight to assume that's related to Data.Seq.
--
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allb...@kf8nh.com
system administrator [openafs,heimdal,too many hats] allb...@ece.cmu.edu
Sean Leather schrieb:
Like this?
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/ListLike
Indeed, a class StringLike is included there as well.
Why not take or improve that one?
Till
___
Haskell mailing list
Haskell@haskell.org
Matthew Pocock wrote:
It seems every time I look at hackage there is yet another stringy
datatype. For lots of apps, the particular stringy datatype you use
matters for performance but not algorithmic reasons. Perhaps this is a
good time for someone to propose a stringy class?
Not likely.
I
What about AString or AnyString?
-Original Message-
From: haskell-boun...@haskell.org [mailto:haskell-boun...@haskell.org]
On Behalf Of Chris Kuklewicz
Sent: Friday, March 06, 2009 8:17 PM
To: Matthew Pocock
Cc: haskell@haskell.org
Subject: Re: [Haskell] string type class
On Thursday 05 March 2009 11:48:33 pm Jonathan Cast wrote:
That is, for any program context C[] such that C[f1] is well-typed,
the program C[f2] must too be well-typed, and if one can observe the
result of C[f1] and of C[f2], the two observations must be identical.
Every time? For every
Two questions:
a) This chat server implementation doesn't actually close the connection
as a real one would need to do. If you use forever is there a way to end
the loop so as to end the connection?
b) In Section 5 of this paper:
http://www.cs.yale.edu/~hl293/download/leak.pdf
Comparing
Personally I would not use fix. I don't think it improves readability.
-- Lennart
2009/3/5 Daryoush Mehrtash dmehrt...@gmail.com:
In this chat server implementation
http://www.haskell.org/haskellwiki/Implement_a_chat_server
forkIO is used with fix as in:
reader - forkIO $ fix $
The voting system we'll use is the Condorcet Internet Voting
System (http://www.cs.cornell.edu/andru/civs.html
). The poll won't be public, but every subscriber to Haskell-Cafe
will get a (private) voting ballot by email.
I'll supervise the poll and make sure it's started, stopped and
Gleb Alexeyev wrote:
instance Eq a = Eq (CatList a) where
a == b = case (viewCL a, viewCL b) of
(Just (x, xs), Just (y, ys)) - x==y xs == ys
(Nothing, Nothing) - True
_- False
I just realized that my solution
On Fri, Mar 6, 2009 at 9:08 AM, Bayley, Alistair
alistair.bay...@invesco.com wrote:
The voting system we'll use is the Condorcet Internet Voting
System (http://www.cs.cornell.edu/andru/civs.html
). The poll won't be public, but every subscriber to Haskell-Cafe
will get a (private) voting
I'd love to hear about anything that I missed and/or that might
influence the voting process in a significant way. (There are
probably some people subscribed with multiple addresses,
but I'll be
using the subscriber list from yesterday, so signing up now
with lots of addresses won't
On Thu, 2009-03-05 at 13:08 +, Simon Marlow wrote:
Lennart Augustsson wrote:
I don't see any breaking of referential transparence in your code.
Every time you do an IO operation the result is basically
non-deterministic since you are talking to the outside world.
You're assuming the
Regarding hpysics, did anybody did some experiments with this? The blog
seems to be inactive since december 2008; has development ceased?
Do alternatives exist? Maybe good wrappers (hopefully pure...) around
existing engines?
Integrating hpysics with Grapefruit might be a good topic for the
On 6 mrt 2009, at 00:03, Achim Schneider wrote:
Eelco Lempsink ee...@lempsink.nl wrote:
The poll won't be public, but every subscriber to Haskell-Cafe
will get a (private) voting ballot by email.
What about us gmane users?
Good point! All of you can send me your email address (directly,
Hello Peter,
The backtraking in time to solve the collision problem you mentionned is
not, in my opinion, efficient.
From a previous life as an aerospace engineer, I remember that two other
solutions exist to handle contact or collision constraints, at least if 2nd
order diff. equations are used
2009/3/6 Daryoush Mehrtash dmehrt...@gmail.com:
Two questions:
a) This chat server implementation doesn't actually close the connection
as a real one would need to do. If you use forever is there a way to end
the loop so as to end the connection?
Yes, throw an exception and catch it from
I think you can achieve what you want but you need to use the correct
types for it. Remember that when you write:
getFilterMainStuff :: Deliverable a = FilePath - Interpreter (Path,
Filter a)
the proper way to read the signature is the caller of
getFilterMainStuff is entitled to pick the
Thanks for the info. With backtracking I actually meant the computation of
the exact collision time, and let (part of the simulation) only go that far,
so it's not really back tracking in the physics engine; does that
correspond to your 2nd proposal. I just got this from a physics
Peter Verswyvelen bugf...@gmail.com
wrote:
Integrating hpysics with Grapefruit might be a good topic for the
Hackaton, trying to make a simple game (e.g. Pong or Breakout)
Be sure to have more than two simultaneously moving collision objects
besides paddles in the specs, or it won't get close
Peter,
Backtracking: yes it is the computation of the exact collision time.
I gave 2 solutions that can be used in multi-body dynamics, in general (that
is, with 2nd order derivatives). I am not a game writing specialist but, if
I understand you, I would say that, in a game, we have 1st order
Sorry, my message was inadvertently sent - hit the wrong key - a gmail
feature
Peter,
Backtracking: yes it is the computation of the exact collision time.
I gave 2 solutions that can be used in multi-body dynamics, in general (that
is, with 2nd order derivatives). I am not a game writing
John Goerzen wrote:
Hi,
My google skills must be faulty, because I can't find much stuff on
migrating from QuickCheck 1.0 to 2.0.
I've got a number of questions:
What's the deal with Result and reason being in two different places
in QuickCheck with two different definitions?
All
Am Freitag, 6. März 2009 14:34 schrieb Daniel Bünzli:
without using recursive signal functions,
If this is because there's this limitation in the frp system you use
It is.
then better fix the system.
The system is Grapefruit, by the way. And I’m its developer, by the way. :-)
I have to
Am Freitag, 6. März 2009 17:51 schrieb Wolfgang Jeltsch:
By the way, the adress of the Grapefruit mailing list is
grapefr...@projects.haskell.org, not grapefr...@haskell.org.
Oh, this is really strange: I addressed my e-mail to
grapefr...@projects.haskell.org but the version arriving at the
Thanks so much, I think I understand. This definitely sounds like what I
want to do. I guess I've got some learning to do...
Thats why I love Haskell so much, every other day it gives me something
new to learn.
Thanks again,
/Joe
Daniel Gorín wrote:
I think you can achieve what you want
fft1976:
On Wed, Mar 4, 2009 at 5:03 PM, FFT fft1...@gmail.com wrote:
Are MPI bindings still the best way of using Haskell on Beowulf
clusters? It's my feeling that the bindings stagnated, or are they
just very mature?
What's the story with distributed memory multiprocessing? Are Haskell
On Thu, Mar 5, 2009 at 10:43 AM, FFT fft1...@gmail.com wrote:
Are MPI bindings still the best way of using Haskell on Beowulf
clusters? It's my feeling that the bindings stagnated, or are they
just very mature?
MPI itself hasn't changed in 14 years, so it's not exactly a moving target.
2009/3/6 Bryan O'Sullivan b...@serpentine.com
On Thu, Mar 5, 2009 at 10:43 AM, FFT fft1...@gmail.com wrote:
Are MPI bindings still the best way of using Haskell on Beowulf
clusters? It's my feeling that the bindings stagnated, or are they
just very mature?
MPI itself hasn't changed in
bos:
On Thu, Mar 5, 2009 at 10:43 AM, FFT fft1...@gmail.com wrote:
Are MPI bindings still the best way of using Haskell on Beowulf
clusters? It's my feeling that the bindings stagnated, or are they
just very mature?
MPI itself hasn't changed in 14 years, so it's not
On Fri, Mar 6, 2009 at 1:48 AM, Daryoush Mehrtash dmehrt...@gmail.comwrote:
Question: Do I need to worry about space leak if I am using the fix to
instead of the let?
If you need to worry about a space leak with fix, you need to worry about it
with let.
The reason arrows can tie the loop
* Peter Verswyvelen bugf...@gmail.com [2009-03-06 11:17:50+0100]
Regarding hpysics, did anybody did some experiments with this?
Nothing I'm aware of.
The blog
seems to be inactive since december 2008; has development ceased?
Sort of. One reason is that DPH does not seem to be ready for
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 investors I have spoken with want me to contact
Ed McCaffrey wrote:
Other investors I have spoken with want me to contact them again when
it is further developed;
That means no. See
http://blog.guykawasaki.com/2006/01/the_top_ten_lie.html
Paul.
___
Haskell-Cafe mailing list
On Fri, Mar 6, 2009 at 9:30 AM, Don Stewart d...@galois.com wrote:
http://haskell.org/haskellwiki/Applications_and_libraries/Concurrency_and_parallelism#Distributed_Haskell
These are all Haskell-derived languages, not libraries, right?
___
On Fri, 2009-03-06 at 19:16 +, Chris Kuklewicz wrote:
Matthew Pocock wrote:
It seems every time I look at hackage there is yet another stringy
datatype. For lots of apps, the particular stringy datatype you use
matters for performance but not algorithmic reasons. Perhaps this is a
On Thu, Mar 5, 2009 at 6:51 AM, Neil Mitchell ndmitch...@gmail.com wrote:
Hi Gwern,
I get String/Data.Binary issues too. My suggestion would be to change
your strings to ByteString's, serisalise, and then do the reverse
conversion when reading. Interestingly, a String and a ByteString have
On Thu, Mar 5, 2009 at 2:55 PM, Neil Mitchell ndmitch...@gmail.com wrote:
Avoid massive reductions in runtime while maintaining the same API?
I did move to using ByteString's internally for those bits later on,
but reading String's from Data.Binary with a ByteString+unpack went
much more
On Thu, Mar 05, 2009 at 03:43:22PM -0500, Thomas DuBuisson wrote:
getFileStatus, fileSize ...
Great, thanks.
BTW, Hoogle does not seem to know about
System.Posix.Files, though it did point me to System.IO.FileSize
which would also have served the purpose.
Yep, this was discussed in
Given the following (usual) definition of map:
map:: (a - b) - [a] - [b]
map f [] = []
map f (x : xs) = f x : map f xs
What's the type of map map?
GHCi's :t command reveals:
*Main :t map map
map map :: [a - b] - [[a] - [b]]
I'd be grateful if
2009/3/6 R J rj248...@hotmail.com
Given the following (usual) definition of map:
map:: (a - b) - [a] - [b]
What's the type of map map?
The definition is irrelevant, so I removed it.
To make it easier to reason about, I'm going to rename the second map to
map'. It
map :: (a - b) - [a] - [b]
map takes a function and transforms a list of a's to b's.
map succ [1,2,3]
== [succ 1, succ 2, succ 3]
== [2, 3, 4]
In general,
map f :: [a] - [b]
where a is domain-type of f and b is image-type of f (f :: a - b).
map map [x, y, z]
== [map x, map y, map z]
so, x,y,z
Gleb Alexeyev wrote:
Here's my attempt though it's not really different from using built-in
lists:
viewCL CatNil = Nothing
viewCL (Wrap a) = Just (a, CatNil)
viewCL (Cat a b) = case viewCL a of
Nothing - viewCL b
Just (x, xs) - Just (x, Cat xs b)
My
65 matches
Mail list logo
