The Implicit Calculus of Constructions

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 revisiting 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.

[1]  Joe B. Wells,et al.  Typability and Type Checking in System F are Equivalent and Undecidable , 1999, Ann. Pure Appl. Log..

[2]  Alexandre Miquel A model for impredicative type systems, universes, intersection types and subtyping , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[3]  Masami Hagiya,et al.  On Implicit Arguments , 1994, Logic, Language and Computation.

[4]  Hendrik Pieter Barendregt,et al.  Introduction to generalized type systems , 1991, Journal of Functional Programming.

[5]  Luigi Liquori,et al.  Comparing Cubes , 1994, LFCS.

[6]  Mark-Jan Nederhof,et al.  Modular proof of strong normalization for the calculus of constructions , 1991, Journal of Functional Programming.

[7]  Benjamin Werner,et al.  Une Théorie des Constructions Inductives , 1994 .

[8]  Thorsten Altenkirch,et al.  Constructions, inductive types and strong normalization , 1993, CST.

[9]  Zhaohui Luo,et al.  Computation and reasoning - a type theory for computer science , 1994, International series of monographs on computer science.

[10]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[11]  Paola Giannini,et al.  Type Inference: Some Results, Some Problems , 1993, Fundam. Informaticae.

[12]  Hugo Herbelin,et al.  The Coq proof assistant : reference manual, version 6.1 , 1997 .

[13]  Daniel Leivant,et al.  Polymorphic type inference , 1983, POPL '83.