by Flemming Nielson, Hanne Riis Nielson, Torben Amtoft
http://www.daimi.aau.dk/~tamtoft/Papers/LOMAPS16.ps.Z
Add To MetaCart
Abstract:
Abstract. We study an annotated type and e#ect system that integrates let-polymorphism, e#ects, and subtyping into an annotated type and e#ect system for a fragment of Concurrent ML. First we define a type inference algorithm and then construct procedures for constraint normalisation and simplification. Next these algorithms are proved syntactically sound with respect to the annotated type and e#ect system. 1
Citations
|
801
|
A theory of type polymorphism in programming
– Milner
- 1978
|
|
110
|
Type inference for polymorphic references
– Tofte
- 1990
|
|
104
|
Type inference with simple subtypes
– Mitchell
- 1991
|
|
83
|
Type inference with subtypes
– FUH, MISHRA
- 1990
|
|
74
|
Coherence for qualified types
– Jones
- 1993
|
|
64
|
Higher-order concurrent programs with finite communication topology
– Nielson, Nielson
- 1994
|
|
38
|
Polymorphic subtype inference: Closing the theorypractice gap
– Fuh, Mishra
- 1989
|
|
28
|
The type and e#ect discipline
– Talpin, Jouvelot
- 1994
|
|
26
|
Polymorphic type, region and eect inference
– Talpin, Jouvelot
- 1992
|
|
24
|
Algebraic reconstruction of types and eects
– Jouvelot, Giord
- 1991
|
|
4
|
Constraints for polymorphic behaviours for Concurrent ML
– Nielson, Nielson
- 1994
|
|
3
|
Henglein and C. Mossin: Polymorphic Binding-Time Analysis
– unknown authors
- 1994
|
|
3
|
Polymorphic inference with overloading and subtyping
– Smith
- 1993
|
|
2
|
Polymorphic subtyping for e#ect analysis: The dynamic semantics
– Amtoft, Nielson, et al.
- 1997
|
|
2
|
Amtoft: Polymorphic subtypes for e#ect analysis: the static semantics. This volume of SLNCS
– Nielson, Nielson, et al.
- 1997
|
|
2
|
Siekmann: Unification Theory
– H
- 1989
|
|
1
|
Panangaden and J.H. Reppy: The essence of Concurrent ML
– unknown authors
- 1996
|
|
1
|
Region-annotated types and type schemes
– Tofte, Birkedal
- 1996
|
