File: srfi-11.html

package info (click to toggle)
drscheme 1%3A352-6
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k
  • size: 71,608 kB
  • ctags: 55,284
  • sloc: ansic: 278,966; cpp: 63,318; sh: 32,265; lisp: 14,530; asm: 7,327; makefile: 4,846; pascal: 4,363; perl: 2,920; java: 1,632; yacc: 755; lex: 258; sed: 93; xml: 12
file content (184 lines) | stat: -rw-r--r-- 6,178 bytes parent folder | download | duplicates (11)
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
<!DOCTYPE HTML PUBLIC "-//IETF//DTD HTML//EN">
<html>
  <head>
    <title>SRFI 11: Syntax for receiving multiple values</title>
  </head>

  <body>

<H1>Title</H1>

SRFI 11: Syntax for receiving multiple values

<H1>Author</H1>

Lars T Hansen

<H1>Status</H1>
This SRFI is currently in ``final'' status.  To see an explanation of each status 
that a SRFI can hold, see <A HREF="http://srfi.schemers.org/srfi-process.html">here</A>.
You can access the discussion via <A HREF="http://srfi.schemers.org/srfi-11/mail-archive/maillist.html">the archive of 
the mailing list</A>.
<P><UL>
<LI>Received: 1999/09/10
<LI>Draft: 1999/09/14-1999/11/12
<LI>Revised: 1999/11/01
<LI>Revised: 2000/03/15
<LI>Final: 2000/03/15
</UL>

<H1>Abstract</H1>

The SRFI introduces syntactic forms LET-VALUES and LET*-VALUES that bind the values of
expressions that return multiple values.

<H1>Issues</H1>

None.

<H1>Rationale</H1>

LET-VALUES and LET*-VALUES reduce the clutter of the CALL-WITH-VALUES notation for
receiving multiple values.


<H1>Specification</H1>

<dl>
<dt><a name="let-values"></a>
<tt>(LET-VALUES ((&lt;formals&gt; &lt;expression&gt;) ...) &lt;body&gt;)</tt>
<br>Syntax
<dd>
<p>Each &lt;formals&gt; should be a formal arguments list as for a LAMBDA 
   expression, cf section 4.1.4 of the R5RS.</p>

<p>The &lt;expression&gt;s are evaluated in the current environment, the 
   variables of the &lt;formals&gt; are bound to fresh locations, the return 
   values of the &lt;expression&gt;s are stored in the variables, the &lt;body&gt; 
   is evaluated in the extended environment, and the values of the
   last expression of &lt;body&gt; are returned.  The &lt;body&gt; is a 
   &lt;tail body&gt;, cf section 3.5 of the R5RS.</p>

<p>The matching of each &lt;formals&gt; to values is as for the matching of 
   &lt;formals&gt; to arguments in a LAMBDA expression, and it is an
   error for an &lt;expression&gt; to return a number of values that does
   not match its corresponding &lt;formals&gt;.</p>

<p>
<pre>
             (let-values (((a b . c) (values 1 2 3 4)))
               (list a b c))            --&gt; (1 2 (3 4))

             (let ((a 'a) (b 'b) (x 'x) (y 'y))
               (let-values (((a b) (values x y))
                            ((x y) (values a b)))
                 (list a b x y)))       --&gt; (x y a b)
</pre>
</p>

<dt><a name="let*-values"></a>
<tt>(LET*-VALUES ((&lt;formals&gt; &lt;expression&gt;) ...) &lt;body&gt;)</tt>
<br>Syntax
<dd>
<p>Each &lt;formals&gt; should be a formal arguments list as for a LAMBDA 
   expression, cf section 4.1.4 of the R5RS.</p>

<p>LET*-VALUES is similar to LET-VALUES, but the bindings are performed
   sequentially from left to right, and the region of a binding indicated
   by (&lt;formals&gt; &lt;expression&gt;) is that part of the LET*-VALUES
   expression to the right of the binding.  Thus the second binding is done in
   an environment in which the first binding is visible, and so on.</p>

<p>
<pre>
             (let ((a 'a) (b 'b) (x 'x) (y 'y))
               (let*-values (((a b) (values x y))
                             ((x y) (values a b)))
                 (list a b x y)))       --&gt; (x y x y)
</pre>
</p>
</dl>

<H1>Implementation</H1>

The following implementation is written in R5RS Scheme.  It is not
compatible with the IEEE Scheme standard because the IEEE standard does
not contain the high-level macro system.

<p>The implementation assumes that some top-level names defined by the
R5RS are bound to their original values.

<p>
<pre>
;; This code is in the public domain.

(define-syntax let-values
  (syntax-rules ()
    ((let-values (?binding ...) ?body0 ?body1 ...)
     (let-values "bind" (?binding ...) () (begin ?body0 ?body1 ...)))
    
    ((let-values "bind" () ?tmps ?body)
     (let ?tmps ?body))
    
    ((let-values "bind" ((?b0 ?e0) ?binding ...) ?tmps ?body)
     (let-values "mktmp" ?b0 ?e0 () (?binding ...) ?tmps ?body))
    
    ((let-values "mktmp" () ?e0 ?args ?bindings ?tmps ?body)
     (call-with-values 
       (lambda () ?e0)
       (lambda ?args
         (let-values "bind" ?bindings ?tmps ?body))))
    
    ((let-values "mktmp" (?a . ?b) ?e0 (?arg ...) ?bindings (?tmp ...) ?body)
     (let-values "mktmp" ?b ?e0 (?arg ... x) ?bindings (?tmp ... (?a x)) ?body))
    
    ((let-values "mktmp" ?a ?e0 (?arg ...) ?bindings (?tmp ...) ?body)
     (call-with-values
       (lambda () ?e0)
       (lambda (?arg ... . x)
         (let-values "bind" ?bindings (?tmp ... (?a x)) ?body))))))

(define-syntax let*-values
  (syntax-rules ()
    ((let*-values () ?body0 ?body1 ...)
     (begin ?body0 ?body1 ...))

    ((let*-values (?binding0 ?binding1 ...) ?body0 ?body1 ...)
     (let-values (?binding0)
       (let*-values (?binding1 ...) ?body0 ?body1 ...)))))
</pre>

<H1>Copyright</H1>
<p>Copyright (C) Lars T Hansen (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-editors@srfi.schemers.org">Mike Sperber</a></address>
<!-- Created: Tue Sep 29 19:20:08 EDT 1998 -->
<!-- hhmts start -->
Last modified: Tue Sep 28 10:59:57 MST 2004
<!-- hhmts end -->
  </body>
</html>