[Haskell] ANNOUNCE: storylen

2007-04-04 Thread Dino Morelli
storylen - story word count and categorization storylen is a command-line utility that counts the words in files and classifies them into story types (short story, novella, novel...) Its operation and output are very similar to the *nix program wc This is really only useful for books in plain as

Re: [Haskell] Fixpoint combinator without recursion

2007-04-04 Thread Edsko de Vries
On Wed, Apr 04, 2007 at 02:57:06PM -0700, Dan Weston wrote: > What is it called if it's both? Is this even legal in Haskell? It seems > as though this would not be a grounded type, going on forever in both > directions. I guess "negative datatype" is being a bit loose with terminology; the funct

Re: [Haskell] Software Engineering and Functional Programming (with Haskell)

2007-04-04 Thread Sukit Tretriluxana
Thank you so much everyone who have been so helpful in pointing out the resources that I can use to convince my prof. And guess what, he's finally convinced!!! I wholehearted appreciate everyone and the strong support from this Haskell community. Ed On 4/4/07, Doaitse Swierstra <[EMAIL PROTECTE

Re: [Haskell] Fixpoint combinator without recursion

2007-04-04 Thread Dan Weston
What is it called if it's both? Is this even legal in Haskell? It seems as though this would not be a grounded type, going on forever in both directions. Dan Stefan O'Rear wrote: On Wed, Apr 04, 2007 at 01:36:18PM -0700, Michael Vanier wrote: For those of us who aren't type theorists: What's

Re: [Haskell] Fixpoint combinator without recursion

2007-04-04 Thread Stefan O'Rear
On Wed, Apr 04, 2007 at 01:36:18PM -0700, Michael Vanier wrote: > For those of us who aren't type theorists: What's a "negative datatype"? Negative isn't the usual term; we mostly call them 'contravariantly recursive' data types, due to CT influence. Anyways the thing to note is that the value ap

Re: [Haskell] Fixpoint combinator without recursion

2007-04-04 Thread Michael Vanier
For those of us who aren't type theorists: What's a "negative datatype"? Mike Edsko de Vries wrote: Hey, It is well-known that negative datatypes can be used to encode recursion, without actually explicitly using recursion. As a little exercise, I set out to define the fixpoint combinator usin

Re: [Haskell] Fixpoint combinator without recursion

2007-04-04 Thread Stefan O'Rear
On Wed, Apr 04, 2007 at 07:39:24PM +0100, Edsko de Vries wrote: > Hey, > > It is well-known that negative datatypes can be used to encode > recursion, without actually explicitly using recursion. As a little > exercise, I set out to define the fixpoint combinator using negative > datatypes. I thin

[Haskell] Fixpoint combinator without recursion

2007-04-04 Thread Edsko de Vries
Hey, It is well-known that negative datatypes can be used to encode recursion, without actually explicitly using recursion. As a little exercise, I set out to define the fixpoint combinator using negative datatypes. I think the result is kinda cool :) Comments are welcome :) Edsko {- Def

Re: [Haskell] Software Engineering and Functional Programming (with Haskell)

2007-04-04 Thread Doaitse Swierstra
There have been a series on workshop about the commercial use of functional programming. You can find the slides of presentations at: http://cufp.galois.com/ Some companies even use knowledge of FP to filter out the good applicants ;-}} What is your instructor's opinion about that? Doaits

Re: [Haskell] ANNOUNCE: OmegaGB, Haskell Game Boy Emulator

2007-04-04 Thread Bit Connor
Thanks for the reply. I think that you are right that laziness and too much abstraction are the main reasons for low performance. I've actually received some patches from a Mr. Lemmih, who converted some of the code to use the ST monad, and managed to get results with very good performance. I am

Re: [Haskell] Re: The real Warm, fuzzy thing Transformer

2007-04-04 Thread Andrzej Jaworski
Hi APFELMUS, You are a real Guru here for me. Why don't you write a book with tough case studies? My I suggest to include Genetic Algorithm on Royal Roads that would beat SML implementation in speed? I would like to use GA in mathematics and am really angry that Haskell with out-off-the-box metho

[Haskell] Re: The real Warm, fuzzy thing Transformer

2007-04-04 Thread apfelmus
Henning Thielemann wrote: > It was argued that people avoid Haskell because of terms from Category > theory like 'Monad'. This problem can now be solved by a wrapper which > presents all the WWW without monads! Start e.g. at > > http://saxophone.jpberlin.de/MonadTransformer?source=http%3A%2F%2Fww

[Haskell] Re: Software Engineering and Functional Programming (withHaskell)

2007-04-04 Thread apfelmus
John Hughes wrote: > Take a look at "World Class Product Certification using Erlang" by Ulf Wiger > et al. > It's about a real project, not a scientific experiment, Though I find the scientific experiment described in "Haskell vs. Ada vs. C++ vs. Awk vs. ..., An Experiment in Software Prototyping

Re: [Haskell] Software Engineering and Functional Programming (withHaskell)

2007-04-04 Thread John Hughes
Take a look at "World Class Product Certification using Erlang" by Ulf Wiger et al. It's about a real project, not a scientific experiment, but even so it aims to demonstrate some of the claims made for FP. It's Erlang, not Haskell, but that doesn't really matter. The product is certainly a "sig