Re: Clean and Haskell

2000-01-13 Thread Doug Ransom
I am curious. How much faster do you think GHC would run if it were written in C? Or how much slower would a C++ compiler be if it were written in Haskell instead of C++? It seems to me that a compiler would be an ideal candidate for writing in a functional language. The number of times C++

RE: Haskell and the NGWS Runtime

2000-08-07 Thread Doug Ransom
It is not what language that you want on your phone that matters -- you didn't write the software. What matters is any development team can pick the language they prefer to use and make their software portable to your phone or your PC. -Original Message- From: Nigel Perry

RE: Haskell and the NGWS Runtime

2000-08-07 Thread Doug Ransom
Back to the language wars then. It does seem like integration of Haskell and the NGWS is a graunch, largely because Haskell is not OO. Is there anything preventing Haskell from becoming OO and seamlessly fitting into the NGWS? Or from designing a functional language that would be a good fit

RE: Haskell and the NGWS Runtime

2000-08-15 Thread Doug Ransom
I think most C++ programmers realize C++ for what it is, a poorly designed portable object oriented assembler language. Most C++ programmers use C++ because they program for windows and COM, and the only other real choices of development environments are VB and Delphi (which I do not know

RE: The importance and relevance of FP

2000-08-17 Thread Doug Ransom
of the development cycle trying to find a memory leak. Doug Ransom --Ben -- Benjamin L. Russell [EMAIL PROTECTED] [EMAIL PROTECTED] "Furuike ya! Kawazu tobikomu mizu no oto." --Matsuo Basho

RE: The importance and relevance of FP

2000-08-18 Thread Doug Ransom
I do believe FP is current 90 degrees out of phase with OO. I think the isue with tuples, lists, conses, etc. it the big problem. I currently see no way for someone to write a clever matrix library in Haskell and have it seamlessly integrate into the NGWS framework (the new object type and

Patterns Catalog

2000-09-08 Thread Doug Ransom
I have worked through "Haskell: The craft of functional programming". Learning the language is one thing, applying FP is another. The next thing I would like to study would be a catalog of patterns for lazy functional programming. In the Object-oriented world, there are some catalogs of useful

RE: Patterns Catalog

2000-09-14 Thread Doug Ransom
Unfortunately there are only 3 idioms cataloged. Maybe someone could get a thesis or textbook out of this. Here is a link to a description of such a book for OO: http://www.chapters.ca/books/details/default.asp?ISBN=0201633612mscssid=L5D

RE: ANNOUNCE: HaXml 1.00

2000-12-27 Thread Doug Ransom
I think it is important that a good haskell XML library be included as part of the haskell runtime library given XML's relevance. -Original Message- From: Malcolm Wallace [mailto:[EMAIL PROTECTED]] Sent: Thursday, November 16, 2000 8:42 AM To: [EMAIL PROTECTED] Subject:

Learning Haskell and FP

2000-12-27 Thread Doug Ransom
ut more advanced in terms of introducing necessary topics like Category theory, catamorphisms, monads, etc? I would find such a book very useful, especially if it concentrated on lazy functional programming. Doug Ransom Systems Engineer Power Measurement Ltd. http://www.pml.com 250-652-7100 office

RE: Haskell newsgroup

2000-12-28 Thread Doug Ransom
That would only work if the haskell mailing list was either delete or mirrored onto a newsgroup. I would prefer a newsgroup myself for bandwidth reasons. -Original Message- From: i r thomas [mailto:[EMAIL PROTECTED]] Sent: Thursday, December 28, 2000 12:53 AM To: [EMAIL PROTECTED]

RE: Learning Haskell and FP

2000-12-28 Thread Doug Ransom
Jeuring [mailto:[EMAIL PROTECTED]] Sent: Thursday, December 28, 2000 6:06 AM To: Doug Ransom Cc: [EMAIL PROTECTED] Subject: Re: Learning Haskell and FP Is there a good textbook on Functional Programming which starts from a base point similar to "The craft of Functional Progra

Haskell Language Design Questions

2000-12-29 Thread Doug Ransom
the Maybe monad, then it becomes hard to use if SomeFunction might raise an error. Am I missing something? Doug Ransom Systems Engineer Power Measurement Ltd. http://www.pml.com 250-652-7100 office 250-652-0411 fax mailto:[EMAIL PROTECTED

RE: combinator parsers and XSLT

2000-09-25 Thread Doug Ransom
There is no need for "." or [^abc] as Haskell list operators can be used to "simulate" them. The following is from the C lexer and matches all visible characters and all characters except newline, respectively: visible = alt [' '..'\127'] anyButNL = alt (['\0'..'\255'] \\

RE: combinator parser and XSLT

2000-09-25 Thread Doug Ransom
I think it would be useful if you could post the reparser stuff. I think it would be really cool if we could parse the xml in a lazy fashion so that the entire tree might not come into memory at once. i.e. let x=parse xml in (y,z)=processXml(someAlgebra,x) like the circular rep-min