Recent Quotes
-
Voting:
-
1
+
There are infinitely many bottoms around.
— Jim Donahue
·
May 1, 1979
·
Permalink
-
Voting:
-
0
+
This is probably the most influential paper in semantics that's never been published.
— Jim Donahue
·
May 1, 1979
·
Permalink
-
Voting:
-
0
+
If the program works you probably don't care.
— Ralph Johnson
·
May 1, 1979
·
Permalink
-
Voting:
-
0
+
This is a language for hackers - I mean, it's a really neat language for hackers.
— Ralph Johnson
·
May 1, 1979
·
Permalink
-
Voting:
-
0
+
A good hacker's language is one in which you can do things the writer of the language never intended.
— Ralph Johnson
·
May 1, 1979
·
Permalink
-
Voting:
-
0
+
Max, as a unary function, isn't very interesting.
— Bill Fischofer
·
April 29, 1979
·
Permalink
-
Voting:
-
0
+
Let L_0 be your favorite NP-complete problem ...
— John Hopcroft
·
April 25, 1979
·
Permalink
-
Voting:
-
3
+
Gries: ... "dereferencing" and "ref-referencing"? ... "anti-dereferencing"? ...
Student: How about "referencing"?
Gries: That's too simple.
— David Gries
·
April 25, 1979
·
Permalink
-
Voting:
-
0
+
It's got plus and times and all that other neat stuff.
— Jim Donahue
·
April 24, 1979
·
Permalink
-
Voting:
-
2
+
I'll have you know I spent 13 hours preparing this lecture - so nobody had better sleep.
— John Hopcroft
·
April 20, 1979
·
Permalink
-
Voting:
-
2
+
This is obvious to an educated person.
— John Hopcroft
·
April 18, 1979
·
Permalink
-
Voting:
-
0
+
I would like to say we've proven such a theorem for Russell, but Alan's been awfully slow about it.
— Jim Donahue
·
April 17, 1979
·
Permalink