The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping

نویسنده

  • Alexandre Miquel
چکیده

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 implicit product induces a rich subtyping relation over the type system in a natural way. We also illustrate the specificities of this calculus by revisitting the impredicative encodings of the Calculus of Constructions, and we show that their translation into the implicit calculus helps to reflect the computational meaning of the underlying terms in a more accurate way.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Model for Impredicative Type Systems, Universes, Intersection Types and Subtyping

We introduce a new model based on coherence spaces for interpreting large impredicative type systems such as the Extended Calculus of Constructions (ECC). Moreover, we show that this model is well-suited for interpreting intersection types and subtyping too, and we illustrate this by interpreting a variant of ECC with an additional intersection type binder. Furthermore, we propose a general met...

متن کامل

A Calculus of Constructions with Explicit Subtyping

The calculus of constructions can be extended with an infinite hierarchy of universes and cumulative subtyping. Subtyping is usually left implicit in the typing rules. We present an alternative version of the calculus of constructions where subtyping is explicit. We avoid problems related to coercions and dependent types by using the Tarski style of universes and by adding equations to reflect ...

متن کامل

Coq à la Tarski: a predicative calculus of constructions with explicit subtyping

The predicative Calculus of Inductive Constructions (pCIC), the theory behind the Coq proof system, contains an infinite hierarchy of predicative universes T ype 0 ∈ T ype 1 ∈ T ype 2 ∈. .. and an impredicative universe P rop for propositions, together with an implicit cumulativity relation P rop ⊆ T ype 0 ⊆ T ype 1 ⊆ T ype 2 ⊆. .. . Subtyping in Coq is implicit, and is handled by the kernel. A...

متن کامل

Towards an Implicit Calculus of Inductive Constructions. Extending the Implicit Calculus of Constructions with Union and Subset Types

We present extensions of Miquel’s Implicit Calculus of Constructions (ICC) and Barras and Bernardo’s decidable Implicit Calculus of Constructions (ICC*) with union and subset types. The purpose of these systems is to solve the problem of interaction betweeen logical and computational data. This is a work in progress and our long term goal is to add the whole inductive types to ICC and ICC* in o...

متن کامل

Constructor Subtyping in the Calculus of Inductive Constructions

The Calculus of Inductive Constructions (CIC) is a powerful type system, featuring dependent types and inductive deenitions, that forms the basis of proof-assistant systems such as Coq and Lego. We extend CIC with constructor subtyping, a basic form of subtyping in which an inductive type is viewed as a subtype of another inductive type if has more elements than. It is shown that the calculus i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001