https://massimo-nocentini.github.io/tags/lookup/Recent content in Lookup on Massimo NocentiniHugoenmassimo.nocentini@gmail.com (Massimo Nocentini)massimo.nocentini@gmail.com (Massimo Nocentini)Fri, 10 Apr 2026 09:58:04 +0100https://massimo-nocentini.github.io/post/2026-04-10-scm-testsuite-sbral-suite/Fri, 10 Apr 2026 09:58:04 +0100massimo.nocentini@gmail.com (Massimo Nocentini)https://massimo-nocentini.github.io/post/2026-04-10-scm-testsuite-sbral-suite/A walkthrough of the Scheme module <code>(aux fds sbral)</code>, showing how skew binary random-access lists support persistent front operations in constant amortized time and indexed lookup and update in logarithmic time.https://massimo-nocentini.github.io/post/2015-03-00-efficient-representations-of-triangular-substitutions/Sun, 01 Mar 2015 18:33:23 +0100massimo.nocentini@gmail.com (Massimo Nocentini)https://massimo-nocentini.github.io/post/2015-03-00-efficient-representations-of-triangular-substitutions/This paper studies efficient representations for triangular substitutions in miniKanren, showing how skew binary random-access lists reduce lookup costs while preserving the advantages of a purely functional Scheme implementation.https://massimo-nocentini.github.io/post/1995-10-01-okasaki-purely-functional-random-access-lists/Sun, 01 Oct 1995 18:33:23 +0100massimo.nocentini@gmail.com (Massimo Nocentini)https://massimo-nocentini.github.io/post/1995-10-01-okasaki-purely-functional-random-access-lists/Okasaki introduces purely functional random-access lists, a data structure that combines constant-time list operations with logarithmic lookup and update, offering an efficient persistent alternative to arrays in functional programs.