RE: [Haskell-cafe] libffi mystery

Conor McBride wrote: > Is there some way I can get some more static linking to happen? > I did poke about online a bit and found some remarks to the effect > that GHC got so much more portable after switching to the dynamic > libffi. That sounds great, but tough luck for me. > > So, being both

RE: [Haskell-cafe] Bug in HTTP (bad internal error handling)

Bit Connor wrote: > On Sat, Oct 16, 2010 at 10:29 AM, Claus Reinke > wrote: >>> After it catches this error, the function returns (line 376): >>> >>> return (fail (show e)) >>> >>> The "fail" is running in the Either monad (The Result type = >>> Either). This calls the default Monad implementat

RE: [Haskell-cafe] ANNOUNCE: tls, native TLS/SSL protocolimplementation

Vincent Hanquez wrote: > On Fri, Oct 08, 2010 at 12:54:48PM +0100, Sittampalam, Ganesh wrote: >> What's the motivation for this? > > Well, I wanted to have a tls/ssl module that integrate nicely with > haskell. > until then the 2 solutions were: > > - shelli

RE: [Haskell-cafe] ANNOUNCE: tls, native TLS/SSL protocolimplementation

Vincent Hanquez wrote: > On Fri, Oct 08, 2010 at 11:14:01AM +0530, C K Kashyap wrote: >> Does native mean "Haskell only" - without FFI? > > Native means the implementation is in haskell, and the library is not > using another implementation (in another language) to do the work: > either through FF

RE: [Haskell-cafe] base-3 -> base-4

Johannes Waldmann wrote: > Is there a "conversion guide" for switching from base-3 to base-4? > > I noticed that ghc-HEAD (6.13) comes with base-4.3 (and no base-3). > This will break an awful lot of packages (?), in fact the breakage > starts with cabal-install (since it depends on HTTP which dep

RE: [Haskell-cafe] cabal, Setup.lhs example

Mark Wotton wrote: > Perhaps cabal should print a warning if you have a Setup.hs file, > _and_ try to use Simple? It'd at least give the hint that they're > unhappy together. I think it should instead verify that Setup.hs is consistent with a Simple build. I don't know how much variation exists

RE: [Haskell-cafe] Page rank and GHC docs directory organization

Ketil Malde wrote: > Robin KAY writes: > >> the redirects and ignore the original URLs [2]. Using a "302 Found" >> redirect instead might produce better results, at least for Google > > But the page you point to suggests 302 is discouraged, and says they > don't help for the other search engines

RE: [Haskell-cafe] Ocaml for Haskellers tutorial

Stephen Tetley wrote: > I suspect the difference between the ML module system vs. typeclasses > will be as important as lazy vs. strict. As a style point, Ocaml > programmers don't seem too prone to combinator mania - so I think > golf is a bit less popular over there. Both the lack of lazines

RE: [Haskell-cafe] Re: Asynchronous exception wormholes kill modularity

Simon Marlow wrote: > I came to the conclusion that counting nesting layers doesn't solve > the problem: the wormhole still exists in the form of nested unmasks. > That is, a library function could always escape out of a masked > context by writing > >unmask $ unmask $ unmask $ ... > > enoug

RE: [Haskell-cafe] Re: Hackage accounts and real names

Ivan Miljenovic wrote: > 5) No-one is convincing anyone else to their point of view, so we > have a stale mate. Would allowing pseudonyms but requiring them to be explicitly marked as such be an acceptable compromise? Ganesh =

RE: [Haskell-cafe] Re: Where are the haskell elders?

Günther Schmidt wrote: > Is there a listing of sorts for all Haskell-relevant blogs? http://planet.haskell.org Ganesh === Please access the attached hyperlink for an important electronic communications disclaimer:

RE: [Haskell-cafe] Lazy language on JVM/CLR

Tom Lokhorst wrote: > Also, I wonder if there is some efficient way of implementing the > Lazy class, perhaps by having the Force method using runtime code > generation to override itself. I don't know if this is possible, but > I vaguely remember the Dynamic Language Runtime on .NET doing > somet

RE: [Haskell-cafe] Anyone up for Google SoC 2010?

Gwern Branwen wrote: > On Wed, Feb 3, 2010 at 8:14 PM, Henk-Jan van Tuyl > wrote: >> On Wed, 03 Feb 2010 23:34:34 +0100, Neil Mitchell >> >> wrote: >> >>> Hi Gwern, >>> >>> Please update: "haskell-src-exts -> haskell-src" **Unknown** >>> >>> This project was an unqualified success.  haskell-s

