F. Cardone U. de' Liguoro M. Dezani Ciancaglini Dedicated to Corrado Bohm on...  Home/Search
Context Related
| di.unito.it/~deligu/pub/CDdL94.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: di.unito.it/~deligu/pub/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a type inference system for pure -calculus which includes, in addition to arrow types, also universal and existential type quantifiers, intersection and union types, and type recursion. The interest of this system lies in the fact that it offers a possibility to study in a unified framework a wide range of type constructors. We investigate the main syntactical properties of the system, including an analysis of the preservation of types under parallel reduction strategies, leading ... (Update)
Context of citations to this paper: More
.... (Leivant, 1990) and the dual notion of union types (Barbanera Dezani Ciancaglini, 1991; Hayashi, 1991; Pierce, 1991b; Cardone et al. 1994; Barbanera et al. 1995) Some related extensions to ML style type inference systems are the notions of refinement types...
.... in [62] Extensions of intersection types with union and quantified types, both universal and existential, have been studied in [51, 66, 13, 23]. The completeness problem for such systems has been recently settled by Yokouchi in [94] Intersection and union types turn out...
Cited by: More
Intersection Types, λ-models, and Böhm Trees - Dezani-Ciancaglini.. (Correct)
Intersection Types and Bounded Polymorphism - Pierce (1996) (Correct)
Active bibliography (related documents): More All
1.2: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998) (Correct)
0.5: Inheritance As Implicit Coercion - Breazu-Tannen, Coquand, Gunter.. (1991) (Correct)
0.5: The Impact of the Lambda Calculus in Logic and Computer Science - Barendregt (1997) (Correct)
Similar documents based on text: More All
0.3: A Convex Powerdomain over Lattices: its Logic and.. - Alessi, al. (1997) (Correct)
0.3: Some Results on the Full Abstraction Problem for Restricted.. - Honsell, Lenisa (1993) (Correct)
0.3: A Complete Characterization of Complete.. - Dezani-Ciancaglini.. (Correct)
Related documents from co-citation: More All
3: A type assignment for the strongly normalizable -terms (context) - Pottinger - 1980
3: A filter lambda model and the completeness of type assignment (context) - Barendregt, Coppo et al. - 1983
3: Principal Types and Unification for a Simple Intersection Type Systems (context) - Coppo, Giannini - 1995
BibTeX entry: (Update)
Cardone, F., Dezani-Ciancaglini, M., & de' Liguoro, U. 1994. Combining type disciplines. Annals of Pure and Applied Logic, 66, 197--230. http://citeseer.ist.psu.edu/cardone94combining.html More
@article{ cardone94combining,
author = "Felice Cardone and Mariangiola Dezani-Ciancaglini and Ugo de'Liguoro",
title = "Combining Type Disciplines",
journal = "Annals of Pure and Applied Logic",
volume = "66",
number = "3",
pages = "197-230",
year = "1994",
url = "citeseer.ist.psu.edu/cardone94combining.html" }
Citations (may not include all citations):342 data abstraction and polymorphism (context) - Cardelli, Wegner et al. - 1985
311 Abstract types have existential type (context) - Mitchell, Plotkin - 1988
266 Information and Computation (context) - Coquand, Huet et al. - 1988
214 An ideal model for recursive polymorphic types (context) - MacQueen, Plotkin et al. - 1986
210 Its Syntax and Semantics (context) - Barendregt, Calculus - 1984
132 Syntactic control of interference (context) - Reynolds - 1989
116 Natural Deduction (context) - Prawitz - 1965
109 Continuous lattices (context) - Scott - 1972
82 Typeful programming - Cardelli - 1989
81 Refinement types for ML - Freeman, Pfenning - 1991
70 Preliminary design of the programming language FORSYTHE (context) - Reynolds - 1988
64 A type assignment for the strongly normalizable -terms (context) - Pottinger - 1980
62 The Collected Papers of Gerhard Gentzen (context) - Szabo - 1969
56 bounded quantification for objectoriented programming (context) - Canning, Cook et al. - 1989
53 Automatic synthesis of typed -programs on term algebras (context) - Bohm, Berarducci - 1985
47 Intersection and union types: syntax and semantics (context) - Barbanera, Dezani-Ciancaglini et al. - 1992
36 Recursion over realizability structures (context) - Amadio - 1991
23 Recursive types and type constraints in second order lambda .. (context) - Mendler - 1987
8 An extension of basic functionality theory for lambda-calcul.. (context) - Coppo, Dezani-Ciancaglini - 1980
7 Intersection types for a logical framework - Pfenning - 1988
6 Type inference with recursive types (context) - Cardone, Coppo - 1991
4 Preliminary investigation of a calculus with intersection an.. - Pierce - 1990
2 Examples of formal semantics (context) - Knuth - 1970
2 A completeness theorem for recursively defined types (context) - Coppo - 1985
2 The CUCH as a formal and description language (context) - Bohm - 1966
1 Theoretical Computer Science (context) - Cardone, for - 1991
1 abstract interpretation and strictness analysis (context) - Coppo, Ferrari - 1992
Documents on the same site (http://www.di.unito.it/~deligu/pub/): More
Non Deterministic Extensions of Untyped λ-calculus - de'Liguoro, Piperno (1995) (Correct)
A Convex Powerdomain over Lattices: its Logic and.. - Alessi, al. (1997) (Correct)
A Filter Model for Concurrent λ-Calculus - Dezani-Ciancaglini.. (1998) (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