Excellent point. Now fixed in the HEAD. Thanks for the report.
Simon
| -Original Message-
| From: Tobias Gedell [mailto:[EMAIL PROTECTED]]
| Sent: 22 January 2003 16:56
| To: glasgow-haskell-bugs
| Subject: Invalid binding names in generated Core code
|
| The generation of binding
| The attached file (generated by running ghc -fext-core on the Fibheaps
| benchmark from the nofib suite) fails to typecheck:
|
| $ ghc -dcore-lint Fibheaps.hcr
|
| Couldn't match `#' against `*'
| Expected kind: #
| Inferred kind: *
| When checking kinds in `GHC.Prim.(-)
The interactive loop of ghci displays an interesting evaluation fault
to do with derived equality. In the attached source file, there is
a simple guard which tests some equalities, and basically the same
value is given on the left and right of the (==). Yet, it evaluates
to False in
Bugs item #657462, was opened at 2002-12-22 11:05
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=657462group_id=8032
Category: None
Group: None
Status: Closed
Resolution: Fixed
Priority: 5
Submitted By: Nobody/Anonymous (nobody)
Assigned to: Simon Marlow
As pointed Michael Weber in a sparc-unknown-linux porting,the
key point is
gcc on sparc-linux (mips-irix) doesn't mark the beginning of
.data(like data_start on i386-linux) . Using etext is
definitely wrong
here, since .rodata comes afterwards and therefore etext
doesn't cover the
Hello,
Please help me understanding GHC 5.02.2 profiling output!
Here is the root of my program (Show.hs):
\begin{code}
showData:: BaseVector a = Params - Operator a - String
showData params pot = unlines [Version 3.1,
I'm having some difficulties with the --split-objs parameter when building
HOpenGL on win xp ine with --disable-split-objs.
Tried uninstalling my 'normal' copy of perl upgrading GHC to 5.04.2 but
am still getting the same error.
Couldn't find anything in the archives, so anyone got any
I wonder if I could run an idea I've had by this list. It seems to
me you could get some of the desired effects of lazy evaluation by using
continuation passing style in code. For example, take this psuedo-code
using CPS to represent an infinite data type.
Using non-CPS this would be
Chris Clearwater wrote:
It seems to
me you could get some of the desired effects of lazy evaluation by using
continuation passing style in code. For example, take this psuedo-code
using CPS to represent an infinite data type.
Using non-CPS this would be something like:
ones = 1 : ones
using
I wonder if I could run an idea I've had by this list. It seems to
me you could get some of the desired effects of lazy evaluation by using
continuation passing style in code. For example, take this psuedo-code
using CPS to represent an infinite data type.
Using non-CPS this would be
fre 2003-01-24 klockan 13.21 skrev Chris Clearwater:
I wonder if I could run an idea I've had by this list. It seems to
me you could get some of the desired effects of lazy evaluation by using
continuation passing style in code. For example, take this psuedo-code
using CPS to represent an
On Fri, Jan 24, 2003 at 01:51:57PM +0100, Jerzy Karczmarczuk wrote:
Chris Clearwater wrote:
It seems to
me you could get some of the desired effects of lazy evaluation by using
continuation passing style in code. For example, take this psuedo-code
using CPS to represent an infinite data type.
On Fri, Jan 24, 2003 at 03:07:48PM +0100, Thomas Johnsson wrote:
Yes I am. But the + should be in CPS form anyways to be perfectly
correct, so: natural n c = (+) n 1 (\m - c n : (natural m))
I think Jerzy (in his usual polite manner :-) refers to the
every group has it's moshez
Chris == Chris Clearwater [EMAIL PROTECTED] writes:
Chris But also, this brings me to another idea! Data structures
Chris should be built from lambdas and CPS! For example, a list
Chris of integers: 1 : 2 : 3
Chris list = \c - c 1 (\c - c 2 nil)
How about just:
cons hd tl =
Chris == Chris Clearwater [EMAIL PROTECTED] writes:
Chris LIAR. You want to steal my idea for yourself! It's MINE! :)
I hate to be the one to break it to you, but we used to routinely show
this trick to Intro to CS students.
Chris But anyways, it was to show that when a list is defined
Chris Clearwater wrote:
On Fri, Jan 24, 2003 at 01:51:57PM +0100, Jerzy Karczmarczuk wrote:
Hey, Maestro, why don't you check before posting, hm? What is the type
of ones? I am afraid you will get a nasty surprise...
Check what, the type? Or are you refering to the double posting?...
It
On Fri, 24 Jan 2003 09:18:47 -0600
Kevin S. Millikin [EMAIL PROTECTED] wrote:
So your trick *is* used to implement lazy evaluation in other
languages. It's not very pleasant if you write a lot of lazy code,
because you have to explicitly suspend evaluation of values using
delay and
On Fri, Jan 24, 2003 at 09:18:47AM -0600, Kevin S. Millikin wrote:
Chris == Chris Clearwater [EMAIL PROTECTED] writes:
Chris LIAR. You want to steal my idea for yourself! It's MINE! :)
I hate to be the one to break it to you, but we used to routinely show
this trick to Intro to CS
Does anyone have an implementation of hot (heap on top) priority queues in
Haskell (or perhaps ML)?
Thanks!
- Hal
--
Hal Daume III
Computer science is no more about computers| [EMAIL PROTECTED]
than astronomy is about telescopes. -Dijkstra | www.isi.edu/~hdaume
In a fit of madness, I have agreed to deliver a 50-minute lecture
on type classes to an audience of undergraduate students. These
students will have seen some simple typing rules for F2 and will
have some exposure to Hindley-Milner type inference in the context
of ML. I am soliciting advice
--- Norman Ramsey [EMAIL PROTECTED] wrote:
In a fit of madness, I have agreed to deliver a 50-minute lecture
on type classes to an audience of undergraduate students. These
students will have seen some simple typing rules for F2 and will
have some exposure to Hindley-Milner type inference in
G'day all.
On Fri, Jan 24, 2003 at 06:13:29PM -0500, Norman Ramsey wrote:
In a fit of madness, I have agreed to deliver a 50-minute lecture
on type classes to an audience of undergraduate students. These
students will have seen some simple typing rules for F2 and will
have some exposure to
--
Call for Papers
SAS '03
10th Annual International Static Analysis Symposium
June 11-13, 2003 : San Diego, California
Chris == Chris Clearwater [EMAIL PROTECTED] writes:
Chris Sarcasm, Kevin, sarcasm. :)
Why is it that those who most need to point out that they were joking
are least able to see it in others?
Chris The difference is with the CPS way it is implicit. For
Chris example take the Y
You're probably using IO (or System.IO) try. If you want imprecise
exceptions (I think that's the right name), you want to use
Control.Exception versions of try/catch/bracket/etc.
Prelude :m IO
Prelude IO :t try
forall a. IO a - IO (Either GHC.IOBase.Exception a)
Prelude IO try (error a)
***
I've noticed some interesting behaviour:
Prelude Control.Exception try (return (error e))
Prelude Control.Exception it
Right *** Exception: e
It would appear that when the result of this function is evaluated, the
exception fires during evaluation, after the try is out of scope. I suppose
it
In article [EMAIL PROTECTED],
Sarah Thompson [EMAIL PROTECTED] wrote:
I've noticed some interesting behaviour:
Prelude Control.Exception try (return (error e))
Prelude Control.Exception it
Right *** Exception: e
It would appear that when the result of this function is evaluated, the
I wrote:
--
Ashley Yakeley, Seattle WA
-- ghc ThrowCatch.hs -o ThrowCatch ./ThrowCatch
module Main where
Sorry, I was expecting my UA to attach the file rather than append it.
But there it is anyway.
--
Ashley Yakeley, Seattle WA
___
On Fri, 24 Jan 2003, Sarah Thompson wrote:
I've noticed some interesting behaviour:
Prelude Control.Exception try (return (error e))
Prelude Control.Exception it
Right *** Exception: e
It would appear that when the result of this function is evaluated, the
exception fires during
Your COM wrapper code probably behaves differently because the error is
not evoked at the very top level. Note that `seq` (and hence ($!)) only
force evaluation to weak head normal form, which essentially means only
enough to determine the top-level constructor. You may need to evaluate
Hi again,
A slightly harder problem this time. I want to implement something that
looks something like the Microsoft XML parser. This is a very COM heavy
contraption that provides an interface that looks to client applications
like a tree of COM objects that reflects the internal structure of an
31 matches
Mail list logo
