Re: [Haskell-cafe] [ANN] lvish 1.0 -- successor to monad-par

lso, is there a publicly accessible repository where further development will take place? Cheers, - Ben pgppP5lQOaZx3.pgp Description: PGP signature ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] name lists

Roman Cheplyaka writes: > * Ben Gamari [2013-09-17 10:03:41-0400] >> Another approach might be to introduce some notion of a name list which >> can appear in the export list. These lists could be built up by either >> user declarations in the source module or in Template H

Re: [Haskell-cafe] Proposal: Pragma EXPORT

the implementation of such a feature without the introduction of new syntax * there are arguably few uses for such a mechanism beyond exporting TH constructs * you still have the work of solving the issues presented in #1475 Anyways, just a thought. Cheers, - Be

Re: [Haskell-cafe] Performance of delete-and-return-last-element

isn't this what zippers are for? b On Aug 30, 2013, at 1:04 PM, Clark Gaebel wrote: > I don't think a really smart compiler can make that transformation. It looks > like an exponential-time algorithm would be required, but I can't prove that. > > GHC definitely won't... > > For this specific

Re: [Haskell-cafe] Compiler stops at SpecConstr optimization

; a) -> Vector a -> Vector a > > foo f = V.fromList . V.foldl (\xs x -> f x : xs) [] Probably an instance of this one: http://ghc.haskell.org/trac/ghc/ticket/5550 Ben. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] enumerators: exception that can't be catched

This is partially guesswork, but the code to catchWSError looks dubious: catchWsError :: WebSockets p a -> (SomeException -> WebSockets p a) -> WebSockets p a catchWsError act c = WebSockets $ do env <- ask let it = peelWebSockets env $ act cit = pe

Re: [Haskell-cafe] GHC flags: optghc

That's not a GHC flag; it's a haddock flag. Haddock (which, in case you're not familiar with it, is a program to generate documentation from Haskell source code) uses GHC, and the `optghc` flag lets you pass options to GHC when you invoke Haddock. See [the Haddock docs of the 6.12 era][1], on page

Re: [Haskell-cafe] Ideas on a fast and tidy CSV library

nto Haskell produces worse performance than the more readable, idiomatic approach. I understand this leaves many of your questions unanswered, but I'd give the idiomatic approach a bit more time before trying to coerce C into Haskell. Profile, see where the hotspots are and opt

Re: [Haskell-cafe] homotopy type theory for amateurs

on how it is to be run. best, b On Jun 25, 2013, at 1:03 PM, Ben wrote: > hello cafe -- > > by now i'm sure you have heard that the homotopy type theory folks have just > written up a free introductory book on their project. > > http://homotopytypetheory.org/2

[Haskell-cafe] homotopy type theory for amateurs

f any developments. best, ben ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Array, Vector, Bytestring

array). > To be perfectly clear, ByteString and Text target much different use-cases and are hardly interchangeable. While ByteString is, as the name suggests, a string of bytes, Text is a string of characters in a Unicode encoding. When you are talking about unstructured binary data, you sho

Re: [Haskell-cafe] mapFst and mapSnd

On Thu, May 30, 2013 at 7:12 PM, Shachaf Ben-Kiki wrote: > One generalization of them is to lenses. For example `lens` has > "both", "_1", "_2", such that "mapPair = over both", "mapFst = over > _1", etc., but you can also get "fst

Re: [Haskell-cafe] mapFst and mapSnd

On Tue, May 28, 2013 at 1:54 AM, Dominique Devriese wrote: > Hi all, > > I often find myself needing the following definitions: > > mapPair :: (a -> b) -> (c -> d) -> (a,c) -> (b,d) > mapPair f g (x,y) = (f x, g y) > > mapFst :: (a -> b) -> (a,c) -> (b,c) > mapFst f = mapPair f id > > ma

Re: [Haskell-cafe] [haskell.org Google Summer of Code 2013] Approved Projects

d to do something and failed. Ben. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Teaching FP with Haskell

Helium seems interesting, but the code is a little stale, no? The last updates seem to be from 2008-2009. I couldn't get it to build with ghc 7.6.3, not that I tried too terribly hard. On Tue, May 21, 2013 at 6:07 AM, Andrew Butterfield < andrew.butterfi...@scss.tcd.ie> wrote: > Rustom, > you s

Re: [Haskell-cafe] Backward compatibility

ttle, he ought to know where to hire some mercenaries. On Sat, May 4, 2013 at 2:03 PM, Carter Schonwald wrote: > What pray tell are those missing pieces? Aren't they mostly building a > browser based ide plus doing training courses ? > On May 4, 2013 1:42 PM, "Ben Doyle"

Re: [Haskell-cafe] Backward compatibility

You might want to check out FPComplete, if you haven't already. They're far more focused on making it easy for organizations to adopt Haskell than the community can be. As they say: "Where the open-source process is not sufficient to meet commercial adoptio

Re: [Haskell-cafe] Markdown extension for Haddock as a GSoC project

ought it'd be a helpful pointer to whomever is working on new haddock -- they are of course welcome to ignore it. totally understand that overmuch debate is not helpful (though i'm not sure it's fair to call it bikeshedding, since it is a primary feature of the proposed project!

Re: [Haskell-cafe] Markdown extension for Haddock as a GSoC project

but it seems to be a good alternative. http://asciidoc.org/ http://asciidoctor.org/docs/what-is-asciidoc-why-use-it/ best, ben On Apr 27, 2013, at 11:06 AM, Bryan O'Sullivan wrote: > On Sat, Apr 27, 2013 at 2:23 AM, Alistair Bayley wrote: > How's about Creole? > http://wi

Re: [Haskell-cafe] Stream fusion and span/break/group/init/tails

On 26/04/2013, at 2:15 PM, Johan Tibell wrote: > Hi Ben, > > On Thu, Apr 25, 2013 at 7:46 PM, Ben Lippmeier wrote: >> The Repa plugin will also do proper SIMD vectorisation for stream programs, >> producing the SIMD primops that Geoff recently added. Along the way it will

Re: [Haskell-cafe] Stream fusion and span/break/group/init/tails

d a buffer. I've got some hand drawn diagrams of this if anyone wants them (mail me), but none of it helps implement 'unzip' for streams or 'cozip' for costreams. > I'll be interested to see in more detail the approach that Ben is > talking about. As Ben

Re: [Haskell-cafe] Stream fusion and span/break/group/init/tails

he loop/for each element of a loop/after the loop etc. Splitting multiple operators this way and then merging the parts into a single loop provides the "concurrency" required by the description in John Hughes's thesis. Ben. ___ Hask

Re: [Haskell-cafe] Stream fusion and span/break/group/init/tails

S 1991 The Anatomy of a Loop Olin Shivers, ICFP 2005 The contribution of the HS paper is planning to be: 1) How to extend the approach to the combinators we need for DPH 2) How to package it nicely into a Haskell library. I'm still working on the above... Ben. ___

Re: [Haskell-cafe] Stream fusion and span/break/group/init/tails

ng the evaluation of the two consumers must be interleaved. I've got a solution for this problem and it will form the basis of Repa 4, which I'm hoping to finish a paper about for the upcoming Haskell Symposium. Ben. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] multivariate normal distribution in Haskell?

etty much need a linear algebra library (e.g. HMatrix) to perform the inversion (and determinant for proper normalization). Otherwise, implementing the function given the inverse is quite straightforward. Cheers, - Ben ___ Haskell-Cafe mai

Re: [Haskell-cafe] GSoC Project Proposal: Markdown support for Haddock

enough to include HTML as an escape hatch. > For what it's worth, I think Markdown is a fine choice for very much the same reason. RST has some nice properties (especially for documenting Python), but Markdown is much more common. Moreover, I've always found RST's linkification

Re: [Haskell-cafe] Type level natural numbers

[1]. The DataKinds work is already available in 7.6, allowing one to use type level naturals, but the type checker is unable to unify arithmetic operations. Cheers, - Ben [1] http://hackage.haskell.org/packages/archive/linear/1.1.1/doc/html/Linear-V.html ___

Re: [Haskell-cafe] Lazy object deserialization

that's too bad, i used lazy deserialization for an external sort thing i did aeons ago. http://www.haskell.org/pipermail/haskell-cafe/2007-July/029156.html that was an amusing exercise in lazy IO. these days it's probably better off doing something with pipes et al instead of unsafeInterleaveI

Re: [Haskell-cafe] Open-source projects for beginning Haskell students?

be fast enough to work pleasantly with large datasets. ggplot2 is pretty awesome but kills my machine, routinely. i would be willing to mentor, but i'm not an expert enough i think! best, ben ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Haskell + RankNTypes + (forall p. p Char -> p Bool) sound?

