I'm trying to build a recent cvs checkout of
glass.cse.ogi.edu:/cvs/fptools. First, I get the following error:
checking for happy... /usr/bin/happy
checking for version of happy... 1.14
configure: error: Happy version 1.15 or later is required to compile GHC.
But the newest version of happy in
On 26 February 2005 03:25, Frederik Eaton wrote:
I'm trying to build a recent cvs checkout of
glass.cse.ogi.edu:/cvs/fptools. First, I get the following error:
checking for happy... /usr/bin/happy
checking for version of happy... 1.14
configure: error: Happy version 1.15 or later is
Bugs item #1146068, was opened at 2005-02-22 09:11
Message generated for change (Comment added) made by simonpj
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1146068group_id=8032
Category: Compiler (Type checker)
Group: 6.4
Status: Closed
Resolution:
Bugs item #1153674, was opened at 2005-02-28 10:09
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1153674group_id=8032
Category: Compiler (Parser)
Group: 6.2.2
Status: Open
On Mon, Feb 28, 2005 at 03:01:53AM -, Simon Peyton-Jones wrote:
Ah, this one we fixed a few days ago. Works for me with the head.
Thanks for your well-boiled-down bug reports; they are a lot faster to
fix.
Simon
Thanks, it's nice to hear that. Though I consider it a fair
deal: I'm
Feature Requests item #1153029, was opened at 2005-02-27 12:24
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=358032aid=1153029group_id=8032
Category: None
Group: None
Status: Open
On 28 February 2005 05:38, Kip Macy wrote:
In a clean tree I configured:
./configure --prefix=/u/kmacy/usr/x86_64
--with-ghc=/u/kmacy/src/ghc/src/ghc-6.2.2-x86_64-x86_64/ghc/compiler/ghc
-inplace
where the ghc-inplace is unregisterised, points to stage1, and is
known to compile Hello World
Feature Requests item #1153029, was opened at 2005-02-27 20:24
Message generated for change (Comment added) made by simonmar
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=358032aid=1153029group_id=8032
Category: None
Group: None
Status: Closed
Priority: 5
On 25 February 2005 15:48, Christian Maeder wrote:
we used redirect output of ghc via tee (within a Makefile). With the
new ghc this randomly fails now. Does anyone have an explanation for
this?
ghc omitted args 21 | tee log
yields:
Skipping Main ( hets.hs, hets.o )
Simon Peyton-Jones [EMAIL PROTECTED] writes:
I think I've fixed this (on the head anyway; simon will merge to branch
shortly). Care to try again?
Yup, the toplevel rigid type-variable problem seems to have been fixed,
thanks. nhc98 now builds as expected with ghc-6.4.
BTW, there seems to be
Hi,
The following either eats memory until killed or segfaults (I can't pin
down a reason for the difference). Tested with GHC 6.2.2 and 6.4.20050212,
with various different libgmp3s under various Redhat and Debian platforms,
and WinXP.
Prelude :m +Data.Bits
Prelude Data.Bits
On Mon, Feb 28, 2005 at 02:55:56PM +, Ganesh Sittampalam wrote:
Hi,
The following either eats memory until killed or segfaults (I can't pin
down a reason for the difference). Tested with GHC 6.2.2 and 6.4.20050212,
with various different libgmp3s under various Redhat and Debian
On Mon, 28 Feb 2005, Remi Turk wrote:
On Mon, Feb 28, 2005 at 02:55:56PM +, Ganesh Sittampalam wrote:
Prelude :m +Data.Bits
Prelude Data.Bits 18446658724119492593 `shiftL` (-3586885994363551744) ::
Integer
and calculating, in your case, 2^3586885994363551744 is not
something your
On Mon, Feb 28, 2005 at 10:59:32PM +, Ganesh Sittampalam wrote:
On Mon, 28 Feb 2005, Remi Turk wrote:
On Mon, Feb 28, 2005 at 02:55:56PM +, Ganesh Sittampalam wrote:
Prelude :m +Data.Bits
Prelude Data.Bits 18446658724119492593 `shiftL` (-3586885994363551744) ::
Integer
Hi,
I have been racking my brain over the infamous 'gfoldl' and 'gunfold'
combinators. (Yes, I have read the papers). What finally made me understand
how they worked was reading the code: first the implementation of the gmap
functions (Data/Generics/Basics.hs), then the long and detailed
That's a very good point.
Me too, I would often wish to see some principled
code details when entering documentation. For instance
what is the point of _explaining_ that inc aliases
add 1, why not just show that equation! I agree that
gmap?? are a bit of this kind. It is so much easier to
explain
On Mon, Feb 28, 2005 at 05:20:18PM -0800, Ralf Lammel wrote:
That's a very good point.
Me too, I would often wish to see some principled
code details when entering documentation. For instance
what is the point of _explaining_ that inc aliases
add 1, why not just show that equation! I agree
Is there a type we can give to
y f = f . f
y id
y head
y fst
are all typeable?
Jim Apple
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
On Mon, 28 Feb 2005 03:50:14 -0500
Jim Apple [EMAIL PROTECTED] wrote:
Is there a type we can give to
y f = f . f
y id
y head
y fst
are all typeable?
Using ghci:
Prelude let y f = f.f
Prelude :t y
y :: forall c. (c - c) - c - c
So it admits principal type (a-a) - a-a. From this
The name y suggests that you want to define the fixpoint combinator.
This works as follows:
Prelude let y f = f (y f)
Prelude :type y
y :: forall t. (t - t) - t
Prelude y (\fac n - if n == 0 then 1 else n*fac(n-1)) 10
3628800
Prelude
Till
Pedro Vasconcelos wrote:
On Mon, 28 Feb 2005 03:50:14 -0500
Call for Tutorials - ICTAC05
INTERNATIONAL COLLOQUIUM ON
THEORETICAL ASPECTS OF COMPUTING
Hanoi, Vietnam - 17--21 October, 2005
http://www.iist.unu.edu/ictac05
=
BACKGROUND AND OBJECTIVES
ICTAC is an International Colloquium on Theoretical Aspects of
Computing founded by the
Hi Group,
i'm trying to complete an haskell pgsql interface.
all compiles well when using ghc's generated executable
but it segfaults when i do a pqexec.
-- PGresult *PQexec(PGconn *conn, const char *query);
foreign import ccall libpq-fe.h PQexec
pqexec::X_PGconn-CString-IO X_PGresult
Pedro Vasconcelos wrote:
Jim Apple [EMAIL PROTECTED] wrote:
Is there a type we can give to
y f = f . f
y id
y head
y fst
are all typeable?
Using ghci:
Prelude let y f = f.f
Prelude :t y
y :: forall c. (c - c) - c - c
So it admits principal type (a-a) - a-a. From this you can see that
(y
Hi,
I've got a little parser written using Parsec that I want to link into
some C code. I start by compiling the Haskell sources like so:
ghc -ffi -fglasgow-exts -main-is My_Init -c parse.hs
When linking parse.o and parse_stub.o against my (additional) glue code,
I get the following
On 2005-02-28 at 18:03GMT Ben Rudiak-Gould wrote:
Pedro Vasconcelos wrote:
Jim Apple [EMAIL PROTECTED] wrote:
Is there a type we can give to
y f = f . f
y id
y head
y fst
are all typeable?
Using ghci:
Prelude let y f = f.f
Prelude :t y
y :: forall c. (c - c) -
adam.turoff:
Hi,
I've got a little parser written using Parsec that I want to link into
some C code. I start by compiling the Haskell sources like so:
ghc -ffi -fglasgow-exts -main-is My_Init -c parse.hs
When linking parse.o and parse_stub.o against my (additional) glue code,
I
On Thursday 24 February 2005 23:27, Keean Schupke wrote:
Benjamin Franksen wrote:
Well at the moment this would give an error, but remember the
list is heterogeneous, so you can just not give the list a type, and
simply append the specific function... admitedly this is not as
type-safe.
Jon Fairbairn writes:
On 2005-02-28 at 18:03GMT Ben Rudiak-Gould wrote:
Pedro Vasconcelos wrote:
Jim Apple [EMAIL PROTECTED] wrote:
Is there a type we can give to
y f = f . f
y id
y head
y fst
are all typeable?
Using ghci:
Prelude let y f = f.f
Jon Fairbairn wrote:
If you allow quantification over higher
kinds, you can do something like this:
d f = f . f
d:: a::*, b::**.(b a a) b (b a) a
What's the problem with
d :: (forall c . b c - c) - b (b a) - a
d f = f . f
to which ghci gives the type
d :: forall a b. (forall c. b c - c) -
If you are not using them to prevent overlapping instances, then why
require instance decls at all? For example, why does
GHC require an instance decl here:
instance (Ord x)=ToSet [] x where toSet = Set.fromList
But not here:
listToSet x = Set.fromList x
Or I suppose, one could rephrase
Is it widely accepted that the precedence of infix operators is defined by
numbers? The numbers look arbitrary to me and it is not possible to
introduce infix operators with interim precedences.
What about defining relations such as (*) has precedence over (+)? The
compiler could construct a
Henning Thielemann writes:
Is it widely accepted that the precedence of infix operators is defined by
numbers? The numbers look arbitrary to me and it is not possible to
introduce infix operators with interim precedences.
What about defining relations such as (*) has precedence over (+)? The
Hi Group,
i'm trying to complete an haskell pgsql interface.
all compiles well when using ghc's generated executable
but it segfaults when i do a pqexec.
-- PGresult *PQexec(PGconn *conn, const char *query);
foreign import ccall libpq-fe.h PQexec
pqexec::X_PGconn-CString-IO X_PGresult
Simon Marlow [EMAIL PROTECTED] writes:
Is it important which thread executes Haskell code (I bet no) and
unsafe foreign calls (I don't know)? If not, couldn't the same OS
thread execute code of both threads until a safe foreign call is made?
Actually in a bound thread, *all* foreign calls
| Or I suppose, one could rephrase this question as why not
| simplify instance declarations to be:
|
|instance ToSet where
| toSet = Set.fromList
|
| And let the typechecker take care of figuring out what instance is
| being specified here?
That might be possible, but Haskell forces
Hi,
I've seen some options for GUI programming in Haskell libraries page,
but what I really would like is to define my user interface using HTML
(or, maybe, SVG). What are the options to do that in Haskell? I've read
that Gtk2Hs has a mozilla rendering engine, but unfortunatly that won't
G'day all.
Quoting [EMAIL PROTECTED]:
Widely accepted is a widely accepted relativism...
I am also annoyed by the precedences 0,1,2, ...,9, etc.
Why not 10, 20, 30,... ??
I _think_ we had this back around Haskell 1.1 (which I never used, but
early Gofers also had it). Moreover, operators
37 matches
Mail list logo
