Conference paper Open Access

Realizing Implicit Computational Complexity

Aubert, Clément; Rubiano, Thomas; Rusch, Neea; Seiller, Thomas

Citation Style Language JSON Export

  "publisher": "Zenodo", 
  "DOI": "10.5281/zenodo.7938752", 
  "author": [
      "family": "Aubert, Cl\u00e9ment"
      "family": "Rubiano, Thomas"
      "family": "Rusch, Neea"
      "family": "Seiller, Thomas"
  "issued": {
    "date-parts": [
  "abstract": "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.\nThe 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.\nThe second project refines and implements the original analysis to obtain a fast, modular static analyzer.\nAll 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.", 
  "title": "Realizing Implicit Computational Complexity", 
  "type": "paper-conference", 
  "id": "7938752"
All versions This version
Views 1717
Downloads 44
Data volume 760.8 kB760.8 kB
Unique views 1717
Unique downloads 44


Cite as