Assaf J. Kfoury, Santiago M. Pericas-Geertsen  Home/Search
Context Related
| bu.edu/techreports...ecursivetypes.pdf 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: bu.edu/techreports/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider type systems that combine universal types, recursive types, and object types. We study type inference in these systems under a rank restriction, following Leivant's notion of rank. To motivate our work, we present several examples showing how our systems can be used to type programs encountered in practice. We show that type inference in the rank- system is decidable for and undecidable for . (Similar results based on different techniques are known to hold for System ... (Update)
Cited by: More
StaXML: Static Typing of XML Document Fragments for.. - Bradley, Kfoury.. (2004) (Correct)
Principal Typings and True Rank 2 Intersection Typable Recursive.. - Damiani (2003) (Correct)
Similar documents (at the sentence level):
52.4%: Type Inference for Recursive Definitions - Kfoury, Pericás-Geertsen (2000) (Correct)
13.2%: Type Inference with Recursive Types at Different Ranks - Pericas-Geertsen (1994) (Correct)
Active bibliography (related documents): More All
0.7: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998) (Correct)
0.3: Depth Subtyping and Type Inference for Object Calculi - Bugliesi, Pericas-Geertsen (2000) (Correct)
0.2: Type Inference for Variant Object Types - Michele Bugliesi Dipartimento (2000) (Correct)
Similar documents based on text: More All
0.5: What are Polymorphically-Typed Ambients? - Amtoft, Kfoury, Pericas-Geertsen (2001) (Correct)
0.4: Relating Typability and Expressiveness in Finite-Rank .. - Kfoury, Mairson.. (1999) (Correct)
0.3: Programming Examples Needing Polymorphic Recursion - Hallett, Kfoury (2004) (Correct)
Related documents from co-citation: More All
2: Modeling HTML in Haskell - Thiemann
2: Towards valid XML applications - Kempa, Linnemann - 2002
2: A Type-Disciplined Approach to Developing Resources and Applications for the Wor.. (context) - Bradley - 2004
BibTeX entry: (Update)
Assaf J. Kfoury and Santiago M. Pericas-Geertsen. Type inference for recursive definitions. In Proc. 14th Ann. IEEE Symp. Logic in Comput. Sci., pages 119--128, July 1999. http://citeseer.ist.psu.edu/kfoury00type.html More
@techreport{ kfoury00type,
author = "Assaf Kfoury and Santiago M. Pericas-Geertsen",
title = "Type Inference For Recursive Definitions",
number = "2000-007",
month = "6,",
year = "2000",
url = "citeseer.ist.psu.edu/kfoury00type.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
862 The Java Language Specification - Gosling, Joy et al. - 1996
809 A theory of type polymorphism in programming (context) - Milner - 1978
191 Polymorphic type inference (context) - Leivant - 1983
174 Springer-Verlag (context) - Abadi, Cardelli et al. - 1996
160 The principal type-scheme of an object in combinatory logic (context) - Hindley - 1969
146 The Glasgow Haskell compiler: A technical overview - Jones, Hall et al. - 1993
129 ACM Transactions on Programming Languages and Systems (context) - Amadio, Cardelli et al. - 1993
126 Type inference with polymorphic recursion - Henglein - 1993
118 What are principal typings and what are they good - Jim - 1996
82 Journal of Computer and System Sciences (context) - Paterson, Wegman - 1978
79 Polymorphic type schemes and recursive definitions (context) - Mycroft - 1984
76 Type inference for recursively constrained types and its app.. - Eifrig, Smith et al. - 1995
67 A direct algorithm for type inference in the rank-2 fragment.. - Kfoury, Wells - 1994
59 An analysis of ML typability (context) - Kfoury, Tiuryn et al. - 1994
55 The undecidability of the semi-unification problem (context) - Kfoury, Tiuryn et al. - 1993
54 Type reconstruction in the presence of polymorphic recursion (context) - Kfoury, Tiuryn et al. - 1993
51 the sequential nature of unification (context) - Dwork, Kanellakis et al. - 1984
36 Efficient inference of object types - Palsberg - 1995
31 Recursive unsolvability of a problem of thue (context) - Post - 1947
31 On subsumption and semiunification in feature algebras (context) - Dorre, Rounds - 1992
30 Basic Simple Type Theory (context) - Hindley - 1997
27 Type reconstruction in finite rank fragments of the second-o.. (context) - Kfoury, Tiuryn - 1992
18 Inferring recursive data types - McAllester - 1996
17 Rank-2 type systems and recursive definitions - Jim - 1995
13 Type inference with simple selftypes is np-complete - Palsberg, Jim - 1997
10 Objective ml: An effective object-oriented extension to ml - Remy, Vouillon
9 Type inference with rank 1 polymorphism for type-directed co.. - Ohori, Yoshida - 1998
7 The word problem for certain classes of semigroups (context) - Gurevich - 1966
4 Essays in Honour of Alan Robinson (context) - Kanellakis, Mairson et al. - 1991
Documents on the same site (http://www.cs.bu.edu/techreports/): More
Connection Scheduling in Web Servers - Crovella, Frangioso, Harchol-Balter (1999) (Correct)
Measuring Web Performance in the Wide Area - Barford, Crovella (1999) (Correct)
A Fully Distributed Location Management Scheme for Large PCS - Ratnam, Matta, Rangarajan (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