Luca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov  Home/Search
Context Related
| microsoft.com/Users/luca/...FSub.A4.pdf compaq.com/SRC/personal/lu...FSub.A4.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: luca.demon.co.uk/Bibliography (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: System F is a well-known typed l-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F <: (pronounced ef-sub) that combines parametric polymorphism with subtyping. The main focus of the paper is the equational theory of F <: , which is related to PER models and the notion of parametricity. We study some categorical properties of the theory when restricted to closed terms, including interesting categorical... (Update)
Context of citations to this paper: More
.... [18] Simpler, specialized subtyping systems are presented in [109, 88, 70, 68, 71, 2, 1, 52] Minimal calculi are proposed in [40, 92, 16]. A speciale case of the update problem is tackled in [20] Recursion and inheritance is analyzed in [33, 14, 15, 5] A calculus with...
...of even a valid typing environment. An analogous, albeit somewhat simpler, situation arises in subtyping for the polymorphic l calculus [7]. We clarify technical similarities and differences between the two typing systems. Although some techniques developed for the l...
Cited by: More
Assigning Types to Processes - Yoshida, Hennessy (2000) (Correct)
Equational Axiomatization of Bicoercibility for Polymorphic Types - Tiuryn (1995) (Correct)
Higher-Order Persistent Polymorphic Programming in Tycoon - Matthes (2000) (Correct)
Similar documents (at the sentence level):
5.9%: Extensible Records in a Pure Calculus of Subtyping - Cardelli (1991) (Correct)
Active bibliography (related documents): More All
5.6: An extension of system F with subtyping - Cardelli, Martini, Mitchell.. (1991) (Correct)
0.5: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998) (Correct)
0.4: The Quest Language and System - Cardelli (1994) (Correct)
Similar documents based on text: More All
0.9: Building User Interfaces by Direct Manipulation - Cardelli (1993) (Correct)
0.6: Operations on Records - Cardelli, Mitchell (1991) (Correct)
0.2: Subtyping and Parametricity - Plotkin, Abadi, Cardelli (1993) (Correct)
Related documents from co-citation: More All
9: Bounded quantification is undecidable - Pierce - 1993
7: Subtyping recursive types - Amadio, Cardelli - 1993
7: A calculus for overloaded functions with subtyping - Castagna, Ghelli et al. - 1995
BibTeX entry: (Update)
L. Cardelli, S. Martini, J.C. Mitchell, and A. Scedrov. An extension of system F with subtyping. In T. Ito and A.R. Meyer, editors, Theoretical Aspects of Computer Software, pages 750--771. Springer-Verlag, September 1991. LNCS 526. http://citeseer.ist.psu.edu/cardelli91extension.html More
@incollection{ cardelli91extension,
author = "Luca Cardelli and John C. Mitchell and Simone Martini and Andre Scedrov",
title = "An Extension of System {F} with Subtyping",
booktitle = "Proc.\ of 1st Int.\ Symp.\ on Theor.\ Aspects of Computer Software, {TACS}'91, Sendai, Japan, 24--27 Sept 1991",
volume = "526",
publisher = "Springer-Verlag",
address = "Berlin",
editor = "Takayasu Ito and Albert R. Meyer",
pages = "750--770",
year = "1991",
url = "citeseer.ist.psu.edu/cardelli91extension.html" }
Citations (may not include all citations):342 data abstraction and polymorphism (context) - Cardelli, Wegner et al. - 1985
97 and parametric polymorphism (context) - Reynolds, abstraction - 1983
81 Information and Computation (context) - Bruce, Longo et al. - 1990
40 Mathematical Structures in Computer Science (context) - Cardelli, Mitchell et al. - 1991
29 Mathematical Structures in Computer Science (context) - Curien, Ghelli et al.
19 lecture notes for the International Summer School in Compute.. (context) - Strachey, in et al. - 1967
12 Scott: Introduction to higher order categorical logic (context) - Lambek - 1986
9 et son application l'limination des coupures dans l'analyse .. (context) - Girard, de l'interprtation et al. - 1971
5 Dipartimento di Informatica (context) - Ghelli, studies et al. - 1990
4 Berarducci: Automatic synthesis of typed l-programs on term .. (context) - Bhm - 1985
3 a proof theoretic study on second order lambda-calculus with.. (context) - Di Cosmo, terms et al. - 1991
3 Longo: A semantic basis for Quest (context) - Cardelli - 1990
3 and parametricity (context) - Mitchell, Scedrov et al.
3 to appear (context) - Cardelli, in et al.
2 to appear in TCS (context) - Freyd, polymorphism
2 Scott: Functorial polymorphism (context) - Bainbridge, Freyd et al. - 1990
2 Curien: Formal parametric polymophism (context) - Abadi, Cardelli
2 models and cartesian closed categories (context) - Mitchell, Scott et al. - 1989
2 the Fourth International Conference on Fuctional Programming.. (context) - Wadler, free et al. - 1989
2 extensionality: confluence of bhtop-reductions in F (context) - Curien, Ghelli - 1991
2 Logical Foundations of Functional Programming (context) - Mitchell, inference et al. - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.luca.demon.co.uk/Bibliography.html): More
On Binary Methods - Bruce, Cardelli, Castagna, Eifrig.. (1995) (Correct)
Subtyping and Parametricity - Plotkin, Abadi, Cardelli (1993) (Correct)
On Understanding Types, Data Abstraction, and Polymorphism - Cardelli, Wegner (1985) (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