(Enter summary)
Abstract: Several proof-assistants rely on the very formal basis of Pure Type Systems. However, some
practical issues raised by the development of large proofs lead to add other features to actual
implementations for handling namespace management, for developing reusable proof libraries
and for separate verification of distincts parts of large proofs. Unfortunately, few theoretical
basis are given for these features. In this paper we propose an extension of Pure Type Systems
with a module calculus... (Update)
Context of citations to this paper: More
...conclusion. 5 Implementation We extended uf, our prototype implementation of a module calculus over the Calculus of Constructions [Cou97,Cou01] with the constructs and rules of EPECC. This prototype is written in Objective Caml with the help of a homemade tool compiling...
...decidability of type checking. Courant has managed to adapt his ideas to more general core languages including dependently typed logics[13]. However, the need to perform even limited compile time equational reasoning on module terms is a distinct departure from the rigid phase...
Cited by: More
Functors for Proofs and Programs - Filliatre, Letouzey (2003)
(Correct)
A Logical Framework with Dependently Typed Records - Coquand, Pollack, Takeyama
(Correct)
Implementing Modules in the Coq System - Jacek Chrzszcz Institute
(Correct)
Similar documents (at the sentence level):
56.9%: A Module Calculus for Pure Type Systems - Courant (1997)
(Correct)
Active bibliography (related documents): More All
1.4: A Module Calculus Enjoying the Subject-Reduction Property - Courant (1996)
(Correct)
0.2: Applicative Functors and Fully Transparent Higher-Order Modules - Leroy (1995)
(Correct)
0.2: A Theory of Mixin Modules: Basic and Derived Operators - Ancona, Zucca (1996)
(Correct)
Similar documents based on text: More All
0.8: Expansion Postponement Problem for Pure Type Systems with.. - Jiménez (2000)
(Correct)
0.3: Proof reconstruction Preliminary version - Courant (1996)
(Correct)
0.2: Loop Shifting for Loop Parallelization - Darte, Huard (2000)
(Correct)
Related documents from co-citation: More All
6: A type theoretic approach to higher-order modules with sharing
- Harper, Lillibridge - 1994
5: and separate compilation (context) - Leroy, modules
3: Computer Science Laboratory (context) - Owre, Shankar et al. - 1997
BibTeX entry: (Update)
Judicael Courant. A module calculus for pure type systems. In Typed Lambda Calculi and Applications 97, LNCS. Springer-Verlag, 1997. http://citeseer.ist.psu.edu/article/courant96module.html More
@inproceedings{ courant97module,
author = "Judicael Courant",
title = "A Module Calculus for Pure Type Systems",
booktitle = "Proceedings fo the Third International Conference on Typed Lambda Calculus and Applications ({TLCA}'97)",
publisher = "Springer-Verlag LNCS",
address = "Nancy, France",
editor = "R. Hindley",
year = "1997",
url = "citeseer.ist.psu.edu/article/courant96module.html" }
Citations (may not include all citations):
382
Lambda calculi with types
- Barendregt - 1991
215
A type-theoretic approach to higher-order modules with shari..
- Harper, Lillibridge - 1994
128
and separate compilation (context) - Leroy, modules - 1994
85
The ALF proof editor and its proof engine (context) - Magnusson, Nordstrom - 1994
75
Applicative functors and fully transparent higher-order modu..
- Leroy - 1995
72
The Theory of LEGO: A Proof Checker for the Extended Calculu..
- Pollack - 1994
64
A meta-mathematical investigation of a Calculus of Construct.. (context) - Coquand - 1987
49
Inductive definitions in the system Coq : Rules and Properti..
- Paulin-Mohring - 1993
47
volume 7 of Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
46
The calculus of constructions (context) - Coquand, Huet - 1988
38
Pure type systems with definitions
- Severi, Poll - 1994
38
Using parameterized signatures to express modular structures
- Jones - 1996
27
The definition of Extended ML: a gentle introduction
- Kahrs, Sannella et al.
23
A module system for a programming language based on the LF l.. (context) - Harper, Pfenning - 1992
23
The Coq Proof Assistant Reference Manual Version (context) - Cornes, Courant et al. - 1995
22
Isomorphisms of types: from -calculus to information retriev.. (context) - Di Cosmo - 1995
17
Ecc: an extended calculus of constructions
- Luo - 1989
16
The IMPS User's Manual (context) - Farmer, Guttman et al. - 1995
13
Cime: Completion modulo e (context) - Contejean, March'e - 1996
10
Department of Information Science (context) - Takahashi, in et al. - 1993
8
ath'ematique; Th'eorie des Ensembles (context) - Bourbaki - 1970
5
A module calculus enjoying the subject-reduction property
- Courant - 1996
5
Formal program development in Extended ML for the working pr.. (context) - Sannella - 1990
4
Included in the distribution available at ftp (context) - Rouaix, report et al. - 1992
2
Private Communication (context) - Saibi - 1996
2
Programmation modulaire avec surcharge et liaison tardive (context) - Aponte, Castagna - 1996
2
ese, Universit (context) - Rouaix, Typage et al. - 1990
1
ese de doctorat, Laboratoire d (context) - Castagna, sous-typage et al. - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ens-lyon.fr/LIP/research_reports.fr.html): More
JNN, a Randomized Algorithm for Learning Multilayer.. - Elisseeff, Paugam-Moisy (1998)
(Correct)
ML Type Inference for Dead Code Analysis - Prost (1997)
(Correct)
Asynchronous Sub-Logarithmic Adders - Muller, Tisserand, Vincent (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC