University of Cambridge > Talks.cam > Churchill CompSci Talks > Implementation of persistent arrays

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Implementation of persistent arrays

Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Ireland .

An array is a fundamental data structure in many programming languages. However, in functional languages using arrays can cause some side effects, to mitigate it we need to make our arrays immutable and persistent. A simple way of implementing a persistent array is using a fully balanced binary search tree. In this talk, we will discuss what kind of data structures can be used to implement persistent arrays with better time and memory complexity.

This talk is part of the Churchill CompSci Talks series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lord Ashcroft Building (LAB027), Anglia Ruskin University, Cambridge SAMSUNG AI Center Cambridge 4th Floor, Jupiter House -- 10 Station Road Cambridge CB1 2JB West Road Concert Hall, 11 West Road, Cambridge, CB3 9DP

Other talks

Packing the Border: Quail Crates and the Regulation of Animal Movement on the US-Mexico Border, 1910s-1940s Title tbc Online Causal Inference Seminar Evolution: Inevitable or Remarkable? Tissue-scale communication in cancer development Cooperation in Nature
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity