shriramkmurthi

9 ms·

61.
by shriramkmurthi 12y ago
Look, the OP could have been precise. We have terminology that makes all these things very exact. That's why terms like "soundness", "completeness", etc. were invented. The OP wrote something that is ambiguous. I wa
62.
by shriramkmurthi 12y ago
What he wrote is "statements that are semantically absolutely identical but differ in just the 'sugar'". I was just quoting him back. Of course, one can always construct various hacky approximations to this, and maybe th
63.
by shriramkmurthi 12y ago
If you have a way of automatically detecting that two terms in a program are semantically identical, don't keep it secret! [Hint: Halting Problem.]
64.
by shriramkmurthi 12y ago
For more detail, I suggest reading chapters 35, 36, and 37 of the first edition of this book (PLAI), which provide even more detail. See http://www.plai.org/ .
65.
by shriramkmurthi 14y ago
It's not an either-or. Typed Racket is a statically typed language, and students would be welcome to use it.
66.
by shriramkmurthi 14y ago
The choice of Racket is because it contains several points of interest for what we're trying to teach. For instance, we will discuss advanced control (continuations), contracts, the typed/untyped boundary, etc., all of which are best repres
67.
by shriramkmurthi 14y ago
You shouldn't need to log into anything to be able to view the page, but at any rate, as tomku points out, we are going to use G+ for classwork discussion, so it's either now or later.
68.
by shriramkmurthi 14y ago
We've already discussed this in the G+ thread.
69.
by shriramkmurthi 14y ago
Thanks for the attempt to explain. However, it's slightly off on several fronts, so I'd like to set the record straight. I don't know what you mean when you say it's not a "traditional mathematical definition". It's both traditional and m