Safe Incremental Type Checking
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...