22 citations · 108 across the 38 of their papers we have counts for
4 papers · 1 filter
Multiplicative linear logic from a resolution-based tile system
Boris Eng, Thomas Seiller
We present the stellar resolution, a "flexible" tile system based on Robinson's first-order resolution. After establishing formal definitions and basic properties of the stellar re…
A Novel Loop Fission Technique Inspired by Implicit Computational Complexity
Clément Aubert, Thomas Rubiano, Neea Rusch +1
This work explores an unexpected application of Implicit Computational Complexity (ICC) to parallelize loops in imperative programs. Thanks to a lightweight dependency analysis, ou…
mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity
Clément Aubert, Thomas Rubiano, Neea Rusch +1
Implicit Computational Complexity (ICC) drives better understanding of complexity classes, but it also guides the development of resources-aware languages and static source code an…
Realizing Implicit Computational Complexity
Clément Aubert, Thomas Rubiano, Neea Rusch +1
This abstract aims at presenting an ongoing effort to apply a novel typing mechanism stemming from Implicit Computational Complexity (ICC), that tracks dependencies between variabl…