University of Cambridge > > sb2743's list > Fully in-Place Functional Programming

Fully in-Place Functional Programming

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Siddharth Bhat.

As functional programmers we always face a dilemma: should we write purely functional code, or sacrifice purity for efficiency and resort to in-place updates? For an increasingly large proportion of programs, we can obtain the best of both worlds: using techniques such as Perceus reference 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 introduction 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.

Speaker Bio

Anton Lorenzen is pursuing a PhD in programming languages at the University 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 compiler team of Jane Street. He holds a BSc Mathematics and an MSc Computer Science from the University of Bonn, Germany.

This talk is part of the sb2743's list series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity