Safe Incremental Type Checking

Matthias Puech 1, 2, 3 Yann Régis-Gianas 3
3 PI.R2 - Design, study and implementation of languages for proofs and programs
PPS - Preuves, Programmes et Systèmes, Inria Paris-Rocquencourt, UPD7 - Université Paris Diderot - Paris 7, CNRS - Centre National de la Recherche Scientifique : UMR7126
Abstract : We study the problem of verifying the well-typing of terms, not in a batch fashion, as it is usually the case for typed languages, but incrementally, that is by sequentially modifying a term, and re- verifying each time only a smaller amount of information than the whole term, still ensuring that it is well-typed.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [3 references]  Display  Hide  Download
Contributor : Matthias Puech <>
Submitted on : Friday, December 9, 2011 - 7:13:41 PM
Last modification on : Friday, January 4, 2019 - 5:33:25 PM
Document(s) archivé(s) le : Friday, November 16, 2012 - 3:06:05 PM


Files produced by the author(s)


  • HAL Id : hal-00650341, version 1



Matthias Puech, Yann Régis-Gianas. Safe Incremental Type Checking. TLDI 2012 - Seventh ACM SIGPLAN Workshop on Types in Language Design and Implementation, Jan 2012, Philadelphia, United States. ⟨hal-00650341⟩



Record views


Files downloads