<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Lists on Massimo Nocentini</title><link>https://massimo-nocentini.github.io/tags/lists/</link><description>Recent content in Lists on Massimo Nocentini</description><generator>Hugo</generator><language>en</language><managingEditor>massimo.nocentini@gmail.com (Massimo Nocentini)</managingEditor><webMaster>massimo.nocentini@gmail.com (Massimo Nocentini)</webMaster><lastBuildDate>Sun, 01 Oct 1995 18:33:23 +0100</lastBuildDate><atom:link href="https://massimo-nocentini.github.io/tags/lists/index.xml" rel="self" type="application/rss+xml"/><item><title>Purely functional random-access lists</title><link>https://massimo-nocentini.github.io/post/1995-10-01-okasaki-purely-functional-random-access-lists/</link><pubDate>Sun, 01 Oct 1995 18:33:23 +0100</pubDate><author>massimo.nocentini@gmail.com (Massimo Nocentini)</author><guid>https://massimo-nocentini.github.io/post/1995-10-01-okasaki-purely-functional-random-access-lists/</guid><description>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.</description></item></channel></rss>