Séminaire Cambium, Inria Paris, 2 rue Simone Iff
                          Salle Lions 1, bâtiment C
                             Mardi 12 mars, 10h00

                                 Daan Leijen
                              Microsoft Research

           The Functional Essence of Imperative Binary Search Trees

Recent work on Perceus reference counting, functional-but-in-place
(FIP) programming, and first-class constructor contexts enables new
ways of writing efficient purely functional algorithms in the Koka
language. In this talk I will revisit various balanced tree insertion
algorithms (including the recent zip trees by Tarjan et al.) and show
how we can derive efficient top-down and bottom-up insertion
algorithms from the recursive specification that have performance
on-par with the best C implementations.

Tech. report available at
<https://www.microsoft.com/en-us/research/uploads/prod/2023/07/fiptree-tr-v4.pdf>

            Vous pouvez vous abonner à nos annonces de séminaires:
                     http://cambium.inria.fr/seminar.html

             Nos séminaires sont accessibles en ligne en direct
                            via le lien ci-dessus.