Mailing List Archive
tlug.jp Mailing List tlug archive tlug Mailing List Archive
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]Re: [tlug] Functional Programming Group Meeting
- Date: Thu, 24 Apr 2008 10:18:15 +0900
- From: "Stephen J. Turnbull" <stephen@example.com>
- Subject: Re: [tlug] Functional Programming Group Meeting
- References: <20080418052710.GQ19582@lucky.cynic.net> <ed10ee420804180003u62f516faif03c3a4a7f49d765@mail.gmail.com> <20080419072835.GC15075@pragmatic.cynic.net> <ed10ee420804190138p4c8187fbo26d8957c06a42179@mail.gmail.com> <874p9ydz80.fsf@uwakimon.sk.tsukuba.ac.jp> <20080420063549.GA9312@lucky.cynic.net> <87y778xmfa.fsf@uwakimon.sk.tsukuba.ac.jp> <20080422222304.GC25426@pragmatic.cynic.net> <878wz5p191.fsf@uwakimon.sk.tsukuba.ac.jp> <20080423232530.GB29521@pragmatic.cynic.net>
Curt Sampson writes: > I guess you're thinking of a different issue than the one I know about. > Send me the details, if you like, and I'll look into this. They're on darcs-devel. I don't really care any more; Darcs is dog-slow compared to git in any case, and I don't expect that to change because the problem it solves is inherently harder than the one git solves. > > I'm not claiming that average case is bad. I'm claiming that worst > > case can be surprisingly bad. > > So, would you also claim that in non-lazy languages the worst case can > also be surprisingly bad? No. It's a matter of what people are used to. Haskell is a research language, and almost by definition most people will not be used to it. And I've seen people for whom it is the weapon of choice get bad results from it. > When I set up the full search tree for a problem and start > searching it, it suprises me now that the computer went and did > about a hundred CPU-years of computations that it then threw away > becuase they were never used. "The doctor says to put down the hammer." And what do you do if you need that same search tree for 1000 searches? It's not like (defun get-search-tree () (or search-tree-cache (setq search-tree-cache (compute-the-cache)))) hasn't been an idiom since John McCarthy was an assistant professor. It's not that hard to express lazy construction in a similar fashion (but I'm out of practice and in a hurry, so I won't do it right now). Sure, Haskell generalizes and automates this to some extent with memoization, which is nice. > Haskell certainly needs a different way of thinking. However, saying > that "commonly used" algorithms have "suprising" behaviour is about the > same as complaining that one's good algorithms don't work in Smalltalk > because it doesn't have a computed GOTO. No, it's not the same at all. When TOOWTDI[1] is an imperative, "that way is efficient" is also imperative. If it can't be done "that way" then of course "that way" doesn't need to work, let alone be fast. Footnotes: [1] GOTO shell, type "python", and then "import this".
- Follow-Ups:
- Re: [tlug] Functional Programming Group Meeting
- From: Curt Sampson
- References:
- [tlug] Functional Programming Group Meeting
- From: Curt Sampson
- Re: [tlug] Functional Programming Group Meeting
- From: SL Baur
- Re: [tlug] Functional Programming Group Meeting
- From: Curt Sampson
- Re: [tlug] Functional Programming Group Meeting
- From: SL Baur
- Re: [tlug] Functional Programming Group Meeting
- From: Stephen J. Turnbull
- Re: [tlug] Functional Programming Group Meeting
- From: Curt Sampson
- Re: [tlug] Functional Programming Group Meeting
- From: Stephen J. Turnbull
- Re: [tlug] Functional Programming Group Meeting
- From: Curt Sampson
- Re: [tlug] Functional Programming Group Meeting
- From: Stephen J. Turnbull
- Re: [tlug] Functional Programming Group Meeting
- From: Curt Sampson
Home | Main Index | Thread Index
- Prev by Date: Re: [tlug] Kernel panic
- Next by Date: Re: [tlug] Kernel panic
- Previous by thread: Re: [tlug] Functional Programming Group Meeting
- Next by thread: Re: [tlug] Functional Programming Group Meeting
- Index(es):
Home Page Mailing List Linux and Japan TLUG Members Links