dons

15 ms·

121.
by dons 13y ago
* http://hackage.haskell.org/package/network-bitcoin * Pure coin , https://github.com/laanwj/Purecoin * haskoin, https://github.com/bitcoin-spec/haskoin
122.
by dons 13y ago
I don't run xmobar or trayer... It's nice that we don't need to write these things in C to be small and fast.
123.
by dons 13y ago
> no unexpected side effects No one ever expects the side effects
124.
by dons 13y ago
> It locks up oddly sometimes under heavy load. ???
125.
by dons 13y ago
Tomorrow night (Wednesday).
126.
by dons 13y ago
Got about 30 guys here using Haskell. More in other centers.
127.
by dons 13y ago
See also free applicatives. We use these extensively at work. E.g. http://gergo.erdi.hu/blog/2012-12-01-static_analysis_with_ap... Amazing when entire DSL programs turn into 1 line calls.
128.
by dons 13y ago
Abstraction power doesn't scale linearly in the number of tokens.
129.
by dons 13y ago
See also Koen Claessen's "Poor Man's Concurrency Monad", http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8...
130.
by dons 13y ago
> This is very dense code, and takes some getting-used-to in order to read. I don't think so. It is full of syntactic noise, for what is really just notation for building a cyclic structure. * type annotations stated explicitly, not
131.
by dons 13y ago
You don't know Haskell. > take 8 $ cycle [1,2,3]
132.
by dons 13y ago
> If the last sentence read to you like some Haskellish solution to a self-inflicted problem, Language design is a formal discipline. Why the urge to dumb it down?
133.
The Algebra of Algebraic Data Types(chris-taylor.github.io)
129 points by dons 13y ago|14 comments
134.
by dons 13y ago
To be fair, it is the world's first 3D FPS written using a functional reactive programming style. 8 years ago. By one guy who was learning Haskell. In 8 weeks.
135.
by dons 13y ago
Lazy languages don't have equivalent call stacks as strict languages. However, GHC lets you get a stack trace via profiling. E.g. +RTS -xc flag gives a stack trace.
136.
Semantic design of programs(lukepalmer.wordpress.com)
1 points by dons 13y ago|0 comments
137.
A detailed look at GHC's STM implementation from a non-GHC hacker(fryguybob.github.io)
1 points by dons 13y ago|0 comments
138.
by dons 13y ago
... you might want to read up on monad comprehensions :) http://hackage.haskell.org/trac/ghc/wiki/MonadComprehensions
139.
by dons 13y ago
> By contrast, OCaml code is much easier to understand. Where you have a different + for doubles and ints...
140.
by dons 14y ago
> Debugging is annoying when I can't stick a println You might not know about Debug.Trace? http://www.haskell.org/ghc/docs/latest/html/libraries/base/D...
141.
by dons 14y ago
> it takes away your ability to arbitrarily mutate state and perform IO No. Haskell requires that you declare where IO is allowed (via the type). Once you assert that you admit mutable state (ST) or arbtirary IO (IO), then you are free
142.
by dons 14y ago
Go is a low level language compared to Haskell though. It's like walking back to 1982.
143.
Parsing Floats in Haskell With Parsec(fpcomplete.com)
5 points by dons 14y ago|0 comments
144.
by dons 14y ago
What's with the "dude" and "totally radical"? The problem with [Char] for bulk text IO was well acknowledged when I wrote bytestring. To quote: "The Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, b
145.
by dons 14y ago
What do you mean "syntax doesn't syntactically scale" ?
146.
by dons 14y ago
> :t map reverse :: [[a]] -> [[a]] > show (map reverse) No instance for (GHC.Show.Show ([[a0]] -> [[a0]])) You can't show functions. Pass an argument: > map reverse ["test","this"] =>
147.
by dons 14y ago
While halvm boots in the 10ms range (like starting a GHC process). These can be very fine grained and fast.
148.
by dons 14y ago
Not dead. Here's Adam's talk from the Xen Summit 6 months ago - http://www.xen.org/xensummit/xs12na_talks/M9b.html
149.
by dons 14y ago
The data structure has great complexity, and is closely relate to hash-array mapped tries, and ropes, which have good implementations. Individual implementations might suck. Others are just fine ( http://hackage.haskell.org/packages/archive
150.
School of Haskell : tutorials with live code(fpcomplete.com)
5 points by dons 14y ago|0 comments

More ›