(Enter summary)
Abstract: We show that standard formulations of intersection type systems
are unsound in the presence of computational effects,
and propose a solution similar to the value restriction for
polymorphism adopted in the revised definition of Standard
ML. It differs in that it is not tied to let-expressions and requires
an additional weakening of the usual subtyping rules.
We also present a bi-directional type-checking algorithm for
the resulting language that does not require an excessive
amount of type... (Update)
Cited by: More
Tridirectional Typechecking - Dunfield, Pfenning (2004)
(Correct)
Combining Two Forms of Type Refinements - Dunfield (2002)
(Correct)
Active bibliography (related documents): More All
0.8: Intersection Types and Computational Effects - Davies, Pfenning (2000)
(Correct)
0.3: Type Refinements - Harper, Pfenning (2001)
(Correct)
0.2: Typability and Type Checking in System F Are Equivalent and.. - Wells (1998)
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
Related documents from co-citation: More All
22: Refinement types for ML
- Freeman, Pfenning - 1991
19: Dependent types in practical programming
- Xi, Pfenning - 1999
11: Soft typing with conditional types
- Aiken, Wimmers et al. - 1994
BibTeX entry: (Update)
@article{ davies00intersection,
author = "Rowan Davies and Frank Pfenning",
title = "Intersection types and computational effects",
journal = "ACM SIG{\-}PLAN Notices",
volume = "35",
number = "9",
pages = "198--208",
year = "2000",
url = "citeseer.ist.psu.edu/766376.html" }
Citations (may not include all citations):
1074
The Definition of Standard ML (context) - Milner, Tofte et al. - 1997 ACM
306
A syntactic approach to type soundness
- Wright, Felleisen - 1994 ACM DBLP
157
Soft typing with conditional types
- Aiken, Wimmers et al. - 1994 ACM DBLP
138
Type inference for polymorphic references (context) - Tofte - 1990 ACM DBLP
116
Mathematical Structures in Computer Science (context) - Pierce, bounded - 1997
90
Type systems
- Cardelli - 1997 ACM DBLP
81
Refinement types for ML
- Freeman, Pfenning - 1991
70
Preliminary design of the programming language Forsythe (context) - Reynolds - 1988
65
A practical soft type system for Scheme
- Wright, Cartwright - 1994 ACM DBLP
61
Local type inference
- Pierce, Turner - 1998 ACM DBLP
58
Simple imperative polymorphism
- Wright - 1995 ACM DBLP
52
A type-theoretic interpretation of Standard ML
- Harper, Stone - 2000 ACM
45
Information and Computation (context) - Mitchell, inference - 1988 DBLP
38
Design of the programming language Forsythe
- Reynolds - 1996 ACM
30
A typed intermediate language for flow-directed compilation
- Wells, Dimock et al. - 1997 ACM DBLP
19
The subtyping problem for second-order types is undecidable (context) - Tiuryn, Urzyczyn - 1996 ACM DBLP
17
Practical refinement-type checking
- Davies - 1997
11
A practical refinement-type checker for Standard ML (context) - Davies - 1997
8
Polymorphism by name (context) - Leroy - 1993
7
The undecidability of Mitchell's subtyping relation
- Wells - 1995
6
Inheritance as implicit coercion (context) - Breazu-Tannen, Coquand et al. - 1991
6
Available as technical report CMU-CS (context) - Freeman, for et al. - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/afs/cs/user/fp/www/papers/): More
Linear Higher-Order Pre-Unification - Cervesato, Pfenning (1997)
(Correct)
System Description: Twelf - A Meta-Logical Framework for.. - Pfenning, Schürmann (1999)
(Correct)
On Equivalence and Canonical Forms in the LF Type Theory.. - Harper, Pfenning
(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