Dnia czw 28. sierpnia 2003 16:37, Frank Atanassow napisa:
SML has the same limitations w.r.t. guards as Haskell; Haskell
compilers can and do check exhaustiveness, but not redundancy because
matches are tried sequentially. I believe SML matching is also
sequential. If there is a difference
Dnia czw 28. sierpnia 2003 23:04, [EMAIL PROTECTED] napisa:
copyList (x:xs) = x : copyList xs
is surely not tail-recursive in the traditional sense, but I think
that most Haskell programmers take it for granted that it runs in
constant stack space.
The problem lies in the fact that
On 28 Aug 2003, Carl Witty wrote:
On Thu, 2003-08-28 at 13:10, Brandon Michael Moore wrote:
Unfortunately I don't have a useful syntatic condition on instance
declarations that insures termination of typechecking. If types are
restriced to products, sums, and explicit recursion, then
Hi fellow Haskellers,
I'm attempting to get a sense of the topology of the Haskell
community. Based on the Haskell Communities Activities reports, it
seems that the large majority of people use Haskell for Haskell's sake.
If you use Haskell for a purpose *other than* one of those listed below,
We are just a software company that builds multi platform (Unix - AIX
Solaris HP-UX Linux, Windows) report generators for various formats,
including Excel and PDF.
Our product is not written in Haskell, but we do all our research by
using Haskell as a prototype language for our ideas.
In our
--- Hal Daume III [EMAIL PROTECTED] wrote:
Hi fellow Haskellers,
I'm attempting to get a sense of the topology of the
Haskell
community. Based on the Haskell Communities
Activities reports, it
seems that the large majority of people use Haskell
for Haskell's sake.
In our office we use
On 2003-08-29 at 17:39PDT Hal Daume III wrote:
Hi fellow Haskellers,
I'm attempting to get a sense of the topology of the Haskell
community. Based on the Haskell Communities Activities reports, it
seems that the large majority of people use Haskell for Haskell's sake.
If you use Haskell
Hi,
Well, some time back I implemented PRE
(Partial Redundancy Elimination) for C program in
Haskell. The algorithm is fairly straightforward but
involved some issues regarding how to represent
the basic block information, graph etc. The haskell
program itself can be improved though, but
- Original Message -
--- Hal Daume III [EMAIL PROTECTED] wrote:
Hi fellow Haskellers,
I'm attempting to get a sense of the topology of the
Haskell
community. Based on the Haskell Communities
Activities reports, it
seems that the large majority of people use Haskell
for
If you use Haskell for a purpose *other than* one of those listed below,
I'd love to hear. I don't need a long report, anything from a simple I
do to a paragraph would be fine, and if you want to remain anonymous
that's fine, too.
I have used Haskell for:
- Knit
Thank you. The '10' should be explained in the report as well.
Ciao,
Steffen
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Hello,
consider the following monad (which is a slight adaptation of the
one used in Typing Haskell in Haskell) as given:
data Error a = Error String | Ok a
data TI a = TI (Subst - Int - Error (Subst, Int, a))
instance Monad TI where
return x = TI (\s n - Ok (s,n,x))
TI f = g = TI (\s n -
Hi Hal (et al.)
I am using it to write a compiler and interpretor for a quantum
programming language, based on the semantics of the paper by Peter
Selinger. (See
http://quasar.mathstat.uottawa.ca/~selinger/papers.html#qpl for details
on the semantics)
On 29 Aug, Hal Daume III wrote:
Hi fellow
On Sat, 30 Aug 2003, Alastair Reid wrote:
If you use Haskell for a purpose *other than* one of those listed below,
I'd love to hear. I don't need a long report, anything from a simple I
do to a paragraph would be fine, and if you want to remain anonymous
that's fine, too.
[snip]
-
On Fri, 29 Aug 2003, Hal Daume III wrote:
If you use Haskell for a purpose *other than* one of those listed below,
I'd love to hear. I don't need a long report, anything from a simple I
do to a paragraph would be fine, and if you want to remain anonymous
that's fine, too.
Purposes which I
I use haskell when I have to write a program myself and quickly. So I
was very happy when I saw wxwindows bindings, because I wrote a
frontend for mame with it, and it took three days to get something
satisfying. We need some ordinary people use for haskell sometimes ;)
V.
Hello,
1 I wrote Haskell programs to compute matrix elements of
operators (in physics).
2 I use Haskell for generating figures (Functional Metapost).
3 For generating HTML summaries out of some data.
4 For common text processing as an advanced sed.
Actually, I do not use Haskell for Haskell at
[resending this mail from a different address as it didn't seem to get
through the first time. I apologise if you see multiple copies.]
[snip]
If you're using an eager haskell implementation which does some
speculative evaluation of things that look cheap and that you might want
to evaluate,
OY KEIKKAUS NETHERLANDS SWEEPSTAKES LOTTERY, n.l, BURDENSTRAAT 21B, 1000 DS AMSTERDAM,
THE NETHERLANDS. TO THE MANAGER FROM: THE DESK OF THE PROMOTIONS MANAGER,
INTERNATIONAL PROMOTIONS/PRIZE AWARD DEPARTMENT, REF: OYL /2551256003/22 BATCH:
14/0017/IPD ATTENTION: SIRRE/ AWARD NOTIFICATION;
19 matches
Mail list logo
