Hi all! I don't read this mailing list, so please copy me on responses
if you think I need to see them.
Having some problems (all fixable) with the Solaris 4.2 GHC make.
1. Sun's cc can't handle empty structs.
Fix: add char empty; to all those structs.
2. Sun's cc can't handle
Do you want to drive me away from learning Haskell? Who the
hell can try
to write such functions? Is readabilty not a concern in Haskell?
I would have to agree, Sven does seem to be working hard to drive a
beginner away from Haskell. But he is illustrating an important
coding
I know, we all have something else to do than to take on extra
responsibilities. But if someone could donate an access to a
fast web server (mine is just too slow) then we could go
along Wiki-Wiki Web Server concepts
(http://c2.com:8080/WikiWikiWeb) and have
HaskellDirect - an IDL compiler for Haskell
A new release of HaskellDirect, version 0.15, is now available for
download (source + binaries.)
* What is it?
=
HaskellDirect is an IDL compiler for Haskell, helping to bridge the
gap between Haskell programs and the
Green Card 2.0
A Foreign Function Interface Preprocessor for Haskell
This is the second public release of Green Card, a foreign function
interface pre-processor for Haskell.
* What is it?
=
Green Card is a foreign function interface preprocessor
The Glasgow Haskell Compiler -- version 4.03 (beta)
===
A test release of the Glasgow Haskell Compiler (GHC), version 4.03 for
x86 Win32 platforms is now available. Distributions are freely
available via the World-Wide Web and
"Hans" == Hans Aberg [EMAIL PROTECTED] writes:
One reason flip(.) might be given a symbol similar to multiplication and
flip($) a symbol similar to exponentiation is that on the Church integer
functionals, these two operations are just the multiplication and
exponentiation
At 12:44 +0100 1999/06/02, Peter Hancock wrote:
One reason flip(.) might be given a symbol similar to multiplication and
flip($) a symbol similar to exponentiation is that on the Church integer
functionals, these two operations are just the multiplication and
exponentiation of
haskell.org is the obvious place. I'm sure John Peterson would be happy
to add stuff to the site.
Community-generated FAQ pages sound great, but
- Some (standard? readily-available?) technology is needed to allow
people to add stuff without intervention from the site organiser.
Hans Aberg wrote:
[...] Then together with the identity I, +, * and ^ can be written
out to be a primitive set for the lambda theory. That is, all lambda
expressions can be generated from these symbols.
Impressive! %-) Hmmm, I just thought about the possible directions
of this discussion if
At first, thanks to all of you about this nice insight into FP used
programmers. It was really a suprise to me to see that that what Sven
wrote seems to be easily understood. I would really like to see such
code-snippets to found on a central site what about www.haskell.org ?
I reread my book
Simon Peyton-Jones writes:
Community-generated FAQ pages sound great, but
- Some (standard? readily-available?) technology is needed to allow
people to add stuff without intervention from the site organiser.
The Wiki-Wiki-Web stuff indeed looks like a real possibility. I didn't
This summer I'd like to work with everyone on a major revamp of the
Haskell web pages. In particular, organize the libraries pages
and make it easier to search for existing code and more introductory
material, including some "Haskell Programming Pearls" and a good FAQ.
I'd also like to update
At 11:57 +0900 1999/06/02, Frank A. Christoph wrote:
I just wish a standard operator is chosen for a) flip (.) and b) flip
($) instead of having everyone make up their own. I don't really care
what it is. I truthfully like . for flip (.) and # for flip ($) but I
can easily change.
The
Hans Aberg wrote:
But it can be a spin-off for thoughts: A category is essentially an object
with I and *, and a functor is a map preserving those. So what about the
two other operations, + and ^ ?.
I somehow managed to delete Hans's earlier post in which he gives the
definitions for + and
At 16:46 +0200 1999/06/02, Sven Panne wrote:
[...] Then together with the identity I, +, * and ^ can be written
out to be a primitive set for the lambda theory. That is, all lambda
expressions can be generated from these symbols.
Impressive! %-) Hmmm, I just thought about the possible
FYI: I've uploaded a Linux (libc6) RPM for Hugs98, so the lazy :-)
users can upgrade via:
rpm -U ftp://ftp.informatik.uni-muenchen.de/pub/local/pms/hugs98-990601-1.i386.rpm
This version still has the bug that a dove tail in the first line
of a literate file is not handled.
Cheers,
Sven
17 matches
Mail list logo
