#3554: ASSERT failed! file TcMType.lhs line 349
+---
Reporter: simonmar |Owner: chak
Type: bug | Status: new
Priority: normal
#3555: Vectorisation error with negative Double const
-+--
Reporter: ams | Owner:
Type: bug | Status: new
Priority: normal
#3555: Vectorisation error with negative Double const
---+
Reporter: ams| Owner:
Type: bug| Status: new
Priority: normal
#3555: Vectorisation error with negative Double const
---+
Reporter: ams| Owner:
Type: bug| Status: new
Priority: normal
#3555: Vectorisation error with negative Double const
---+
Reporter: ams| Owner:
Type: bug| Status: new
Priority: normal
#2965: GHC on OS X does not compile 64-bit
+---
Reporter: Axman6 |Owner: thoughtpolice
Type: feature request | Status: new
Priority: normal |Milestone:
#3550: Dynamic libraries don't work on Mac OS/X
+---
Reporter: StephenBlackheath|Owner:
StephenBlackheath
Type: bug |
#2965: GHC on OS X does not compile 64-bit
+---
Reporter: Axman6 |Owner: thoughtpolice
Type: feature request | Status: new
Priority: normal |Milestone:
[I just found out that there is a dedicated bugs email address so forwarding
the original message there.]
Hello,
I've created a small example of the program I have at this URL with the
output of -ddump-simpl:
http://hpaste.org/fastcgi/hpaste.fcgi/view?id=10109#a10109
Notice that on line 139, I
#3390: Upgrade the Windows build to use gcc 4.4.0
-+--
Reporter: simonmar |Owner:
Type: task | Status: new
Priority: normal|Milestone: 6.14.1
#3556: Build the bootstrapping ghc-pkg with ghc-cabal
---+
Reporter: igloo | Owner:
Type: task | Status: new
Priority: normal|
#3555: Vectorisation error with negative Double const
---+
Reporter: ams| Owner: rl
Type: bug| Status: new
Priority: normal
This is an updated version of my graph-theoretic static analysis tool
for Haskell, SourceGraph. This version is available from
http://hackage.haskell.org/package/SourceGraph-0.5.1.0 (now with docs on
the Hackage page!).
This version provides the ability to pass in a single Haskell source
file
Bas van Dijk wrote:
Comments and patches are highly welcome.
I tried to install on my Mac but bindings-common choked on:
cabal install bindings-common
Resolving dependencies...
cabal: Error: some packages failed to install:
bindings-common-1.1 failed while unpacking the package. The
Dear all,
After several years at the helm, I've decided to step down as editor
of the Monad.Reader.
I am happy to announce that Brent Yorgey will take over my role as
editor. I'd like to take this opportunity to thank Brent for helping
to keep the Monad.Reader alive. I'm sure he'll do a
---
This message is a literate Haskell file, hence:
{-# LANGUAGE GADTs#-} -- a matter of style only
import Control.Monad.State hiding (mapM)
import Control.Applicative
import Data.Traversable
import Data.Foldable
import
Am I correct in saying that the collection of widgets contains a
single widget type so far? ;-)
Technically, four; vertical and horizontal boxes, a text string
widget, and the List you mentioned. It only has a few types because I
was just releasing early. I'm going to start using this in a
# Nice. This sure beats how I've been doing it in the past. Out of
# curiousity, can you talk about what you're doing with it?
Yeah, I'd like to use this to write an administration tool for my
dbmigrations package. I started doing it in hscurses and decided I
needed to be able to live with the
Ah-- so _that's_ why you stopped doing HWN. Moving on to Greener
Pastures...
:) Congrats Brent!
On Oct 1, 2009, at 3:44 PM, Brent Yorgey wrote:
On Thu, Oct 01, 2009 at 04:33:43PM +0200, Wouter Swierstra wrote:
Dear all,
After several years at the helm, I've decided to step down as
On Thu, Oct 1, 2009 at 3:48 PM, Joe Fredette jfred...@gmail.com wrote:
Ah-- so _that's_ why you stopped doing HWN. Moving on to Greener Pastures...
At least, less-frequently-released pastures!
--
gwern
___
Haskell mailing list
Haskell@haskell.org
On 2009-10-01 08:53 +0100 (Thu), Andrew Coppin wrote:
Sure. But what is a computer program? It's a *list of instructions* that
tells a computer *how to do something*.
Some are. Some aren't, as proven by the Haskell definition of sum, which
is certainly a program.
I like to think of a
This is an updated version of my graph-theoretic static analysis tool
for Haskell, SourceGraph. This version is available from
http://hackage.haskell.org/package/SourceGraph-0.5.1.0 (now with docs on
the Hackage page!).
This version provides the ability to pass in a single Haskell source
file
Hi Dimitry,
On Thu, Oct 1, 2009 at 05:23, Dimitry Golubovsky golubov...@gmail.comwrote:
OK, I got it to work with gread/gshow.
However I have noticed this:
*Main (gread $ gshow $ FuncExpr 0 [] (EmptyStmt 0)) :: [(Expression
Int, String)]
[(FuncExpr 0 [] (EmptyStmt 0),)]
vs.
*Main
2009/10/1 Curt Sampson c...@starling-software.com
On 2009-10-01 08:53 +0100 (Thu), Andrew Coppin wrote:
Sure. But what is a computer program? It's a *list of instructions* that
tells a computer *how to do something*.
Some are. Some aren't, as proven by the Haskell definition of sum, which
2009/10/1 Dmitry Astapov dasta...@gmail.com:
Hi,
I've been playing with generics in general (pardon the pun) and Uniplate in
particular, and found out that strict data fields somehow derail Uniplate.
I think this is related to Neil's bug report about Ratio:
1254389201.7656.3.ca...@localhost
Content-Type: text/plain; charset=Windows-1252
Content-Transfer-Encoding: quoted-printable
MIME-Version: 1.0
On Thu=2C 2009-10-01 at 03:29 +=2C Brian Bloniarz wrote:
I.e. why does an exception raised during exception handling get
propagated past the
Sorry for the garbled post, this should hopefully be plain text:
On Thu, 2009-10-01 at 03:29 +, Brian Bloniarz wrote:
I.e. why does an exception raised during exception handling get
propagated past the exception that triggered the handler?
Because it's the obvious and sensible thing to
Hello,
I would like to announce the release of usb-0.1, a Haskell library for
communicating with USB devices from userspace.
usb is implemented as a high-level wrapper around Maurício C. Antunes'
bindings-libusb which is a binding to the C library: libusb-1.* (
http://libusb.org ).
All
Bas van Dijk wrote:
Comments and patches are highly welcome.
I tried to install on my Mac but bindings-common choked on:
cabal install bindings-common
Resolving dependencies...
cabal: Error: some packages failed to install:
bindings-common-1.1 failed while unpacking the package. The
Yes, that happens. I don't now the cause but the work-around is easy.
Simply download the package manually from hackage, unpack and install
using cabal.
At least the following packages suffer from this problem:
bindings-common
bindings-libusb
bindings-posix
Perhaps Maurício can shed some
On Thu, Oct 1, 2009 at 9:53 AM, Andrew Coppin
andrewcop...@btinternet.comwrote:
Sure. But what is a computer program? It's a *list of instructions* that
tells a computer *how to do something*. And yet, the Haskell definition of
sum looks more like a definition of what a sum is rather than an
Hello List,
I'm running into a problem with c2hs and how it parses the C typedef
'size_t'. On 32bit systems, this ends up being parsed as a CUInt. On 64bit
systems, this ends up as a CULong. This gets especially sticky with function
pointers.
In order to make bindings with c2hs that work across
Roel van Dijk wrote:
Yes, that happens. I don't now the cause but the work-around is easy.
Simply download the package manually from hackage, unpack and install
using cabal.
At least the following packages suffer from this problem:
bindings-common
bindings-libusb
bindings-posix
Perhaps
That's odd, even cabal unpack fails. Smells like a cabal bug. :-) I'll see
if I can find if it's been reported before.
I meant a manual unpack: tar xvf bindings-common-1.1.tar.gz
But it is indeed odd.
___
Haskell-Cafe mailing list
Dear all,
After several years at the helm, I've decided to step down as editor
of the Monad.Reader.
I am happy to announce that Brent Yorgey will take over my role as
editor. I'd like to take this opportunity to thank Brent for helping
to keep the Monad.Reader alive. I'm sure he'll do a
Ah, but it takes care of my performance problems, so many thanks from
the lurker :-)
-- Jeff
On Wed, Sep 30, 2009 at 11:37 PM, wren ng thornton w...@freegeek.org wrote:
wren ng thornton wrote:
I guess one could make rules for that, but this tickets makes me wander
if
that really works:
Or you could look at my blog posts describing the implementation of the
Cannibals and Missionaries variant step by step.
First a naive approach and secondly using a state monad solution.
http://adoseoflogic.blogspot.com/2009/07/cannibals-missionaries-and-state-monad.html
Cheers,
Bas
2009/9/28
;)
Off topic:
Maybe the entire space time, the universe and his history, is isomorphic to
a mathematical structure.
http://space.mit.edu/home/tegmark/toe_frames.html
http://space.mit.edu/home/tegmark/toe_frames.html
2009/10/1 Peter Verswyvelen bugf...@gmail.com
On Thu, Oct 1, 2009 at 9:53
On Wed, Sep 30, 2009 at 5:35 AM, Jonathan Daugherty drcyg...@gmail.com wrote:
vty-ui is:
An extensible library of user interface widgets for composing and
laying out Vty user interfaces. This library provides a collection of
widgets and a type class for rendering widgets to Vty Images.
Am I
Am I correct in saying that the collection of widgets contains a
single widget type so far? ;-)
Technically, four; vertical and horizontal boxes, a text string
widget, and the List you mentioned. It only has a few types because I
was just releasing early. I'm going to start using this in a
On Thu, Oct 1, 2009 at 4:23 PM, Jonathan Daugherty drcyg...@gmail.com wrote:
Am I correct in saying that the collection of widgets contains a
single widget type so far? ;-)
Technically, four; vertical and horizontal boxes, a text string
widget, and the List you mentioned. It only has a few
Along the projection/co-algebra lines (I actually didn't know that's what
they were called until today :) yay for learning new things!)
How about something like this:
-- Define prototypes for your class of actions here
data Actor = Actor {pos::Vector2 Float, move::Vector2 Float - Actor}
--
On 2009-09-29 13:18 +0200 (Tue), Alberto G. Corona wrote:
What is the vehicle that haskell can use to enter the mainstream?.
Actually, I have one more thought on that: wait.
I'd had the impression that Haskell was becoming fairly well known (if
not yet heavily used, in comparison to languages
The file bindings-common.tar.gz looks a bit odd: when I unpack it with
7Zip, I get the path:
bindings-common-1.1.tar.gz\\home\mauricio\bindings-common-1.1.tar.gz\bindings-common-1.1\
(first part deleted)
Met vriendelijke groet,
Henk-Jan van Tuyl
--
http://functor.bamikanarie.com
On Thu, 2009-10-01 at 16:22 +0200, Martijn van Steenbergen wrote:
Roel van Dijk wrote:
Yes, that happens. I don't now the cause but the work-around is easy.
Simply download the package manually from hackage, unpack and install
using cabal.
At least the following packages suffer from
Tom Tobin wrote:
On Thu, Oct 1, 2009 at 3:26 AM, Andrew Coppin
andrewcop...@btinternet.com wrote:
It might be a better argument to say that human thinking is fundamentally
sequential; parallel computers have been around for a little while now...
Perhaps *conscious* human thinking is
On Thu, 2009-10-01 at 10:20 -0400, John Van Enk wrote:
Hello List,
I'm running into a problem with c2hs and how it parses the C typedef
'size_t'. On 32bit systems, this ends up being parsed as a CUInt. On
64bit systems, this ends up as a CULong. This gets especially sticky
with function
May be because consciousness is relatively new and thus, not optimized.
Sequentiallity is somehow related with lack of information and lack or
resources. There is nothing more sequential than a Turing machine. The Von
Newman architecture is designed to make as much as possible with a few more
# Nice. This sure beats how I've been doing it in the past. Out of
# curiousity, can you talk about what you're doing with it?
Yeah, I'd like to use this to write an administration tool for my
dbmigrations package. I started doing it in hscurses and decided I
needed to be able to live with the
Opps, errors, it should be more like:
moveBall (Vector2 x y) (Ball ...) = ...
movePaddle (Vector2 x y) (Paddle ...) = ...
-- selection actions for Ball
instance Actor Ball where
mkActor this = let
pos' = getBallPosition this
move' v = mkActor $ moveBall v this
in Actor pos' move'
Hi Duncan,
Yes, I forgot to leave out that I'd like to see 'size_t' mapped to CSize.
As a (dirty) workaround, one can use 'castPtr' as the marshaler when dealing
with pointers to 'size_t'. I'm a little more concerned about FunPtr's
(though 'castPtr' still makes the issue go away).
Here's my
At least the following packages suffer from this problem:
bindings-common bindings-libusb bindings-posix
Most .tar files contain entries for the directories that
precede the entries for the files. This is only by convention
however. It looks like this tar file has an entry for
I can't help with the title, but you might show how Haskell can help
avoid the subtle bugs that create erroneous results. Start with the
dimensional library (http://hackage.haskell.org/package/dimensional).
Paul.
___
Haskell-Cafe mailing list
2009/10/1 Maurício CA mauricio.antu...@gmail.com:
Meanwhile, I'll be uploading as soon as
possible new versions...
Thanks Mauricio,
I've uploaded usb-0.1.0.1 that now depends on the fixed bindings-libusb-1.2.
http://hackage.haskell.org/package/usb-0.1.0.1
regards,
Bas
On Thu, 2009-10-01 at 13:00 -0400, John Van Enk wrote:
Hi Duncan,
Yes, I forgot to leave out that I'd like to see 'size_t' mapped to
CSize.
As a (dirty) workaround, one can use 'castPtr' as the marshaler when
dealing with pointers to 'size_t'. I'm a little more concerned about
FunPtr's
Ohhh, if you're dealing with pointers to CSize then it's easy, c2hs
supports that directly. See the c2hs user guide section on the pointer
hook.
{# pointer *size_t as CSizePtr - CSize #}
I seriously should have thought of that. I have #pointer's everywhere, but I
didn't think to do it with
On Thu, Oct 01, 2009 at 04:33:43PM +0200, Wouter Swierstra wrote:
Dear all,
After several years at the helm, I've decided to step down as editor of the
Monad.Reader.
I am happy to announce that Brent Yorgey will take over my role as editor.
I'd like to take this opportunity to thank Brent
Ah-- so _that's_ why you stopped doing HWN. Moving on to Greener
Pastures...
:) Congrats Brent!
On Oct 1, 2009, at 3:44 PM, Brent Yorgey wrote:
On Thu, Oct 01, 2009 at 04:33:43PM +0200, Wouter Swierstra wrote:
Dear all,
After several years at the helm, I've decided to step down as
On Thu, Oct 1, 2009 at 3:48 PM, Joe Fredette jfred...@gmail.com wrote:
Ah-- so _that's_ why you stopped doing HWN. Moving on to Greener Pastures...
At least, less-frequently-released pastures!
--
gwern
___
Haskell-Cafe mailing list
so whats pretty cool is that I can traverse arbitrary data structures as well:
data Tree a = Tree (Tree a) a (Tree a) | Bottom
deriving Show
left a = do
make $ \ st - do
case(st) of
(Bottom) - eos
(Tree left val right) -
case (a val) of
In a short while, the package 'ls-usb' will be released.
I've just uploaded usb-id-database-0.4 and ls-usb-0.1:
http://hackage.haskell.org/package/usb-id-database-0.4
http://hackage.haskell.org/package/ls-usb-0.1
The utility ls-usb uses the usb package to detect all USB devices
connected to
Hi there, I am trying to write some code for parsing string in p==q or
pq or p|||r, something like this.But I have trouble in reading operator
like==|||... how can I fix it? I attached my code file with the email.Can
some one give me some hints to fix the error and run the code?Thank you in
You can do it almost transparently with the Workflow package::
http://hackage.haskell.org/package/Workflow
2009/2/11 Cristiano Paris cristiano.pa...@gmail.com
On Wed, Feb 11, 2009 at 2:30 PM, Peter Verswyvelen bugf...@gmail.com
wrote:
I haven't looked at the details, but I think this is
I was poking around once trying to find something like that and stumbled
across this: http://wiki.cs.pdx.edu/forge/riviera.html
Cheers,
Tim
On Wed, Feb 11, 2009 at 8:22 AM, Cristiano Paris
cristiano.pa...@gmail.comwrote:
I wonder whether this can be done in Haskell (see muleherd's comment):
Hi,
I managed to abstract parts of the business logic of my application by
employing a very naive DSL and it actually worked quite well. I'll
probably replace that with a Finally Tagless version, just for the sake
of it.
But now I'd really try to abstract the hard part, the GUI logic. I
On Oct 1, 2009, at 8:53 PM, Andrew Coppin wrote:
Sure. But what is a computer program?
It depends on the computer. Classical machines do one thing,
data flow machines do another, reduction machines another.
I once saw a tiny machine at a UK university where the hardware
was a combinator
On Oct 1, 2009, at 9:26 PM, Andrew Coppin wrote:
It might be a better argument to say that human thinking is
fundamentally sequential; parallel computers have been around for a
little while now...
You've never been talking on the phone while stirring a pot with one
hand
and wiping down
On Oct 2, 2009, at 11:14 AM, Richard O'Keefe wrote:
Human *verbalisation* is fundamental, human *thinking* is not.
Sigh. Accidentally lean on the wrong key and half your text disappears.
Human *verbalisation* is fundamentally sequential.
Human *thinking* is not.
I don't know any sign
Andrew Coppin said:
Sure. But what is a computer program?
then Richard O'Keefe said:
A computer program, in short, is *whatever we want it to be*.
(Within reasonable limits.)
I agree with Richard's conclusion.
From where I sit, the critical point is that, unless you're breadboarding,
Is there a way to tell, let's say, how many constructors there are for a type?
Or do I need one of the haskell extensions I've read about?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Thu, Oct 1, 2009 at 6:22 PM, Gregory Propf gregorypr...@yahoo.com wrote:
Is there a way to tell, let's say, how many constructors there are for a
type? Or do I need one of the haskell extensions I've read about?
Use Data.Data and derive Data for the types you are interested in or
instance
On Oct 1, 2009, at 19:22 , Gregory Propf wrote:
Is there a way to tell, let's say, how many constructors there are
for a type? Or do I need one of the haskell extensions I've read
about?
If the constructors are nullary (that is: data MyData = Foo | Bar |
Baz) you could derive Enum and
Cool, I like how this parser can model the Look, an Eagle scenario. For
reference:
http://www.youtube.com/watch?v=pjh3e198pUQ
The parser can change focus (that is, change traversal strategy) in
response to a successful parse. In the Look, an Eagle scenario, the bear
is able to interpret and
Haskell, and FP languages more broadly, are finding a pretty solid
niche in small scale, but technically demanding and lucrative
projects. Financial modeling and analytics are the first thing that
comes to mind. The work of Galois, Atom, etc also sort of fit this
mold.
While the people
This version fixes defective handling of empty objects and
arrays.
http://hackage.haskell.org/package/json-b-0.0.4
Thanks to Dmitry Astapov for this fix.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
ed...@ymonad.com 쓴 글:
Hi,
I will give a seminar to physicists at USP (Universidade de São Paulo, Brazil)
university and they asked me for a good title, something that can attract
physicists. Anyone has some suggestions? (Will be
a seminar about the use of Haskell to substitute C or Fortran
in
On 2009-09-30 21:27 +0200 (Wed), Alberto G. Corona wrote:
Do you really want, in 2020, to look back at the 2010 revision of the
Haskell standard and think, we entrenched things that for a decade
everybody agreed was dumb?
I see no problem in haskell having both. experimental and fixed
namekuseijin namekusei...@gmail.com writes:
Point is: = . $ : ! `` and meaningful whitespace are all nice
shortcuts, but also hairy confusing...
As somebody pointed out, these are rather idiomatic, and only confusing
to beginners. (I'm not sure what you refer to with whitespace, some
think
Andrew Coppin andrewcop...@btinternet.com writes:
Peter Verswyvelen wrote:
I really doubt people tend to think in either way. It's not even
sure our thinking can be modeled with computing no?
Well, try this: Go ask a random person how you add up a list of
numbers.
Although the question of
John Dorsey wrote:
Well, try this: Go ask a random person how you add up a list of numbers.
Most of them will say something about adding the first two together,
adding the third to that total, and so forth. In other words, the step
by step instructions.
You word the (hypothetical)
Ketil Malde wrote:
Although the question of how we naturally think often comes up, I'm
not sure it's a very important one. In my experience, the natural
thing for humans appear rather to be the absence of thinking, and
instead slouching in front of the TV eating unhealthy food.
After all, we
2009/10/1 Andrew Coppin andrewcop...@btinternet.com:
John Dorsey wrote:
Well, try this: Go ask a random person how you add up a list of numbers.
Most of them will say something about adding the first two together,
adding the third to that total, and so forth. In other words, the step by
Hong Yang hyang...@gmail.com writes:
But in my program, I did not define --++.
And that's what the error tells you, no?
Defining operators (or not) doesn't change the syntax. Since the lexeme
--++ is syntactially a valid operator, it will be parsed as such,
regardless of whether it is defined
Peter Verswyvelen wrote:
I guess this is related to the expression problem.
Suppose I have a datatype
*data Actor = Ball ... | Paddle ... | Wall ...*
and a function
*move (Ball ...) = *
*move (Paddle ...) = *
*move (Wall ...) = *
in Haskell one must put *Actor* and *move* into a
Eugene Kirpichov wrote:
2009/10/1 Andrew Coppin andrewcop...@btinternet.com:
Sure. But what is a computer program? It's a *list of instructions* that
tells a computer *how to do something*. And yet, the Haskell definition of
sum looks more like a definition of what a sum is rather than an
2009/10/1 Andrew Coppin andrewcop...@btinternet.com:
Eugene Kirpichov wrote:
2009/10/1 Andrew Coppin andrewcop...@btinternet.com:
Sure. But what is a computer program? It's a *list of instructions* that
tells a computer *how to do something*. And yet, the Haskell definition
of
sum looks
I'm not sure if I understand what you mean with this co-algebraic approach,
but I guess you mean that functions - like move - don't work directly on any
datatype; you need to provide other functions that give access to the data.
But that's basically what type classes do no? And that's also related
Exception handling code should generally be assumed to work, so if
something goes wrong there you would normally like to know about it.
Also, there is nothing preventing you from wrapping the rescue code in
further exception handling, however, if the initial error were raised
upon encountering a
On Thu, 2009-10-01 at 03:29 +, Brian Bloniarz wrote:
I had a question about onException friends: what's the rationale
for having:
(error foo) `onException` (error bar)
give bar and not foo?
I.e. why does an exception raised during exception handling get
propagated past the exception
Hi.
I was going to add a reference to the recently born Russian journal
Practice of functional programming (http://fprog.ru/ ; had its 1st
issue in July and 2nd was Sep.28) to haskellwiki into a section
devoted specifically to journals, but it turned out there is no such
section and,
On Tue, Sep 29, 2009 at 9:36 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
Similarly, Parsec has some lovely external documentation (unfortunately as a
single giant HTML page), but the Haddock stuff is bare.
The last version (3.x) improves things.
91 matches
Mail list logo
