Re: terminology
Date: Mon, 19 Jun 2006 17:33:06 GMT
Message-ID: <mdBlg.64183$Mn5.4042_at_pd7tw3no>
Marshall wrote:
> ...
> TTM is extremely well developed in the RT part. Indeed, it
> is the most thorough treatment of the topic I know of, and
> probably the only one to give it its due importance. But it is
> fairly uninspired in the PLT part. There is no mention of
> closures (in the PLT sense,) lambda, higher-order functions,
> recursion or tail-call optimization, process calculi or even
> message passing, type inference, parametric polymorphism
> (outside of its built-in use with relations) or metaprogramming
> anywhere in the book that I can find. (Although I only have
> the 2nd ed.; haven't gotten to the 3rd ed. yet.)
> ...
(at the risk of exposing my feeble grasp of modern plt lingo):
- closures - don't views give the same notion of postponement?
- messages - aren't they somehow equivalent to assignment?
- recursion - i seem to recall some kind of "with" notation in TD.
- type inference - i thought the larger part of TTM was about this (even though typing theory is a bit over my head).
p Received on Mon Jun 19 2006 - 19:33:06 CEST