R.Milner: A proposal for Standard ML, Proc. Symposium on Lisp and Functional Programming, Austin, Texas, August 6-8 1984, pp. 184-197. ACM, New York. 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)
....forbid them from being returned by other functions. Higher order functions form the essence of the Z calculus [Barendregt 85] It seems that the first programming language to define them correctly was Iswim [Landin 66] and today the major language to implement them correctly is Standard ML [Milner 84] Even in their weaker forms, they are considered an essential structuring tool in many areas of system programming, such as operating systems. Abstract types come from the desire to hide irrelevant program information and to protect internal program invariants from unwanted external ....
R.Milner: A proposal for Standard ML, Proc. Symposium on Lisp and Functional Programming, Austin, Texas, August 6-8 1984, pp. 184-197. ACM, New York.
Phase Distinctions in Type Theory - Cardelli (1988) (21 citations) (Correct)
....all simple type systems found in programming languages (e.g. Pascal) which are usually variations on the type system of first order typed l calculus. This phase distinction remains when generalizing to second order typed l calculus, which can be used to model parametric polymorphism (e.g. in ML [Milner 84] and abstract types [Mitchell 85] In all these languages, phases can be distinguished syntactically: there are separate syntactic sorts of type expressions and value expressions. Phase distinction are however lost when moving to languages like Pebble [Burstall 84a] based on dependent types ....
R.Milner: A proposal for Standard ML, Proc. Symposium on Lisp and Functional Programming, Austin, Texas, August 6-8 1984, pp. 184-197. ACM, New York.
Typeful Programming - Cardelli (1993) (77 citations) (Correct)
....forbid them from being returned by other functions. Higher order functions form the essence of the l calculus [Barendregt 85] It seems that the first programming language to define them correctly was Iswim [Landin 66] and today the major language to implement them correctly is Standard ML [Milner 84] Even in their weaker forms, they are considered an essential structuring tool in many areas of system programming, such as operating systems. Abstract types come from the desire to hide irrelevant program information and to protect internal program invariants from unwanted external ....
R.Milner: A proposal for Standard ML, Proc. Symposium on Lisp and Functional Programming, Austin, Texas, August 6-8 1984, pp. 184-197. ACM, New York.
Amber - Cardelli (1986) (Correct)
....dynamic requirements of a system programming language. For this purpose, multiple inheritance and persistent objects are integrated in a strongly typed language. Other features include graphics, higher order functions, modules and concurrency. Amber is a spin off of the ML programming language [Milner 84] The ML language is now being standardized, and as such is not very suitable for experimentation. Amber is intended as a tool for trying out new ideas in language implementation, language design, and language environments, while being deeply influenced by the ML experience. As a programming ....
R.Milner: A proposal for Standard ML, Proc. Symposium on Lisp and Functional Programming, Austin, Texas, August 6-8 1984, pp. 184-197. ACM, New York.
On Understanding Types, Data Abstraction, and Polymorphism - Cardelli, Wegner (1985) (90 citations) (Correct)
....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 ML, it is possible to write a polymorphic identity function which works for every type of argument, and a length function which maps a list of arbitrary element type into its integer length. It is also possible to write a generic sorting ....
....related to the notion of inheritance, and we can say that the expressive power of objectoriented type systems is due in large measure to the polymorphism they facilitate. In order to complete our discussion of the evolution of types in programming languages we examine the type mechanisms of ML [Milner 84] ML is an interactive functional programming language in which type specifications omitted by the user may be reintroduced by type inference.If the user enters 3 4 the system responds 7:int , computing the value of the expression and inferring that the operands and the value are of type int. ....
[Article contains additional citation context not shown here]
R.Milner: A proposal for Standard ML, Proc. Symposium on Lisp and Functional Programming, Austin, Texas, August 6-8 1984, pp. 184-197. ACM, New York.
Typeful Programming - Luca Cardelli Digital (1989) (77 citations) (Correct)
No context found.
R.Milner: A proposal for Standard ML, Proc. Symposium on Lisp and Functional Programming, Austin, Texas, August 6-8 1984, pp. 184-197. ACM, New York.
The Quest Language and System - Cardelli (1994) (3 citations) (Correct)
No context found.
R.Milner: A proposal for Standard ML, Proc. Symposium on Lisp and Functional Programming, Austin, Texas, August 6-8 1984, pp. 184-197. ACM, New York.
Phase Distinctions in Type Theory - Cardelli (1988) (21 citations) (Correct)
No context found.
R.Milner: A proposal for Standard ML, Proc. Symposium on Lisp and Functional Programming, Austin, Texas, August 6-8 1984, pp. 184-197. ACM, New York.
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