The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping-Reference-Cited by-同舟云学术

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

Published:2001 Issue: Volume: Page:344-359
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Miquel Alexandre

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45413-6_27

Reference18 articles.

1. T. Altenkirch. Constructions, Inductive types and Strong Normalization. PhD thesis, University of Edinburgh, 1993.

2. Henk Barendregt. Introduction to generalized type systems. Technical Report 90-8, University of Nijmegen, Department of Informatics, May 1990.

3. B. Barras, S. Boutin, C. Cornes, J. Courant, J.C. Filliâtre, E. Giménez, H. Herbelin, G. Huet, C. Muñoz, C. Murthy, C. Parent, C. Paulin, A. Saïbi, and B. Werner. The Coq Proof Assistant Reference Manual — Version V6.1. Technical Report 0203, INRIA, August 1997.

4. J. H. Geuvers and M. J. Nederhof. A modular proof of strong normalization for the calculus of constructions. In Journal of Functional Programming, volume 1,2(1991), pages 155–189, 1991.

5. P. Giannini, F. Honsell, and S. Ronchi della Rocca. Type inference: some results, some problems. In Fundamenta Informaticæ, volume 19(1,2), pages 87–126, 1993.

Cited by 40 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Internalizing Indistinguishability with Dependent Types;Proceedings of the ACM on Programming Languages;2024-01-05

2. Impredicative Encodings of Inductive-Inductive Data in Cedille;Lecture Notes in Computer Science;2023

3. A Dependent Dependency Calculus;Programming Languages and Systems;2022

4. Extracting functional programs from Coq, in Coq;Journal of Functional Programming;2022

5. Monotone recursive types and recursive data representations in Cedille;Mathematical Structures in Computer Science;2021-06