harpocrates

10 ms·

31.
by harpocrates 9y ago
Is this implemented yet? The paper you linked is a draft. I'm glad C++ is doing this. > Historically, C++ used includes so that it could be compatible with C. I think it is more the case that C++ slowly splintered off C and never br
32.
by harpocrates 9y ago
Actually, those are the type errors I _like_ having (and don't always have: Scala will implicitly convert `Int` to `Long`), although I concede this is a matter of opinion. However, I am definitely less impressed by the unhelpful type e
33.
by harpocrates 9y ago
Pretty-printing is tough. That said, please don't reinvent the wheel. There is research that has gone into this that should make most of this stuff pretty straightforward. I personally recommend Wadler's "A Prettier Printer&q
34.
by harpocrates 9y ago
> There is no way new compiler can be 100% compatible. Hopefully it will be tested on major projects, or there will be some official Scala Language spec. I, for one, think that an official language spec would do the language a lot of goo
35.
by harpocrates 10y ago
> It's quite formally specified. Haha, that's a good one. Haskell, unlike SML, is _not_ formally specified. If only, if only... sobs
36.
by harpocrates 10y ago
I enjoyed your initial quip immensely. This one a bit less (I liked _The Sound And The Fury_, although not nearly as much as _The Mansion_). I think the OpenSSL line was only intended to emphasize that the communication wasn't easy - t
37.
by harpocrates 10y ago
I am a bit saddened to see so many languages adding sugar for promises (or the equivalent abstraction in that language). Promises are just a monad and async/await is a poor mans version of Haskell's do notation. Exactly the same a
38.
by harpocrates 10y ago
> I gave a presentation back in 2013 at mloc.js where I argued that static typing is an essential feature when picking a language for a large software project OK, so you went shopping for a statically typed language and somehow ended up
39.
by harpocrates 10y ago
See, now _this_ is something interesting. When I get some time, I'll take a look at hyperscan. Looks pretty neat.
40.
by harpocrates 10y ago
The article by Russ Cox [0] (from which the initial Perl vs. Thompson NFA graph is taken) is a much more informative read. Also, I'm not sure why this always gets brought up as being a big deal: CS is all about making the right tradeof
41.
by harpocrates 10y ago
Haskell lists should be thought of like (pure immutable) iterators. They have the same cache-misses and possibly-infinite properties. One could argue that the mistake Haskell made was to call them "lists" instead of "streams&
42.
by harpocrates 10y ago
That does help, yes. For example, inserting into a tree only takes a logarithmic number of allocations because of the fact the subtrees are persistent. That said with every insertion/deletion into that same tree, there is still at leas
43.
by harpocrates 10y ago
This is a big deal. Right now, Haskell (like most GC-ed languages) has one big heap that gets GC-ed regularly. The _only_ time memory is reclaimed is when the GC runs. By retrofitting Haskell with linear types, there would be another linear
44.
by harpocrates 10y ago
IIRC There is some discussion of using "-o", but then there are a whole slew of lexing/parsing issues that emerge since "o" is not part of the (vast!) class of characters Haskell considers as valid for use in operat
45.
by harpocrates 10y ago
Regarding your first idea, you may be interested in the Shake [0] Haskell EDSL as a replacement for Make. Being embedded in Haskell, Shake still has the full power of Haskell at its disposal. [0] http://ndmitchell.com/downlo
46.
by harpocrates 10y ago
Consider two directed acyclic graphs where each node has a hash that depends on its value and its parent's hashes. Suppose you have a slow connection and one of the graphs is remote, how do you figure out as efficiently as possible whi
47.
by harpocrates 10y ago
He has found a way to keep his question alive, at the known cost of generating what is likely going to be garbage for posterity (I am exaggerating here, but bottom line is that if a question is being closed, it probably is not useful to pos
48.
by harpocrates 10y ago
You realize _why_ the questions are being closed, and instead of cooperating with the people trying to keep StackOverflow clean, you just go around them. I never understood why StackOverflow would try to find correlations in user votes (vot
49.
by harpocrates 10y ago
I agree the initial reply may have been a bit harsh, but you must see the irony in saying > There are allot of uniformed assumptions being made here... followed by > What most people do know is that Stack Overflow is a shit show in de
50.
by harpocrates 10y ago
This. Yes. As someone who was classified as "gifted" and went to one of these special programs, your third point is a common occurrence. All that aside though, I think the very notion of gifted-ness is harmful (in a labelling sens
51.
by harpocrates 10y ago
I see. Googled the for Dafny quick sort and it does have some pretty long invariants. [1]: http://rise4fun.com/Dafny/ks
52.
by harpocrates 10y ago
What were the things that were confusing? I tried it out and found it much more intuitive than Coq (especially in the proofs). The keywords made sense, and so did the error messages. That said, I come from a more math oriented background, a
53.
by harpocrates 10y ago
Writing a type-checker is fun and pretty interesting. For that, I recommend you get acquainted with formal semantics and judgements (that's just the language for describing type-systems). You'll probably be interested in then look
54.
by harpocrates 10y ago
This looks really neat. I really like the idea, and I think it has lots of potential. That said, I'm going to try to moderate my enthusiasm until more stuff gets implemented. Thinking back to Yi [0], there is a lot of really cool stuff
55.
by harpocrates 10y ago
> full of half-discarded research projects, dependency on offshoot libraries, and a ton of tribal culture. That's a bit harsh. GHC is a pretty old beast and its source isn't as nice as I wish it was (if only imports were qualif
56.
by harpocrates 10y ago
This is a great read! From having dipped my toes into this, I'd say a large part of the problem (from the library designer's point of view) is deciding what interface to expose to the library user and making that as language agnos
57.
by harpocrates 10y ago
I really have to back up the recommendation for Wadler's "prettier printer" paper. I'm working on a Haskell parser and pretty-printer for Rust and I had pretty much given up on ever finding a lightweight pretty printer t
58.
by harpocrates 10y ago
Is there no way to indicate to GCC when you want something fully evaluated at compile-time? Maybe some pragmas? 98% of the time I probably don't care whether GCC does a good job optimizing this properly, but for the times I do care: wh
59.
by harpocrates 10y ago
I'm getting a bit tired of these articles. Writing this on a new MBP I have not yet once needed an adapter. I'm sure at some point I will, but for the time being I am quite content with having a couple minimal USB-C ports and my h
60.
Software project maintenance is where Haskell shines(fpcomplete.com)
3 points by harpocrates 10y ago|0 comments

More ›