Collected Size Semantics for Functional Programs over Polymorphic Nested Lists ?

Size analysis is an important prerequisite for heap consump- tion analysis. This paper is a part of ongoing work about typing support for checking output-on-input size dependencies for function denitions in a strict functional language. A signicant restriction for our earlier re- sults is that inner data structures (e.g. in a list of lists) all must have the same size. Here, we make a big step forwards by overcoming this lim- itation via the introduction of higher-order size annotations such that variate sizes of inner data structures can be expressed.