What are the plans for http://hackage.haskell.org/trac/ghc/ticket/5623 which
seems to be still open?
Quoting form the ticket ...
Just to spam a little more, it seems that the HEAD happily duplicates all
computations on unboxed types. It even duplicates x+x in this example:
foo :: Float - Float
Sai Hemanth K saihema...@gmail.com schrieb im Newsbeitrag
news:canok7kum7-g5bwhj6btrraruykyl1xyltfr9rd4ke5sovbi...@mail.gmail.com...
Hi,
Apologies if this is an off-topic for the list,
If someone here managed to build network 2.3.05 on windows 7 with ghc-7.2.1
, could you kindly pass
Daniel Fischer daniel.is.fisc...@googlemail.com schrieb im Newsbeitrag
news:201108272331.01371.daniel.is.fisc...@googlemail.com...
On Saturday 27 August 2011, 23:10:17, David Virebayre wrote:
2011/8/27 aditya siram aditya.si...@gmail.com:
Hi all,
I would like for the GHCI interpreter to
Ian Lynagh ig...@earth.li schrieb im Newsbeitrag
news:20110729182136.ga2...@matrix.chaos.earth.li...
We are pleased to announce the first release candidate for GHC 7.2.1:
Is it normal for the windows build to have 99 unexpected failures?
Hello Ian,
Index.html in the windows installer needs fixing up as well.
In currently contains the haddock help find instead of the master contents
with the usual entries (GHC user guide, libraries, ghc api etc).
It was also a bit cleaner in ghc 6.12.3 with the separate users_guide
directory.
Hello,
According to the release notes there is a new package that now contains the
module Data.Array.Diff.
According to Ian's commit this package is called diffarray.
This package does not seem to be available on Hackage.
Could someone upload it?
Rene.
Uwe Schmidt [EMAIL PROTECTED] schrieb im Newsbeitrag
news:[EMAIL PROTECTED]
this statement isn't true in general. HXT itself can be incremental, if
there
is no need for traversing the whole XML tree. When processing a document
containing a DTD, indeed there is a need even when no validation
Matthew Pocock [EMAIL PROTECTED] schrieb im Newsbeitrag
news:[EMAIL PROTECTED]
On Thursday 24 January 2008, Albert Y. C. Lai wrote:
Matthew Pocock wrote:
I've been using hxt to process xml files. Now that my files are getting
a
bit bigger (30m) I'm finding that hxt uses inordinate
Uwe Schmidt [EMAIL PROTECTED] schrieb im Newsbeitrag
news:[EMAIL PROTECTED]
it into HXT.
This still does not solve the processing of very very large
XML document. I doubt, whether we can do this with a DOM
like approach, as in HXT or HaXml. Lazy input does not solve all problems.
A SAX like
Yitzchak Gale [EMAIL PROTECTED] schrieb im Newsbeitrag
news:[EMAIL PROTECTED]
Henning Thielemann wrote:
HXT uses Parsec, which is strict.
I had a look at using HXT awhile ago. Parsec is the least of the problems.
HXT stores the XML as an explicit tree in memory, where the head has explict
Andrew Wagner [EMAIL PROTECTED] schrieb im Newsbeitrag
news:[EMAIL PROTECTED]
current position (or, even more ideally, the so-called principal
variation, which is the best series of moves from the current
position). Is there a good way to collect this, without mapping some
sort of function
Simon Marlow [EMAIL PROTECTED] schrieb im Newsbeitrag
news:[EMAIL PROTECTED]
Yes, by default we don't build or supply the GHC package with profiling,
because of the extra bloat it would add to the downloads and the time
taken to build it.
Why is a program so large when I use the GHC module?
Peter Verswyvelen [EMAIL PROTECTED] schrieb im Newsbeitrag
news:[EMAIL PROTECTED]
In Scheme, on can quote code, so that it becomes data. Microsoft's F#
and C# 3.0 also have something similar that turns code into expression
trees. The latter is used extensively in LINQ which translates plain
Claus Reinke [EMAIL PROTECTED] schrieb im Newsbeitrag
news:[EMAIL PROTECTED]
though I'm extremely dubious about the utility of the Maybe patterns.
actually, they are the main thing that interests me about view patterns!-)
type Typ
unit :: Typ - Maybe ()
arrow :: Type - Maybe
Simon PJ and I are implementing view patterns, a way of pattern matching
against abstract datatypes, in GHC. Our design is described here:
http://hackage.haskell.org/trac/ghc/wiki/ViewPatterns
If you have any comments or suggestions about this design, we'd love to
hear them. You can
Hello,
I am attempting some genetic programming in Haskell.
Rather than defining my own data type for programs and writing my own
interpreter, I want to use the template haskell expression data types and
evaluate them with the rts's byte code interpreter. This gives me a nice
fast interpreter
How difficult would it be to implement Mathematica in Haskell?
Why don't you use axiom? It already has several 100 of years man effort put
into it.
Or for dynamically type package you could use Maxima.
Both are free.
Rene.
___
Haskell-Cafe
What are the plans for the esc branch?
Are the changing going to be merged?
Rene.
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
I vote for 6.8.
Rene.
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
Alistair Bayley [EMAIL PROTECTED] schrieb im Newsbeitrag
news:[EMAIL PROTECTED]
Is this using the darcs repository version of hs-plugins?
That's the only versions that works with 6.6
Just got, built, and installed the repo version, and it has the same
problem.
Alistair
You managed to
The following code took me several hours to work out.
I post it here, so perhaps other can avoid the difficulties of working out
how to use existential types.
Improvements welcome.
If anyone thinks it is worth it I could add it to the wiki under existential
types (I didn't find the examples
In my opinion, views are going to make more Haskell more complicated, and
from what I have seen so far, for little gain.
Maybe a poll should be made to see what features the average Haskeller feels
the most in need of. Or what their greatest problems are.
Going by the traffic over the previous
There may be a heuristic that would help more programs to go through... but
I prefer asking the programmer to make the desired behaviour explicit.
Simon
How can the user make this explicit?
With the
class C a b where
op :: a - a
instance C Int Int where
op a = -a
test d = op d
Brian Smith" [EMAIL PROTECTED] schrieb im
Newsbeitrag news:[EMAIL PROTECTED]...
On
9/30/06, Rene de Visser [EMAIL PROTECTED]
wrote:
What
do I need to install for the regex library support on MINGW?It looks
like the regex library needs the posix library, and in my
Ian Lynagh [EMAIL PROTECTED] schrieb im Newsbeitrag
news:[EMAIL PROTECTED]
http://www.haskell.org/ghc/dist/current/dist/
Hello Ian,
Is it on purpose that the lastest windows build does not include
cabal-install?
Since the September builds I don't see any logs for the mingw build?
Rene.
Hello,
What do I need to install for the regex library support on MINGW?
It looks like the regex library needs the posix library, and in my MINGW /
MSYS installation I don't find one
(and neither does configure).
Rene.
___
Glasgow-haskell-users
The flags under section
4.17.26. Compiler debugging options
seem to be out of date. They seem to be wrong for both 6.42 and 6.6
For example --ddump-cmm is not listed, but works.
But --ddump-absC is listed, and gives the error unknown flag.
I can't get -ddump-stix to work either.
Gone, or
I'll just add myself onto the list of webforum haters.
I find gmane over a news reader much more comfortable that any webforums I
have used.
Perhaps gmane can be used over a web interface?
Then those that want to use a web forum have one, and I can continue to use
my news reader.
When I want
Tomasz Zielonka [EMAIL PROTECTED] schrieb im Newsbeitrag
news:[EMAIL PROTECTED]
BTW. The -fno-recomp option has a very unintuitive name, at least for
me. When I see -fno-recomp, my brain thinks no recompilation,
meaning no unneccesary recompilation, which is what --make does by
default. Using
Is there anyway to turn off that ghci runs in threaded mode on windows?
fps 0.8 (and software that uses fps) triggers trac error #806.
This means that I cannot run such things interactively :-(
Rene.
___
Glasgow-haskell-users mailing list
Michael Marte [EMAIL PROTECTED] schrieb im
Newsbeitrag news:[EMAIL PROTECTED]
Hello *,
I noticed a five percent speed up by making local definitions global.
Maybe the global defintions are monomorphic, and the local defintions
are polymorphic. You could evaluate the types of the global types
Simon Peyton-Jones [EMAIL PROTECTED] schrieb im Newsbeitrag |
| This gives the user possibility to redefine a certain part of the
| library instance.
| Is not ghc-6.4.1 better at this point?
Perhaps. That's what I'd like feedback about. What do others think?
...
Simon
What are the
Hello,
I tried to compile HAppS using the latest GHC snapshot (in compiles fine
with 6.41).
I for example get the error
/home/rene/repos/HAppS/src/HAppS/MACID/Var.hs:23:0:
Illegal polymorphic or qualified type: forall state event.
Ev state event
The following link gives reasons for not generating via C
http://groups.google.com/groups?hl=enlr=ie=UTF-8selm=4zp8kn7xe.fsf_-_%40beta.franz.com
Naturally a number of these are common lisp specific, however I think that
Haskell and GCC are quite semantically different, so using GCC might
seems that you don;t understand the situation. ghc compiles Haskell to
language called core, do almost all optimizations at level of this
language, then translates final result to the STG language from that
the C-- code is generated. changing the translation of STG can't
prevent ANY ghc
From: Bulat Ziganshin [EMAIL PROTECTED]
Hello Rene,
i done reading. my question - is YOU read this? the lisp problems have
almost
nothing in common with haskell
It is a long time since i read this, but some things come to mind. Listed
below.
Maybe GHC should generate better C. I am
From: Bulat Ziganshin [EMAIL PROTECTED]
i answered in the original letter (search for Cray :)
Re-reading this, I see that you have a well defined goals that cover most of
my points.
seems that you don't seen the attached files. tail calls are optimized
in gcc
No I don't see any
One idea that occurred to us recently is this: GHCi could provide a
simplified version of the cost-centre-stack machinery *all the time*,
Simon
This still doesn't explain to me why
C:\Haskell\devmain +RTS -xc
gave
GHC.Arr.CAFmain: Error in array index
(This is with full profiling
I suggest that the code in GHC.Arr be changed from
error Error in array index
to
error Error in array index ++ show b ++ show i
so that the bounds and offending index is shown. This is easy to do as the
information is already available, and would in most cases be of great help
to the user
Hello,
Where is the documentation on how pinning works in the GHC garbage collector
(from a GHC users point of view).
I have copied the following code from array/IO.hs and am thinking that it is
assuming that the array is pinned? What triggers the pinning?
On a second note.
Why is the type
Hello,
I want to write a multi-dimensional unboxed arrary of Int32 to a file. (And
also read it back later).
What I tried so far is
import NewBinary.Binary
...
mapM_ (put bin) $ elems array
...
but this was exceedlying slow.
The array contains about 10 000 000 entries. Any suggestions?
From: Ketil Malde [EMAIL PROTECTED]
Rene de Visser wrote:
I want to write a multi-dimensional unboxed arrary of Int32 to a file.
(And also read it back later).
hGetArray/hPutArray?
To do this I need to cast my 5 dimensional array to a 1 dimensional array?
Does this work? i.e. how do I know
From: Bulat Ziganshin [EMAIL PROTECTED]
Hello Rene,
Monday, October 31, 2005, 11:13:30 AM, you wrote:
RdV I want to write a multi-dimensional unboxed arrary of Int32 to a file.
(And
RdV also read it back later).
how about fileWriteBuf/fileReadBuf?
Hello Bulat,
How does this work? (is this
Many thanks to all for the replies
From: ChrisK [EMAIL PROTECTED]
Could the interval for element x of List xList overlap with more than
one element of another list? It does not matter too much, but is
something you did not clarify. In general, how may the intervals for
all the lists
Hello,
I need to zip together multiple lists.
The lists are sorted by date, and each entry in the list represents data for
a time interval.
The time intervals between the lists may be missmatched from each other.
This means that sometimes you don't need to move forward in list, while you
From: ChrisK [EMAIL PROTECTED]
Rene de Visser wrote:
Does a single list have only disjoint intervals?
Yes. The lists are strictly increasing
Doing this for two lists with a recursive function is easy. There being
an output element whenever the intervals of the two input lists overlap.
Yes, I
From: Henning Thielemann [EMAIL PROTECTED]
On Wed, 15 Jun 2005, Rene de Visser wrote:
I have a somewhat complicated calculation programmed in Haskell.
This calculation is coded without using monads.
I want to also produce a report describing the details of this
calculation
for each
From: Henning Thielemann [EMAIL PROTECTED]
On Wed, 15 Jun 2005, Rene de Visser wrote:
You can put temporary values into a data structure.
E.g. if you have an iteration don't write a recursion with a fixed abort
criterion but write a function which maps the old value to the new one,
then apply
From: Bayley, Alistair [EMAIL PROTECTED]
From: Rene de Visser [mailto:[EMAIL PROTECTED]
I would rather use Haskell also for the persistency, global
constraint
maintanence, etc... rather than using an external database.
What do you mean by external database? If you just mean on another
I would
49 matches
Mail list logo
