Standard ML-NJ weak polymorphism and imperative constructs (1996)

Cached

Download Links

by John Mitchell , Ramesh Viswanathan
Venue:IN PROCEEDINGS, EIGHTH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE
Citations:11 - 0 self

Documents Related by Co-Citation

104 Type inference for polymorphic references – M Tofte - 1990
490 A Syntactic Approach to Type Soundness – Andrew K. Wright, Matthias Felleisen - 1992
47 Polymorphic Type Inference and Assignment – Xavier Leroy, Pierre Weis, Inria Rocquencourt - 1991
1497 The Definition of Standard ML – Robin Milner, Mads Tofte, Robert Harper - 1990
135 The Type and Effect Discipline – Jean-Pierre Talpin, Pierre Jouvelot - 1992
9 Standard ML Weak Polymorphism Can Be Sound – John Greiner - 1993
29 Polymorphism by name for references and continuations – Xavier Leroy - 1993
26 Typing References by Effect Inference – Andrew Wright - 1992
92 Type Assignment in Programming Languages – L Damas - 1984
89 Simple Imperative Polymorphism – Andrew Wright - 1995
323 Principal type-schemes for functional programs – Luis Damas, Robin Milner - 1982
22 Typage polymorphe d'un langage algorithmique. Doctoral dissertation (in – X Leroy - 1992
65 Explicit Polymorphism and CPS Conversion – Robert Harper , Mark Lillibridge - 1992
874 A theory of type polymorphism in programming – Robin Milner - 1978
130 The principal type-scheme of an object in combinatory logic – J R Hindley - 1969
221 Principal type schemes for functional programs – L Damas, H Milner - 1982
122 Higher-order Concurrency – John Hamilton Reppy - 1992
88 Typing First-Class Continuations in ML – Robert Harper, Bruce F. Duba, David Macqueen - 1992
28 Polymorphism for Imperative Languages without Imperative Types – Andrew Wright - 1993