#1351: mistake in Data.Set description
--+-
Reporter: guest |Owner:
Type: bug| Status: new
Priority: normal |Milestone:
Component:
#1351: mistake in Data.Set description
--+-
Reporter: guest |Owner:
Type: bug| Status: closed
Priority: normal |Milestone:
Component:
Hello,
I'm suddenly getting the following error when I compile a program:
bayesian-sets.hs:1:0:
The main function `main' is not defined in module `Main'
When checking the type of the main function `main'
I don't know what that means. Perhaps the error could be made more
human-friendly?
Hello,
If one of the modules you are importing (for example, Fu.NewLogging),
does *not* contain a line at the top like:
module Fu.NewLogging where
then I think you will get an error that looks something like that. I
am not sure if this is your problem, but if it is, it is an easy fix
:)
hope
Hello,
No, that is not the case, all imported modules are from packages which
are already compiled and functional.
I found that removing the .o and .hi files and recompiling the source
made it work.
However, should either of these things be necessary? I think users
oughtn't have to memorize and
At Sun, 13 May 2007 02:49:13 +0100,
Frederik Eaton wrote:
Hello,
However, should either of these things be necessary?
no.
I think users oughtn't have to memorize and execute a list of
haphazard tricks, for instance like reading the modules they import
and visually checking that they
On Sun, Apr 29, 2007 at 09:12:00AM -0400, Isaac Dupree wrote:
When I was doing `rm -r` on a build tree it pointed out that
driver/split/ghc-split.prl
and
driver/mangler/ghc-asm.prl
were write-protected. Tacking this down, they're generated from .lprl
with unlit... then (in mk/suffix.mk)
On Sun, May 06, 2007 at 10:09:10PM +0100, Adrian Hey wrote:
Can we expect a 6.6.1 binary and/or installer for windows sometime?
You've probably already noticed, but in case not, there are now two
installers available for Windows:
http://www.haskell.org/ghc/download_ghc_661.html#windows
On Fri, 2007-05-11 at 16:05 -0400, Isaac Dupree wrote:
Simon Peyton-Jones wrote:
It's very difficult to get inlining right all the time. Even for a
function marked INLINE, there's really no point in inlining in some
contexts. E.g.
map f xs
(don't inline f).
Would it make
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Duncan Coutts wrote:
Also, uninlining is nigh on impossible.
I would say that's the critical problem with my notion... Why is it so
difficult? Is it because it's too easy for some minor
optimization/change to be made in the Core representation,
Dirk Kleeblatt wrote:
Bas van Dijk wrote:
Regarding the use of labels, did you consider using circular
programming with recursive do to define and reference labels like in:
Russell O'Connor, Assembly: Circular Programming with Recursive do
Hello,
I have uploaded a simple AGI interface to hackage. It is still very
alpha, but that has never stopped me before :)
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/AGI-1.0
darcs get http://www.n-heptane.com/nhlab/repos/haskell-agi/
The best way to understand how to use it is
Gaal Yahas wrote:
What do higher-order types like lists mean when viewed through the
Curry-Howard correspondence? I've been wondering about this for a
while. The tutorials ask me to consider
[...]
But what does the following mean?
map :: (a - b) - [a] - [b]
Since the empty list inhabits
Henning Thielemann wrote:
I want to parse and process HTML lazily. I use HXT because the HTML parser
is very liberal. However it uses Parsec and is thus strict. HaXML has a
so called lazy parser, but it is not what I consider lazy:
[...]
Note that lazy parsing is inherently difficult and most
Hi,
What results should a lazy parser return before emitting ⊥? At the time
you read the html-tag, you cannot know whether a syntax error far down
in the file makes it invalid. Thus, you may not return the top-most
html-tag until you see the closing /html.
But to return the top most html you
Hi,
Hi,
What results should a lazy parser return before emitting ⊥? At the time
you read the html-tag, you cannot know whether a syntax error far down
in the file makes it invalid. Thus, you may not return the top-most
html-tag until you see the closing /html.
But to return the top
On Mon, May 07, 2007 at 10:43:04PM -0500, Josiah Manson wrote:
problem? Maybe, but I still think the behavior feels like deadlock, because
sometimes compilation hangs while sometimes it does not, and when it hangs
there is no CPU usage.
Can you get ghc -v output of (a) it hanging and (b) it
Sorry, please ignore.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org [EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
This is a question about some interesting behaviors in GHC's
typechecker regarding MPTCs. The brief code is at the bottom of the
message. By the way, the types can be inferred but not declared
without the forall and ascription in the where clause.
f1 below is illegal because we don't know what
19 matches
Mail list logo
