This repository was archived by the owner on Oct 5, 2024. It is now read-only.
forked from scheme-requests-for-implementation/srfi-8
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsrfi-8.html
218 lines (186 loc) · 8.14 KB
/
srfi-8.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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
<!DOCTYPE html PUBLIC "-//IETF//DTD HTML 3.2//EN" "http://www.w3.org/TR/HTML32.dtd">
<html lang="en">
<head>
<title>SRFI 8: RECEIVE: Binding to multiple values</title>
<meta charset="utf-8" />
<meta content="width=device-width, initial-scale=1" name="viewport" />
<link href="https://srfi.schemers.org/srfi.css" rel="stylesheet" type="text/css" />
<link href="/favicon.png" rel="icon" sizes="192x192" type="image/png" />
</head>
<body>
<h1><a href="https://srfi.schemers.org/"><img alt="SRFI surfboard logo" class="srfi-logo" src="https://srfi.schemers.org/srfi-logo.svg" /></a>8: <code>receive</code>: Binding to multiple values</h1>
<p>by John David Stone<br />
Department of Mathematics and Computer Science, Grinnell College, Grinnell, Iowa 50112,
<a href="mailto:[email protected]">email</a>.
</p>
<h2>Status</h2>
<p>This SRFI is currently in <em>final</em> status. Here is <a href="https://srfi.schemers.org/srfi-process.html">an explanation</a> of each status that a SRFI can hold. To provide input on this SRFI, please send email to <code><a href="mailto:srfi+minus+8+at+srfi+dotschemers+dot+org">srfi-8@<span class="antispam">nospam</span>srfi.schemers.org</a></code>. To subscribe to the list, follow <a href="https://srfi.schemers.org/srfi-list-subscribe.html">these instructions</a>. You can access previous messages via the mailing list <a href="https://srfi-email.schemers.org/srfi-8">archive</a>.</p>
<ul>
<li>Received: 1999-05-27
</li><li>Draft: 1999-07-01--1999-08-30
</li><li>Final: 1999-08-30
</li></ul>
<h2>Related SRFIs</h2>
<p>
The syntax proposed in this SRFI is used in the reference implementation of
<a href="../srfi-1/">SRFI-1</a>, “List library.”
</p>
<h2>Abstract</h2>
<p>
The only mechanism that R<sup>5</sup>RS provides for binding identifiers to
the values of a multiple-valued expression is the primitive
<code>call-with-values</code>. This SRFI proposes a more concise, more
readable syntax for creating such bindings.
</p>
<h2>Rationale</h2>
<p>
Although R<sup>5</sup>RS supports multiple-valued expressions, it provides
only the essential procedures <code>values</code> and
<code>call-with-values</code>. It is evident that the authors expected
Scheme programmers to define other constructs in terms of these,
abstracting common patterns of use.
</p>
<p>
One such pattern consists in binding an identifier to each of the values of
a multiple-valued expression and then evaluating an expression in the scope
of the bindings. As an instance of this pattern, consider the following
excerpt from a quicksort procedure:
</p>
<pre>
<code>
(call-with-values
(lambda ()
(partition (precedes pivot) others))
(lambda (fore aft)
(append (qsort fore) (cons pivot (qsort aft)))))
</code>
</pre>
<p>
Here <code>partition</code> is a multiple-valued procedure that takes two
arguments, a predicate and a list, and returns two lists, one comprising
the list elements that satisfy the predicate, the other those that do not.
The purpose of the expression shown is to partition the list
<code>others</code>, sort each of the sublists, and recombine the results
into a sorted list.
</p>
<p>
For our purposes, the important step is the binding of the identifiers
<code>fore</code> and <code>aft</code> to the values returned by
<code>partition</code>. Expressing the construction and use of these
bindings with the <code>call-by-values</code> primitive is cumbersome: One
must explicitly embed the expression that provides the values for the
bindings in a parameterless procedure, and one must explicitly embed the
expression to be evaluated in the scope of those bindings in another
procedure, writing as its parameters the identifiers that are to be bound
to the values received.
</p>
<p>
These embeddings are boilerplate, exposing the underlying binding mechanism
but not revealing anything relevant to the particular program in which it
occurs. So the use of a syntactic abstraction that exposes only the
interesting parts -- the identifiers to be bound, the multiple-valued
expression that supplies the values, and the body of the receiving
procedure -- makes the code more concise and more readable:
</p>
<pre>
<code>
(receive (fore aft) (partition (precedes pivot) others)
(append (qsort fore) (cons pivot (qsort aft))))
</code>
</pre>
<p>
The advantages are similar to those of a <code>let</code>-expression over a
procedure call with a <code>lambda</code>-expression as its operator. In
both cases, cleanly separating a “header” in which the bindings are
established from a “body” in which they are used makes it easier to
follow the code.
</p>
<h2 id="receive">Specification</h2>
<p>
<code>(receive</code> <formals> <expression>
<body><code>)</code> library syntax
</p>
<p>
<Formals>, <expression>, and <body> are as described in
R<sup>5</sup>RS. Specifically, <formals> can have any of three
forms:
</p>
<ul>
<li><p>
<code>(</code><variable<sub>1</sub>> <code>...</code>
<variable<sub><i>n</i></sub>><code>)</code>: The environment in which
the <code>receive</code>-expression is evaluated is extended by binding
<variable<sub>1</sub>>, ...,
<variable<sub><i>n</i></sub>> to fresh locations. The
<expression> is evaluated, and its values are stored into those
locations. (It is an error if <expression> does not have exactly
<i>n</i> values.)
</p></li>
<li><p>
<variable>: The environment in which the
<code>receive</code>-expression is evaluated is extended by binding
<variable> to a fresh location. The <expression> is evaluated,
its values are converted into a newly allocated list, and the list is
stored in the location bound to <variable>.
</p></li>
<li><p>
<code>(</code><variable<sub>1</sub>> <code>...</code>
<variable<sub><i>n</i></sub>> . <variable<sub><i>n</i> +
1</sub>><code>)</code>: The environment in which
the <code>receive</code>-expression is evaluated is extended by binding
<variable<sub>1</sub>>, ...,
<variable<sub><i>n</i> + 1</sub>> to fresh locations. The
<expression> is evaluated. Its first <i>n</i> values are stored into
the locations bound to <variable<sub>1</sub>> <code>...</code>
<variable<sub><i>n</i></sub>>. Any remaining values are converted
into a newly allocated list, which is stored into the location bound to
<variable<sub><i>n</i> + 1</sub>>. (It is an error if
<expression> does not have at least
<i>n</i> values.)
</p></li>
</ul>
<p>
In any case, the expressions in <body> are evaluated sequentially in
the extended environment. The results of the last expression in the body
are the values of the <code>receive</code>-expression.
</p>
<h2>Reference implementation</h2>
<pre>
<code>
(define-syntax receive
(syntax-rules ()
((receive formals expression body ...)
(call-with-values (lambda () expression)
(lambda formals body ...)))))
</code>
</pre>
<hr />
<p>
Copyright (C) John David Stone (1999). All Rights Reserved.
</p>
<p>
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
</p>
<p>
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
</p>
<p>
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
</p>
<hr />
<address>Editor: <a href="mailto:srfi%20minus%20editors%20at%20srfi%20dot%20schemers%20dot%20org">Mike Sperber</a></address>
</body>
</html>