Safe Incremental Type Checking - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Safe Incremental Type Checking


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.
Fichier principal
Vignette du fichier
abstract.pdf (71.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00650341 , version 1 (09-12-2011)


  • 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⟩
196 View
74 Download


Gmail Facebook X LinkedIn More