R.Burstall, D.MacQueen, D.Sannella: Hope: an Experimental Applicative Language, Proceedings of the 1980 LISP Conference, Stanford, August 1980, pp. 136143. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Basic Polymorphic Typechecking - Cardelli (1988) (56 citations) (Correct)
....recently, Milner and Damas proved the principal type property for the extended system [Damas 82] which implies that the type system is decidable. With minor refinements, this is the state of the art exposed in the rest of this paper. This style of polymorphic typechecking was soon adopted by Hope [Burstall 80] and more recently has been incorporated in other functional languages. During that initial development of ML, it was found that the introduction of side effects made the type system unsafe [Gordon 79, p. 52] This was resolved in a rather ad hoc way; the situation was later improved by Damas, ....
....is rather technical, and mostly oriented towards the theoretical background. In the hope of making the algorithm accessible to a larger group of people, we present an implementation (in the form of a Modula 2 program) which is very close to the one used in LCF, Hope and Page 5 ML [Gordon 79, Burstall 80, Milner 84] Although clarity has sometimes been preferred to efficiency, this implementation is reasonably efficient and quite usable in practice for typechecking large programs. Only the basic cases of typechecking are considered, and many extensions to common programming language constructs ....
[Article contains additional citation context not shown here]
R.Burstall, D.MacQueen, D.Sannella: Hope: an Experimental Applicative Language, Proceedings of the 1980 LISP Conference, Stanford, August 1980, pp. 136143.
On Understanding Types, Data Abstraction, and Polymorphism - Cardelli, Wegner (1985) (90 citations) (Correct)
....which maps a list of arbitrary element type into its integer length. It is also possible to write a generic sorting package that works on any type with an ordering relation. Other languages that used or helped develop these ideas include CLU [Liskov 81] Russell [Demers 79, Hook 84] Hope [Burstall 80] Ponder [Fairbairn 82] and Poly [Matthews 85] Finally, we should mention generic procedures of the kind found in Ada, which are parametrized templates that must be instantiated with actual parameter values before they can be used. The 7 polymorphism of Ada s generic procedures is similar to ....
R.Burstall, D.MacQueen, D.Sannella: Hope: an experimental applicative language, Conference Record of the 1980 LISP Conference, Stanford, August 1980, pp. 136-143.
The TRANSPOSE Machine - A Global Implementation of a.. - Ben-Asher, Seidl.. (Correct)
No context found.
R.M. Burstall, D.B. MacQueen, D.T. Sannella: HOPE: an Experimental Applicative Language. University of Edinburgh, tech. report CSR-62-80, 1980
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