dons

46 ms·

481.
by dons 16y ago
At least Haskell orients towards shared-state concurrency, where the state is the thin layer of communication between many stateless threads, using mechanisms like transactional memory to manage the shared resource.
482.
by dons 16y ago
> A common complaint about Haskell is that doing "game-like" stuff I doubt some user-input issue on the Mac, in the alpha release, is to do with difficulties in the correct design for updating shared state, in a purely functional way...
483.
Re-implementing the XMonad window manager core in Coq: PDF(cs.ru.nl)
37 points by dons 16y ago|3 comments
484.
by dons 16y ago
This problem was solved brilliantly by computer science in the 1970s . FTFY :-)
485.
Functions are values(existentialtype.wordpress.com)
5 points by dons 16y ago|0 comments
486.
Parallel Haskell Digest: sparks, threadscope, concurrent servers... (well-typed.com)
1 points by dons 16y ago|0 comments
487.
by dons 16y ago
I'm not saying you will write nonsense, I'm asking what evidence you have. The evidence in this case is "I know what I'm doing".
488.
by dons 16y ago
Right. You better copy the original data structure. That's one good way to guarantee internal mutation (of the copy) isn't going to be visible. Or it gets tricky (e.g. linear types)
489.
by dons 16y ago
> if you just destructively modify and return a copy of the source Then the caller can no longer reference the source without observing the fact you've mutated it -- you'd have to guarantee they've dropped all references to the now-muta
490.
SPJ: Managing parallelism: embrace diversity, but control side effects(skillsmatter.com)
2 points by dons 16y ago|0 comments
491.
by dons 16y ago
> dunno if real World Haskell is a fire hydrant; We certainly tried (and it ended up being 3x bigger than we planned): http://book.realworldhaskell.org/read/
492.
by dons 16y ago
Without types, how do you know you're not writing nonsense?
493.
Mutation is not modular; mutation is complicated.(blog.ezyang.com)
4 points by dons 16y ago|0 comments
494.
Functional flocks : modelling and visualizing flocking behavior in Haskell(syntacticsalt.com)
27 points by dons 16y ago|0 comments
495.
by dons 16y ago
Some advice is given in the "read more" link: http://hackage.haskell.org/platform/contents.html
496.
by dons 16y ago
You'll need to wait for your distro maintainer to update the package set. Alternatively, you can build from source, using a generic Linux ghc, like so: http://www.vex.net/~trebla/haskell/haskell-platform.xhtml
497.
The Haskell Platform 2011.2 is out: GHC 7 for all (hackage.haskell.org)
97 points by dons 16y ago|33 comments
498.
by dons 16y ago
GHC provides a parallel programming model, * K sparks scheduled over * M lightweight threads scheduled onto * N OS threads over * C hardware cores. The runtime manages this, and does load balancing.
499.
by dons 16y ago
7.0.1 was the release candidate for 7.0.2 (stable).
500.
GHC 7 is released. with LLVM, improved inliner, improved thread scheduler ...(haskell.org)
98 points by dons 16y ago|14 comments
501.
Build Yourself a Bluetooth Controlled Six-Legged Robot(blog.sigfpe.com)
4 points by dons 16y ago|0 comments
502.
by dons 16y ago
The focus is primarily about building open source infrastructure, so yep, for the love of code (though often informed by commercial need).
503.
by dons 16y ago
No, was a bit hard to make it to .ca from .au. However, they did inspire the structure of the Haskell ones.
504.
by dons 16y ago
The Haskell ones tend to produce a lot of code: but we plan ahead on what to work on, and turn up with small teams. More info on how we do planning: http://www.haskell.org/haskellwiki/Hackathon
505.
by dons 16y ago
My colleague, Matt Sottile, has a nice blog on languages, functional programming, and scientific (often numerical) computing, http://syntacticsalt.com/
506.
by dons 16y ago
Conal Elliott has a good overview, http://www.reddit.com/r/haskell/comments/fnc80/type_level_na...
507.
Type level numbers and arithmetic added to GHC Haskell(hackage.haskell.org)
4 points by dons 16y ago|1 comments
508.
by dons 16y ago
Remember that regular Haskell has pragmatic destructive arrays as well (e.g. repa, vector, hmatrix). The primary interesting thing about DDC, in my view, is the effect types -- the type system can infer what kind of monadic effects you're u
509.
Faster persistent data structures through hashing : Galois Tech Talk(blog.johantibell.com)
5 points by dons 16y ago|0 comments
510.
by dons 16y ago
These are comparisons of various Haskell webservers, running the same micro benchmark, and the given number for Warp is provided. There are links to older benchmarks against servers in other languages. Look for the big graph with differen

More ›