#871: compiler bug concerning arrays
-+--
Reporter: guest |Owner:
Type: bug | Status: new
Priority: normal|Milestone:
Component: Compiler |
#833: hs-plugins requires an executable temporary directory
-+--
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: closed
Priority: normal | Milestone:
Frederik Eaton wrote:
Hi all,
It seems that ghc is searching for package libraries relative to the
current directory. Is that the intended behavior? ghci does the same
thing, by the way.
$ pwd
/home/frederik/GSLHaskell2
$ ghc --make ../test-proc.hs -package GSL
Chasing modules from:
#870: extra commas accepted in import export lists
+---
Reporter: ross | Owner:
Type: bug| Status: closed
Priority: normal | Milestone:
Neil Mitchell wrote:
Taking a look at:
http://haskell.org/ghc/docs/latest/html/libraries/base/GHC-ConsoleHandler.html#v%3AinstallHandler
On Windows this has the members:
data ConsoleEvent = ControlC | Break | Close | Logoff | Shutdown
data Handler = Default | Ignore | Catch (ConsoleEvent -
#229: Integer overflow in array allocation
-+--
Reporter: josefs | Owner: simonmar
Type: bug | Status: assigned
Priority: low | Milestone:
#866: Building unregistarized version
+---
Reporter: kyukhin| Owner:
Type: bug| Status: closed
Priority: high | Milestone:
Component: Build
#858: -fPIC on x86 and x86_64
-+--
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: closed
Priority: normal | Milestone:
Component:
#872: OSX x86.
+---
Reporter: guest|Owner:
Type: feature request | Status: new
Priority: normal |Milestone:
Component: Compiler |
#872: OSX x86.
--+-
Reporter: guest| Owner:
Type: feature request | Status: new
Priority: normal | Milestone:
Component: Compiler |
Hi,
I'm seeing some odd data corruption in a log file. Below, the second
line should be a SQL query (prefixed by a timestamp). It's turned into
garbage, but apparently not just random bytes. I'm using HSQL - that's
the only external library, and it uses FFI, so there might be some bad
memory
Sorry, forgot to say that I was using GHC 6.4.2 the first time, and
ghc-6.4.3.20060816 this time.
Frederik
On Mon, Aug 21, 2006 at 10:45:40PM +0100, Frederik Eaton wrote:
Hi,
I'm seeing some odd data corruption in a log file. Below, the second
line should be a SQL query (prefixed by a
We are delighted to announce that GHC now has a full-time support
engineer. He is Ian Lynagh (aka Igloo on IRC), and is well known to
many of you on the Haskell and GHC mailing lists. He'll be helping with
all aspects of GHC, especially release management, bug diagnosis and
tracking,
Hello All,
I currently try to get a ghc port on mips-linux going. I understand
Igloo does the same ATM, and things look promising so far.
However, the port is currently unregisterised, and I would like to
improve it a bit. A registerised port seems to be achievable with
a moderate amount of
Hi,
I'm starting to explore Template Haskell and I've got the following program:
-- almost directly from Template meta-programming in Haskell paper
module Duma.Template.Test
( Format(..)
, printf
) where
import Language.Haskell.TH
Bulat Ziganshin wrote:
Hello skaller,
Sunday, August 13, 2006, 4:34:14 AM, you wrote:
But the state of the art is then two stages behind the
requirement: Haskell still has to 'world stop' threads
to do a major collection.
is not exactly true. look at Non-stop Haskell
Bulat Ziganshin wrote:
Monday, August 14, 2006, 10:34:22 AM, Andres Loeh wrote:
14:30 Simon Marlow (Microsoft Research)
An Extensible Dynamically-Typed Hierarchy of Exceptions
is this planned to be included in ghc 6.6? 6.8?
Sadly I didn't get around to it. There's a proposal on
Bulat Ziganshin wrote:
Hello Bulat,
Can you please fix the following problems in GHC 6.6.*
(uncertainly in 6.6, 6.6.1 will be also good enough)
http://hackage.haskell.org/trac/ghc/ticket/814
http://hackage.haskell.org/trac/ghc/ticket/637
Looks like #814 has been done, #637 is looking
Hello Brian,
[snip]
getInfo :: Q Info
getInfo = reify (mkName Car)
[snip]
-- Crashes if I try to print out the info
-- info - runQ getInfo
-- putStrLn (pprint info)
[snip]
The example from the paper works fine with the few minor
Joel Reymont wrote:
On Aug 19, 2006, at 7:30 PM, Simon Peyton-Jones wrote:
I can't tell just what you are doing, but somehow you seem to be
building a stage-2 compiler in stage1.
Well, I'm on Mac Intel so I can only build ghc 6.5 using ghc 6.5.
You'd probably find it easier to use the
Pepe Iborra wrote:
Joel, I feel your pain.
In my (very short) experience, the ghc build system can be fragile and
impredictable some times. Randomly, it will decide to do a stage2 build
in stage1, and this is clearly your case today Joel.
GHC builds with GHCi support in stage1 if it
Esa Ilari Vuokko wrote:
Paolo Martini got ghc to built using Audrey Tang's build from
20060608 on Mac OS X/Intel x86. Instructions are available at
ghc trac:
http://hackage.haskell.org/trac/ghc/wiki/X86OSXGhc
Please edit the page if you have corrections.
The bit about editing mk/config.mk
Joel Reymont wrote:
/usr/local/bin/ghc -H16m -O -istage1/utils -istage1/basicTypes -
istage1/types -istage1/hsSyn -istage1/prelude -istage1/rename -
istage1/typecheck -istage1/deSugar -istage1/coreSyn -istage1/
specialise -istage1/simplCore -istage1/stranal -istage1/stgSyn -
On Aug 21, 2006, at 4:10 PM, Simon Marlow wrote:
GHC is trying to build GHCI in stage 1, because it thinks you have
a compatible compiler. In fact, you have a slightly older 6.5
installed. However (as I think I mentioned before) we don't
officially support building GHC using a random
Hi David,
Thanks for the patch, it looks reasonable so I've applied it. This is not the
issue affecting 6.4.3 on MacOS X/PPC, because SMP.h isn't used in the threaded
RTS in 6.4.3. Nevertheless, it's a good fix.
Cheers,
Simon
David Kirkman wrote:
I managed to build
Hello Simon,
Monday, August 21, 2006, 6:55:47 PM, you wrote:
is not exactly true. look at Non-stop Haskell
Simply because it adds overhead (both in runtime and code complexity), and the
benefits are relatively modest.
i think that GC that don't stops the world is just a different
product.
Hello Brian,
Monday, August 21, 2006, 6:34:06 PM, you wrote:
-- almost directly from Template meta-programming in Haskell paper
i should warn you that some TH details was changed in 6.4. these
changes described in second TH paper and afair, reifying is among them
look at
Ulf Norell wrote:
I want to use GHCi as the interface to my Application. The simple
solution is to have the Application store its state in global IORefs. A
user can then start up ghci with -package Application and use the
provided functions to communicate with the Application. This works
Joel Reymont wrote:
On Aug 21, 2006, at 4:10 PM, Simon Marlow wrote:
GHC is trying to build GHCI in stage 1, because it thinks you have a
compatible compiler. In fact, you have a slightly older 6.5
installed. However (as I think I mentioned before) we don't
officially support building
On Aug 21, 2006, at 5:03 PM, Simon Marlow wrote:
It's still trying to build part of GHCi. Try cleaning harder (make
distclean), or just start with a fresh tree. Also I just fixed
compiler/Makefile so it won't try to build GHCi in stage1, even if
it thinks you are bootstrapping with the
Bulat Ziganshin wrote:
Hello Brian,
Monday, August 21, 2006, 6:34:06 PM, you wrote:
-- almost directly from Template meta-programming in
Haskell paper
i should warn you that some TH details was changed in 6.4. these
changes described in second TH paper and afair, reifying is among
Arie Peterson wrote:
I seem to remember that 'reify' cannot be run in the IO monad. IIRC
ghci gives a nice error message saying this, so perhaps you can try
to execute 'main' from within ghci to corroborate my suspicion.
Yes you're right - ghci gives the error:
Can't do `reify' in the IO
Hello Arie,
Monday, August 21, 2006, 7:08:31 PM, you wrote:
getInfo :: Q Info
getInfo = reify (mkName Car)
-- Crashes if I try to print out the info
-- info - runQ getInfo
I seem to remember that 'reify' cannot be run in the IO monad.
oh, yes! runQ
Hello Simon,
Monday, August 21, 2006, 8:03:41 PM, you wrote:
I'm not sure I understand this. How do you guys work then? Do you
always build ghc 6.5 using ghc 6.4?
Sure.
What about the time-honored technique of bootstrapping using yourself?
You can do that of course, but it has to be the
Just in case anyone was wondering why you might want GHC to work well on
MIPS...
http://www.movidis.com/products/rev_spec.asp
A 16x core 600Mhz low-power MIPS machine pre-installed with Debian.
With the new smp-capable ghc, such a box might be rather good for some
Haskell server application.
I get to stage two and then this:
ghci/InteractiveUI.hs:74:7:
Could not find module `System.Console.Readline':
Use -v to see a list of the files searched for.
ghc: 302864492 bytes, 43 GCs, 4361258/9612180 avg/max bytes
residency (4 samples), 24M in use, 0.01 INIT (0.00 elapsed),
Bulat Ziganshin wrote:
as you can see, it don't supports reification, recovery and
information about currently compiled module just because there is no
such information when program runs. and of course, you can't add new
fields or new functions at run-time. isntead typical technique is:
I was wondering if anyone has managed to get the GLUT or OpenGL
trivial examples going on the Intel mac binary distribution from aug
8th running?
I can't get them running under either ghc or ghci.
Thanks,
Ryan
___
Glasgow-haskell-users mailing
We are delighted to announce that GHC now has a full-time support
engineer. He is Ian Lynagh (aka Igloo on IRC), and is well known to
many of you on the Haskell and GHC mailing lists. He'll be helping with
all aspects of GHC, especially release management, bug diagnosis and
tracking,
Dear all,
HaskellNet is develped under GSoC program, and I'd like to report the
current status of HaskellNet.
HaskellNet will be a collection library for networking.
Now, it contains,
- SMTP
- POP3
- IMAP
- HTTP
- (FTP)
- URI
- Mime parser
and, I wrote a Stream like type class of
Frisby is an implementation of the 'packrat' parsing algorithm, which
parse PEG grammars and have a number of very useful qualities, they are
a generalization of regexes in a sense that can parse everything in
LL(k), LR(k), and more, including things that require unlimited
lookahead, all in
I have written a prototype tool that is similar in spirit, and in some
of its workings, to QuickCheck,
but based on exhaustive testing in a bounded space of test values.
Sales pitch: wouldn't you like to ...
* write test generators for your own types more easily?
* be sure that any
On 2006-08-20 at 15:52+0200 John Hughes wrote:
From: Jon Fairbairn [EMAIL PROTECTED]
To reinforce what Aaron said, if a programme works now,
it'll still work if map suddenly means fmap.
Well, this isn't quite true, is it? Here's an example:
class Foldable f where
fold :: (a - a -
On Fri, Aug 18, 2006 at 05:30:53PM +0200, John Hughes wrote:
on students having Haskell' books. All that time, students would write map
instead of mapList because that's what the book says, and get stuck with
incomprehensible error messages. Is it really worth an incompatible change
in the
Hello Lambda,
Monday, August 21, 2006, 1:20:26 AM, you wrote:
Greetings Haskellers,
I have recently found myself in a situation where I was needing to
general tuples of randomized things; in my case, two coordinates and
a custom data type, Direction. As it is always better to
On 8/19/06, Henk-Jan van Tuyl [EMAIL PROTECTED] wrote:
Or you could use:
putStrLn [head This and that]
Gotta say I really like this ... running the head function inside of the list...
Okay so I can really learn something here... what would that look like
in raw monadic notation?
using
yumagene:
On 8/19/06, Henk-Jan van Tuyl [EMAIL PROTECTED] wrote:
Or you could use:
putStrLn [head This and that]
Gotta say I really like this ... running the head function inside of the
list...
Okay so I can really learn something here... what would that look like
in raw monadic
Lennart and all,
On 8/19/06, Lennart Augustsson [EMAIL PROTECTED] wrote:
There are much better ways than storing strings on the stack.
Like using a data type with constructors for the different types that
you can store.
-- Lennart
Off topic, but this is important info for me!
From: Jared Updike [mailto:[EMAIL PROTECTED]
Ian's LCS code looks like it works fine in terms of space usage, but
for large input (lengrh as == 4, length bs == 5) it seems to
be way too slow in terms of time complexity (GNU sdiff executes on
this same data in a few seconds, the
Hi all,First, thanks Daan for offering to stay involved. I'd much prefer to have you working on the project in whatever capacity is possible for you - as the main architect and the person with most knowledge of the wxHaskell implementation, this will be invaluable.
Second thing, for those who are
Hi Shelarcy,Thanks for volunteering to work on the Windows port. What I'd like to ask is this: we need someone to maintain the Windows port.I think, in practice, that this would mean maintaining the Windows build files (which should, generally, be a fairly straightforward job) as well as building
On 2006 August 21 Monday 04:42, Gene A wrote:
but can you have
a list of type [Num] ?? I thought that it had to be the base types of
Int, Integer, Float, Double etc.. No?
See http://www.haskell.org/hawiki/ExistentialTypes
___
Haskell-Cafe mailing
Hello Gene,
Monday, August 21, 2006, 12:42:17 PM, you wrote:
being able to use +,* on any of the numeric types... but can you have
a list of type [Num] ?? I thought that it had to be the base types of
Int, Integer, Float, Double etc.. No?
you can, using existentials:
data Number = forall
Hello Brian,
Friday, August 18, 2006, 8:54:08 PM, you wrote:
classes: lack of record extension mechanisms (such at that implemented
in O'Haskell) and therefore inability to reuse operation
implementation in an derived data type...
You can reuse ops in a derived data type but it involves a
Hi,
I'm trying to write out a binary file, in particular I want the
following functions:
hPutInt :: Handle - Int - IO ()
hGetInt :: Handle - IO Int
For the purposes of these functions, Int = 32 bits, and its got to
roundtrip - Put then Get must be the same.
How would I do this? I see Ptr,
I don't know exactly what types you have as base types in your
implementation, but here's a small code fragment that of what I had
in mind.
data Value = D Double | S String | B Bool
type Stack = [Value]
-- Add top stack elements
plus :: Stack - Stack
plus (D x : D y : vs) = D (x+y) : vs
On Sun, 20 Aug 2006, Neil Mitchell wrote:
Hi,
I want to generate documentation for the base libraries, so I darcs
get the base libraries, and a very basic (the sample default)
Setup.hs, and try:
runhaskell Setup configure
runhaskell Setup build
Pretty much no luck, but I'll leave
Hi
haddock.exe: Main.all_subs_of_qname: unexpected unqual'd name:IOMode
Sometimes such an error is a Haddock problem, sometimes one of the
'unliterate' procedure in Cabal. Does the problem remain if you start
Haddock manually, maybe on manually unliterated modules?
Base is a bit too big and
Neil Mitchell wrote:
I'm trying to write out a binary file, in particular I want the
following functions:
hPutInt :: Handle - Int - IO ()
hGetInt :: Handle - IO Int
For the purposes of these functions, Int = 32 bits, and its got to
roundtrip - Put then Get must be the same.
How
Hi
hPutInt h = hPutStr h . map chr . map (0xff ..)
. take 4 . iterate (`shiftR` 8)
hGetInt h = replicateM 4 (hGetChar h) =
return . foldr (\i d - i `shiftL` 8 .|. ord d) 0
This of course assumes that a Char is read/written as a single low-order
byte without
Hi,
I note that in the base libraries, Data.Array.Diff is defined as:
type DiffArray = IOToDiffArray IOArray
However, IOToDiffArray takes 3 parameters.
I thought this was not allowed in Haskell 98? Its annoying from my
point of view because Hoogle wants to know the arity of a type, and if
it
Hi All,
I got up this morning {after not much sleep} to find these very
helpful suggestions/comments:
from Scott Turner:
{... See: http://www.haskell.org/hawiki/ExistentialTypes ...}
From Bulat Ziganshin:
{...
you can read recent discussion on this in this topic, or look at
This might be easier:
Prelude putStrLn $ return $ head this and that
t
Prelude
Gene A wrote:
The thread on the use of show and print to display an Int value,
brought up a problem I had early on... the one of cleanly displaying a
Char value, on a line all by itself.. My first attempts:
This
hi,
Now, is there a speed or cleaness of code advantage to using the
function composition method using (.) :
putStrLn . return . head $ This and that
over the application method...using ($):
putStrLn $ return $ head this and that
some thoughts on that ... they both work.. but any advantage
On 8/20/06, Brian Hulley [EMAIL PROTECTED]
wrote:
Henning Thielemann wrote: On Thu, 17 Aug 2006, Brian Smith wrote: I find it strange that right now almost every Haskell program directly or indirectly (through FPTOOLS) depends on CPP, yet there
is no effort to replace CPP with something better
Simon,I am familiar with the GHC library as I had used it a year or so ago to create a very cheap Haddock knockoff. I used the GHC library to do the type inference (which Haddock didn't do at the time) and to deal with elements that didn't have source code available. I remember that I created it
66 matches
Mail list logo
