(Enter summary)
Abstract: The simple and elegant Hindley/Milner polymorphic type discipline is the basis of the type
system of Standard ML, but ML's imperative features are a blight on this otherwise clean
landscape. Polymorphism and imperative features cannot freely coexist without compromising
type safety, hence Standard ML assigns imperative types of limited polymorphism to procedures
that use references, exceptions, or continuations. Several other solutions exist, but all introduce
new kinds of types that complicate ... (Update)
Cited by: More
Compiling Polymorphism Using Intensional Type - Analysis Robert Harper
(Correct)
Compiling with Non-Parametric Polymorphism - Preliminary Report Robert
(Correct)
Using Modules as Classes - Erome Vouillon November (1998)
(Correct)
Active bibliography (related documents): More All
0.4: Simple Imperative Polymorphism - Wright (1995)
(Correct)
0.4: Practical Soft Typing - Wright (1994)
(Correct)
0.3: A Syntactic Approach to Type Soundness - Wright, Felleisen (1992)
(Correct)
Similar documents based on text: More All
0.4: Relaxing the Value Restriction - Jacques Garrigue Research (2003)
(Correct)
0.3: Proc. 20th Symp. Principles of Programming Languages.. - Polymorphism By Name
(Correct)
0.0: A Cellular Automaton Hardware Design For Generating Traffic.. - Yao, Blight
(Correct)
Related documents from co-citation: More All
19: Compiling with Continuations (context) - Appel - 1992
17: The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
16: Unboxed objects and polymorphic typing
- Leroy - 1992
BibTeX entry: (Update)
Wright, A. K. Polymorphism for imperative languages without imperative types. Tech. Rep. 93-200, Rice University, February 1993. http://citeseer.ist.psu.edu/wright93polymorphism.html More
@techreport{ wright96polymorphism,
author = "Andrew Wright",
title = "Polymorphism for Imperative Languages without Imperative Types",
number = "TR93-200",
month = "21,",
pages = "10",
year = "1996",
url = "citeseer.ist.psu.edu/wright93polymorphism.html" }
Citations (may not include all citations):
1074
The Definition of Standard ML (context) - Milner, Tofte et al. - 1990 ACM
809
A theory of type polymorphism in programming (context) - Milner - 1978 DBLP
306
A syntactic approach to type soundness
- Wright, Felleisen - 1991 ACM DBLP
163
Commentary on Standard ML (context) - Milner, Tofte - 1991 ACM
138
Type inference for polymorphic references (context) - Tofte - 1990 ACM DBLP
87
call-by-value and the lambda-calculus (context) - Plotkin - 1975
67
Higher-order Concurrency
- Reppy - 1991 ACM
54
Type Assignment in Programming Languages (context) - Damas - 1985
41
The type and effect discipline
- Talpin, Jouvelot - 1992 ACM DBLP
41
Polymorphic type inference and assignment
- Leroy, Weis - 1991 ACM DBLP
29
Polymorphism by name for references and continuations (context) - Leroy - 1993 ACM DBLP
20
Typing references by effect inference
- Wright - 1992
15
Typage polymorphe d'un langage algorithmique (context) - Leroy - 1992
12
Standard ML weak polymorphism and imperative constructs (context) - Hoang, Mitchell et al. - 1993
5
Standard ML of New Jersey release notes (context) - of, release et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rice.edu/CS/PLT/Publications/): More
Synthesizing Object-Oriented and Functional Design.. - Krishnamurthi.. (1998)
(Correct)
Reasoning about Explicit and Implicit Representations of State - Sabry, Field (1993)
(Correct)
A Practical Soft Type System for Scheme - Wright, Cartwright (1994)
(Correct)
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