D.Weinreb, D.Moon: Lisp machine manual, Symbolics Inc., 1981. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Typeful Programming - Cardelli (1989) (77 citations) (Correct)
....built this way can be very easily debugged. Nonetheless, this practice does not lead to robustness, reliability or maintainability. Bugs can easily be fixed, but cannot easily be prevented, and systems cannot be easily restructured. These systems seem to become rapidly incomprehensible with size [Weinreb Moon 81] since no static structure is imposed on them. Type free programming is often advocated for beginners [Kemeny Kurtz 71] but languages like ML and Miranda [Turner 85] have demonstrated that some powerful type systems, if desired, can be made completely unobtrusive through type inferencing ....
D.Weinreb, D.Moon: Lisp machine manual, Symbolics Inc., 1981.
Typeful Programming - Cardelli (1993) (77 citations) (Correct)
....built this way can be very easily debugged. Nonetheless, this practice does not lead to robustness, reliability or maintainability. Bugs can easily be fixed, but cannot easily be prevented, and systems cannot be easily restructured. These systems seem to become rapidly incomprehensible with size [Weinreb Moon 81] since no static structure is imposed on them. Type free programming is often advocated for beginners [Kemeny Kurtz 71] but languages like ML and Miranda [Turner 85] have demonstrated that some powerful type systems, if desired, can be made completely unobtrusive through type inferencing ....
D.Weinreb, D.Moon: Lisp machine manual, Symbolics Inc., 1981.
On Understanding Types, Data Abstraction, and Polymorphism - Cardelli, Wegner (1985) (90 citations) (Correct)
....superclass. Simula s objects and procedures are polymorphic because an object of a subclass can appear wherever an object of one of its superclasses is required. Smalltalk [Goldberg 83] although an untyped language, also popularized this view of polymorphism. More recently, Lisp Flavors [Weinreb 81] untyped) have extended this style of polymorphism to multiple immediate superclasses, and Amber (typed) Cardelli 85] further extends it to higher order functions. The paradigmatic language for parametric polymorphism is ML [Milner 84] which was entirely built around this style of typing. In ....
D.Weinreb, D.Moon: Lisp machine manual, Fourth Edition, Chapter 20: Objects, message passing, and flavors, Symbolics Inc., 1981.
Typeful Programming - Luca Cardelli Digital (1989) (77 citations) (Correct)
No context found.
D.Weinreb, D.Moon: Lisp machine manual, Symbolics Inc., 1981.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC