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
