Higher-Order and Symbolic Computation, 12(3)219
EditorialOlivier Danvy and Carolyn Talcott
|
At OOPSLA'98, Guy Steele delivered a brilliant talk on language
design, a polished version of which we are happy to present in this
issue. In their article "Optimal Representations of Polymorphic Types with Subtyping," Alexander Aiken, Ed Wimmers, and Jens Palsberg investigate the problem of minimal variable representations of polymorphic types in the presence of subtyping. They develop an algorithm and prove it both sound and complete for simple non-recursive and recursive types. Extensions of the algorithm are sound but not complete for intersection and union types, and for constrained types. The article also contains a comprehensive survey of the issues involved, done in a generic setting that makes it an excellent reference work for the area. Finally, as another offshoot of our special issue on continuations, Mitchell Wand allowed us to reprint his seminal article on "Continuation-Based Multiprocessing" [1], for which he kindly wrote an introduction. References 1. Wand, M. Continuation-based multiprocessing. In Conference Record of the 1980 LISP Conference, Ruth E. Davis and John R. Allen (Eds.). Stanford, California, August 1980, pp. 19-28. |
![[picture of journal cover]](../LISP.JPG)