Realizing Implicit Computational Complexity - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Realizing Implicit Computational Complexity

Résumé

This abstract aims at presenting an ongoing effort to apply a novel typing mechanism stemming from Implicit Computational Complexity (ICC), that tracks dependencies between variables in three different ways, at different stages of maturation. The first and third projects bend the original typing discipline to gain finer-grained view on statements independence, to optimize loops by hoisting invariant and by splitting loops "horizontally" to parallelize them more efficiently. The second project refines and implements the original analysis to obtain a fast, modular static analyzer. All three projects aims at pushing the original type system, inspired from ICC, to its limits, to assess how ICC can in practice leads to original, sometimes orthogonal, approaches.
Fichier principal
Vignette du fichier
article.pdf (185.73 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04098255 , version 1 (15-05-2023)

Identifiants

  • HAL Id : hal-04098255 , version 1

Citer

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller. Realizing Implicit Computational Complexity. TYPES 2022 - 28th International Conference on Types for Proofs and Programs, Jun 2022, Nantes, France. ⟨hal-04098255⟩
2 Consultations
2 Téléchargements

Partager

Gmail Facebook X LinkedIn More