dons

42 ms·

391.
Animating quasicrystals in parallel Haskell(mainisusuallyafunction.blogspot.com)
73 points by dons 15y ago|13 comments
392.
SnapChat: a tutorial on web programming in Haskell using the Snap Framework(gregorycollins.net)
30 points by dons 15y ago|1 comments
393.
How GHC and LLVM work together, and how they can improve(dterei.blogspot.com)
43 points by dons 15y ago|3 comments
394.
Iteratee-based IO in Haskell at Tsuru Capital(blog.kfish.org)
50 points by dons 15y ago|11 comments
395.
GHC Haskell now native on ARM devices(haskell.org)
2 points by dons 15y ago|0 comments
396.
by dons 15y ago
There's much more info about Snap, Yesod and Happstack (the three competing systems in Haskell-land) on the Haskell Reddit, * http://www.reddit.com/r/haskell/search?q=yesod&sort=top&... * http://www.reddit.com/r/haskell/search?q=snap
397.
by dons 15y ago
Well, that's kind of interesting. I just bought 100G so I could store all my mp3s in the cloud player while travelling. After uploading about 40G, this plan must have activated, and it shows "< 1%" of 100G used. Cool idea: I might use t
398.
by dons 15y ago
Pure code is code with no side effects. The result of a pure function only depends on its input parameters, and not the state of the world. Such code is by-default thread-safe, composable and tends to be simpler to understand than code with
399.
Erlang's parallelism is not parallelism(jlouisramblings.blogspot.com)
39 points by dons 15y ago|13 comments
400.
by dons 15y ago
Yes, the space semantics of lazy evaluation is difficult to learn, particularly when coming from fully-strict languages, or languages with little support for lazy programming. Many other programming techniques face similar barriers: e.g. me
401.
by dons 15y ago
There seems to be some confusion here. Iteratees weren't introduced to solve the problem of "eating up resources" per se. They're a new abstraction for doing high performance IO -- in any language. You've always had several choices for IO
402.
by dons 15y ago
The "always just out of reach" metaphor is tired. It's a somewhat outdated view of the community, which is now quite large, with many members gainfully employed building systems in Haskell commercially, and in non-trivial applications.
403.
On the origin of `x` and `xs` for variable names in functional programming...(stackoverflow.com)
1 points by dons 15y ago|1 comments
404.
Experience using the Haskell Snap framework in production(cdsmith.wordpress.com)
2 points by dons 15y ago|0 comments
405.
Rendering floating point numbers is hard(serpentine.com)
38 points by dons 15y ago|17 comments
406.
by dons 15y ago
Classic text on implementing typed Haskell/ML-like languages circa late 80s. Many of the terms and concepts remain relevant, though state of the art of runtime systems has advanced a lot.
407.
by dons 15y ago
There were something like 8 research groups involved in inventing the language, and at each group there had been previous proto-Haskell languages in house. As a result there were different styles that emerged. By the mid-2000s though, there
408.
Galois Video: Building an Open-Source Autonomous Quad-Copter(corp.galois.com)
3 points by dons 15y ago|0 comments
409.
by dons 15y ago
Haskell is the only widely used language that uses lazy evaluation by default. This has historically lead to confusion and difficulties with reasoning about time and space, particularly when a programmer is coming from a strict language. Wh
410.
by dons 15y ago
That's the default. There are, however, many other interesting computational environments you might want to use, which Haskell let's you enable: controlled, strict evaluation (the use of seq and rnf); local mutable state (the `ST` monad); m
411.
SIGPLAN Programming Languages Award goes to Peyton Jones and Marlow for GHC(corp.galois.com)
3 points by dons 15y ago|0 comments
412.
by dons 15y ago
https://github.com/languages/Lua #16 https://github.com/languages/Haskell #15
413.
by dons 15y ago
This is how Gilad rolls.
414.
by dons 15y ago
> Being able to fix running programs w/o going through the whole compile cycle is a demonstrable productivity gain. Indeed! Removing many sources of runtime failures at compile time is also a demonstrable productivity gain. So good thin
415.
by dons 15y ago
Unpack in this sense means "unbox", and you can specialize before you hide the type.
416.
by dons 15y ago
From the Haskell reddit discussion: > It's a simple truth, indeed a tautology, that if you want the compiler to check the consistency of interactions between modules, then the compiler must know the information that it is checking. That
417.
by dons 15y ago
Discussion about this overview at the Haskell Reddit: http://www.reddit.com/r/haskell/comments/hs0e9/three_haskell...
418.
Three Haskell web frameworks: an overview(blogs.linux.ie)
41 points by dons 15y ago|3 comments
419.
Simulating visual artifacts with Fourier optics(blog.sigfpe.com)
26 points by dons 15y ago|1 comments
420.
by dons 15y ago
The trust you place is based on mathematical evidence for the soundness of the compiler. The compiler is thus trustworthy, based on formal arguments, as opposed to informal arguments (such as "we did some testing" or "no bugs are were repor

More ›