#1031: ghc 6.6 impossible happened
--+-
Reporter: guest | Owner: simonpj
Type: bug | Status: new
Priority: normal| Milestone:
Component: Compiler |Version:
#1032: Test.QuickCheck.Batch overflow in length of tests
+---
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
Priority: normal |
#1032: Test.QuickCheck.Batch overflow in length of tests
-+--
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
Priority: normal |
#1000: Refactor HPC support
--+-
Reporter: simonmar | Owner: AndyGill
Type: task | Status: closed
Priority: normal| Milestone: 6.8
Component:
The following code gives a rather unpleasant error message with ghc 6.6.
Adding the type signature fixes the error.
David
{-# OPTIONS -fglasgow-exts #-}
data PatchSeq p a b where
Nil :: PatchSeq p a a
U :: p a b - PatchSeq p a b
(:-) :: PatchSeq p a b - PatchSeq p b c - PatchSeq
Hello Dinko,
Wednesday, November 29, 2006, 11:56:49 AM, you wrote:
How exactly can CSE cause space leaks, and what does this have to do
with strictness?
standard example is
x = [1..9] ++ [1..9]
comparing to
x = a++a where a=[1..9]
first version runs (without CSE transformation) in fixed
I just installed ghc 6.6 from MacPorts and am trying to use the
Haskell ported NeHe OpenGL lessons to play with OpenGL. Unfortunately,
when I load the lesson in ghci and then run main the screen turns to
garbage and I am forced to power cycle the machine to get back to my
desktop.
It's not a
I think that in principle you can do this. I see three issues
1. You have to identify the CodeCutDecl points.
2. You have to compile all the code before your cut-point to byte-code, just
in case it's invoked by a splice afterwards. This is in addition to compiling
it to machine code
Call for Participation
P L A N - X 2 0 0 7
Programming Language Technologies for XML
An ACM SIGPLAN Workshop collocated with POPL 2007
Nice, France -- January 20, 2007
That's great! Thanks for the hard work, Krasimir.
One question, where can I find the source? I didn't see anything
about that on the download page.
-- Lennart
On Nov 28, 2006, at 02:30 , Krasimir Angelov wrote:
Hello Haskellers,
I am happy to announce that there is a prerelease
[DEADLINE EXTENDED: Title and Abstract due Dec 4, Papers due Dec 11]
Call for Papers
for
Seventh Workshop on
Language Descriptions, Tools and Applications
LDTA 2007
A satellite event of
Hi Krasimir,
On Tue, 28 Nov 2006 20:19:40 +0900, Krasimir Angelov [EMAIL PROTECTED] wrote:
As far as I know there is an academic license that allows you to
use Visual Studio free of charge for non commercial purposes. At least
I heard that students in some Bulgarian universities are allowed to
On Wed, Nov 29, 2006 at 06:08:14PM +, Malcolm Wallace wrote:
Unfortunately, I suspect that teaching is _the_ major use-case for
defaulting. Imagine, day one, lesson one, a student types
Prelude 1+2
into Hugs, and gets the response
Unresolved overloading: Num a
Huh? This
On 30/11/2006, at 5:08 AM, Malcolm Wallace wrote:
Bernie Pope [EMAIL PROTECTED] wrote:
I don't see a proposal to remove defaulting defaulting altogether on
that page - has that been discussed already?
Defaulting is one wart I would be glad to be rid of.
I would also be happy if it was
On Thu, 2006-11-30 at 12:21 +1100, Bernie Pope wrote:
A compromise is to turn defaulting off by default. This would mean
that if you want defaulting you have to ask for it. The question then
would be:
does defaulting get exported across module boundaries? I would be
inclined to say no,
Hi Slavomir,
On 11/28/06, Slavomir Kaslev [EMAIL PROTECTED] wrote:
instance Num Float3 where
.
signum a | a == Float3 0 0 0 = 0
| otherwise = 1
signum has a natural generalization for vectors.
signum v = vector with the same direction as v but with |v| = 1
where
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Johannes Waldmann
sounds great - but can I use this without buying Visual Studio first,
i. e. does it work with some free beta version or similar?
and, does it then work under wine :-)
seriously, how hard would it be to
Hi Jeff,
It all depends how you want to write your code. The two options are
full Haskell (Yhc) or combinators (HSPClientSide).
Thanks
Neil
On 11/29/06, jeff p [EMAIL PROTECTED] wrote:
Hello,
There's a Google SoC-project made by a friend of mine for JavaScript
support in Haskell Server
| In many useful cases, such as the getLine example, the Y action will have its
| own atomic {} block. In which case the semantics of when it is allowed to
| re-attempt X are what is important. If you require (Y) to complete before
| re-attempting (X) then you get an infinite regression where
On 29/11/06, Ian Lynagh [EMAIL PROTECTED] wrote:
On Wed, Nov 22, 2006 at 03:37:05PM +, Neil Davies wrote:
Ian/Simon(s) Thanks - looking forward to the fix.
I've now pushed it to the HEAD.
Thanks - I'll pull it down and give it a try.
It will help with the real time enviroment that
On Tue, 28 Nov 2006, Brian Hulley wrote:
While it may be tempting to want to use symbolic operators like + and -,
these quickly become very confusing when more distinctions need to be made
(eg between cross product, dot product, and scaling, or between transforming
a position versus
On Wed, Nov 29, 2006 at 03:38:24 +, Duncan Coutts wrote:
On Tue, 2006-11-28 at 17:24 +, Magnus Therning wrote:
On Tue, Nov 28, 2006 at 12:00:50 +, Magnus Therning wrote:
[..]
Can't really see anything obviously bogus about the following:
% cat Foo.chs
module Foo where
Hello Nicolas,
Wednesday, November 29, 2006, 7:36:59 AM, you wrote:
1) What ended up happening with David Waern's SoC project? I tried the
darcs repo at http://darcs.haskell.org/SoC/haddock.ghc/, but got some
now it's integrated in ghc 6.7 (HEAD) version. unfortunately, this
years SoC
On Wed, 2006-11-29 at 11:26 +, Magnus Therning wrote:
Or the simpler way is to include in your .cabal file:
extensions: ForeignFunctionInterface
That then applies to every module in the lib and has the advantage of
being portable between compilers.
Ah, good point.
Now, where
Hi,
Firstly my apologies if this is an outrageously newbie question.
I am trying to write a binary protocol parser using Data.ByteString. I
have created a module ByteParser containing my parsing utilities, which
imports ByteString as:
import qualified Data.ByteString as B
In my Main module,
neil:
Hi,
Firstly my apologies if this is an outrageously newbie question.
I am trying to write a binary protocol parser using Data.ByteString. I
have created a module ByteParser containing my parsing utilities, which
imports ByteString as:
import qualified Data.ByteString as B
In
On Wed, Nov 29, 2006 at 01:12:50PM +, Duncan Coutts wrote:
http://www.haskell.org/cabal/release/latest/doc/users-guide/x30.html#buildinfo
Section 2.1.4, though I do notice that the link to the full list of
extensions is broken.
This version works (and looks better too):
2006/11/29, jeff p [EMAIL PROTECTED]:
This seems to contain just what I was looking for. Although I'm not
using HSP, it looks like the HSPClientside library can be used (in
conjunction with Text.XHtml) to generate webpages with embedded
scripts.
It sure should be possible to use
Hi
Anyway I encourage you to have a look at HSP as well :-)
It's quite nice to be able to use regular XML syntax within the Haskell
code.
I think it should be entirely possible to use Haskell with Yhc and HSX
(http://www.cs.chalmers.se/~d00nibro/haskell-src-exts/), so you can
still write
[snip]
If you're doing matrix transformations, you might also like to consider
using separate PositionN and DirectionN types instead of VecN to make use of
the type system to catch some math bugs but I haven't looked into this
myself yet so I don't know whether this would be practical or not.
Hi folks
I just tripped over the Contexts differ in length error message. I
know it's not a new problem, but I thought I'd enquire as to its status.
For those of you who haven't seen it, here's an example, contrived but
compact.
data Thing
= Val Int
| Grok Thing (Maybe Int - Int)
I personally find doing higher order functions with IO extremely
difficult, and the resulting compiler errors are often downright scary.
But this is probably a direct consequence my rather limited
understanding of the monadic operators that the do notion hides. It
seems that one has to be
On 11/29/06, Krasimir Angelov [EMAIL PROTECTED] wrote:
Hi Slavomir,
On 11/28/06, Slavomir Kaslev [EMAIL PROTECTED] wrote:
instance Num Float3 where
.
signum a | a == Float3 0 0 0 = 0
| otherwise = 1
signum has a natural generalization for vectors.
signum v =
It is possible of course but your definition doesn't correspond to any
operation in the usual vector algebra. By the way how do you define
(*)? Isn't it 3D vector multiplication?
Krasimir
On 11/29/06, Slavomir Kaslev [EMAIL PROTECTED] wrote:
You mean signum = normalize? What do you think of my
On Wed, 2006-11-29 at 20:27 +0100, [EMAIL PROTECTED] wrote:
On the implementation level, lazy evaluation is in the way when
crunching bytes.
Something I rather enjoyed when hacking on the ByteString lib is finding
that actually lazy evaluation is great when crunching bytes, though you
do need
Hello,
It sure should be possible to use HSPClientside with Text.XHtml,
but off course with exceptions to all Haskell Server Pages (HSP) specific
functions.
Anyway I encourage you to have a look at HSP as well :-)
It's quite nice to be able to use regular XML syntax within the Haskell
code.
Hi,
In order to automatize the creation of W3C DOM typesafe wrapper (this
is needed for my Haskell-Javascript stuff) I am processing the OMG
IDL files that contain interface definitions for DOM methods and
attributes with HDirect.
It works in general (for some reason it didn't like boolean
37 matches
Mail list logo
