Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorAllais, Guillaume
dc.contributor.editorWies, Thomas
dc.date.accessioned2023-05-03T15:31:39Z
dc.date.available2023-05-03T15:31:39Z
dc.date.issued2023-04-18
dc.identifier.citationAllais , G 2023 , Builtin types viewed as inductive families . in T Wies (ed.) , Programming Languages and Systems : 32nd European Symposium on Programming, ESOP 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22–27, 2023, Proceedings . Lecture Notes in Computer Science , vol. 13990 , Springer , pp. 113–139 , 32nd European Symposium on Programming, ESOP 2023 , Paris , France , 22/04/23 . https://doi.org/10.48550/arXiv.2301.02194 , https://doi.org/10.1007/978-3-031-30044-8_5en
dc.identifier.citationconferenceen
dc.identifier.isbn9783031300431
dc.identifier.isbn9783031300448
dc.identifier.issn0302-9743
dc.identifier.otherPURE: 283369125
dc.identifier.otherPURE UUID: 735678bd-ea48-4a86-9711-e946cbca018b
dc.identifier.otherScopus: 85161392649
dc.identifier.urihttps://hdl.handle.net/10023/27500
dc.descriptionThis research was funded by the Engineering and Physical Sciences Research Council (grant number EP/T007265/1).en
dc.description.abstractState of the art optimisation passes for dependently typed languages can help erase the redundant information typical of invariant-rich data structures and programs. These automated processes do not dramatically change the structure of the data, even though more efficient representations could be available. Using Quantitative Type Theory, we demonstrate how to define an invariant-rich, typechecking time data structure packing an efficient runtime representation together with runtime irrelevant invariants. The compiler can then aggressively erase all such invariants during compilation. Unlike other approaches, the complexity of the resulting representation is entirely predictable, we do not require both representations to have the same structure, and yet we are able to seamlessly program as if we were using the high-level structure.
dc.format.extent32
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofProgramming Languages and Systemsen
dc.relation.ispartofseriesLecture Notes in Computer Scienceen
dc.rightsCopyright © The Author(s) 2023. This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. The images or other third party material in this chapter are included in the chapter’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.en
dc.subjectRuntime representationen
dc.subjectIdris 2en
dc.subjectQuantitative Type Theoryen
dc.subjectIndexed familiesen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectDASen
dc.subject.lccQA75en
dc.titleBuiltin types viewed as inductive familiesen
dc.typeConference itemen
dc.description.versionPublisher PDFen
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.identifier.doihttps://doi.org/10.48550/arXiv.2301.02194


This item appears in the following Collection(s)

Show simple item record