Trevor Jim, Jens Palsberg  Home/Search
Context Related
| purdue.edu/homes/p...mpalsberg99.ps.gz purdue.edu/homes/tzhao/./isomo...jim.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: purdue.edu/homes/p...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present general methods for performing type inference and deciding subtyping in languages with recursive types. Our type inference algorithm generalizes a common idea of previous work: type inference is reduced to a constraint satisfaction problem, whose satisfiability can be decided by a process of closure and consistency checking. We prove a general correctness theorem for this style of type inference. We define subtyping co-inductively, and we prove by co-induction that a closed and... (Update)
Context of citations to this paper: More
...the most closely related papers in greater detail. Analysis. Two basic approaches to type inference are constraint resolution [2, 9, 15, 26] and abstract interpretation [24] Constraint resolution builds a set of constraints (such as equalities or inequalities) from the...
...for developing techniques that increase the reliability of programs. Subtyping was introduced through the subsumption rule in [29] [4, 24, 21] treat subtyping in the presence of recursive types. 49] shows that terms typable in a system with structural subtyping denote...
Cited by: More
Structural Subtyping of Non-Recursive Types is Decidable - Kuncak, Rinard (2003) (Correct)
An Implicitly-Typed Deadlock-Free Process Calculus - Naoki Kobayashi Shin (Correct)
Efficient Type Matching - Jha, Palsberg, Zhao (2002) (Correct)
Active bibliography (related documents): More All
1.4: Type Inference in Systems of Recursive Types With Subtyping - Jim, Palsberg (1997) (Correct)
0.4: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998) (Correct)
0.4: Automatic Discovery of Covariant Read-Only Fields - Palsberg, Zhao, Jim (2002) (Correct)
Similar documents based on text: More All
0.2: Teaching Reviewing to Graduate Students - Palsberg, Baxter (2002) (Correct)
0.2: Compiling with Code-Size Constraints - Palsberg (2002) (Correct)
0.2: Efficient Spill Code for SDRAM - Nandivada, Palsberg (2003) (Correct)
Related documents from co-citation: More All
6: Simplifying subtyping constraints: a theory - Pottier - 1998
5: Coinductive axiomatization of recursive type equality and subtyping - Brandt, Henglein - 1997
5: Mathematical Structures in Computer Science (context) - Kozen, Palsberg et al. - 1995
BibTeX entry: (Update)
Trevor Jim and Palsberg, J., Type Inference in Systems of Recursive Types with Subtyping, July 1997. Avairable from: http://www.cis.upenn.edu/~tjim/papers.html. http://citeseer.ist.psu.edu/article/jim99type.html More
@unpublished{ jim99type,
author = "Trevor Jim and Jens Palsberg",
title = "Type inference in systems of recursive types with subtyping",
year = "1999",
url = "citeseer.ist.psu.edu/article/jim99type.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989
502 Concurrency and automata on infinite sequences (context) - Park - 1981
380 The Java Language Specification (context) - Gosling, Joy et al. - 1996
322 volume 92 of Lecture Notes in Computer Science (context) - Milner, of et al. - 1980
257 Smalltalk-80---The Language and its Implementation (context) - Goldberg, Robson - 1983
214 An ideal model for recursive polymorphic types (context) - MacQueen, Plotkin et al. - 1986
187 Type inclusion constraints and type inference - Aiken, Wimmers - 1993
176 Ellis and Bjarne Stroustrup (context) - Margaret - 1990
146 Typing and subtyping for mobile processes - Pierce, Sangiorgi - 1993
129 ACM Transactions on Programming Languages and Systems (context) - Amadio, Cardelli et al. - 1993
89 Springer-Verlag (context) - Abadi, Cardelli et al. - 1996
88 A type system equivalent to flow analysis - Palsberg, O'Keefe - 1995
85 Type inference with simple subtypes (context) - Mitchell - 1991
82 Coercion and type inference (context) - Mitchell - 1984
76 Type inference for recursively constrained types and it appl.. - Eifrig, Smith et al. - 1995
68 Subtyping constrained types - Trifonov, Smith - 1996
67 ACM Transactions on Programming Languages and Systems (context) - Palsberg, Smith et al. - 1996
50 Information and Computation (context) - Cardelli, Martini et al. - 1994
47 Two extensions of Curry's type inference system (context) - Cardone, Coppo - 1990
43 Subtype inequalities (context) - Tiuryn - 1992
41 Type inference with recursive types: Syntax and semantics (context) - Cardone, Coppo - 1991
39 Type inference with partial types (context) - Thatte - 1988
39 Type inference with partial types (context) - Thatte - 1994
38 Coinductive axiomatization of recursive type equality and su.. - Brandt, Henglein - 1997
36 Principal type schemes for functional programs with overload.. - Smith - 1994
31 Sound polymorphic type inference for objects (context) - Eifrig, Smith et al. - 1995
30 Lower bounds on type inference with subtypes (context) - Hoang, Mitchell - 1995
30 Efficient inference of partial types - Kozen, Palsberg et al. - 1994
28 Quasi-static typing (context) - Thatte - 1990
23 ese de Doctorat d (context) - Huet, equations et al. - 1976
22 Type inference for partial types is decidable (context) - O'Keefe, Wand - 1992
20 Type reconstruction with recursive types and atomic subtypin.. (context) - Tiuryn, Wand - 1993
18 Mathematical Structures in Computer Science (context) - Kozen, Palsberg et al. - 1995
18 Type inference with nonstructural subtyping - Palsberg, Wand et al. - 1997
13 Efficient type reconstruction in the presence of inheritance (context) - Benke - 1994
4 Typing in the presence of overloading (context) - Kaes - 1992
3 Satisfying systems of subtype inequalities in polynomial spa.. (context) - Frey - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.purdue.edu/homes/palsberg/publications.html): More
Safety Analysis versus Type Inference for Partial Types - Palsberg, Schwartzbach (1992) (Correct)
Comparing Flow-based Binding-time Analyses - Palsberg (1995) (Correct)
Normal Forms have Partial Types - Palsberg (1993) (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