リスプ－１。

Whats your favorite Scheme standard nowadays, /prog/? Are you coding from a standard or implementation specific?

        1975 "Scheme: an interpreter for extended lambda calculus"
3 yrs   1978 RRS
     << 1984 SICP >>
7 yrs   1985 RRRS
1 yr    1986 R3RS
5 yrs   1991 R4RS
     << 1996 SICP 2nd E >>
7 yrs   1998 R5RS
     << 2001 HtDP >>
9 yrs   2007 R6RS
5 yrs   2012 R7RS-SmL-draft6

control and prompt look very interesting. I've read another paper also by Felleisen where he described another alternative of his: continuation-graft. He must really dislike call/cc, and I must say that I can't be too apologetic of it.

But I've always wondered about the need for user-defined types and data structures. Can't you build everything out of lists (and other primitive aggregate types)? Why is it better to dispatch on type than on structure with match and match-lambda? Let badly formed data fail (early). What about racket's contracts?

Information hiding and encapsulation in plain data is useful when your operations on them are destructive. But with mostly immutable data structures it's not nearly as important.