BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Fully in-Place Functional Programming - Anton Lorenzen\, Universit
 y of Edinburgh
DTSTART:20240402T100000Z
DTEND:20240402T110000Z
UID:TALK213496@talks.cam.ac.uk
CONTACT:Siddharth Bhat
DESCRIPTION:As functional programmers we always face a dilemma: should we 
 write purely functional code\, or sacrifice purity for efficiency and reso
 rt to in-place updates? For an increasingly large proportion of programs\,
  we can obtain the best of both worlds: using techniques such as Perceus r
 eference counting and Tail Recursion Modulo Cons\, these purely functional
  programs can be executed safely using in-place updates without requiring 
 allocation or superfluous stack space. In my talk\, I will give an introdu
 ction to these techniques and describe how they can be used to program in 
 a style that we call _fully in-place functional programming_. Furthermore\
 , I will show that such programs have a close correspondence to imperative
  code which can lead to new insights for verifications.\n\n*Speaker Bio*\n
 \n\nAnton Lorenzen is pursuing a PhD in programming languages at the Unive
 rsity of Edinburgh\, where he is supervised by Sam Lindley and Daan Leijen
 . He has interned at the RiSE group of Microsoft Research and the OCaml co
 mpiler team of Jane Street. He holds a BSc Mathematics and an MSc Computer
  Science from the University of Bonn\, Germany.\n\n
LOCATION:Computer Laboratory\, William Gates Building\, Room SS03
END:VEVENT
END:VCALENDAR
