(Enter summary)
Abstract: The weak polymorphic type system of Standard ML of New Jersey (SML/NJ) (MacQueen,
1992) has only been presented as part of the implementation of the SML/NJ compiler,
not as a formal type system. As a result, it is not well understood. And while numerous
versions of the implementation have been shown unsound, the concept has not been proved
sound or unsound.
We present an explanation of weak polymorphism and show that a formalization of
this is sound. We also relate this to the SML/NJ... (Update)
Cited by: More
A Type System for Well-Founded Recursion - Dreyer, Harper, Crary (2003)
(Correct)
Similar documents (at the sentence level):
10.7%: Standard ML Weak Polymorphism Can Be Sound - Greiner (1993)
(Correct)
Active bibliography (related documents): More All
0.4: Thesis Proposal: Data Representations and Polymorphic Languages - Morrisett (1993)
(Correct)
0.2: Typing References by Effect Inference - Andrew Wright (1992)
(Correct)
0.2: The Type and Effect Discipline - Talpin, Jouvelot (1993)
(Correct)
Similar documents based on text: More All
0.4: Polymorphic Typing of Variables and References - Smith, Volpano
(Correct)
0.2: The Hello Operating System - Biagioni, Fu
(Correct)
0.2: Standard ML-NJ weak polymorphism and imperative constructs - Hoang, Mitchell, Viswanathan (1993)
(Correct)
BibTeX entry: (Update)
John Greiner. Weak polymorphism can be sound. Journal of Functional Programming, 6(1):111-141, 1996. http://citeseer.ist.psu.edu/greiner96weak.html More
@article{ greiner96weak,
author = "John Greiner",
title = "Weak Polymorphism can be Sound",
journal = "Journal of Functional Programming",
volume = "6",
number = "1",
pages = "111-141",
year = "1996",
url = "citeseer.ist.psu.edu/greiner96weak.html" }
Citations (may not include all citations):
1074
The Definition of Standard ML (context) - Milner, Tofte et al. - 1990 ACM
343
Principal type-schemes for functional programs (context) - Damas, Milner - 1982 DBLP
306
A Syntactic Approach to Type Soundness
- Wright, Felleisen - 1991 ACM DBLP
160
The principal type scheme of an object in combinatory logic (context) - Hindley - 1969
138
Type Inference for Polymorphic References (context) - Tofte - 1990 ACM DBLP
137
Introduction to Combinators and -Calculus (context) - Hindley, Seldin - 1986
87
Operational Semantics and Polymorphic Type Inference (context) - Tofte - 1988
54
Type Assignment in Programming Languages (context) - Damas - 1985
52
A Simplified Account of Polymorphic References
- Harper - 1993 ACM DBLP
29
A theory of type polymorphism in programming languages (context) - Milner - 1978
12
Standard ML weak polymorphism and imperative constructs (context) - Hoang, Mitchell et al. - 1993
4
Polymorphic Type (context) - Talpin, Jouvelot - 1992
4
Type Abstraction Rules for References: A Comparison of Four .. (context) - Jr - 1989 ACM
3
Source code for SML/NJ type inference algorithm (context) - MacQueen - 1992
Documents on the same site (http://www.cs.rice.edu/~greiner/my_research.html):
Operational Semantics Models of Complexity (thesis proposal) - Greiner (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