The implicit calculus of constructions: Extending pure type systems with an intersection type binder and subtyping

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2044 LNCS, Issue , 2001, Pages 344-359

  Miquel, Alexandre ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; FORMAL LANGUAGES; PATHOLOGY; BINDERS; BINS;

CALCULUS OF CONSTRUCTION; ENCODINGS; INTERSECTION TYPES; PURE TYPE SYSTEMS; SUBJECT REDUCTION; SUBTYPING RELATION; SUBTYPINGS; TYPE SYSTEMS;

CALCULATIONS;

EID: 84888873920     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45413-6_27     Document Type: Conference Paper

References (18)

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. Filliatre, E. Gimenez, H. Herbelin, G. Huet, C. Munoz, C. Murthy, C. Parent, C. Paulin, A. Sai'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 Informatiche, volume 19(1,2), pages 87-126, 1993.
6. M. Hagiya and Y. Toda. On implicit arguments. Technical Report 95-1, Department of Information Science, Faculty of Science, University of Tokyo, 1995.
7. Paul B. Jackson. The Nuprl proof development system, version 4.1 reference manual and user's guide. Technical report, Cornell University, 1994.
8. D. Leivant. Polymorphic type inference. In Proceedings of the 10th ACM Symposium on Principles of Programming Languages, pages 88-98, 1983.
9. Z. Luo. Computation and Reasoning: A Type Theory for Computer Science. Oxford University Press, 1994.
10. Zhaohui Luo and Randy Pollack. Lego proof development system: User's manual. Technical Report 92-228, LFCS, 1992.
11. Lena Magnusson. Introduction to ALF - an interactive proof editor. In Uffe H. Engberg, Kim G. Larsen, and Peter D. Mosses, editors, Proceedings of the 6th Nordic Workshop on Programming Theory (Aarhus, Denmark, 17-19 October, 1994), number NS-94-6 in Notes Series, page 269, Department of Computer Science, University of Aarhus, December 1994. BRICS. vi+483.
12. Alexandre Miquel. Arguments implicites dans le calcul des constructions: etude d'un formalisme a la Curry. Master's thesis, Universite Denis-Diderot Paris 7, octobre 1998.
13. Alexandre Miquel. A model for impredicative type systems with universes, intersection types and subtyping. In Proceedings of the 15 th Annual IEEE Symposium on Logic in Computer Science (LICS'00), 2000.
14. R. Pollack. Implicit syntax. In Gerard Huet and Gordon Plotkin, editors, Proceedings of the First Workshop on Logical Frameworks (Antibes), may 1990.
15. A. Saïbi. Algebre Constructive en Theorie des Types, Outils génériques pour la modélisation et la demonstration, Application à latheorie des Categories. PhD thesis, Universite Paris VI, 1998.
16. S. van Bakel, L. Liquori, R. Ronchi della Rocca, and P. Urzyczyn. Comparing Cubes. In A. Nerode and Yu. V. Matiyasevich, editors, Proceedings of LFCS '94- Third International Symposium on Logical Foundations of Computer Science, St. Petersburg, Russia, volume 813 of Lecture Notes in Computer Science, pages 353-365. Springer-Verlag, 1994.
17. J. B. Wells. Typability and type checking in system F are equivalent and un-decidable. In Annals of Pure and Applied Logic, volume 98(1-3), pages 111-156, 1999.
18. B. Werner. Une theorie des Constructions Inductives. PhD thesis, Universite Paris VII, 1994.