I was trying to figure out a way to write absurd :: (forall p. p Char -> p Bool) -> Void using only rank-n types. Someone suggested that Haskell with RankNTypes and a magic primitive of type (forall p. p Char -> p Bool) might be sound (disregarding the normal ways to get ⊥, of course). Is that tru

Re: [Haskell-cafe] ANN: Nomyx 0.1 beta, the game where you can change the rules

On 27/02/2013, at 10:28 , Corentin Dupont wrote: > Hello everybody! > I am very happy to announce the beta release [1] of Nomyx, the only game > where You can change the rules. Don't forget 1KBWC: http://www.corngolem.com/1kbwc/ Ben. _

Re: [Haskell-cafe] haskell build phase is very slow

relevant to you at the moment, since you're hacking on someone else's package. But always good to know. Best of luck, Ben [1]: http://www.haskell.org/ghc/docs/latest/html/users_guide/separate-compilation.html#recomp [2]: http://www.haskell.org/g

Re: [Haskell-cafe] quotRem and divMod

On Mon, Jan 28, 2013 at 4:27 PM, Artyom Kazak wrote: > Hi! > > I’ve always thought that `quotRem` is faster than `quot` + `rem`, since both > `quot` and `rem` are just "wrappers" that compute both the quotient and the > remainder and then just throw one out. However, today I looked into the > impl

Re: [Haskell-cafe] Undo records

I think acid-state (http://hackage.haskell.org/package/acid-state) might do what you want, at least in broad strokes. It uses a durable transaction log to store query and update events. As far as I know, the interface to the library doesn't expose an undo/rollback function, so you'd have a bit of

Re: [Haskell-cafe] Are there REPA linear algebra routines? e.g. Eigenvalues?

On 06/12/2012, at 3:18 , KC wrote: > :) Not apart from the matrix-matrix multiply code in repa-algorithms. If you wanted to write some I'd be happy to fold them into repa-algorithms. Ben. ___ Haskell-Cafe mailing list Haskell-Cafe@has

Re: [Haskell-cafe] The end of an era, and the dawn of a new one

DE_OWNERS file? If so then I can start it. I think it's better to have it directly in the repo than on the wiki, that way no-one that works on the code can miss it. I suppose I'm the default owner of the register allocators and non-LLVM native code generators. Ben. [1] http://ll

Re: [Haskell-cafe] Why Kleisli composition is not in the Monad signature?

ply: the unit would have have value id for every possible key, so cannot be finite. So what about an example for Bind\\Monad that is not yet another variation of the finite structure theme? Cheers -- Ben Franksen () ascii ribbon campaign - against html e-mail /\ www.asciiribbon.org - against proprietary attachments ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Why Kleisli composition is not in the Monad signature?

Brent Yorgey wrote: > On Thu, Nov 29, 2012 at 03:52:58AM +0100, Ben Franksen wrote: >> Tony Morris wrote: >> > As a side note, I think a direct superclass of Functor for Monad is not >> > a good idea, just sayin' >> > >> > class Fun

Re: [Haskell-cafe] Why Kleisli composition is not in the Monad signature?

lementation, but IMO >=> is *much* more efficient w.r.t. understanding the monad laws. Since it is natural to explain the laws of a class using only class methods, I would prefer if >=> was added to the class with default implementations for >=> in terms of >>= and vice vers

Re: [Haskell-cafe] Why Kleisli composition is not in the Monad signature?

striking examples for types with natural (or at least useful) Apply and Bind instances that cannot be made Applicative resp. Monad. Also, it is not clear to me what laws should hold for them. Cheers -- Ben Franksen () ascii ribbon campaign - against html e-mail /\ www.asciiribbon.org - again

[Haskell-cafe] A big hurray for lambda-case (and all the other good stuff)

s etc. GHC is just simply amazing. You guys RULE THE WORLD! Cheers -- Ben Franksen () ascii ribbon campaign - against html e-mail /\ www.asciiribbon.org - against proprietary attachments ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org

Re: [Haskell-cafe] Reaching Max Bolingbroke

27;d like to get in touch, I'd appreciate that. He wasn't at ICFP either. I think SPJ said he was in the middle of writing up his PhD thesis. When I was doing mine I was out of circulation for a good 3 months. Ben. ___ Haskell-Cafe ma