RE: [Haskell-cafe] How to fulfill the "code-reuse" destiny of OOP?

The problem with interfaces as a replacement for type classes is that they only provide dispatch based on the specific type of the first argument (i.e. the receiver). Type classes allow you to dispatch based on return type, and on the instantiations of generic parameters. Neither of these things

RE: [Haskell-cafe] mtl and transformers

Ivan Lazar Miljenovic wrote: > Martijn van Steenbergen writes: >> Another solution is to build your applications using Cabal and >> specify your dependency on mtl in the cabal file. > > But until we have "cabal ghci", this completely fails for actual > hacking purposes... Just do cabal build -v

RE: [Haskell-cafe] darcs 2.4 beta 1 release

Obviously source code documentation would be nice, but why is it "show-stopping"? Ivan Lazar Miljenovic wrote: > I really feel that bug 1720 [1] is a show-stopping bug for darcs, > especially since it means that building Haddock for darcs with > GHC-6.12.* isn't possible. > > [1] http://bugs.da

RE: [Haskell-cafe] Re: no sparks?

\a b -> Left a `amb` Right b From: haskell-cafe-boun...@haskell.org [mailto:haskell-cafe-boun...@haskell.org] On Behalf Of Jamie Morgenstern Sent: 21 December 2009 16:50 To: Benedikt Huber Cc: haskell-cafe@haskell.org Subject: [Haskell-cafe] Re: no sparks? Thank

RE: [Haskell-cafe] ANN: hakyll-0.1

Gregory Crosswhite wrote: >> Tom Tobin wrote: >> >> The 3 clause BSD license is officially a GPL compatible license. >> See: >> >> >> http://www.gnu.org/licenses/license-list.html#GPLCompatibleLicenses >> >> It is within the terms of the GPL to link GPL code to a bunch of BSD3 >> code as l

RE: [Haskell-cafe] Working with multiple projects

To install a package from local sources, just run 'cabal install' in the directory with the package's .cabal file. Tony Morris wrote: > I don't want to have to upload every time I make a minor change as I > am working. Surely there is an easier way. > > Martijn van Steenbergen wrote: >> Tony Mor

RE: [Haskell-cafe] Why MTL and Transformers?

Gregory Crosswhite wrote: > Something that I have been wondering for a while is: why are there > *still* two monad transformer libraries with seemingly identical > functionality, especially given that they have conflicting > namespaces? It creates stupid problems like the one that Erik > encounte

RE: [Haskell-cafe] A proposals

Martijn van Steenbergen wrote: > wren ng thornton wrote: >> Another nice >> thing this suggests is the ability to use underscore as a pattern for >> when you know the compiler will infer the type but it's too complex >> to want to write out (e.g. while experimenting). > > I'd love this! F# has th

RE: [Haskell-cafe] Haskell -> .NET

