Am Mittwoch 18 November 2009 08:56:26 schrieb Felipe Lessa:
On Tue, Nov 17, 2009 at 10:21:07PM -0800, Anatoly Yakovenko wrote:
Anyone else seeing a bunch of linker errors when trying to install
HipmunkPlayground?
Hmmm, no, I've never seen those errors before. Are you able to
compile any
On 17/11/2009 18:42, Brandon S. Allbery KF8NH wrote:
On Nov 17, 2009, at 11:36 , Bryan O'Sullivan wrote:
On Tue, Nov 17, 2009 at 3:00 AM, Simon Marlow marlo...@gmail.com
mailto:marlo...@gmail.com wrote:
I've just uploaded deepseq-1.0.0.0 to Hackage
On 17/11/2009 12:25, Nicolas Pouillard wrote:
Excerpts from Simon Marlow's message of Tue Nov 17 12:00:21 +0100 2009:
I've just uploaded deepseq-1.0.0.0 to Hackage
Great!
I'm wondering what is the need/purpose for DeepSeqIntegral and DeepSeqOrd?
I don't actually know, they were previously
On 18/11/2009 03:48, Dean Herington wrote:
At 11:00 AM + 11/17/09, Simon Marlow wrote:
I've just uploaded deepseq-1.0.0.0 to Hackage
http://hackage.haskell.org/package/deepseq
This provides a DeepSeq class with a deepseq method, equivalent to the
existing NFData/rnf in the parallel
Hello Simon,
Wednesday, November 18, 2009, 12:17:31 PM, you wrote:
You could argue that (a - b - b) is doing more than (a - ()),
if i correctly understand, we have two versions:
1) easier to use
2) more efficient
and one of them may be defined via another? how about providing both
versions,
Simon Marlow wrote:
I've just uploaded deepseq-1.0.0.0 to Hackage
http://hackage.haskell.org/package/deepseq
This provides a DeepSeq class with a deepseq method, equivalent to the
existing NFData/rnf in the parallel package. I'll be using this in a
newly revamped parallel package,
| Simon, have you given any thought to how this interacts with type system
| extensions, in particular with GADTs and type families? The proposal relies
| on being able to find the type of a term but it's not entirely clear to me
| what that means. Here is an example:
|
| foo :: F Int - Int
| foo
It's always tempting to spend a lot of time on syntax, but in this case it may
be justified. Syntactic brevity is a good part of the point of TDNR. And I'm
on a train which is a good time to argue about syntax.
Personally I think there are strong advantages to .:
* For record selectors,
On 18/11/2009, at 21:10, Simon Peyton-Jones wrote:
Yes I think it can, although you are right to point out that I said nothing
about type inference. One minor thing is that you've misunderstood the
proposal a bit. It ONLY springs into action when there's a dot. So you'd
have to write
CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS
ICFP 2010
15th ACM SIGPLAN International Conference on Functional Programming
September 27 - 29, 2010
Baltimore, Maryland
http://www.icfpconference.org/icfp2010
I wonder whether the Haskell community tryed to reproduce the study Lisp as an
alternative to Java, by Ron Garret / Erann Gat. However, since that study was
reproduced in almost every other language (with a fair amount of cheating going
on, I believe :-), I am sure that there is a Haskell
On 16/11/2009 16:29, Simon Marlow wrote:
Help us weed the GHC ticket database, and get a warm fuzzy feeling from
contributing to Haskell core technology!
There are currently ~750 tickets against GHC. Many of them have not been
looked at in months or years. Often when I go through old tickets I
On 16/11/2009 22:32, Michael Lesniak wrote:
Hello,
I'm also interested and find Roman's idea about a wiki-page for
tracking motivating.
So the idea we have is this: do an incremental sweep of the whole
database, starting from the oldest tickets. Check each one, and try to
make some progress
It looks quite neat to use the Maybe monoid here:
import Data.Monoid
searchList p = foldr (\x - if p x then mappend (Just [x]) else id) Nothing
but it seems that the Maybe Monoid instance keeps this strict. I
fiddled with this a bit, and came up with the following:
instance (Monoid m) =
Hi all,
I'd like to send a signal from the main thread to a forkOS-ed thread in
GHC. The former should use raiseSignal and the second should sit in
awaitSignal.
I figured that the posix functionality in the unix-2.3 library does not
cover this case.
I would have expected that
On Wed, Nov 18, 2009 at 2:03 PM, Gabor Greif ga...@mac.com wrote:
PS: I guess some of you will say, use condition variables.
But that won't answer my question :-)
Actually, I was going to say use throwTo.
Is there som reason you have to use the POSIX routines directly
instead of using native
Luke Palmer wrote:
It's very hard to tell what is going on without more details. If you
*at least* give the ghci session, and possibly the whole code (while
it might be too much to read, it is not to much to load and try
ourselves).
This looks like a monomorphism restriction, which shouldn't
I've just uploaded parallel-2.0.0.0 to Hackage. If you're using
Strategies at all, I'd advise updating to this version of the parallel
package. It's not completely API compatible, but if you're just using
the supplied Strategies such as parList, the changes should be
relatively minor.
The
On Wed, 2009-11-18 at 09:17 +, Simon Marlow wrote:
So the main difference is that with the current formulation of deepseq,
you need to explicitly force the result in order to use it, either with
a pattern match, another seq, or a pseq. If we used (a - b - b) then
the top-level forcing
| Each 'foo' gives a type instance for TDNR_foo, mapping the type of the first
| argument to the type of that foo.
|
| Hmm... GHC doesn't allow this:
|
| type instance TDNR_foo () = forall a. () - a - a
|
| IIUC this restriction is necessary to guarantee termination. Given your
analogy,
|
Hi.
The Unicode Standard (version 4.0, section 3.9, D31 - pag 76) says:
Because surrogate code points are not included in the set of Unicode
scalar values, UTF-32 code units in the range D800 .. DFFF are
ill-formed
However GHC does not reject this code units:
Prelude print '\xD800'
Hi everyone,
I'm pleased to announce the first pre-beta-candidate-release of the
LambdaCube 3D engine [1] and the bindings for the Bullet physics
library [2].
The packages are just a cabal-install away. You should be able to
install lambdacube-engine and lambdacube-examples right away. In order
On Nov 18, 3:43 pm, Simon Peyton-Jones simo...@microsoft.com wrote:
But anyway, the original TDNR thing is perfectly well defined. It might
occasionally be surprising. But that doesn't stop the OO folk from loving it.
Not only OO folks but I think anybody who works with many records
having
Hi,
I'm finally about to organize myself, somewhat.
And am going to use a wiki for it. Does there a good one exist that's
written in Haskell?
Günther
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
2009/11/18 Günther Schmidt gue.schm...@web.de:
Hi,
I'm finally about to organize myself, somewhat.
And am going to use a wiki for it. Does there a good one exist that's
written in Haskell?
Günther
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/gitit
2009/11/18 Günther Schmidt gue.schm...@web.de:
Hi,
I'm finally about to organize myself, somewhat.
And am going to use a wiki for it. Does there a good one exist that's
written in Haskell?
Günther
___
Haskell-Cafe mailing list
Enforcing a gap in the middle of the range of Char would be exceedingly
awkward to propagate through all of the libraries. Off the top of my head:
1.) Functions like succ and pred which currently work on Char as an
enumeration would have to jump over the gap, to be truly anal retentive
about the
Hi Deniz,
you're probably right, but I'm looking for a web-based solution so I could
access it from different machines / desktops. I'm doing work in about half
a dozen different VMs.
Günther
Am 18.11.2009, 18:17 Uhr, schrieb Deniz Dogan deniz.a.m.do...@gmail.com:
2009/11/18 Günther
===
CALL FOR PARTICIPATION
ACM SIGPLAN 2010 Workshop on
Partial Evaluation and Program Manipulation (PEPM'10)
Madrid, January 18-19, 2010
(Affiliated with
You know, another solution to the records problem, which is not quite
as convenient but much simpler (and has other applications) is to
allow local modules.
module Foo where
module Bar where
data Bar = Bar { x :: Int, y :: Int }
module Baz where
data Baz = Baz { x :: Int, y :: Int }
On Nov 18, 8:18 pm, Luke Palmer lrpal...@gmail.com wrote:
You know, another solution to the records problem, which is not quite
as convenient but much simpler (and has other applications) is to
allow local modules.
module Foo where
module Bar where
data Bar = Bar { x :: Int, y :: Int
On Wed, Nov 18, 2009 at 3:10 PM, levi greenspan.l...@googlemail.com wrote:
On Nov 18, 8:18 pm, Luke Palmer lrpal...@gmail.com wrote:
You know, another solution to the records problem, which is not quite
as convenient but much simpler (and has other applications) is to
allow local modules.
The proposal has this sentence, apparently in reference to using
qualified imports: This is sufficient, but it is just sufficiently
inconvenient that people don't use it much. Does this mean qualified
imports? I use them exclusively, and I'd love it if everyone else
used them too.
Anyway, a
On Wed, Nov 18, 2009 at 3:53 PM, Evan Laforge qdun...@gmail.com wrote:
The proposal has this sentence, apparently in reference to using
qualified imports: This is sufficient, but it is just sufficiently
inconvenient that people don't use it much. Does this mean qualified
imports? I use them
How about:
http://hackage.haskell.org/package/orchid
a simple, but nice wiki produced by one of our students Sebastiaan
Visser,
Doaitse Swierstra
On 18 nov 2009, at 18:14, Günther Schmidt wrote:
Hi,
I'm finally about to organize myself, somewhat.
And am going to use a wiki for it.
On Wed, Nov 18, 2009 at 4:12 PM, Edward Kmett ekm...@gmail.com wrote:
Qualified imports are some times problematic when you need to work with
classes from the module. You can't define a member of two instances from
different two modules that define classes with conflicting member names.
This
On Wed, Nov 18, 2009 at 7:43 AM, Ben Millwood hask...@benmachine.co.ukwrote:
It looks quite neat to use the Maybe monoid here:
import Data.Monoid
searchList p = foldr (\x - if p x then mappend (Just [x]) else id)
Nothing
but it seems that the Maybe Monoid instance keeps this strict. I
Thanks! Learn something new every day. =)
-Edward Kmett
On Wed, Nov 18, 2009 at 4:29 PM, David Menendez d...@zednenem.com wrote:
On Wed, Nov 18, 2009 at 4:12 PM, Edward Kmett ekm...@gmail.com wrote:
Qualified imports are some times problematic when you need to work with
classes from the
I love the new Eval Applicative!
Out of idle curiosity, can parListN be generalized to parTraverseN similar
to how parList was generalized to parTraverse? Similarly, parListChunk?
-Edward Kmett
On Wed, Nov 18, 2009 at 9:21 AM, Simon Marlow marlo...@gmail.com wrote:
I've just uploaded
Am 18.11.2009 um 14:15 schrieb Svein Ove Aas:
On Wed, Nov 18, 2009 at 2:03 PM, Gabor Greif ga...@mac.com wrote:
PS: I guess some of you will say, use condition variables.
But that won't answer my question :-)
Actually, I was going to say use throwTo.
Is there som reason you have to use the
If you haven't bought any of Knuth's fascicles yet, this is definitely
the one to get.
The Art of Computer Programming: Volume 4
Bitwise Tricks Techniques
Binary Decision Diagrams
Fascicle 1
Donald E. Knuth
2009
Describes basic broadword operations and an important class of data
structures
I can't compare it with Knuth's fascicle, but the FXT book (linked to
from http://www.jjj.de/fxt/) has a whole chapter on bit wizardry and
is another excellent resource along these lines.
On Wed, Nov 18, 2009 at 6:22 PM, Casey Hawthorne cas...@istar.ca wrote:
If you haven't bought any of Knuth's
Thank you for the URL.
On Wed, 18 Nov 2009 18:30:31 -0500, you wrote:
I can't compare it with Knuth's fascicle, but the FXT book (linked to
from http://www.jjj.de/fxt/) has a whole chapter on bit wizardry and
is another excellent resource along these lines.
On Wed, Nov 18, 2009 at 6:22 PM,
Levi Greenspan wrote:
What's the status of the TDNR proposal [1]? Personally I think it is a
very good idea and I'd like to see it in Haskell'/GHC rather sooner
than later. Working around the limitations of the current record
system is one of my biggest pain points in Haskell and TDNR would be a
Kapil Hari Paranjape schrieb:
Hello,
On Sat, 14 Nov 2009, Jaco van Iterson wrote:
Only installation with 'cabal install yi' in a Cygwin shell under MS Windows
XP ended in:
Yi\Prelude.hs:182:9:
Duplicate instance declarations:
instance Category Accessor.T -- Defined at
Ted Zlatanov schrieb:
On Mon, 16 Nov 2009 00:03:54 +0300 Eugene Kirpichov ekirpic...@gmail.com
wrote:
EK 2009/11/15 Michael Mossey m...@alumni.caltech.edu:
Can someone tell me if this is correct. I'm guessing that if I represent
two sets of integers by Word32 (where ith bit set means i is
Hello,
On Wed, Nov 18, 2009 at 02:21:54PM +, Simon Marlow wrote:
[...]
is now @a - a...@. This change helps to fix the space leak described
in \Runtime Support for Multicore Haskell\. The problem is that
the runtime will currently retain the memory referenced by all
sparks, until they
Am Donnerstag 19 November 2009 01:07:37 schrieb Henning Thielemann:
Kapil Hari Paranjape schrieb:
Hello,
On Sat, 14 Nov 2009, Jaco van Iterson wrote:
Only installation with 'cabal install yi' in a Cygwin shell under MS
Windows XP ended in:
Yi\Prelude.hs:182:9:
Duplicate instance
On Wed, Nov 18, 2009 at 8:15 PM, Daniel Fischer daniel.is.fisc...@web.dewrote:
Am Donnerstag 19 November 2009 01:07:37 schrieb Henning Thielemann:
Kapil Hari Paranjape schrieb:
Hello,
On Sat, 14 Nov 2009, Jaco van Iterson wrote:
Only installation with 'cabal install yi' in a Cygwin
Daniel Fischer schrieb:
Am Donnerstag 19 November 2009 01:07:37 schrieb Henning Thielemann:
Seems to be that the author defined an orphan instance - something one
should never do!
So what do you do if you need an instance ClassX TypeY but the author of the
package that
defines TypeY
Am Donnerstag 19 November 2009 03:03:09 schrieb Henning Thielemann:
Daniel Fischer schrieb:
Am Donnerstag 19 November 2009 01:07:37 schrieb Henning Thielemann:
Seems to be that the author defined an orphan instance - something one
should never do!
So what do you do if you need an
On Thu, 19 Nov 2009 01:13:23 +0100 Henning Thielemann
lemm...@henning-thielemann.de wrote:
HT Ted Zlatanov schrieb:
On Mon, 16 Nov 2009 00:03:54 +0300 Eugene Kirpichov ekirpic...@gmail.com
wrote:
EK 2009/11/15 Michael Mossey m...@alumni.caltech.edu:
Can someone tell me if this is
Am Donnerstag 19 November 2009 03:57:56 schrieb Ted Zlatanov:
On Thu, 19 Nov 2009 01:13:23 +0100 Henning Thielemann
lemm...@henning-thielemann.de wrote:
HT Ted Zlatanov schrieb:
On Mon, 16 Nov 2009 00:03:54 +0300 Eugene Kirpichov
ekirpic...@gmail.com wrote:
EK 2009/11/15 Michael Mossey
A good trick is to use NOINLINE and restricted module exports to ensure
changes in one module don't cause others to be recompiled. A common
idiom is something like.
module TypeAnalysis(typeAnalyze) where
where the module is a fairly large complicated beast, but it just has
the single entry point
Gabor Greif wrote:
Because I'd like to eventually send signals from outside (e.g. a shell)
too. This is in fact a stripped-down version of a real program written
in C
mainly to demonstrate how much easier it is to get the same functionality
in Haskell.
Much easier then to install a signal
Hi,
I want to set up a build that compiles fortran sources in addition to
the Haskell, and which maybe also eventually checks for the existence
of a library or two (specifically, LAPACK and BLAS). Does anyone here
have a suggestion for where I should be looking to figure out how to
do
56 matches
Mail list logo
