See this document in CiteSeerX!

The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping  (Make Corrections)  
Alexandre Miquel
Proc.\ of 5th Int.\ Conf.\ on Typed Lambda Calculi and Applications, TLCA'01, Krakow, Poland, 2--5 May 2001



  Home/Search   Context   Related

 
View or download:
pauillac.inria.fr/~mique...tlca01.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  pauillac.inria.fr/~mi...indexeng (more)
(Enter author homepages)

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

Abstract: In this paper, we introduce a new type system, the Implicit Calculus of Constructions, which is a Curry-style variant of the Calculus of Constructions that we extend by adding an intersection type binder| called the implicit dependent product. Unlike the usual approach of Type Assignment Systems, the implicit product can be used at every place in the universe hierarchy. We study syntactical properties of this calculus such as the -subject reduction property, and we show that the... (Update)

Active bibliography (related documents):   More   All
0.6:   A Model for Impredicative Type Systems, Universes, Intersection.. - Miquel   (Correct)
0.6:   Type-Secure Meta-Programming - Christopher Bentley Dornan (1998)   (Correct)
0.4:   More On Implicit Syntax - Luther   (Correct)

Similar documents based on text:   More   All
0.4:   On Implicit Arguments - Hagiya, Toda (1995)   (Correct)
0.3:   Strong OpenMath - Caprotti And Cohen   (Correct)
0.3:   Domain-Free Pure Type Systems - Barthe (1993)   (Correct)

BibTeX entry:   (Update)

@incollection{ miquel01implicit,
    author = "Alexandre Miquel",
    title = "The Implicit Calculus of Constructions: Extending Pure Type Systems with an Intersection Type Binder and Subtyping",
    booktitle = "Proc.\ of 5th Int.\ Conf.\ on Typed Lambda Calculi and Applications, {TLCA}'01, Krakow, Poland, 2--5 May 2001",
    volume = "2044",
    publisher = "Springer-Verlag",
    address = "Berlin",
    editor = "S. Abramsky",
    pages = "344--359",
    year = "2001",
    url = "citeseer.ist.psu.edu/493149.html" }
Citations (may not include all citations):
191   Polymorphic type inference (context) - Leivant - 1983
191   Lego proof development system: User's manual (context) - Luo, Pollack - 1992
84   Computation and Reasoning: A Type Theory for Computer Scienc.. (context) - Luo - 1994
42   The Coq Proof Assistant Reference Manual { Version V (context) - Barras, Boutin et al. - 1997
39   A modular proof of strong normalization for the calculus of .. (context) - Geuvers, Nederhof
39   Introduction to generalized type systems (context) - Barendregt - 1990
20   Inductive types and Strong Normalization (context) - Altenkirch - 1993
19   Typability and type checking in system F are equivalent and .. - Wells - 1999
14   Type inference: some results (context) - Giannini, Honsel et al. - 1993
12   reference manual and user's guide (context) - Jackson, proof et al. - 1994
11   Implicit syntax - Pollack - 1990
3   Ronchi della Rocca (context) - van Bakel, Liquori - 1994
3   Department of Information Science (context) - Hagiya, Toda et al. - 1995
3   eorie des Constructions Inductives (context) - Werner - 1994
2   Arguments implicites dans le calcul des constructions: etud.. (context) - Miquel - 1998
1   Introduction to ALF | an interactive proof editor (context) - Magnusson
1   ebre Constructive en Theorie des Types (context) - Sa, Alg - 1998
1   A model for impredicative type systems with universes (context) - Miquel - 2000

Documents on the same site (http://pauillac.inria.fr/~miquel/index-eng.html):
A Model for Impredicative Type Systems, Universes, Intersection.. - Miquel   (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