Now fixed properly in the head (and 6.2)
| -Original Message-
| From: [EMAIL PROTECTED]
[mailto:glasgow-haskell-bugs-
| [EMAIL PROTECTED] On Behalf Of Ross Paterson
| Sent: 15 March 2004 17:27
| To: [EMAIL PROTECTED]
| Subject: newtype of newtype
|
| The following little module:
|
|
Hi,
my program throws
Stack space overflow: current size 1048576 bytes.
Use `+RTS -Ksize' to increase it.
only when translated with -O. Is it possible that the next release of
ghc uses a higher stack size at least when the -O flag is set? (Only
to reduce the likelyhood that our users need to
Thanks to Sigbjorn, our long-suffering Windows installer guru, there is
a new Windows installer release candidate for 6.2.1 is here:
http://www.haskell.org/ghc/dist/stable/dist/ghc-6-2-1.msi
Please test. We'd especially like to hear from Win98/WinME users. Also
try installing under a directory
Christian Maeder [EMAIL PROTECTED] writes:
Stack space overflow: current size 1048576 bytes.
Use `+RTS -Ksize' to increase it.
only when translated with -O. Is it possible that the next release
of ghc uses a higher stack size at least when the -O flag is set?
(Only to reduce the
In keeping with recent announcements regarding database libraries,
Oleg Kiselyov and I present a library to interface to the Oracle DBMS.
This library is a low-level interface for issuing SQL commands,
similar to HSQL. It uses the Oracle Call Interface, a low-level C library
provided with most
Graham Klyne wrote:
I'm trying to check this out with some software that uses a previous
version (HXml toolbox), and I get the following error from Hugs:
[[
Reading file ..\http\Browser.hs:
Type checking
ERROR ..\http\Browser.hs:865 - Type error in application
*** Expression : ioAction $
On Wed, Mar 17, 2004 at 11:12:23AM -, José Vilaça wrote:
I'm searching for more detailed information about
Language.Haskell.Syntax than the one provided by the Haddock
documentation of the Hierarchical Libraries.
Unfortunately, that's all there is. The docs are sparse, but the types
do
On a related note, I recently implemented a System.Process library on
Unix. Source code attached. The Windows implementation should be
relatively straightforward. Porting it to Hugs will require
System.Posix.forkProcess, but I don't see any great difficulties there.
One warning: if you want
I have a microcontroller connected to the COM2 port on a Windows machine, and
want my Haskell program to interact with it. My Haskell program is working
nicely on my Mac, with interaction using stdin and stdout, but I am not
familiar with Windows and a quick Google search did not give me any
On Mar 10, 2004, at 8:56 AM, [EMAIL PROTECTED] wrote:
Example (readers familiar with the problem may
skip this):
salutationDear Mr.nameRobert Smith/name./salutation
This structure is represented by the XML Schema
xsd:element name=salutation
xsd:complexType mixed=true
xsd:sequence
xsd:element
Hello,
Given the fact that Haskell 98 demands that class constraints in an
explicit type are
in a normal form (either a variable, or a type variable applied to a
list of types), it struck me
that in the following (not very useful) program ghci yields a type
which is not of that form.
class X
GHC does context reduction as late as possible, so that when overlapping
instances are involved the commitment is made where maximum information
is available.
Simon
| -Original Message-
| From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]
On Behalf Of Jurriaan Hage
| Sent: 17 March 2004
hi ,
this is an interesting discussion and i agree that in general instances
of Eq should be equality, but what do people mean by real equality?
probably the most reasonable interpretation is some sort of
observational equivalance, i.e. if two things are equal we should always
be able to replace
On Wed, Mar 17, 2004 at 05:46:25PM +1030, Peter Pudney wrote:
I have a microcontroller connected to the COM2 port on a Windows machine, and
want my Haskell program to interact with it. My Haskell program is working
nicely on my Mac, with interaction using stdin and stdout, but I am not
Dear Haskellers,
Today I searched over more than an hour on the web to
find an implementation of an algorithm that was first
written in the 1970's that solves 2-Conjuntive Normal
Form logical sentences in polynomial time.
I don't recall the exact algorithm, but here are some observations:
[moving to haskell-cafe due to an extreme shift in topic]
On Wed, Mar 17, 2004 at 08:55:22AM +0100, Ketil Malde wrote:
So it is agreed: we use is :-)
Hmm...
s1 `isSubsetOf` s2 vs s1 `isSubset` s2
isSubsetOf s1 s2 isSubset s1 s2
I'm not sure I have any
Has anyone recently built Haddock on Windows? I'm invoking
configure and
make from Cygwin bash. Configure takes a couple of hours, and
then make produces a load of errors (see below).
I'm ashamed to say that Haddock, like Alex and Happy don't really
support native Windows too well.
You
Got it built after realising that my PATH didn't include ghc (thanks Andy
Moran). I renamed haddock.bin to haddock.exe and copied to into ghc's bin
for convenience (ghc's bin is already in my path). Now I just have to figure
out how to invoke it...
Where can I find instructions for use? I see
Hello Alistair,
Where can I find instructions for use? I see haddock.sgml in
haddock-0.6/haddock/doc but reading sgml hurts. Is there an html version
of
this somewhere?
Haddock is very well documented at http://www.haskell.org/haddock/
Greetings, Arjan
http://www.haskell.org/haddock/docs/haddock.html
Ahh, sorry, somehow I missed that. Yes, that is the html generated from the
sqml.
-Original Message-
From: Arjan van IJzendoorn [mailto:[EMAIL PROTECTED]
Sent: 17 March 2004 14:00
To: Bayley, Alistair
Cc: [EMAIL PROTECTED]
Subject:
20 matches
Mail list logo
