Good idea. There's suitable section here in the HEAD manual, here:
http://www.haskell.org/ghc/dist/current/docs/users_guide/special-ids.htm
l#id3159468
I'll add a subsection about unsafeCoerce#
Simon
| -Original Message-
| From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED]
| On Behalf
Hi
In that bit of the manual it also has inline as both the section
headings, so lazy won't show up in the table of contents. (a typo)
I didn't think to search the manual anyway, so it would be nice if
they could get added to the haddock index in some way.
Thanks
Neil
On 7/31/06, Simon
Dear GHC developers,
Long ago you wrote that GHC has made Integer only about 3/2 times
slower than Int.
I tested this once, and then all this time I have been relying on this.
Now, with
ghc-6.4.1 compiled for Linux - i386-unknown,
running under Debian
By my previous letter about cost(Integer)/cost(Int) = 2.55
I wanted to ask
is there anything new in ghc-6.4.1 in comparison to, say,
ghc-5.01, to ghc-4, with relation to this cost ratio?
Regards,
-
Serge Mechveliani
[EMAIL PROTECTED]
On Mon, 2006-07-31 at 14:32 +0400, Serge D. Mechveliani wrote:
Dear GHC developers,
Long ago you wrote that GHC has made Integer only about 3/2 times
slower than Int.
I tested this once, and then all this time I have been relying on this.
Now, with
ghc-6.4.1 compiled
Hi David,
For a while hoogle used to parse iface files with some Perl, its in
the hoogle repo under data/hihoo. It was particularly unreliable, but
might give some insights...
And there probably shouldn't be one, if people want it then use the
GHC API. Rather than defining a weak text format,
A more clever representation of Integer could unbox numbers in big
range.
But that would require some runtime support, I think.
-- Lennart
On Jul 31, 2006, at 11:19 , Duncan Coutts wrote:
On Mon, 2006-07-31 at 14:32 +0400, Serge D. Mechveliani wrote:
Dear GHC developers,
Long ago
However because Int is often unboxable where as Integer is never
unboxable there are certainly programs where the factor is much much
greater than x2 or x3. If the Int can be unboxed into an Int# then the
operations are very quick indeed as they are simple machine
primitives.
This has made
Dear Haskellers,
The following paper may still benefit from your comment.
The final version is only due per 10 August 2006.
Thanks,
Ralf Laemmel
--
http://homepages.cwi.nl/~ralf/gpce06/
Title: Software Extension and
On 31.07 03:18, Frederik Eaton wrote:
I don't think it's necessarily such a big deal. Presumably the library
with the worker threads will have to be invoked somewhere. One should
just make sure that it is invoked in the appropriate environment, for
instance with the database connection already
On 31.07 14:03, Thomas Conway wrote:
This is why I believe transaction-local variables are a more useful concept.
You are garanteed that there is only one thread accessing them, and
they behave just like ordinary TVars except that each transaction has
its own copy.
This seems like it could be
On Mon, Jul 31, 2006 at 03:09:59PM +0300, Einar Karttunen wrote:
On 31.07 03:18, Frederik Eaton wrote:
I don't think it's necessarily such a big deal. Presumably the library
with the worker threads will have to be invoked somewhere. One should
just make sure that it is invoked in the
Dear all,
The Scheme and Functional Programming Workshop
pre-registration deadline is in about 2 and a half weeks --
do be sure to register for ICFP and the workshop before
then.
Come to hear Manuel Serrano talk about HOP, his new language
for programming the web, a status report from the R6RS
Frederik Eaton wrote:
On Mon, Jul 31, 2006 at 03:09:59PM +0300, Einar Karttunen wrote:
On 31.07 03:18, Frederik Eaton wrote:
4) the library runs the callback code in Tw where the TLS state is
invalid. This is even worse than a global variable in this case.
If you have threads, and you have
Here it is, in all its greatly untested glory: http://pastebin.ca/109242
I don't know how much error it has, but the error won't stack up: if
it's one second off, it will remain one second off until the end of
time, or until your system clock drifts. But system clock drifts will
be fixed by
Is there a mod_haskell (like mod_perl and mod_python) for Apache HTTP
server? Does anyone know about it?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'm trying to write a Parsec parser for a language which authorizes
(this is a simplified example) a or a,b,c or a,c or a,b. (I
can change the grammar but not the language.)
The first attempt was:
* CUT HERE
import Text.ParserCombinators.Parsec
import System (getArgs)
comma = char ','
Thanks, But it seems to be dead! (Last news on 18 Apr 2002). Is there
a more mature one?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2006/7/31, Kaveh Shahbazian [EMAIL PROTECTED]:
Thanks, But it seems to be dead! (Last news on 18 Apr 2002). Is there
a more mature one?
it seems the answer (to which you say thanks) was not posted on the
mailing list...
what was it ?
mt
___
On 7/31/06, Kaveh Shahbazian [EMAIL PROTECTED] wrote:
Is there a mod_haskell (like mod_perl and mod_python) for Apache HTTP
server? Does anyone know about it?
There is. However, you're way better off using FastCGI.
http://www.cs.chalmers.se/~bringert/darcs/haskell-fastcgi/doc/
--
Friendly,
On 7/31/06, Lemmih [EMAIL PROTECTED] wrote:
On 7/31/06, Kaveh Shahbazian [EMAIL PROTECTED] wrote:
Is there a mod_haskell (like mod_perl and mod_python) for Apache HTTP
server? Does anyone know about it?
There is. However, you're way better off using FastCGI.
On Mon, Jul 31, 2006 at 09:04:32AM +0200, Stephane Bortzmeyer wrote:
minilang = do
char 'a'
try (optional (do {comma ; char 'b'}))
optional (do {comma ; char 'c'})
eof
return OK
parse error at (line 1, column 2):
unexpected c
expecting b
On Mon, Jul 31, 2006 at 10:59:14AM +0200,
Matthias Fischmann [EMAIL PROTECTED] wrote
a message of 89 lines which said:
try b | (return '-')
...
The (return 'x') is needed for type consistency.
OK, it works. Many thanks for the solution and the explanations.
Hi there!I'm trying to user Haskell as a code-generating language, specifically generating C# code files. The wish list is1) reading UTF-8 coded text files into unicode-enabled Strings, lets call them UString
2) writing UStrings to UTF-8 coded text files3) using unicode strings in-code, that is in
On 31/07/06, Olof Bjarnason [EMAIL PROTECTED] wrote:
1) reading UTF-8 coded text files into unicode-enabled Strings, lets call them UString
2) writing UStrings to UTF-8 coded text files3) using unicode strings in-code, that is in my .hs filesIn case of GHC:String (Char actually) is unicode
On Mon, 2006-07-31 at 13:56 +0200, Olof Bjarnason wrote:
Hi there!
I'm trying to user Haskell as a code-generating language, specifically
generating C# code files. The wish list is
1) reading UTF-8 coded text files into unicode-enabled Strings, lets
call them UString
The ordinary Haskell
Hello Olof,
Monday, July 31, 2006, 3:56:45 PM, you wrote:
1) reading UTF-8 coded text files into unicode-enabled Strings, lets call
them UString
2) writing UStrings to UTF-8 coded text files
3) using unicode strings in-code, that is in my .hs files
first solution:
On 31/07/06, Bulat Ziganshin [EMAIL PROTECTED] wrote:
first solution: http://haskell.org/haskellwiki/Library/Streams
Looks nice. Just a quick question - does it have an equivalent of
read(write)File?
Regards,
--
Intelligence is like a river: the deeper it is, the less noise it makes
Stephane Bortzmeyer wrote:
minilang = do
char 'a'
try (optional (do {comma ; char 'b'}))
optional (do {comma ; char 'c'})
eof
return OK
* CUT HERE ***
parse error at (line 1, column 2):
unexpected c
expecting b
Apparently,
Hello Piotr,
Monday, July 31, 2006, 4:23:16 PM, you wrote:
first solution: http://haskell.org/haskellwiki/Library/Streams
Looks nice. Just a quick question - does it have an equivalent of
read(write)File?
no, but you can borrow this code from ghc's System.IO module, see
below. actually, if
On Mon, Jul 31, 2006 at 12:57:04PM +0200,
Udo Stenzel [EMAIL PROTECTED] wrote
a message of 59 lines which said:
Now 'optional x' always succeeds, so the 'try' is useless where you
placed it. You need to 'try' the argument to 'optional':
It works, too. Many thanks for the code and the
On Jul 30, 2006, at 5:28 PM, Brian Hulley wrote:
Robert Dockins wrote:
On Sunday 30 July 2006 07:47, Brian Hulley wrote:
Another option, is the Edison library which uses:
class (Functor s, MonadPlus s) = Sequence s where
so here MonadPlus is used instead of Monoid to provide empty and
Robert Dockins wrote:
On Jul 30, 2006, at 5:28 PM, Brian Hulley wrote:
Robert Dockins wrote:
So, what you want is a sequence of sequences that can be
transparently converted to a flattened sequence and vice versa?
Yes as long as the conversion between them takes no time at all - the
The semantics of Parsec's optional operation are what is causing the problem.
optional foo can have 3 results:
1) foo can succeed, optional succeeds, proceed to next command
2) foo can fail without consuming any input, optional succeeds proceed to
next command
3) foo can fail after
On Mon, Jul 31, 2006 at 06:51:27PM +0100,
Chris Kuklewicz [EMAIL PROTECTED] wrote
a message of 102 lines which said:
minilang = do
char 'a'
optional (try (do {comma ; char 'b'}))
optional (do {comma ; char 'c'})
eof
return OK
I now have a new problem which
G'day all.
Quoting Robert Dockins [EMAIL PROTECTED]:
Edison's design hails from a time when MPTCs were not only non-standard (as
they still are), but also not widely used, and before fundeps were avaliable
(I think).
Yes. Chris Okasaki's original version of Edison was standard H98.
I've
G'day all.
Quoting Brian Hulley [EMAIL PROTECTED]:
The problem is that some people will be using Data.Edison.Seq at the moment
and will naturally not want it to change. However I'd suggest that all the
common operations be factored out into separate classes eg:
While I think the huge
[EMAIL PROTECTED] writes:
G'day all.
Quoting Robert Dockins [EMAIL PROTECTED]:
I've considered reformulating the Sequence class to be more similar
to the Collection classes (which use MPTCs, fundeps and mention the
element type),
The redesign of the Collection hierarchy was from my
Hi:
I'm having trouble compiling wxhaskell 0.9.4 under both ghc 6.4.2 and
ghc 6.5. Does anyone know where I should direct my queries?
Thanks.
David F. Place
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
I've done this recently. I put my notes on the wiki:
http://www.haskell.org/haskellwiki/WxHaskell/Install#Windows
Do you have a particular error message?
Jason
On 7/31/06, David F. Place [EMAIL PROTECTED] wrote:
Hi:
I'm having trouble compiling wxhaskell 0.9.4 under both ghc 6.4.2 and
ghc
Brian Hulley writes:
1) Did Edison choose MonadPlus just because this fitted in with the
lack of multi-parameter typeclasses in H98?
Instances of Monoid (and your ISeq) have kind *. Instances of MonadPlus
(and Edison's Sequence) have kind * - *.
Functions like map, zip, and their variants are
Hmmm I found
http://www.haskell.org/haskellwiki/WxHaskell/Installation_tips
so there are two such pages, the other being:
http://www.haskell.org/haskellwiki/WxHaskell/Install
so perhaps these pages can be merged? and a redirect placed from one
to the other?
Cheers,
Jared.
On 7/31/06,
On Mon, 2006-07-31 at 19:11 -0400, David F. Place wrote:
Hi:
I'm having trouble compiling wxhaskell 0.9.4 under both ghc 6.4.2 and
ghc 6.5. Does anyone know where I should direct my queries?
Assuming you're using wxHaskell on linux with wxGTK then the usual
problem with compiling
G'day all.
Quoting David Menendez [EMAIL PROTECTED]:
That's a tough call to make. Changing the kind of Sequence to * from *
- * means losing the Functor, Monad, and MonadPlus superclasses and all
the various maps and zips.
And on the other hand, containers that need extra constraints (e.g.
David Menendez wrote:
Brian Hulley writes:
1) Did Edison choose MonadPlus just because this fitted in with the
lack of multi-parameter typeclasses in H98?
Instances of Monoid (and your ISeq) have kind *. Instances of
MonadPlus (and Edison's Sequence) have kind * - *.
Functions like map,
David Menendez wrote:
[EMAIL PROTECTED] writes:
I didn't get around to fixing Sequence because there wasn't a need
for it yet, but yes, it should be done.
That's a tough call to make. Changing the kind of Sequence to * from *
- * means losing the Functor, Monad, and MonadPlus superclasses and
[EMAIL PROTECTED] wrote:
G'day all.
Quoting Brian Hulley [EMAIL PROTECTED]:
The problem is that some people will be using Data.Edison.Seq at the
moment and will naturally not want it to change. However I'd suggest
that all the common operations be factored out into separate classes
eg:
Brian Hulley wrote:
David Menendez wrote:
Brian Hulley writes:
4) Would it be worth reconsidering the rules for top level names so
that class methods could always be local to their class (ditto for
value constructors and field names being local to their type
constructor).
Qualified module
On 7/31/06, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
G'day all.
Quoting David Menendez [EMAIL PROTECTED]:
That's a tough call to make. Changing the kind of Sequence to * from *
- * means losing the Functor, Monad, and MonadPlus superclasses and all
the various maps and zips.
Perhaps
On Tue, Aug 01, 2006 at 02:56:21AM +0100, Brian Hulley wrote:
Now the problem is that person C may come along and notice that there is a
useful abstraction to be made by inheriting both from ClassA and ClassB.
But both of these define foo and there is no mechanism in the language to
resolve
On 7/31/06, David F. Place [EMAIL PROTECTED] wrote:
Hi:
I'm having trouble compiling wxhaskell 0.9.4 under both ghc 6.4.2 and
ghc 6.5. Does anyone know where I should direct my queries?
If you use ghc 6,4,2 under Windows platform, you
can use my patched version of wxHaskell.
And you can
51 matches
Mail list logo
