(Enter summary)
Abstract: with constraints. The basic idea is to factor out the common core of previous extensions
of the Hindley/Milner system. I present a Hindley/Milner system where the
constraint part is a parameter. Speci
c applications can be obtained by providing
speci
c constraint systems which capture the application in mind. For instance,
the Hindley/Milner system can be recovered by instantiating the constraint part
to the standard Herbrand constraint system. Type system instances of the general
framework... (Update)
Context of citations to this paper: More
.... and Felleisen [7] A soundness result based on a denotational semantics was originally presented by Odersky et al. 1] Sulzmann [5] conjectured that type safety for HM(X) can be established in a syntactic way, but did not provide a proof. Recently, Pottier [2] used HM(X)...
...with growing degrees of complexity. A recent trend is to simplify these type systems by moving to a constraint based framework [13, 11, 18, 15]. This indeed greatly improved the understanding of the various systems, as they can all be described as particular instances of...
Cited by: More
Index types for JVM method invocation - Songtao Xia Sxia
(Correct)
Simple Type Inference for Structural Polymorphism - Jacques Garrigue Research (2002)
(Correct)
A Theory of Overloading - Stuckey, Sulzmann (2002)
(Correct)
Active bibliography (related documents): More All
1.0: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998)
(Correct)
0.9: Polymorphism in Hindley/Milner Style Type Systems with Constraints - Sulzmann (1998)
(Correct)
0.8: Designing Record Systems - Sulzmann (1997)
(Correct)
Similar documents based on text: More All
0.2: Type Inference with Constrained Types - Sulzmann, Odersky, Wehr (1997)
(Correct)
0.2: On the Unification of Substitutions in Type Inference - McAdam (1998)
(Correct)
0.2: Compositional Explanation of Types and Algorithmic Debugging of.. - Chitil (2001)
(Correct)
Related documents from co-citation: More All
4: Type inference with constrained types
- Odersky, Sulzmann et al. - 1999
4: A syntactic approach to type soundness
- Wright, Felleisen - 1991
3: A polymorphic record calculus and its compilation
- Ohori - 1995
BibTeX entry: (Update)
Martin Sulzmann. A General Framework for Hindley/Milner Type Systems with Constraints. PhD thesis, Yale University, Department of Computer Science, May 2000. http://citeseer.ist.psu.edu/sulzmann00general.html More
@misc{ sulzmann00general,
author = "Martin Sulzmann",
title = "A General Framework for Hindley/Milner Type Systems with Constraints",
text = "Martin Sulzmann. A General Framework for Hindley/Milner Type Systems with
Constraints. PhD thesis, Yale University, Department of Computer Science,
May 2000.",
year = "2000",
url = "citeseer.ist.psu.edu/sulzmann00general.html" }
Citations (may not include all citations):
809
A theory of type polymorphism in programming (context) - Milner - 1978
634
A machine-oriented logic based on the resolution principle (context) - Robinson - 1965
369
A semantics of multiple inheritance
- Cardelli - 1984
343
Principal type-schemes for functional programs (context) - Damas, Milner - 1982
306
A syntactic approach to type soundness
- Wright, Felleisen - 1991
238
Pizza into Java: Translating theory into practice
- Odersky, Wadler - 1997
214
An ideal model for recursive polymorphic types (context) - MacQueen, Plotkin et al. - 1986
187
Type inclusion constraints and type inference
- Aiken, Wimmers - 1993
185
De nition of Standard ML (context) - Milner, Tofte et al. - 1997
117
ACME: An Architecture Description Interchange Language
- Garlan, Monroe et al. - 1997
102
Type inference for record concatenation and multiple inherit..
- Wand
102
Type inference for record concatenation and multiple inherit..
- Wand - 1989
80
Constraint logic programming: A survey
- Ja, Michael - 1994
76
Type inference for recursively constrained types and its app..
- Eifrig, Smith et al. - 1995
72
Sound polymorphic type inference for objects
- Eifrig, Smith et al. - 1995
71
Operations on records
- Cardelli, Mitchell - 1989
68
Subtyping Constrained Types
- Trifonov, Smith - 1996
58
Type inference in the presence of overloading (context) - Kaes - 1992
57
A record calculus based on symmetric concatenation
- Harper, Pierce - 1991
57
Type inference for records in a natural extension of ML (context) - emy - 1993
55
A simple algorithm and proof for type inference (context) - Wand - 1987
54
A polymorphic record calculus and its compilation
- Ohori - 1995
51
Fundamental concepts in programming languages (context) - Strachey - 1967
47
The Java Language Speci cation (context) - Gosling, Joy et al. - 1996
45
Putting type annotations to work
- Odersky, aufer - 1996
38
Uni cation theory
- Baader, Siekmann - 1994
34
Type classes in Haskell
- Hall, Hammond et al. - 1996
30
A second look at overloading
- Odersky, Wadler et al. - 1995
30
Extending ML type system with a sorted equational theory (context) - emy - 1992
28
Report on the programming language Haskell: a non-strict (context) - Peterson, Hammond - 1997
27
Type Assignment in Programming Languages (context) - Damas - 1985
23
Typing record concatenation for free
- Remy - 1992
22
Corrigendum: Complete type inference for simple objects (context) - Wand - 1988
21
Minimizing row displacement dispatch tables (context) - Driesen, Hoelzle - 1995
19
North-Holland Publishing Company (context) - Henkin, Monk et al. - 1971
18
Uni cation revisited (context) - Lassez, Maher et al. - 1987
17
Typing Haskell in Haskell
- Jones - 1999
17
Selector table indexing and sparse arrays (context) - Driesen - 1993
17
Type reconstruction for type classes
- Nipkow, Prehofer - 1995
17
A framework for type inference with subtyping
- Pottier - 1998
16
Dimension types
- Kennedy - 1994
14
Extensible records without subsumption (context) - Harper, Pierce - 1990
13
Quali ed Types: Theory and Practice (context) - Jones - 1992
11
Static Typing for Dynamic Messages
- Nishimura - 1998
11
ACM Doctoral Dissertation Award Series (context) - Saraswat, Programming et al. - 1993
10
Indizierte Typen (context) - Zenger - 1999
9
A case study of typechecking with constrained types: Typing .. (context) - emy - 1995
8
Polymorphic type inference for languages with overloading an.. (context) - rey, Smith - 1991
7
A theory of type quali ers (context) - rey, Foster et al. - 1999
4
Uni cation and ML type reconstruction (context) - Kanellakis, Mairson et al. - 1991
4
An axiomatic de nition of the programming language Pascal (context) - Hoare, Wirth - 1973
4
Polymorphic binding-time analysis in polynomial time (context) - Dussart, Henglein et al. - 1995
3
Analysis of Architectures using Constraint{Based Types
- Peterson, Sulzmann - 1999
2
Eliminating Array Bound Cecking Trough Dependent Types (context) - Xi, Pfenning - 1998
2
Technical Report LIXRR (context) - Kennedy, inference et al. - 1996
2
Abelian group uni cation algorithms for elementary terms (context) - Lankford, Butler et al. - 1984
2
Uberladung in Typsystemen (context) - Wehr - 1997
2
Re ned subtyping and row variables for record types (context) - emy - 1995
1
Type inference with constrained types (context) - Sulzmann, Odersky et al. - 1997
1
Feature constraints with rst-class features (context) - Treinen - 1993
1
Type system for specializing polymorphism (context) - Ohori - 1997
1
and quali ed types (context) - Gaster, variants - 1998
1
Type inference with constrained types (context) - Odersky, Sulzmann et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cristal.inria.fr/~fpottier/biblio/english.html): More
Satisfying Subtype Inequalities in Polynomial Space - Frey (1997)
(Correct)
The SLam Calculus: Programming with Secrecy and Integrity - Heintze, Riecke (1998)
(Correct)
Subtyping-Constraint-Based Type Inference With Conditional.. - Pottier (1999)
(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