![]() |
CiteULike | ![]() |
EdwardKmett's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
A Module Calculus for Pure Type Systemsby: Judicael Courant
edited by: R. HindleyIn Proceedings fo the Third International Conference on Typed Lambda Calculus and Applications (TLCA'97) (1997)
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractSeveral 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...
BibTeX record
RIS record