trurl

18 ms·

91.
by trurl 15y ago
The best example I have handy is some Scala code a student I worked with wrote in Scala. I'm not sure if this is necessarily compatible with the latest version of their parser combinator library, but is hopefully suggestive: import sca
92.
by trurl 15y ago
Uh, there are many papers and examples of using HOAS in statically typed settings, such as ML, Haskell, Twelf, Coq, etc. There is still the issue of exotic terms, but there are known type system tricks for helping with that as well. And t
93.
by trurl 15y ago
The title of the post is "Want to Write a Compiler? Just Read These Two Papers." I upped the ante by proposing they just read one better paper. I think if you had actually bothered to read the paper rather than make assumptions you would f
94.
by trurl 15y ago
I learned more about modern compilation by reading and implementing "From System F to Typed Assembly Language" than I did from the compilers course I took. http://www.cs.princeton.edu/~dpw/papers/tal-toplas.pdf
95.
by trurl 15y ago
Okay, that's a pretty good point. I clearly do not think enough like patent troll.
96.
by trurl 15y ago
Okay, as (nearly) the most valuable company in the world, why don't they avoid all the legal maneuvering and resolve the problem with an acquisition?
97.
by trurl 15y ago
No, in the case of 'for', <- and ← are syntax.
98.
by trurl 15y ago
Hah, quite the optimist. In most commonly used languages deciding the equivalence of two code fragments is undecidable.
99.
by trurl 15y ago
Yes, that's it. Thanks.
100.
by trurl 15y ago
Scala's support for implicit parameters lets you do most everything you can with type classes. Plus, implicits have scope in Scala, so can choose which you wish to apply in a given context. With type classes the scope is global, so you're
101.
by trurl 16y ago
I suspect that Bjarne would be so overwhelmed with catching his flight that he would accidentally throw out his boarding pass along with the wrapper.
102.
by trurl 16y ago
This does seem very much like just a press release, but the first thing that came to my mind -- how come the Tolkien estate hasn't sent them a cease and desist yet?
103.
by trurl 16y ago
I don't have time at the moment to give a proof in Coq or another constructive proof assistant, but it boils down to the fact that "n is even and n is odd implies n = 17" is a function that can never be executed.
104.
by trurl 16y ago
Implication is far less confusing if you are a constructivist.
105.
by trurl 16y ago
You mean like http://www.ikvm.net/