-
Notifications
You must be signed in to change notification settings - Fork 2
/
index.html
32 lines (32 loc) · 3.86 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
<!DOCTYPE html>
<html>
<head>
<!-- SPDX-FileCopyrightText: 2024 Arthur A. Gleckler -->
<!-- SPDX-License-Identifier: MIT -->
<title>Purely Functional Random-Access Pairs and Lists</title>
<link href="/admin.css" rel="stylesheet">
<link href="/list.css" rel="stylesheet">
<link href="/favicon.png" rel="icon" sizes="192x192" type="image/png">
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1">
<script type="text/x-mathjax-config">MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\(','\\)']]}});</script>
<script crossorigin="anonymous" integrity="sha384-Ra6zh6uYMmH5ydwCqqMoykyf1T/+ZcnOQfFPhDrp2kI4OIxadnhsvvA2vv9A7xYv" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script></head>
<body>
<h1>SRFI 101: Purely Functional Random-Access Pairs and Lists</h1>
<p class="authors">by David Van Horn</p>
<p class="based-on"></p>
<p class="status">status: <em>final</em> (2013-02-24)</p>
<p class="keywords">keywords: <a href="https://srfi.schemers.org/?keywords=data-structure">Data Structure</a>, <a href="https://srfi.schemers.org/?keywords=r7rs-large">R7RS Large</a>, <a href="https://srfi.schemers.org/?keywords=r7rs-large-red">R7RS Large: Red Edition</a></p>
<ul class="info">
<li><a href="srfi-101.html">The SRFI Document</a></li>
<li><a href="https://srfi-email.schemers.org/srfi-101/">Discussion Archive</a></li>
<li><a href="https://github.com/scheme-requests-for-implementation/srfi-101">Git repo (on GitHub)</a></li>
<li><a href="mailto:srfi-101@srfi.schemers.org">srfi-101@<span class="antispam">nospam</span>srfi.schemers.org (subscribers only)</a></li>
<li><span class="firefox-column-workaround">
<form method="POST" action="https://www.simplelists.com/subscribe.php">
<div class="title">Subscribe to srfi-101 mailing list</div><input name="email" placeholder="email address" tabindex="1" type="email"><input name="name" placeholder="full name" tabindex="2" type="text">
<p><input id="sub-digest" name="digest" tabindex="3" type="checkbox" value="digest"><label for="sub-digest">daily digest?</label></p><input class="submit" name="submit" tabindex="4" type="submit" value="Subscribe to srfi-101"><input type="hidden" name="action" value="subscribe"><input type="hidden" name="list" value="srfi-101@srfi.schemers.org"></form></span></li>
<li><span class="firefox-column-workaround">
<form method="POST" action="https://www.simplelists.com/subscribe.php">
<div class="title">Unsubscribe from srfi-101 mailing list</div><input name="email" placeholder="email address" tabindex="5" type="email"><input class="submit" name="submit" tabindex="6" type="submit" value="Unsubscribe from srfi-101"><input type="hidden" name="action" value="unsubscribe"><input name="list" type="hidden" value="srfi-101@srfi.schemers.org"></form></span></li></ul>
<h2>Abstract</h2> <p>Random-access lists [1] are a purely functional data structure for representing lists of values. A random-access list may act as a drop in replacement for the usual linear-access pair and list data structures (<code>pair?</code>, <code>cons</code>, <code>car</code>, <code>cdr</code>), which additionally supports fast index-based addressing and updating (<code>list-ref</code>, <code>list-set</code>). The impact is a whole class of purely-functional algorithms expressed in terms of index-based list addressing become feasible compared with their linear-access list counterparts. <p>This document proposes a library API for purely functional random-access lists consistent with the R<sup>6</sup>RS [2] base library and list utility standard library [3].</body></html>