Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
dons
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
9 ms
·
61.
▲
by
dons
12y ago
> handle a linked list as rapidly as the JVM handles an array A linked list is not an array. Particular operations will have different complexities. One data structure is not "more rapid" than another.
62.
▲
by
dons
12y ago
Title is misleading. This is about some Scala microbenchmarks. There is no CT or metal here.
63.
▲
by
dons
12y ago
It's almost like the shell was designed to execute arbitrary commands!
64.
▲
by
dons
12y ago
Psuedocode then. Given a type `m` and a type `a` a monad provides functions with types: bind : m a → (a → m b) → m b wrap : a → m a
65.
▲
by
dons
12y ago
Might be a reasonable fit for Cryptol?
66.
▲
by
dons
12y ago
Well its not "much" higher level. It adds memory management and a simpler concurrency story, which helps. But e.g. no generics, no algebraic data types, no pattern matching. Plenty of things will still have to be done by hand. I&#
67.
▲
by
dons
12y ago
Title shows author doesn't understand programming language design. No, a small set of higher-order functions[1] is not as fundamental as the concept of higher-order functions in the first place. [1]: http://www.reddit.com&#x
68.
▲
by
dons
12y ago
How does this differ from e.g. xmonad, which uses vi-like keybindings? It's specifically the bulk operators based on movement?
69.
▲
by
dons
12y ago
there does seem to be some overlap with stream fusion -- which was all about exploiting the optimization opportunities when separating the collection operation from the kernel performed on each element. We called the bits in the middle &quo
70.
▲
by
dons
12y ago
> except generally more cumbersome you're doing it wrong.
71.
▲
by
dons
12y ago
Hmm. This is just one guy's style guide on the public wiki. http://www.haskell.org/haskellwiki/index.php?title=Commentin... It isn't official in any sense.
72.
▲
by
dons
12y ago
Tiobe is not a good way to measure popularity. There is not really more ML code than Haskell , for example. Try e.g. github http://redmonk.com/sogrady/2014/06/13/language-rankings-6-14...
73.
▲
by
dons
12y ago
> full of broken packages. Citation needed. Hackage goes to great lengths to validate packages as much as possible. Other support systems do continuous integration and further validation, if you're looking for well regarded package
74.
▲
by
dons
12y ago
This would become "haskell-rest" in most package systems.
75.
▲
by
dons
12y ago
Because using sloppy language is so much better...
76.
▲
by
dons
12y ago
Gorgeous slides, Ed!
77.
▲
by
dons
12y ago
Yeah. We used started using tinyurl on #haskell IRC by 2003 because long urls would break line wrapping, get mangled, not be typeable etc.
78.
▲
by
dons
12y ago
[citation needed]
79.
▲
by
dons
12y ago
Lens is one guy's pathological abstraction. It's a library, and it's idiosyncratic. It isn't want large Haskell systems "look like". Cf http://ro-che.info/articles/2014-04-24-lens-unidiomat
80.
▲
by
dons
12y ago
Amazing to think that parser combinator libraries are an almost 20 year old technique now. And if you think these things are toys, consider e.g. http://hackage.haskell.org/package/FpMLv53 is used to process transaction
81.
▲
by
dons
12y ago
http://m.youtube.com/watch?v=VNX4spGpIOc&feature=kp I'd recommend Aes' Zodiacpuncture for vocab speed and depth. He basically wins the ranking on that track alone.
82.
▲
by
dons
12y ago
The Haskell logo is backwards...
83.
▲
ACM Turing Award to Leslie Lamport
(prweb.com)
1 points
by
dons
13y ago
|
0 comments
84.
▲
by
dons
13y ago
- HaLVM : https://github.com/GaloisInc/HaLVM - House: http://programatica.cs.pdx.edu/House/ - SeL4 : http://ssrg.nicta.com.au/projects/seL4/ Emphasis is on the security
85.
▲
by
dons
13y ago
tiobe is a measure of "search engine results" for the query "$language programming".. including on YouTube. So it is neither a measure of community nor job market.
86.
▲
by
dons
13y ago
Importantly, comparing "ephemeral" structures - those that destroy previous states through direct hardware mutation - with persistent structures (such as all pure data structures) - is a fraught topic. You can surely gain speed up
87.
▲
by
dons
13y ago
Not sure I want to do BlackScholes and MC or solving SAT problems or data structures in perl.. But text processing , hell yeah. perl -pei ftw! The legacy is perl REs
88.
▲
by
dons
13y ago
These are $5 for a reason. http://www.reddit.com/r/haskell/comments/1rj2jq/book_haskell...
89.
▲
by
dons
13y ago
> idle garbage collection ... Eating CPU when nothing is happening .. Painful surprise Wait, what?
90.
▲
by
dons
13y ago
Complexity of concatMap operations. Nested things don't always fuse. If you want to use fusion, the best place is the `vector` package.
More ›