BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Implementation of persistent arrays - Tautvydas Janiunas\, Sidney 
 Sussex College
DTSTART:20210217T200000Z
DTEND:20210217T203000Z
UID:TALK157603@talks.cam.ac.uk
CONTACT:Matthew Ireland
DESCRIPTION:An array is a fundamental data structure in many programming l
 anguages. However\, in functional languages using arrays can cause some si
 de effects\, to mitigate it we need to make our arrays immutable and persi
 stent. A simple way of implementing a persistent array is using a fully ba
 lanced binary search tree. In this talk\, we will discuss what kind of dat
 a structures can be used to implement persistent arrays with better time a
 nd memory complexity.\n
LOCATION:Online\, via MS Teams
END:VEVENT
END:VCALENDAR