(Enter summary)
Abstract: We show how the Hindley/Milner polymorphic type system can be
extended to incorporate overloading and subtyping. Our approach is to
attach constraints to quantified types in order to restrict the allowed instantiations
of type variables. We present an algorithm for inferring principal
types and prove its soundness and completeness. We find that it
is necessary in practice to simplify the inferred types, and we describe
techniques for type simplification that involve shape unification,... (Update)
Context of citations to this paper: More
.... is therefore no surprise that lots of work has been put into techniques for how to simplify constraints [FM89,Cur90,Kae92,Smi94,EST95,Pot96,TS96,FA96,AWP97,Reh97,FF97]. Another approach is to make the constraint language more powerful so that constraints can be generated by a...
...checker and without enforcing explicit type annotations. e.g. subtyping as a step towards powerful type languages as found in e.g. 1] [8] or partial types as presented in [9, 10] can be processed by our type checker. Our type checker is described as an abstract interpretation...
Cited by: More
Facilitating Reuse in Hardware Models - Type
(Correct)
Microarchitecture Modeling for Design-Space Exploration.. - Vachharajani (2004)
(Correct)
The Liberty Structural Specification Language: A.. - Vachharajani.. (2004)
(Correct)
Active bibliography (related documents): More All
0.3: Syntactic Properties of Polymorphic Subtyping - Henglein (1996)
(Correct)
0.2: Satisfiability of Inequalities in a Poset - Pratt, Tiuryn
(Correct)
0.2: The Complexity of Subtype Entailment for Simple Types - Henglein, Rehof (1997)
(Correct)
Similar documents based on text: More All
0.4: Putting Type Annotations to Work - Odersky, Läufer (1996)
(Correct)
0.4: Type Inference with Constrained Types - Sulzmann, Odersky, Wehr (1997)
(Correct)
0.4: Polymorphism in Hindley/Milner Style Type Systems with Constraints - Sulzmann (1998)
(Correct)
Related documents from co-citation: More All
14: Type inference in the presence of overloading (context) - Kaes - 1992
13: Type inclusion constraints and type inference
- Aiken, Wimmers - 1993
12: Subtyping constrained types
- Trifonov, Smith - 1996
BibTeX entry: (Update)
G. S. Smith. Principal type schemes for functional programs with overloading and subtyping. Science of Computer Programming, 23:197--226, 1994. http://citeseer.ist.psu.edu/smith94principal.html More
@article{ smith94principal,
author = "Geoffrey Smith",
title = "Principal Type Schemes for Functional Programs with Overloading and Subtyping",
journal = "Science of Computer Programming",
volume = "23",
number = "2-3",
pages = "197-226",
year = "1994",
url = "citeseer.ist.psu.edu/smith94principal.html" }
Citations (may not include all citations):
809
A theory of type polymorphism in programming (context) - Milner - 1978 DBLP
343
Principal type-schemes for functional programs (context) - Damas, Milner - 1982 DBLP
224
Semantics of Programming Languages: Structures and Technique.. (context) - Gunter - 1992
190
How to make ad-hoc polymorphism less ad hoc
- Wadler, Blott - 1989 ACM
160
The principal type-scheme of an object in combinatory logic (context) - Hindley - 1969
82
Coercion and type inference (context) - Mitchell - 1984 ACM DBLP
63
Transformational systems and the algebraic structure of atom.. (context) - Reynolds - 1970
63
Three approaches to type structure (context) - Reynolds - 1985 ACM DBLP
62
The transitive reduction of a directed graph (context) - Aho, Garey et al. - 1972 DBLP
43
Subtype inequalities (context) - Tiuryn - 1992 DBLP
34
Polymorphic subtype inference: Closing the theory-practice g.. (context) - Fuh, Mishra - 1989 DBLP
30
Theoretical Computer Science (context) - Fuh, Mishra et al. - 1990 ACM
28
Parametric overloading in polymorphic programming languages (context) - Kaes - 1988 ACM DBLP
24
Type inference with subtypes (context) - Stansifer - 1988
23
Constrained Quantification in Polymorphic Type Analysis (context) - Curtis - 1990
20
Type reconstruction with recursive types and atomic subtypin.. (context) - Tiuryn, Wand - 1993 ACM DBLP
15
Algorithmic aspects of type inference with subtypes
- Lincoln, Mitchell - 1992 ACM DBLP
15
the complexity of ML typability with overloading (context) - Volpano, Smith - 1991
14
Polymorphic Type Inference for Languages with Overloading an.. (context) - Smith - 1991 ACM
8
the complexity of type inference with coercion (context) - Wand, O'Keefe - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.fiu.edu/~smithg/papers/): More
Verifying Secrets and Relative Secrecy - Volpano, Smith (2000)
(Correct)
Language Issues in Mobile Program Security - Volpano, Smith (1998)
(Correct)
Probabilistic Noninterference in a Concurrent Language - Volpano, Smith (1998)
(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