I think Sigbjorn's binding (http://haskell.forkio.com/dotnet/ as linked below) is the most complete and likely to work, but it's still just a binding not a compiler backend. From: haskell-cafe-boun...@haskell.org [mailto:haskel

RE: [Haskell-cafe] Control.Exception base-3/base-4 woes

Neil Brown wrote: > Can anyone tell me how to fix this? I don't think that changing to > always use Control.Exception would fix this, because I need to give a > different type for catch in base-3 to base-4, so there's still the > incompatibility to be dealt with. http://hackage.haskell.org/pa

[Haskell-cafe] Credit Suisse is hiring

Hi, Just to chime in with the spate of job advertisements, the Global Modelling and Analytics Group (GMAG) at Credit Suisse is once again looking to hire functional programmers. The group consists of about 130 people worldwide. The majority of the group are mathematicians engaged in developing

RE: [Haskell-cafe] Re: DDC compiler and effects; better than Haskell?

What would preOrder foldr/foldl mean? What about preOrder (reverse . map) and preOrder (map . reverse) ? Another option would be for map to take a "strategy" as a parameter, sort of like Control.Parallel.Strategies. Peter Verswyvelen wrote: > Well, in DDC I believe the order is left to right. >

RE: [Haskell-cafe] powerSet = filterM (const [True, False]) ... is this obfuscated haskell?

Sebastian Fischer wrote: > On Jul 28, 2009, at 11:06 AM, Sittampalam, Ganesh wrote: > >>> perms = sortByM (const [True,False]) >> >> and moreover the results will depend on the sorting algorithm chosen. > > Is it only that different sorting algorithms enumerat

RE: [Haskell-cafe] powerSet = filterM (const [True, False]) ... is this obfuscated haskell?

> perms = sortByM (const [True,False]) This doesn't seem right, since the comparison function is inconsistent and moreover the results will depend on the sorting algorithm chosen. Ganesh === Please access the attached

RE: [Haskell-cafe] Proposal: TypeDirectedNameResolution

(To be clear, this about Cale's proposal, not simonpj's one) Johannes Waldmann wrote: > Sittampalam, Ganesh wrote: > >> ... it would make it substantially less likely that subexpressions >> could be abstracted into a separate declaration without giving a type >>

RE: [Haskell-cafe] Proposal: TypeDirectedNameResolution

Cale Gibbard wrote: > There was a great related idea on #haskell the other day: Make > explicit qualification unnecessary whenever there is a *unique* > choice of module qualifications from those imported which would make > the expression typecheck. Ambiguities would still need to be > qualified,

RE: [Haskell-cafe] Implicit concatenation in list comprehensions

Roel van Dijk wrote: > On Mon, Jul 20, 2009 at 1:27 PM, Roel van > Dijk wrote: >> I think the tuple sections are a great idea! It also makes tuple >> types and constructors more alike: >> >> x :: (,) String Double >> x = (,) "Pi" 3.14159 > > I just realised this is already in GHC :-) But does y

RE: [Haskell-cafe] A small puzzle: inTwain as function of foldr

Martijn van Steenbergen wrote: > Consider the function inTwain that splits a list of even length > evenly into two sublists: > > > inTwain "Hello world!" > ("Hello ","world!") > > Is it possible to implement inTwain such that the recursion is done > by one of the standard list folds? Does th

RE: [Haskell-cafe] Bool as type class to serve EDSLs.

There are multiple possible classes that you might want under different circumstances (I think the most interesting issue is whether the class (==), (>) etc is in has a fundep from the type of the thing being compared to the type of the boolean), but if NoImplicitPrelude (or some other extension) j

RE: [Haskell-cafe] Strange type error with associated type synonyms

