A program transformation that abstracts each variable by several type-based size measures, together with a data-flow inference that keeps only the measures that affect resource cost, is formalized and proved sound.
The typed-norms of any input variable for any rule of m (including rule number j) will be propagated to the arguments ¯ xk of the call m(¯x, ¯y) in rule i
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Transformational Approach to Resource Analysis with Typed-norms Inference
A program transformation that abstracts each variable by several type-based size measures, together with a data-flow inference that keeps only the measures that affect resource cost, is formalized and proved sound.