Hostname: page-component-8448b6f56d-tj2md Total loading time: 0 Render date: 2024-04-18T10:49:35.907Z Has data issue: false hasContentIssue false
  • English
  • Français

Heterogeneous binary random-access lists

Part of: JFP Functional Pearls

Published online by Cambridge University Press:  07 April 2020

WOUTER SWIERSTRA Open the ORCID record for WOUTER SWIERSTRA [Opens in a new window]
WOUTER SWIERSTRA*
Affiliation:
Utrecht University (e-mail: w.s.swierstra@uu.nl)
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Functional Pearl
Information
Journal of Functional Programming , Volume 30 , 2020 , e10
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s) 2020

References

Abel, A. (2016) Agda tutorial. In 13th International Symposium, FLOPS 2016, Kochi, Japan, March 4–6, 2016, Proceedings. Springer.Google Scholar
Chakravarty, M. M. T., Keller, G., Lee, S., McDonell, T. L. & Grover, V. (2011) Accelerating haskell array codes with multicore gpus. In Proceedings of the Sixth Workshop on Declarative Aspects of Multicore Programming. ACM, pp. 3–14.Google Scholar
Christiansen, D. T., Diatchki, I. S., Dockins, R., Hendrix, J. & Ravitch, T. (2019) Dependently typed haskell in industry (experience report). Proc. ACM Program. Lang. 3(ICFP), 100:1–100:16.CrossRefGoogle Scholar
Dagand, P.-E. (2013) A cosmology of datatypes. Ph.D. thesis, University of Strathclyde.Google Scholar
Eisenberg, R. A., Vytiniotis, D., Peyton Jones, S. & Weirich, S. (2014) Closed type families with overlapping equations. Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL ’14. ACM, pp. 671–683.Google Scholar
Jones, M. P. (2000) Type classes with functional dependencies. European Symposium on Programming. Springer, pp. 230–244.Google Scholar
Ko, H.-S. & Gibbons, J. (2016) Programming with ornaments. J. Funct. Program., 27(December). https://doi.org/10.1017/S0956796816000307Google Scholar
McBride, C. (2004) Epigram: Practical programming with dependent types. In International School on Advanced Functional Programming. Springer, pp. 130–170.Google Scholar
Norell, U. (2009) Dependently typed programming in Agda. In Advanced Functional Programming: 6th International School AFP. Berlin, Heidelberg: Springer, pp. 230–266.CrossRefGoogle Scholar
Norell, U. (2013) Interactive programming with dependent types. In Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming, ICFP ’13. New York, NY, USA: ACM, pp. 1–2.Google Scholar
Okasaki, C. (1999) Purely Functional Data Structures. Cambridge University Press.Google Scholar
Vytiniotis, D., Weirich, S. & Peyton Jones, S. (2006) Simple unification-based type inference for gadts. In ACM SIGPLAN International Conference on Functional Programming (ICFP ’06). ACM Press, pp. 50–61.Google Scholar
Yorgey, B., Weirich, S., Cretin, J., Peyton Jones, S., Vytiniotis, D. & Magalhaes, J. P. (2012) Giving haskell a promotion. In Proceedings of TLDI’12. ACM, pp. 50–61.Google Scholar

Swierstra supplementary material

Swierstra supplementary material

Download Swierstra supplementary material(Video)
Video 26.5 MB
Submit a response

Discussions

No Discussions have been published for this article.