See this document in CiteSeerX!

Basic theory of F-bounded quantification (1999)  (Make Corrections)  
Paolo Baldan, Giorgio Ghelli, Alessandra Raffaetà
Information and Computation



  Home/Search   Context   Related

 
View or download:
tql.di.unipi.it/pap...BalGheRaf99ic.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  tql.di.unipi.it/publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: System F-bounded is a second order typed lambda calculus, where the basic features of object-oriented languages can be naturally modelled. (Update)

Active bibliography (related documents):   More   All
3.2:   Basic theory of F-bounded quantification - Baldan, Ghelli, Raffaetą   (Correct)
0.8:   Bounded Quantification with Bottom - Pierce (1997)   (Correct)
0.5:   Participants - Antonio Albano Professor   (Correct)

Similar documents based on text:   More   All
0.3:   Termination of system F-bounded (Note) - Ghelli   (Correct)
0.3:   Logic-Based Composition of Software - Contiero (1999)   (Correct)
0.3:   Active-U-Datalog: Integrating Active Rules in a Deductive.. - Gervasi, Raffaeta (1997)   (Correct)

BibTeX entry:   (Update)

@article{ baldan99basic,
    author = "Paolo Baldan and Giorgio Ghelli and Alessandra Raffaeta",
    title = "Basic Theory of F-Bounded Quantification",
    journal = "Information and Computation",
    volume = "153",
    number = "1",
    pages = "173-237",
    year = "1999",
    url = "citeseer.ist.psu.edu/666199.html" }
Citations (may not include all citations):
388   On understanding types (context) - Cardelli, Wegner - 1985
325   Towards a theory of type structure (context) - Reynolds - 1974
322   volume 78 of Lecture Notes in Computer Science (context) - Gordon, Milner et al. - 1979
311   Abstract types have existential type (context) - Mitchell, Plotkin - 1988
224   Semantics of Programming Languages: Structures and Technique.. (context) - Gunter - 1992
174   Springer-Verlag (context) - Abadi, Cardelli et al. - 1996
168   ACM Transactions on Programming Languages and Systems (context) - Abadi, Cardelli et al. - 1996
132   Interpr'etation fonctionelle et 'elimination des coupures da.. (context) - Girard - 1972
116   Mathematical Structures in Computer Science (context) - Pierce, bounded - 1997
106   PolyTOIL: A type-safe polymorphic object-oriented language - Bruce, Schuett et al. - 1995
88   A calculus for overloaded functions with subtyping - Castagna, Ghelli et al. - 1995
88   Theory and Practice of Object Systems (context) - Bruce, Cardelli et al. - 1996
81   Information and Computation (context) - Bruce, Longo et al. - 1990
74   Safe Type Checking in a Statically Typed ObjectOriented Prog.. (context) - Bruce, object-oriented et al. - 1993
56   bounded quantification for object-oriented programming (context) - Canning, Cook et al. - 1989
44   Proof Theoretic Studies about a Minimal Type System Integrat.. (context) - Ghelli - 1990
42   A per model of polymorphism and recursive types - Abadi, Plotkin - 1990
41   Unpublished manuscript (context) - Cardelli - 1990
40   Object-oriented programming versus abstract data types (context) - Cook - 1991
36   Recursion over realizability structures (context) - Amadio - 1991
35   Lambda-calculus notation with nameless dummies: a tool for a.. (context) - de Bruijn - 1972
28   The semantics of secondorder lambda calculus (context) - Bruce, Meyer et al. - 1990
25   Theoretical Computer Science (context) - Ghelli, checking - 1995
25   Theoretical Computer Science (context) - Ghelli, Pierce et al. - 1998
23   Recursive types are not conservative over F - Ghelli - 1993
22   Relational semantics for recursive types and bounded quantif.. (context) - Cardone - 1989
18   Completely bounded quantification is decidable - Katiyar, Sankar - 1992
18   early: a calculus with overloading and early binding (context) - Castagna, Ghelli et al. - 1993
15   Coherence of subsumption: Minimum typing and type-checking i.. (context) - Curien, Ghelli - 1994
15   A preliminary version appeared in TACS (context) - Cardelli, Martini et al. - 1994
11   Information and Computation (context) - Hofmann, Pierce - 1996
9   Theoretical Computer Science (context) - Pierce, Steffen - 1997
8   A proof of strong normalization of (context) - McAllester, Kucan et al. - 1995
7   A static type system for late binding overloading (context) - Ghelli - 1991
7   second order polymorphism in a calculus with subtyping (context) - Castagna, parametric et al. - 1996
6   Subtyping recursive types in kernel Fun - Colazzo, Ghelli - 1999
6   Decidability and confluence of fijtop reduction in F (context) - Curien, Ghelli - 1994
5   Information and Computation (context) - Ghelli, system et al. - 1997
4   A fixed point extension of the second order lambda calculus:.. (context) - Amadio - 1988
4   Preliminary version in ACM Conference on Lisp and Functional.. (context) - Cardelli, Longo et al. - 1990
4   bounded types (context) - Katiyar - 1992
3   To appear in a special issue with papers from Theoretical As.. (context) - Bruce, Cardelli et al. - 1997
3   A preliminary version appeared in POPL '91 (context) - Amadio, Cardelli et al. - 1990
2   Theoretical Aspects of Object-Oriented Programming: Types (context) - Pierce, is et al. - 1994
2   Theoretical Computer Science (context) - Castagna, -abstraction - 1997

Documents on the same site (http://tql.di.unipi.it/publications.html):   More
Foundations for Extensible Objects with Roles - Giorgio Ghelli Dipartimento (1999)   (Correct)
Secrecy and Group Creation - Luca Cardelli Giorgio (2000)   (Correct)
Extensible Objects for Database Evolution: - Language Features And   (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