Re: [Haskell-cafe] Taking over ghc-core

Shachaf Ben-Kiki writes: > With Don Stewart's blessing > (<https://twitter.com/donsbot/status/267060717843279872>), I'll be > taking over maintainership of ghc-core, which hasn't been updated > since 2010. I'll release a version with support for GHC 7.6 late

[Haskell-cafe] Taking over ghc-core

With Don Stewart's blessing (), I'll be taking over maintainership of ghc-core, which hasn't been updated since 2010. I'll release a version with support for GHC 7.6 later today. Shachaf ___ Has

Re: [Haskell-cafe] Serializing with alignment

Vincent Hanquez wrote: > On 11/06/2012 09:33 PM, Ben Franksen wrote: >> I want to implement a binary protocol that, unfortunately, has some >> alignment restrictions. >> [snip] > > I don't think such thing currently exists. Feared so. > Not sure that&#x

[Haskell-cafe] Serializing with alignment

ppreciated. Cheers -- Ben Franksen () ascii ribbon campaign - against html e-mail /\ www.asciiribbon.org - against proprietary attachments ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Deriving settings from command line, environment, and files

uited to this since it nicely separates the definition of the options from the data structure used to contain them and doesn't rely on template haskell (unlike cmdargs). Composing this with configuration file and environment variable parsing seems like it shouldn't be too tough. Cheers, - Ben

Re: [Haskell-cafe] Adding custom events to eventlog

Yes, it certainly is possible. Have a look at Debug.Trace.traceEvent and traceEventIO. I have found these to be a remarkably powerful tool for understanding parallel performance. Cheers, - Ben ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Possible bug in Criterion or Statistics package

m is > very small but there is statistics and criterion on top of the monad-par > Failure occurs in the function > Statistics.Resampling.Bootstrap.bootstrapBCA. However I couldn't trigger > bug with mock data. > Has there been any progress or an official bug report on this?

Re: [Haskell-cafe] Is it worth adding Gaussian elimination and eigenvalues to REPA?

Matrix. I considered implementing these myself but I doubt that I could write an implementation worthy of using having relatively little knowledge of this flavor of numerics (stability is a pain, so I hear). Cheers, - Ben ___ Haskell-Cafe maili

Re: [Haskell-cafe] [Haskell] ANNOUNCE: tardis

On Tue, Aug 7, 2012 at 7:04 AM, Dan Burton wrote: > As a side note, since the code base is relatively small, it can also serve > as a simple demonstration of how to use a cabal flag > in conjunction with CPP to selectively include swaths of code > (see Control/Monad/Tardis.hs and tardis.cabal). E

Re: [Haskell-cafe] Monads with "The" contexts?

On Thu, Jul 12, 2012 at 11:01 AM, Takayuki Muranushi wrote: > > sunPerMars :: [Double] > > sunPerMars = (/) <$> sunMass <*> marsMass > > Sadly, this gives too many answers, and some of them are wrong because > they assume different Earth mass in calculating Sun and Mars masses, > which led to inco

Re: [Haskell-cafe] Hackage 2 maintainership

y serious capacity. Perhaps one way forward would be to propose the project again as a GSoC project next year. That being said, there is no guarantee that someone would step up to finish it. Just my two cents. Cheers, - Ben ___ Haskell-Cafe mailing l

Re: [Haskell-cafe] How do people still not understand what FP is about? What are we doing wrong?

moot, anyhow. Apologies for the wild early-morning assumptions, everyone! Cheers, Ben On Tuesday, 19 June 2012 at 6:43 AM, john melesky wrote: > On Tue, Jun 19, 2012 at 05:59:57AM +1000, Ben Kolera wrote: > > Saw this float by in twitter, and it made me a bit sad. Obviously > >

Re: [Haskell-cafe] How do people still not understand what FP is about? What are we doing wrong?

just to add to the ridiculousness quotient of this conversation http://web.archive.org/web/20080406183542/http://www.lisperati.com/landoflisp/panel01.html (i don't know where to find this other than in the web archive.) ben On Jun 18, 2012, at 1:44 PM, Christopher Done wrote: > On

[Haskell-cafe] How do people still not understand what FP is about? What are we doing wrong?

bane? Is it even worth trying to convince people so set in their ways? ( Sorry if this is even too off-topic for the cafe. Just needed a place to vent my frustration at this. ) Cheers, Ben [1] https://twitter.com/cwestin63/status/214793627170390018 __

