Bugs item #679963, was opened at 2003-02-04 02:14
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=679963group_id=8032
Category: Profiling
Group: None
Status: Open
Resolution: None
Priority: 5
Submitted By: Nobody/Anonymous (nobody)
Assigned to:
Bugs item #670756, was opened at 2003-01-19 18:59
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=670756group_id=8032
Category: Driver
Group: 5.04.2
Status: Open
Resolution: None
Priority: 5
Submitted By: Axel Simon (as49)
Assigned to: Nobody/Anonymous
I've made this fix in the HEAD, thank you.
Simon
| -Original Message-
| From: Tobias Gedell [mailto:[EMAIL PROTECTED]]
| Sent: 25 January 2003 11:54
| To: glasgow-haskell-bugs
| Subject: Core, implicit bindings are emitted in the wrong order
|
| The implicit bindings are emitted in the
On Fri, Jan 24, 2003 at 01:31:46PM -, Simon Peyton-Jones wrote:
In short, it's really a bug, but not a particularly easy one to fix.
Rumination required. But it probably only happens on a few programs,
right?
It happens on at least two of the nofib benchmarks, so it seems to be
pretty
A few things. First of all, if you're stupid and say:
ghc ... -fmax-simplifier-iterations=5
then ghc crashes with:
ghc-5.05: panic! (the `impossible' happened, GHC version 5.05):
Prelude.read: no parse
Please report it as a compiler bug to [EMAIL PROTECTED],
or
Aha! So what you really want is a code generator!
I suggest you take a look at C--.
www.cminusminus.org
(Check out the papers especially.) It's designed for exactly what Stix
is designed for, only much, much better. There's a prototype
implementation from Fermin Reig, and Norman
I have to say that I'm not very keen. There is an annotation facility
in Core, but it's easy for the notes to be discarded. So if they are
conveying important info, it might easily get lost... and if not, what's
it doing there in the first place. What do you expect to happen to
these
I'm replying to two threads at the same time and cross posting my reply,
because they are very relevant to each other. I'm sorry if anyone here ends
up seeing this more than once as a consequence.
[s]
--
Sarah
Did you get this problem sorted out?
Not directly. I ended up building an
Simon,
I wasn't suggesting extending the Core datatype. Part of the Core Exp
datatype is these notes. From ExternalCore.hs:
data Exp
...
| Note String Exp
...
My suggestion is simply to allow pragmas to fill in these Note
values. I've actually implemented it in my copy of GHC and
On Tue, 4 Feb 2003, Simon Peyton-Jones wrote:
Aha! So what you really want is a code generator!
I suggest you take a look at C--.
www.cminusminus.org
(Check out the papers especially.) It's designed for exactly what Stix
is designed for, only much, much better. There's a prototype
Don't forget Helium (recently announced)
http://www.cs.uu.nl/~afie/helium/index.html
Also Manuel Chakravarty teaches Haskell to hordes.
Simon
| -Original Message-
| From: Hal Daume III [mailto:[EMAIL PROTECTED]]
| Sent: 04 February 2003 00:02
| To: Haskell Mailing List
| Subject:
John Peterson wrote:
The downside of Haskell is that none of the regular implementations
(ghc, hugs) are really right for this level of student. Type
inference is an especially nasty problem. There also a number of
gotcha's lurking in the language that cause problems.
For exactly these
John Peterson wrote:
The downside of Haskell is that none of the regular implementations
(ghc, hugs) are really right for this level of student. Type
inference is an especially nasty problem. There also a number of
gotcha's lurking in the language that cause problems.
For exactly these
On Mon, 3 Feb 2003, Rex Page wrote:
This matches my experience, too. When I've taught Haskell to first
year college students, there have always been some hard core hackers
who've been at it in C or VB or Perl or something like that for
years, and they rarely take kindly to Haskell. The ones
This is a somewhat older thread, but I ask you to enlighten me.
Norman Ramsey wrote:
A fact that I know but don't understand the implication of is that
Haskell dispatches on the static type of a value, whereas OO languages
dispatch on the dynamic type of a value. But I suspect I'll leave
that
For exactly these reasons we have implemented Helium; not for replacing
Haskell (we're very happy with Haskell), but for *learning* Haskell. There
is no overloading, so types and type errors are easier to understand. The
Helium compiler produces warnings for situations that are probably
On Tuesday, February 4, 2003, at 03:46 PM, Jerzy Karczmarczuk wrote:
I would say that - unless I am dead wrong, the OO languages such as
Smalltalk
do not dispatch on dynamic types of a value. The receiver is known, so
its vir.
f. table (belonging to the receiver's class) is known as well, the
On Tue, 4 Feb 2003, David Bergman wrote:
Rex wrote:
This matches my experience, too. When I've taught Haskell to
first year college students, there have always been some hard
core hackers who've been at it in C or VB or Perl or
something like that for years, and they rarely take
Hi,
I'm looking for large haskell programs with more than 15000 lines of
code. Does any of you know where I can find such programs? The programs
found in the nofib suite are not large enough.
//Tobias
___
Haskell mailing list
[EMAIL PROTECTED]
GHC is such a program, as are the other Haskell compilers. Perhaps too
complicated for your purposes, though.
I can give you a few ~5000-1 line programs if you want. I don't quite
have anything as large as 15000 lines, though.
--
Hal Daume III
Computer science is no more about computers
ginsu (my gale chat client, implemented in haskell) is about ~8000 lines
of really convoluted haskell which abuses every dirty trick in the book
at some point or another. (designed pragmatically, no elegance here.)
http://repetae.net/john/computer/ginsu/
John
On Tue, Feb 04, 2003 at
GHC is such a program, as are the other Haskell compilers. Perhaps too
complicated for your purposes, though.
GHC has too many mutually recursive modules to be useful, otherwise it
would be great! But I will look more into the other compilers, are they
written in Haskell?, thanks for the
I'm replying to two threads at the same time and cross posting my reply,
because they are very relevant to each other. I'm sorry if anyone here ends
up seeing this more than once as a consequence.
[s]
--
Sarah
Did you get this problem sorted out?
Not directly. I ended up building an
| I've started looking into the docs on GHC's
| implementation of Concurrent-Haskell, and I got
| confused about the architecture. Different sources
| seem to indicate that it either:
| - Uses one OS thread, and blocking IO calls will
| therefore block all the Haskell-threads, or
| - Uses
Greetings.
My question is not directly related to
Haskell.
Is it possible to encode an array using lamda terms
only, and recover the term specified by an index term in O(1) time (in other
words in one step reduction, without cheating using several steps behind the
scenes)? Or is it
Thanks to Andrew, I'm now backtracking my state correctly.
Now what I want to do is have two elements of state, an element that gets backtracked,
and an element that doesn't.
My monad now looks like this:
type NondetState bs ns a = StateT bs (NondetT (StateT ns Maybe)) a
where bs is my
Is it possible to encode an array using lamda
terms only, and recover the term specified by an index term in O(1) time (in
other words in one step reduction, without cheating using several steps behind
the scenes)?
depends a bit on your definitions, doesn't
it? if you take lambda
Cagdas Ozgenc wrote:
Is it possible to encode an array using lamda terms only, and recover
the term specified by an index term in O(1) time?
I'd like to go on a limb and argue that there is generally no such
thing as O(1) array access operation. On the conventional hardware,
the fastest
G'day.
On Tue, Feb 04, 2003 at 05:24:29PM -, Guest, Simon wrote:
I can still access my backtracked state using Control.Monad.State.{get,put}, but
I can't access my non-backtracked state.
Iavor mentioned using lift, plus some other ideas. That's what
I'd do:
liftNondet = lift
The formula involves the addition of two numbers -- which is,
generally, a O(log(n)) operation. Granted, if we operate in the
restricted domain of mod 2^32 integers, addition can be considered
O(1). If we stay in this domain however, the size of all our arrays is
limited to M (which is 2^32,
30 matches
Mail list logo
