Type-based allocation analysis for co-recursion in lazy functional languages
MetadataShow full item record
This paper presents a novel type-and-effect analysis for pre-dicting upper-bounds on memory allocation costs for co-recursive def-initions in a simple lazily-evaluated functional language. We show thesoundness of this system against an instrumented variant of Launch-bury’s semantics for lazy evaluation which serves as a formal cost model.Our soundness proof requires an intermediate semantics employing indi-rections. Our proof of correspondence between these semantics that weprovide is thus a crucial part of this work.The analysis has been implemented as an automatic inference system.We demonstrate its effectiveness using several example programs thatpreviously could not be automatically analysed.
Vasconcelos , P B , Jost , S , Florido , M & Hammond , K 2015 , Type-based allocation analysis for co-recursion in lazy functional languages . in J Vitek (ed.) , Programming Languages and Systems : 24th European Symposium on Programming, ESOP 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings . vol. 9032 , Lecture Notes in Computer Science , Springer-Verlag , pp. 787-811 , 24th European Symposium on Programming, ESOP 2015 , London , United Kingdom , 14-16 April . DOI: 10.1007/978-3-662-46669-8_32conference
Programming Languages and Systems
© Springer-Verlag Berlin Heidelberg 2015. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-46669-8_32
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.