Re: [Haskell-cafe] Installing pandoc / json with ghc 6.12.1

> > Am I doing something wrong here? Well, you're using ghc-6.12 ... :-) The most recent version of pandoc that Hackage claims to have built with ghc 6.12 looks to be 1.6. Rolling back that far eliminates the json dependency entirely, so I think it would solve your issue. Or you could use the Pa

Re: [Haskell-cafe] Haskell (GHC 7) on ARM

Joshua Poehls writes: > Hello Ben, > Hello, Sorry for the latency. I'm currently on vacation in Germany so I haven't had terribly consistent Internet access. I've Cc'd haskell-cafe@ as I've been meaning to document my experiences anyways and your email seem

Re: [Haskell-cafe] Is Repa suitable for boxed arrays?...

ver I just (just) submitted a paper on Repa 3 to Haskell Symposium, which might help [2] [1] http://hackage.haskell.org/packages/archive/repa/3.1.4.2/doc/html/Data-Array-Repa-Repr-Vector.html [2] http://www.cse.unsw.edu.au/~benl/papers/guiding/guiding-Haskell2012-sub.pdf Ben.

Re: [Haskell-cafe] mapping a concept to a type

I wonder if you want a typeclass here, rather than a type? A Normal Rule is pretty much a State Transformer, while a Meta Rule seems like a higher-order function on Normal Rules[*]. These are different kinds of things --- and I say "kind" advisedly --- so perhaps better to define the specific commo

Re: [Haskell-cafe] Can Haskell outperform C++?

was also a talk I remember watching a while ago which gave a pretty nice overview. I can't recall, but I might have been this[2]. Lastly, profiling now works with multiple capabilities[3]. Cheers, - Ben [1] http://www.haskell.org/ghc/docs/7.4.1/html/users_guide/release-7-4-1.html [2] http://

Re: [Haskell-cafe] Can Haskell outperform C++?

are still cases where the performance hit incurred by the profiling instrumentation precludes this route of investigation without time consuming guessing at how to pare down my test case. It's certainly not an easy problem. Cheers, - Ben ___ Ha

Re: [Haskell-cafe] Correspondence between libraries and modules

ard library. It also gives you a much better idea what the thing you export is doing than if it is from, say, Org.Epics.PvData.Util. Finally, it gives the package author an incentive to actually do the refactoring that makes it obvious where the f

Re: [Haskell-cafe] heterogeneous environment

s to avoid the problem entirely.) i don't know what to search for, something like interpreters with environments with heterogeneous types. i find the circuit-diagram / functional representation the most interesting, but it seems unfortunately syntactically impossible. best, ben _

[Haskell-cafe] heterogeneous environment

this must be a problem that has either been solved or else there is a haskell point of view on it i'm not grasping which avoids the need for this data structure. maybe there is a way of writing this as an interpreter or using some existing monad, like the ST monad? best, ben [1] - Fr

Re: [Haskell-cafe] why are applicative functors (often) faster than monads? (WAS Google Summer of Code - Lock-free data structures)

sing. > > Do I have that correct? > > > On Fri, Apr 20, 2012 at 4:05 PM, Ben wrote: > i'm not sure what your email is pointing at. if it is unclear, i understand > the difference between applicative and monadic. i suppose the easy answer to > why applica

Re: [Haskell-cafe] why are applicative functors (often) faster than monads? (WAS Google Summer of Code - Lock-free data structures)

i'm not sure what your email is pointing at. if it is unclear, i understand the difference between applicative and monadic. i suppose the easy answer to why applicative can be faster than monadic is that you can give a more specialized instance declaration. i was just wondering if there was a

[Haskell-cafe] why are applicative functors (often) faster than monads? (WAS Google Summer of Code - Lock-free data structures)

or a global clock as in Transactional Locking II.) for the second, right now i'm wondering if i'm going to have to write a compiler for a little DSL; i'd like to be able to exploit applicative performance gains generally, and special case 1-CAS. best, ben On Apr 6, 2012, at 5

Re: [Haskell-cafe] ANNOUNCE: pipes-core 0.1.0

Paolo Capriotti wrote: > On Mon, Apr 16, 2012 at 10:13 PM, Ben Franksen > wrote: >> (1) What is the reason for the asymmetry in >> >> type Producer b m = Pipe () b m >> type Consumer a m = Pipe a Void m >> >> i.e. why does Producer use () for the inp

