Title
Collected Size Semantics for Strict Functional Programs over General Polymorphic Lists.
Abstract
Size analysis can be an important part of heap consumption analysis. This paper is a part of ongoing work about typing support for checking output-on-input size dependencies for function definitions in a strict functional language. A significant restriction for our earlier results 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 limitation via the introduction of higher-order size annotations such that variate sizes of inner data structures can be expressed. In this way the analysis becomes applicable for general, polymorphic nested lists.
Year
DOI
Venue
2013
10.1007/978-3-319-12466-7_9
Lecture Notes in Computer Science
DocType
Volume
ISSN
Conference
8552
0302-9743
Citations 
PageRank 
References 
1
0.35
14
Authors
3
Name
Order
Citations
PageRank
Olha Shkaravska11108.70
marko c j d van eekelen223930.37
Alejandro Tamalet3121.89