Émilie Sayag, Michel Mauny  Home/Search
Context Related
| cristal.inria.fr/~sayag/rr96.ps inria.fr/INRIA/publicat...RR2998.ps.gz inria.fr/INRIA/Projects...RR2998.ps.gz 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: cristal.inria.fr/~s...publication (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: : We introduce an intersection type system which is a restriction of the intersection type discipline. This restriction leads to a principal type property for normal forms in the classical sense, while retaining the expressivity of the classical discipline. We characterize the structure of principal types of normal forms and give an algorithm that reconstructs normal forms from types. Having shown the equivalence between principal types and normal forms, we define an expansion operation on... (Update)
Cited by: More
Expansion: the Crucial Mechanism for Type Inference with.. - Carlier, Wells (2004) (Correct)
Type Inference with Expansion Variables and Intersection.. - Carlier, Wells (Correct)
Expansion: the Crucial Mechanism for Type Inference with.. - Carlier, Wells (2005) (Correct)
Active bibliography (related documents): More All
0.7: Programming with Intersection Types and Bounded Polymorphism - Pierce (1991) (Correct)
0.5: Intersection Type Assignment Systems - van Bakel (1995) (Correct)
0.5: Complete Restrictions of the Intersection Type Discipline - van Bakel (1992) (Correct)
Similar documents based on text: More All
0.4: Principal Typings for All Normalizable Terms in the System.. - Schwartz, Kfoury (2003) (Correct)
0.3: A Few Remarks on SKInT - Goubault-Larrecq (1998) (Correct)
0.2: An Implementation Of Caml-Light With Existential Types - Mauny, Pottier (1993) (Correct)
Related documents from co-citation: More All
16: Principality and type inference for intersection types using expansion variables - Kfoury, Wells - 2003
14: Type error slicing in implicitly typed (context) - Haack, Wells - 2003
12: Inference of polymorphic and conditional strictness properties - Jensen - 1998
BibTeX entry: (Update)
' E. Sayag and M. Mauny. A new presentation of the intersection type discipline through principal typings of normal forms. Technical Report RR-2998, INRIA, Oct. 16, 1996. http://citeseer.ist.psu.edu/sayag96new.html More
@techreport{ sayagnew,
author = "Emilie Sayag and Michel Mauny",
title = "A New Presentation of the Intersection Type Discipline through Principal Typings of Normal Forms",
number = "RR-2998",
pages = "38 p.",
url = "citeseer.ist.psu.edu/sayag96new.html" }
Citations (may not include all citations):809 A theory of type polymorphism in programming (context) - Milner - 1978
343 Principal type schemes for functional programs (context) - Milner, Damas - 1982
137 A filter lambda model and the completeness of type assignmen.. (context) - Barendregt, Coppo et al. - 1983
132 Syntactic control of interference (context) - Reynolds - 1989
118 What are principal typings and what are they good - Trevor - 1995
70 Preliminary design of the programming language Forsythe (context) - Reynolds - 1988
68 An extension of the basic functionality theory for the -calc.. (context) - Coppo, Dezani-Ciancaglini - 1980
67 Programming with Intersection Types and Bounded Quantificati.. - Pierce - 1991
64 A type assignment for the strongly normalizable -terms (context) - Pottinger - 1980
63 Principal type schemes and -calculus semantics (context) - Coppo, Dezani-Ciancaglini et al. - 1980
54 Principal type schemes for an extended type theory (context) - Della, Betti - 1984
47 Two extensions of Curry's type inference system (context) - Cardone, Coppo - 1990
41 Complete restrictions of the intersection type discipline - van Bakel - 1992
38 Principal type scheme and unification for intersection type .. (context) - Della - 1988
36 Typing and computational properties of lambda-expressions (context) - Leivant - 1986
32 Strictness analysis: a new perspective based on type inferen.. (context) - Kuo, Mishra - 1989
28 Deriving algorithms from type inference systems: Application.. - Hankin, Le Metayer - 1994
17 Rank 2 type systems and recursive definitions - Trevor - 1995
17 Discovering needed reductions using type theory - Gardner - 1994
15 Typage polymorphe d'un langage algorithmique (context) - Leroy - 1992
14 Une extension de la th'eorie des types en -calcul (context) - Sall'e - 1978
11 normal forms and D1 -lambda models (context) - Coppo, Dezani-Ciancaglini et al. - 1987
11 Zeitschrift fur Mathematische Logik und Grundlagen der Mathe.. (context) - Coppo, Dezani-Ciancaglini et al. - 1981
10 Partial intersection type assignment in applicative term rew.. - van Bakel - 1993
7 Theoretical Computer Science (context) - Dezani-Ciancaglini, Margaria et al. - 1986
6 Essential intersection type assignment - van Bakel - 1993
6 A decision procedure for the subtype relation on intersectio.. - Pierce - 1989
5 Functional characterization of some semantic equalities insi.. (context) - Coppo, Dezani-Ciancaglini et al. - 1979
5 Technical Report CS-TR (context) - Shao, Appel - 1992
4 Etudes et Recherches en Informatique (context) - Krivine, types - 1990
4 Models for theories of functions strictly depending on all t.. (context) - Honsell, Della - 1984
3 Principal typing in a 8-discipline (context) - Margaria, Zacchi - 1995
1 Applicative information system and D1-models (context) - Coppo, Dezani-Ciancaglini et al. - 1988
1 Characterization of principal types of normal forms in inter.. (context) - Sayag, Mauny - 1996
The graph only includes citing articles where the year of publication is known.
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