Re: [Haskell-cafe] ANNOUNCE: pipes-core 0.1.0

d composition) but your is left to right. You could use e.g. >$> instead, which has the additional advantage of allowing a symmetric variant for the other direction i.e. <$<. Cheers Ben ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] [Haskell] ANNOUNCE: notcpp-0.0.1

On Sun, Apr 15, 2012 at 7:14 PM, Steffen Schuldenzucker wrote: > > > On 04/13/2012 10:49 PM, Ben Millwood wrote: >> >> I'm pleased to announce my first genuinely original Hackage package: >> notcpp-0.0.1! >> >> http://hackage.haskell.org/package/notcpp

Re: [Haskell-cafe] GHCi runtime linker: fatal error (was Installing REPA)

On 08/04/2012, at 2:41 AM, Dominic Steinitz wrote: >> Hi Ben, Chris and Others, >> >> Thanks for your replies and suggestions. All I want to do is invert (well >> solve actually) a tridiagonal matrix so upgrading ghc from the version that >> comes with the pl

Re: [Haskell-cafe] Installing REPA

On 07/04/2012, at 21:38 , Peter Simons wrote: > Hi Ben, > >> I've just pushed Repa 3 onto Hackage, which has a much better API >> than the older versions, and solves several code fusion problems. > > when using the latest version of REPA with GHC 7.4.1, I hav

Re: [Haskell-cafe] Installing REPA

the older versions, and solves several code fusion problems. However, you'll need to upgrade to GHC 7.4 to use it. GHC 7.0.3 is two major releases behind the current version. Ben. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Google Summer of Code - Lock-free data structures

Ben writes: > perhaps it is too late to suggest things for GSOC -- > > but stephen tetley on a different thread pointed at aaron turon's > work, which there's a very interesting new concurrency framework he > calls "reagents" which seems to give the best of a

Re: [Haskell-cafe] Google Summer of Code - Lock-free data structures

perhaps it is too late to suggest things for GSOC -- but stephen tetley on a different thread pointed at aaron turon's work, which there's a very interesting new concurrency framework he calls "reagents" which seems to give the best of all worlds : it is declarative and compositional like STM,

[Haskell-cafe] Mathematics and Statistics libraries

I am a student currently interested in participating in Google Summer of Code. I have a strong interest in Haskell, and a semester's worth of coding experience in the language. I am a mathematics and cs double major with only a semester left and I am looking for information regarding what the commu

Re: [Haskell-cafe] using mutable data structures in pure functions

ecisely the use of the ST monad. ST serves to allow the use of mutable state inside of a function while hiding the fact from the outside world. Cheers, - Ben ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Hackage 2 maintainership

On Tue, 14 Feb 2012 02:06:16 +, Duncan Coutts wrote: > On 14 February 2012 01:53, Duncan Coutts wrote: > > Hi Ben, snip > Ah, here's the link to my last go at getting people to self-organise. > http://www.haskell.org/pipermail/cabal-devel/2011-October/007803.html >

Re: [Haskell-cafe] Hackage 2 maintainership

.haskell.org. Cheers, - Ben ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Hackage 2 maintainership

months ensuring nothing explodes 5) After it's agreed that things are stable, eventually swap the Hackage 1 and 2 instances This will surely be a non-trivial process but I would be willing to move things forward. Cheers, - Ben [1] http://www.haskell.org/pipermail/cabal-devel/2012

Re: [Haskell-cafe] Error in installing dph-examples on Mac OS X 10.7.3

On 10/02/2012, at 6:12 AM, mukesh tiwari wrote: > Hello all > I am trying to install dph-examples on Mac OS X version 10.7.3 but getting > this error. I am using ghc-7.4.1. This probably isn't DPH specific. Can you compile a "hello world" pr

[Haskell-cafe] Transactional memory going mainstream with Intel Haswell

http://arstechnica.com/business/news/2012/02/transactional-memory-going-mainstream-with-intel-haswell.ars would any haskell STM expert care to comment on the possibilities of hardware acceleration? best, ben ___ Haskell-Cafe mailing list Haskell-Cafe

Re: [Haskell-cafe] Loading a texture in OpenGL