Simon Peyton-Jones wrote: > NoMatchErr.hs:20:11: > Couldn't match expected type `Memo d' >against inferred type `Memo d1' > NB: `Memo' is a (non-injective) type function > In the second argument of `(.)', namely `appl' > In the expression: abst . appl > In the def

RE: [Haskell-cafe] I love purity, but it's killing me.

f Of Conal Elliott Sent: 27 May 2009 16:14 To: Sittampalam, Ganesh Cc: Haskell Cafe Subject: Re: [Haskell-cafe] I love purity, but it's killing me. In my experience [1], observable sharing using GHC's stable names is a pretty effective solution to this problem. Plus unsafePerformIO

RE: [Haskell-cafe] I love purity, but it's killing me.

Sebastiaan Visser wrote: > On May 27, 2009, at 1:49 AM, Conal Elliott wrote: >> Hi Tom, >> >> I've been working on another code-generating graphics compiler, >> generating GPU code. As always, I run into the problem of efficient >> common subexpression elimination. In Pan, Vertigo & Pajama, I us

RE: [Haskell-cafe] Re: [Haskell] [ANN] Safe Lazy IO in Haskell

Nicolas Pouillard wrote: > Excerpts from Ryan Ingram's message of Tue May 19 10:23:01 +0200 2009: >> To be fair, you can do this with some extensions; I first saw this in >> a paper on Oleg's site [1]. Here's some sample code: > > This seems like the same trick as the rmonad package: > http://hac

RE: [Haskell-cafe] conflicting variable definitions in pattern

Conor McBride wrote: > On 15 May 2009, at 09:11, Sittampalam, Ganesh wrote: >> >> but then pattern matching can introduce Eq constraints which some >> might see as a bit odd. > > Doesn't seem that odd to me. Plenty of other language features come > wi

RE: [Haskell-cafe] conflicting variable definitions in pattern

Martin Hofmann wrote: > It is pretty clear, that the following is not a valid Haskell pattern: > > foo (x:x:xs) = x:xs > > My questions is _why_ this is not allowed. IMHO, the semantics should > be > clear: The pattern is expected to succeed, iff 'x' is each time bound > to the same term. How

RE: [Haskell-cafe] Removing mtl from the Haskell Platform

rocon...@theorem.ca wrote: > I think that use of the mtl should be deprecated so that we move on > to improved monad transformer libraries. Having the mtl in the > Haskell Platform does the opposite by further entrenching its use, > possibly to the point where we may not be able to get rid of it

RE: [darcs-users] [Haskell-cafe] Darcs as undo/redo system?

Wolfgang Jeltsch wrote: > Am Freitag, 8. Mai 2009 18:43 schrieb Jason Dagit: >> If you wanted to work on this, I would encourage you to read more >> about patch theory[1,2,3,4] and also try out libdarcs[5]. > > Is libdarcs the same as the darcs library package on Hackage (which > exports the darcs

RE: [Haskell-cafe] is value evaluated?

Brandon S. Allbery KF8NH wrote: > On May 8, 2009, at 16:31 , Sittampalam, Ganesh wrote: >> Brandon S. Allbery KF8NH wrote: >>> Unless it catches exceptions itself (which strikes me as a bad idea; >>> it becomes a trivial way to ignore exceptions, leading to bad >&g

RE: [Haskell-cafe] is value evaluated?

Brandon S. Allbery KF8NH wrote: > On May 8, 2009, at 13:08 , Sittampalam, Ganesh wrote: >> Brandon S. Allbery KF8NH wrote: >>> and therefore must be in IO. You may be thinking that it would >>> return a result for _|_, but as described if you fed it _|_ it could >

RE: [Haskell-cafe] is value evaluated?

Brandon S. Allbery KF8NH wrote: > On May 8, 2009, at 01:33 , Joe Fredette wrote: >> That strikes me as being bad in a "I'm violating the Halting Problem" >> sort of way- but I'm not sure how. Is there some contradictory >> construction that could be built from such a function? > > I don't think it

RE: [Haskell-cafe] Why is Bool no instance of Num and Bits?

Stephan Friedrichs wrote: > When looking for an xor function, I found one in Data.Bits but > couldn't use it for Bool, because Bool is no instance of Bits and of > Num (which would be necessary, because it's "class (Num b) => Bits > b"). My question is: Why not? > > [...] > quite trivial... Why

RE: [Haskell-cafe] Data.Map and strictness (was: Is Haskell a GoodChoice for WebApplications?(ANN: Vocabulink))

seq something like size map that will force a traversal of the entire tree, and ensure that the result is actually demanded, e.g. when writing to a TVar: do ... let map' = Data.Map.delete key map size map' `seq` writeTVar tvar map' ... (Not tested) Note that this also won't force any of

RE: [Haskell-cafe] compilation to C, not via-C

Ryan Ingram wrote: > There was > another talk about compiling Haskell into Excel spreadsheets for > finance, but I can't seem to locate it right now. It was an ICFP experience report. http://www.earth.li/~ganesh/research/paradise-icfp08 Ganesh ===

RE: [Haskell-cafe] Template Haskell + Profiling

Do your profiling builds with "-osuf p_o -hisuf p_hi", and then run a non-profiling build first. This means that both sets of object/hi files are available which placates TH. Ganesh From: haskell-cafe-boun...@haskell.org [mailto:haskell-cafe-boun...@haskell.o

RE: [Haskell-cafe] Re: ANNOUNCE: Utrecht Haskell Compiler (UHC) --firstrelease

Jon Fairbairn wrote: > "Sittampalam, Ganesh" writes: >> So I would say that {Haskell 98 - (n+k)} is itself a worthwhile >> standard to implement. > > It's not a standard. You have to document the difference (waste of > time), programmers have to notice

RE: [Haskell-cafe] Re: ANNOUNCE: Utrecht Haskell Compiler (UHC) --first release

Jon Fairbairn wrote: > "John A. De Goes" writes: > >> That's absurd. You have no way to access private source code, so any >> decision on what features to exclude from future versions of Haskell >> must necessarily look at publicly accessible source code. > > This is all entirely beside the poin

RE: [Haskell-cafe] (n+k) patterns

Richard O'Keefe wrote: > The thing is that it really seems bizarre to see this one feature > singled out for non-implementation. > > If I can do the equivalent of n+k patterns by programming in the > *type system*, why *not* in a pattern? Do you mean by something like the following? data Z =

RE: [Haskell-cafe] Re: ANNOUNCE: Utrecht Haskell Compiler (UHC) --first release

Miguel Mitrofanov wrote: > Jon Fairbairn wrote on 20.04.2009 13:59: >> Achim Schneider writes: >> >>> Jon Fairbairn wrote: >>> a...@cs.uu.nl writes: > Utrecht Haskell Compiler -- first release, version 1.0.0 > ==

RE: [Haskell-cafe] ANNOUNCE: vacuum-cairo: a cairo frontend to vacuumfor live Haskell data visualization

I have this problem too, but I don't understand it because librsvg-2-2.dll is in the same directory as the rest of the gtk2hs DLLs - c:/gtk2hs/0.10.0/bin on my system. Yesterday I was also having trouble with not being able to find the glib DLL but that problem has mysteriously vanished today leavi

RE: [Haskell-cafe] Conditional compilation

Robin Green wrote: > I am writing some code for citation support in gitit, and all the > #ifdefs I'm using to do conditional compilation are a bit tiresome. > > Suppose you have the requirement that a certain feature of your > software be disable-able at compile time, to avoid having to pull in >

RE: [Haskell-cafe] Re: Haskell Logo write-in candidate

Jon Fairbairn wrote: > > semi-rant warning: > > This whole badge/logo business seems to me to be an excellent example > of Parkinson's law of triviality (choosing the colour of the > bikeshed). We have a large (too large) number of variations on > relatively few themes and a really sophisticated

RE: [Haskell-cafe] Crash in GHCI - what is the correct behavior here?

I also see a segfault on Windows XP SP2 and GHC 6.10.1, very quick so I'm fairly sure it's not memory. I agree this should be a bug report. From: haskell-cafe-boun...@haskell.org [mailto:haskell-cafe-boun...@haskell.org] On Behalf Of Luke Palmer Sent: 19 March

RE: [Haskell-cafe] Does anybody dislike implicit params as much asI do?

Jules Bean wrote: > Thomas Hartman wrote: >> http://blog.patch-tag.com/2009/03/09/implicitparams-are-evil-thoughts- >> on-adapting-gitit/ >> >> I understand there are arguments for using IPs, but after this >> experience, the ImplicitParams extension is a "code smell" for me. > > It's not just y

RE: [Haskell-cafe] Request: warn about language extensions that are not used

As I understand it the current scheme is that you vote for a bug by adding yourself to the CC list. From: haskell-cafe-boun...@haskell.org [mailto:haskell-cafe-boun...@haskell.org] On Behalf Of Peter Verswyvelen Sent: 12 March 2009 14:27 To: Conal Elliott Cc: hask

RE: [Haskell-cafe] Performance question

Ben Lippmeier wrote: >>> The first thing I would do is replace your isInCircle :: (Floating >>> a, Ord a) => (a,a) -> Bool with isInCircle :: (Double, Double) -> >>> Bool >> >> Can you point me to why that matters? > > At the machine level, GHC treats the (Floating a, Ord a) as an extra > arg

RE: [Haskell-cafe] Memoization local to a function

Dusan Kolar wrote: > Nevertheless, local version does not > work. Restructure your code like this: > fibL m = > let > allfib = 0:1:[allfib!!n + allfib!!(n+1) | n <- [0..]] > in allfib !! m fibL = let allfib = 0:1:[allfib!!n + allfib!!(n+1) | n <- [0..]] in \m -> allfib !! m i

RE: [Haskell-cafe] Re: Hoogle and Network.Socket

Jonathan Cast wrote: > On Wed, 2009-02-25 at 10:23 +, John Lato wrote: >> 4. Cross-platform concerns are something that responsible developers >> need to consider, just like localization and i18n. I.e., why >> *shouldn't* you think of that? > > Sorry, wtf? I have a *responsibility* to desig

RE: [Haskell-cafe] Hac5 projects page

Wolfgang Jeltsch wrote: > on , you can list a > project under "Project descriptions" and under "Experiences". What's > the difference? A project description is something you plan to work on, and an experience is something you could help other pe

RE: [Haskell-cafe] ANNOUNCE: pqueue-mtl, stateful-mtl

Henning Thielemann wrote: > On Mon, 16 Feb 2009, Louis Wasserman wrote: > >> Overnight I had the following thought, which I think could work >> rather well.  The most basic implementation of the idea is as >> follows: >> >> class MonadST s m | m -> s where >> liftST :: ST s a -> m a >> >> insta

RE: [Haskell-cafe] ANNOUNCE: pqueue-mtl, stateful-mtl

Dan Doel wrote: > > Someone already mentioned using Dynamic as an alternate base (for > instance, use a Map of dynamics for underlying storage). Of course, > the implementation of Dynamic in GHC uses unsafeCoerce, just like ST, > so you may not count that. > However, using GADTs, you can implem

RE: [Haskell-cafe] ANNOUNCE: pqueue-mtl, stateful-mtl

Oh, I see, every derived monad has to have an 's' in its type somewhere. From: Louis Wasserman [mailto:wasserman.lo...@gmail.com] Sent: 16 February 2009 16:17 To: Sittampalam, Ganesh Cc: Dan Doel; Henning Thielemann; haskell-cafe@haskell.org S

RE: [Haskell-cafe] ANNOUNCE: pqueue-mtl, stateful-mtl

__ From: Louis Wasserman [mailto:wasserman.lo...@gmail.com] Sent: 16 February 2009 16:01 To: Sittampalam, Ganesh Cc: Dan Doel; Henning Thielemann; haskell-cafe@haskell.org Subject: Re: [Haskell-cafe] ANNOUNCE: pqueue-mtl, stateful-mtl Overnight I had the following thought, which I think could wor

RE: [Haskell-cafe] ANNOUNCE: pqueue-mtl, stateful-mtl

Well, I think a type system like Clean's that had linear/uniqueness types could "fix" the issue by actually checking that the state is single-threaded (and thus stop you from applying it to a "forking" monad). But there's a fundamental operational problem that ST makes destructive updates, so to su

RE: [Haskell-cafe] ANNOUNCE: pqueue-mtl, stateful-mtl

> Stateful-mtl provides an ST monad transformer, Is this safe? e.g. does it work correctly on [], Maybe etc? If not this should be flagged very prominently in the documentation. Cheers, Ganesh == Please access the att

RE: [Haskell-cafe] Monad explanation

> My bad, I restate: a value cannot be both static and dynamic. Or an > object and a morphism. Or an element and a function. Sure, you can > treat a morphism as an object, but only by moving to a higher (or > different) level of abstraction. That doesn't erase the difference > between object

RE: [Haskell-cafe] Re: 1,000 packages, so let's build a few!

Don Stewart wrote: > ganesh.sittampalam: >> Don Stewart wrote: >>> So, wind...@haskell.org anyone? Get the wiki going, get the set of >>> tasks created. >> >> Isn't the Haskell Platform going to do all this? Shouldn't >> interested people just help out there? >> > > The platform is a set of bl

RE: [Haskell-cafe] Re: 1,000 packages, so let's build a few!

Don Stewart wrote: > GHC doesn't bundle with cabal-install on any system. > > What is needed is not for the GHC team to be doing Windows platform > packages, but for the Windows Haskell devs to build their own system, > as happens on all the Unices. > > Take GHC's release, wrap it up with nat

RE: [Haskell-cafe] Re: list choices

Malcolm Wallace wrote: > As for Reply-to: munging - I agree that _changing_ an existing header > would be bad, but would be very happy if mailing lists were to > _introduce_ one on messages where none already existed. That would IMO be the worst of both worlds, as people might use Reply-To for

RE: [Haskell-cafe] Employment

Andrew Coppin wrote: > Andrew Wagner wrote: >> http://www.haskell.org/haskellwiki/Haskell_in_industry could be of >> interest to you > > Hmm, interesting... So lots happening in Portland, Oregon. Lots in > Cambridge, MA. A few things in Europe. And nothing at all in the > UK... We (Credit Suiss

RE: [Haskell-cafe] Comments from OCaml Hacker Brian Hurt

Lennart Augustsson wrote: > Most people don't understand pure functional programming either. > Does that mean we should introduce unrestricted side effects in > Haskell? No, just that we should seek to minimise the new stuff they have to get to grips with. Ganesh =

RE: [Haskell-cafe] Comments from OCaml Hacker Brian Hurt

Lennart Augustsson wrote: > I think the documentation should be reasonably newbie-friendly too. > But that doesn't mean we should call Monoid Appendable. > Appendable is just misleading, since Monoid is more general than > appending. Then why does it have a member named 'mappend'? :-) Ganesh ==

RE: [Haskell-cafe] Comments from OCaml Hacker Brian Hurt

Lennart Augustsson wrote: > a name that anyone can figure out with just a little effort. I think the problem is that all these pieces of "little effort" soon mount up. It's not just the cost of looking it up, but also of remembering it the next time and so on. It's fine when you only encounter the

RE: [Haskell-cafe] Comments from OCaml Hacker Brian Hurt

Lennart Augustsson wrote: > I have replied on his blog, but I'll repeat the gist of it here. > Why is there a fear of using existing terminology that is exact? > Why do people want to invent new words when there are already > existing ones with the exact meaning that you want? If I see Monoid I > k

RE: [Haskell-cafe] The problem with Monads...

Jonathan Cast wrote: > On Tue, 2009-01-13 at 12:56 -0200, Rafael Gustavo da Cunha Pereira > Pinto wrote: >> >> Inspired by the paper "Functional Programming with Overloading and >> Higher-Order Polymorphism", Mark P Jones >> (http://web.cecs.pdx.edu/~mpj/pubs/springschool.html) >>

RE: [Haskell-cafe] mailing list choices?

ED] On Behalf Of Conal Elliott Sent: 08 September 2008 12:52 To: Sittampalam, Ganesh Cc: haskell-cafe@haskell.org Subject: Re: [Haskell-cafe] mailing list choices? In what ways? 2008/9/8 Sittampalam, Ganesh <[EMAIL PROTECTED]> I would call Yahoo and Google groups

RE: [Haskell-cafe] mailing list choices?

I would call Yahoo and Google groups a major step backwards from mailman. From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Conal Elliott Sent: 08 September 2008 11:34 To: Haskell Café Subject: [Haskell-cafe] mailing list choices? I want to set up s

[Haskell-cafe] RE: [Haskell] Top Level <-

Ashley Yakeley wrote: > I really don't know enough about the RTS to know. The > alternative would be to keep all initialised values > when the module is unloaded. I'm guessing this is more > feasible. Easier, but a guaranteed memory leak. Ganesh =

[Haskell-cafe] RE: [Haskell] Top Level <-

Ashley Yakeley wrote: > Sittampalam, Ganesh wrote: >>> Oh dear. To fix this, I suppose the RTS would have to be able to keep >>> track of all static initialisers. But it shouldn't otherwise affect >>> program optimisation. >> >> What would the RT

[Haskell-cafe] RE: [Haskell] Top Level <-

Ashley Yakeley wrote: > Sittampalam, Ganesh wrote: > > I talked to Don about this and you're right, that doesn't happen. > > However > > he also confirmed that it does load modules a second time if they are > > in the main program as well as the plugin, an

[Haskell-cafe] RE: [Haskell] Top Level <-

Ashley Yakeley wrote: > Sittampalam, Ganesh wrote: > > In compiled code module boundaries don't necessarily exist. So how do > > you relink the loaded code so that it points to the unique copy of the > > module? > hs-plugins loads modules as single .o files,

RE: [Haskell-cafe] Re: [Haskell] Top Level <-

Yitzchak Gale wrote > Other applications and libraries that support the pragma - such as other > compilers, and hs-plugins - would be required to respect the guarantee, and > bugs could be filed against them if they don't. If hs-plugins were loading object code, how would it even know of the exi

RE: [Haskell-cafe] Re: [Haskell] Top Level <-

(apologies for misspelling your name when quoting you last time) Yitzchak Gale wrote: >>> For the short term - can we *please* get an ONLYONCE pragma that has >>> the correct semantics? > Until a permanent solution is implemented and deployed in the > compilers (if ever), can we please have a p

RE: [Haskell-cafe] Re: [Haskell] Top Level <-

Yitzhak Gale wrote: > Right. It would not be a bug in hs-plugins. That is > the most urgent problem right now. [...] > For the short term - can we *please* get an ONLYONCE > pragma that has the correct semantics? So the purpose of this pragma would solely be so that you can declare hs-plugins bug

[Haskell-cafe] RE: [Haskell] Top Level <-

Ashley Yakeley wrote: > I think it's bad design for a dynamic loader to load a module more > than once anyway. In compiled code module boundaries don't necessarily exist. So how do you relink the loaded code so that it points to the unique copy of the module? > It's a waste of memory, for a sta

[Haskell-cafe] RE: [Haskell] Top Level <-

Ashley Yakeley wrote: > Sittampalam, Ganesh wrote: > > I am suggesting that this duplication process, whether conducted by > > the dynamic loader or something else, should behave as if they did not > > have the same package name or version. > > > This is certai

RE: [Haskell-cafe] Re: [Haskell] Top Level <-

Ashley Yakeley wrote: > "To solve this the hs-plugins dynamic loader maintains > state storing a list of what modules and packages have > been loaded already. If load is called on a module that > is already loaded, or dependencies are attempted to load, > that have already been loaded, the dynamic

[Haskell-cafe] RE: [Haskell] Top Level <-

Ashley Yakeley wrote: > I don't understand. If the dynamic loader were to load the same package > name and version, and it duplicated the MVar, then Unique values would > have the same type and could be compared. I am suggesting that this duplication process, whether conducted by the dynamic load

RE: [Haskell-cafe] Re: [Haskell] Top Level <-

Dave Menendez wrote: > The Haskell 98 report includes NOINLINE, but > also states that environments are not required > to respect it. So hs-plugins wouldn't necessarily > be at fault if it didn't support Data.Unique. Also, the definition of NOINLINE in the report doesn't preclude copying both t

RE: [Haskell-cafe] Re: [Haskell] Top Level <-

Ashley Yakeley wrote: >Ganesh Sittampalam wrote: >> In any case, what I'm trying to establish below is that it should be a >> safety property of <- that the entire module (or perhaps mutually >> recursive groups of them?) can be duplicated safely - with a new name, >> or as if with a new name

RE: [Haskell-cafe] Top Level <-

David Roundy wrote: > On Tue, Sep 02, 2008 at 10:10:31AM +0100, Sittampalam, Ganesh wrote: >> Arguably both of these cases are not ACIO simply because of the >> non-termination effects, but it's not obvious to me how you tell just >> by looking at either one's

RE: [Haskell-cafe] Top Level <-

> > Contrived example follows: > > > module Module1 (mod1) where > > import Module2 > > > > glob1 :: IORef Int > > glob1 <- mod2 >>= newIORef > > > mod1 :: IO Int > > mod1 = readIORef glob1 > > > module Module2 (mod2) where > > import Module1 > > glob2 :: IORef Int > > glob2 <- mod1 >>= newIOR

RE: [Haskell-cafe] Top Level <-

John Meacham wrote: On Fri, Aug 29, 2008 at 04:33:50PM -0700, Dan Weston wrote: >> C++ faced this very issue by saying that with global data, >> uniqueness of initialization is guaranteed but order of >> evaluation is not. Assuming that the global data are >> merely thunk wrappers over some commo

RE: [Haskell-cafe] Mutually recursive modules and google protocol-buffers

Hi, > module A(A) where > data A > deriving Show I think you should use "instance Show A" rather than "deriving Show". All the boot file needs to do is say that the instance exists, not explain how it is constructed. Cheers, Ganesh

RE: [Haskell-cafe] More on performance

> I wonder what can be said about "stable" optimizations which are insensitive to their environments in some sense. http://citeseer.ist.psu.edu/veldhuizen02guaranteed.html Ganesh == Please access the attached hyperlink f

RE: [Haskell-cafe] looking for examples of non-full Functional Dependencies

> > Why not instead transform single-range FDs into multi-range ones where > > possible? > That's a perfectly reasonable assumption and would establish the logical > property that > a -> b /\ a -> c iff a -> b /\ c > for FDs (by definition). > But what about programmers who'd like that >

RE: [Haskell-cafe] looking for examples of non-full Functional Dependencies

Martin Sulzmann wrote: > Mark P Jones wrote: > > In fact, the two sets of dependencies that you have given here are > > provably equivalent, so it would be decidedly odd to have a "type > > improvement" system that distinguishes between them. > Based on the FD-CHR formulation, for the single-r

RE: [Haskell-cafe] type families and type signatures

t; Id a -> Id a foo _ = id foo' :: Id a -> Id a foo' = foo (undefined :: a) Martin Ganesh Sittampalam wrote: > On Wed, 9 Apr 2008, Manuel M T Chakravarty wrote: > >> Sittampalam, Ganesh: > >>> No, I meant can't it derive that equality when matching (Id a)

  1   2   >