A module calculus for pure type systems

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

Volumn 1210, Issue , 1997, Pages 112-128

  Courant, Judicaël ^a  

^a UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; COMPUTER PROGRAMMING LANGUAGES; INDUSTRIAL PLANTS; PATHOLOGY;

MODULE CALCULI; MODULE SYSTEMS; NAMESPACES; PRACTICAL ISSUES; PROOF ASSISTANT; PURE TYPE SYSTEMS; THEORETICAL FRAMEWORK; TYPE INFERENCES;

CALCULATIONS;

EID: 84958967545     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62688-3_32     Document Type: Conference Paper

References (24)

1. María Virginia Aponte and Ginseppe Castagna. Programmation modulaire avec surcharge et liaison tardive. In JournéesFrancophonesdes Langages Applicatifs, January 1996.
2. H. Barendregt. Lambda calculi with types. Technical Report 91-19, Catholic University Nijmegen, 1991. in Handbook of Logic in Computer Science, Vol II
3. Nicolas Bourbaki. Eldments de Mathdmatique; Théorie des Ensembles, chapter IV. Hermarm, Paris, 1970.
4. C. Comes, J. Courant, L-C. Filliâtre, G. Huet, P. Manoury, C. Muñoz, C. Murthy, C. Parent, C. Paulin-Mohring, A. Saibi, and B. Weaner. The Coq Proof Assistant Reference ManualVersion 5.10. Technical Report 0177, INRIA, July 1995.
5. T. Coquand and G. Huet. The Calculus of Constructions. Inf. Comp., 76:95-120, 1988.
6. Evelyne Contejean and Claude Marché. CiME: Completion Modulo E. In Harald Ganzinger, editor, 7th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science. Springer-Verlag, Rutgers University, NJ, USA,, July 1996.
7. Judieaë1 Courant. A module calculus enjoying the subject-reduction property. Research Report RR 96-30, LIP, 1996. Preliminary version.
8. Robexto Di Cosine. Isomorphisms of types: from λ-calculus to information retrieval and language design. Progress in Theoretical Computer Science. Birkhauser, 1995. ISBH-0-8176-3763-X.
9. William M. Farmer, Joshua D. Guttman, and F. Javier Thayer. The IMPS User's Manual. The MITRE Corporation, first edition, version 2 edition, 1995.
10. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the ACM, 40(1): 143-184, January 1993. Preliminary version appeared in Prec. 2nd IEEE Symposium on Logic in Computer Science, 1987, 194-204.
11. R. Harper and M. Lillibridge. A type-theoretic approach to higher-order modules with sharing. In 21st Symposium on Principles of Programming Languages, page, s 123-137. ACM Press, 1994.
12. Robert Harper and Frank Pfenning. A module system for a programming language based on the LF logical framework. Technical Report CMU-CS-92-191, Carnegie Mellon University, Pittsburgh, Pennsylvania, september 1992
13. Mark P. Jones. Using parameterized signatures to express modular structures. In 23rd Symposium on Principles of Programming Languages. ACM Press, 1996. To appear.
14. Xavier Leroy. Manifest types, modules, and separate compilation. In 21st syrup. Principles of Progr. Lang., pages 109-122. ACM Press, 1994.
15. Xavier Leroy. Applicative functors and fully transparent higher-order modules. In 22nd Symposium on Principles of Programming Languages, pages 142-153. ACM Press, 1995.
16. Zhaohui Luo. ECC: an Extended Calculus of Constructions. In Prec. oflEEE 4th Ann. Syrup. on Logic In Computer Science, Asilomar, California, 1989.
17. David B. MacQueen. Modules for Standard ML. Polymorphism, 2(2), 1985. 35 pages. An earlier version appeared in Prec. 1984 ACM Conf. on Lisp and Functional Programming.
18. Lena Magnusson and Bengt Nordström. The ALF proof editor and its proof engine. In Honk Bareadregt and Tobias Nipkow, editors, Types for Proofs and Programs, pages 213-237. Springer-Verlag LNCS 806, 1994.
19. C. Paulin-Mohring. Inductive definitions in the system Coq: Rules and Properties. In M. Bezem, J.F. Groote, editor, Proceedings of the TLCA, 1993.
20. Robert Pollack. The Theory of LEGO: A Proof Checker for the Extended Calculus of Constructions. PhD thesis, University of Edinburgh, 1994.
21. Françis Rouaix. The Alcoo190 report. Technical report, INRIA, 1992. Included in the distribution available at ftp.inria.fr.
22. Amokrane Saibi, 1996. Private Communication.
23. Don Sannelia. Formal program development in Extended ML for the working programmer. In Prec. 3rd BCS/FACS Workshop on Refinement, pages 99-130. Springer Workshops in Computing, 1990.
24. P. Severi and E. Poll. Pure type systems with definitions. Lecture Notes in Computer Science, 813, 1994.