xecuted before the program exits. "No guarantee of promptness". Even if the GC knows your pointer is unreachable, it might choose not to call the finaliser. I think people have been bitten by this before. Ben. ___ Haskell-Cafe mailing list H

Re: [Haskell-cafe] Loading a texture in OpenGL

e just before the program exits, instead of when the pointer actually becomes unreachable. Because texture memory is a scarce resource, I wouldn't want to rely on a finaliser to free it -- though I suppose this depends on what you're doing. Ben. [1] http://www.haskell.org/ghc/docs/latest/h

Re: [Haskell-cafe] Loading a texture in OpenGL

tions I > should be calling? The Gloss graphics library has texture support, and the code for drawing them is confined to this module: http://code.ouroborus.net/gloss/gloss-head/gloss/Graphics/Gloss/Internals/Render/Picture.hs Feel free to steal the c

Re: [Haskell-cafe] Compiling dph package with ghc-7.4.0.20111219

s The -fdph-par flag doesn't exist anymore, but we haven't had a chance to update the wiki yet. Use -package dph-lifted-vseg to select the backend. You could also look at the cabal file for the dph-examples package to see what flags we use when compiling. Ben. __

Re: [Haskell-cafe] SMP parallelism increasing GC time dramatically

into a similar issue with a concurrent Gibbs sampling implmentation I've been working on. Increasing -H fixed the regression, as expected. I'd be happy to provide data if someone was interested. Cheers, - Ben ___ Haskell-Cafe mailing list

Re: [Haskell-cafe] If you'd design a Haskell-like language, what would you do different?

erminate, then it is marked as "possibly non-terminating". This isn't the same as deciding something is "*definitely* non-terminating", which is what the halting problem is about. This "possibly non-terminating" approach is already used by Coq, Agda and othe

Re: [Haskell-cafe] If you'd design a Haskell-like language, what would you do different?

vented *after* it was decided that Haskell would be a lazy language. Talk about selection bias. Ben. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] If you'd design a Haskell-like language, what would you do different?

ou don't always find an int. Of course the superior Haskell solution is to use algebraic data types, and represent a possibly exceptional integer by "Maybe Int". But then when you inspect a "Maybe Int" you don't always get an .. ah. > Would it cause a compile

Re: [Haskell-cafe] If you'd design a Haskell-like language, what would you do different?

ell-formed term in the language must > have a value. So, what is a value of "fix id"? There isn't one! Bottoms will be the null pointers of the 2010's, you watch. Ben. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] indentation blues

I am fairly new to haskell, but I really like the emacs haskell mode. It is a bit strict but it generally does what I want it to. Unfortunately I can't really compare to the haskell vim mode since I only did Scala and Perl back when I was a heavy vim user. The one useful thing that I can add is th

[Haskell-cafe] "lambda.fm" How can I use this to help the Haskell community?

A while back I somehow managed to get the domain name, "lambda.fm" and I am simply creating this post to get some ideas from the community on what it could be used for to help the FP community. So tell me what you think. ___ Haskell-Cafe mailing list Hask

Re: [Haskell-cafe] A Mascot

t;= f = \k -> m (\a -> (f a) k) This is a formula I can spend a day contemplating and still wonder if I have _really_ understood it. And doesn't that properly reflect the depth and richness of Haskell? Cheers Ben > On Mon, Nov 21, 2011 at 7:52 AM, Karol Samborski > wrote: >

Re: [Haskell-cafe] Interpreter with Cont

he > mother of all monads. It is, in the sense that you can implement all monads in terms of Cont. Cheers Ben ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Deduce problem.

ot a universally quantified type variable. Cheers Ben ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] os.path.expanduser analogue

On Sun, 20 Nov 2011 21:02:30 -0500, Brandon Allbery wrote: > On Sun, Nov 20, 2011 at 20:36, Ben Gamari wrote: [Snip] > > Although arguably there should be some error checking. > Thanks for the improved implementation. I should have re-read my code before sending as it wasn

[Haskell-cafe] os.path.expanduser analogue

On the whole, the filepath package does an excellent job of providing basic path manipulation tools, one weakness is the inability to resolve "~/..." style POSIX paths. Python implements this with os.path.expanduser. Perhaps a similar function might be helpful in filepath? Chee

[Haskell-cafe] timezone-series, timezone-olson dependencies

und bumped to 1.5? Cheers, - Ben ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

  1   2   3   4   5   6   7   8   >