fadmmatt

6 ms·

1.
Does Google Knol encourage and profit from plagiarism?(blog.regehr.org)
5 points by fadmmatt 16y ago|1 comments
2.
by fadmmatt 16y ago
Yes.
3.
by fadmmatt 16y ago
It will look suspiciously similar to the Scripting Language Design and Implementation class that I'll be teaching. This kind of stuff also showed up in my program analysis and advanced compiler classes, too. One of the class projects was
4.
by fadmmatt 16y ago
Sure, but the article doesn't use eval.
5.
by fadmmatt 16y ago
That's a good question, actually. Lisp macros need knowledge of the structure of the s-expression. Certainly one can Church encode s-expressions and provide defmacro. Gensym is trickier. Hygiene might be really challenging. I might actuall
6.
Is linode down?(linode.com)
40 points by fadmmatt 16y ago|34 comments
7.
by fadmmatt 16y ago
I was an entrepreneur (failed twice), and I'm now a professor. Being a pre-tenure professor is way more terrifying than being an entrepreneur was. And, depending on the field, between 25% and 75% of your salary as a professor will come from
8.
by fadmmatt 16y ago
You can't do this with #define alone. You can pass these "functions" around arbitrarily, and it still works.
9.
by fadmmatt 16y ago
Good question. In short, you can use the macros to hide the context-switching (yielding). You could, for instance, force every function to perform a context switch right after its called. Since languages like Scheme encode even loops with
10.
by fadmmatt 16y ago
When I taught advanced compilers last semester, one of the projects was a Scheme-to-C compiler that implemented first-class continuations via call/cc. I realized when going over that material, however, that most students didn't know what a
11.
by fadmmatt 16y ago
Neat; but C++0x does this: [](int x, int y) { return x + y; } instead of this: lambda<int> (x,y) --> x + y Ironically, the template hack could be shorter in many cases.
12.
by fadmmatt 16y ago
(Article author here.) I'd love to use Haskell, but I'm helping out on an exascale DoE project, and C++ is all we're allowed to use. Ugh. Of course, lambdas don't make C++ more powerful, but that's just reductio ad Turing tar-pit. You can
13.
by fadmmatt 17y ago
Milner, Robin (1978), "A Theory of Type Polymorphism in Programming", Jcss 17: 348–375 I don't know if there's a free copy online anywhere. The Damas-Milner paper is the sequel; it presents an alternate algorithm for type inference. Benjami
14.
by fadmmatt 17y ago
For anyone that uses an ML (e.g. OCaml), Haskell or Scala, Milner was responsible for the Hindley-Milner type system and inference algorithm that sits at the foundation of these languages. It ignited a wave of research into type theory tha
15.
by fadmmatt 17y ago
In case anyone needs them, I wrote up Okasaki red-black trees for Scala: http://matt.might.net/articles/implementation-of-immutable-p...
16.
by fadmmatt 17y ago
Back when I took calculus in high school, the instructor asked for a show of hands for first-borns. All hands but one went up--well above 80%. I've wondered why that was so ever since. Why weren't middle and younger children pushing them
17.
by fadmmatt 17y ago
My brother in the Army can still see it, so it's apparently not all government. By the way, he can't get to Hacker News.
18.
by fadmmatt 17y ago
Can anyone check to see if http://matt.might.net/ is blocked? I host it on a linode. Thanks!
19.
by fadmmatt 17y ago
* Does the transfer function not need to take some input other than the state? It depends on how you're encoding things. You might want to supply the I in I/O as an extra parameter to the transfer function. Or, you could kick off the execu
20.
by fadmmatt 17y ago
If you're wondering what things like "operational" and "denotational" mean and what they look like in code, I created this article for my compilers students: http://matt.might.net/articles/writing-an-interpreter-substi... Short version: *
21.
by fadmmatt 17y ago
Herb Simon noted the optimal solution is often infeasible a long time ago. He argued that economic agents rarely finding a satisfying solution to their constraints, and instead choose a "satisficing" or "good-enough" solution. Simon also no
22.
by fadmmatt 17y ago
Enhance! http://www.youtube.com/watch?v=Vxq9yj2pVWk
23.
by fadmmatt 17y ago
This is a great article. Continuations are rarely understood, which is unfortunate, given their power. I wrote an article for my compilers class that gives examples of how to use continuations (in Scheme): http://matt.might.net/articles/p
24.
by fadmmatt 17y ago
The role the YC plays in this case is hiding the memoization. The memoizing Y combinator is the same as the Y combinator, except it doesn't re-compute inputs it's already seen. Writing recursive functions in "Y-combinator style" is a way
25.
by fadmmatt 17y ago
Stay tuned: I'll be giving another crazy lambda talk at PLDI 2010 this summer.
26.
by fadmmatt 17y ago
Thanks! Will fix.
27.
by fadmmatt 17y ago
Re-post: http://news.ycombinator.com/item?id=1136998
28.
by fadmmatt 17y ago
Nifty. I wrote up an alternate derivation based on fixed points for my compilers students: http://matt.might.net/articles/implementation-of-recursive-f... It also shows how to exploit the Y combinator to get speed-ups from memoization in
29.
by fadmmatt 17y ago
Yes.[1] I do research in programming languages, but until yesterday, I never posted much about my research area. I use my blog to post on topics related to courses I teach. (Mostly advanced compilers and static analysis.) I also post on ne
30.
by fadmmatt 17y ago
If you're interested in more Church, here's the blog post I wrote for my compilers students (with code) on Church encodings: http://matt.might.net/articles/church-encodings-demo-in-sche... When building a compiler, I have my students use

More ›