Files in this item
Type-based allocation analysis for co-recursion in lazy functional languages
Item metadata
dc.contributor.author | Vasconcelos, Pedro Baltazar | |
dc.contributor.author | Jost, Steffen | |
dc.contributor.author | Florido, Mario | |
dc.contributor.author | Hammond, Kevin | |
dc.contributor.editor | Vitek, Jan | |
dc.date.accessioned | 2016-04-13T23:01:51Z | |
dc.date.available | 2016-04-13T23:01:51Z | |
dc.date.issued | 2015 | |
dc.identifier.citation | 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/04/15 . https://doi.org/10.1007/978-3-662-46669-8_32 | en |
dc.identifier.citation | conference | en |
dc.identifier.isbn | 978-3-662-46668-1 | |
dc.identifier.isbn | 978-3-662-46669-8 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.other | PURE: 159586916 | |
dc.identifier.other | PURE UUID: 3656a198-22f9-4855-9b2d-158a607430ae | |
dc.identifier.other | Scopus: 84926654576 | |
dc.identifier.other | ORCID: /0000-0002-4326-4562/work/33080453 | |
dc.identifier.other | WOS: 000361751400032 | |
dc.identifier.uri | https://hdl.handle.net/10023/8612 | |
dc.description.abstract | 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. | |
dc.format.extent | 25 | |
dc.language.iso | eng | |
dc.publisher | Springer-Verlag | |
dc.relation.ispartof | Programming Languages and Systems | en |
dc.relation.ispartofseries | Lecture Notes in Computer Science | en |
dc.rights | © 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 | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | NDAS | en |
dc.subject.lcc | QA75 | en |
dc.title | Type-based allocation analysis for co-recursion in lazy functional languages | en |
dc.type | Conference item | en |
dc.contributor.sponsor | European Commission | en |
dc.contributor.sponsor | EPSRC | en |
dc.description.version | Postprint | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | https://doi.org/10.1007/978-3-662-46669-8_32 | |
dc.date.embargoedUntil | 2016-04-14 | |
dc.identifier.grantnumber | FP&-ICT-2011-7 | en |
dc.identifier.grantnumber | EP/F030657/1 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.