Finalize SRFI 240.

Author: arthurgleckler

admin/srfi-data.scm

@@ -2083,12 +2083,13 @@
  (draft-date "2022-11-04")
  (done-date "2023-01-23"))
 ((number 240)
- (status draft)
+ (status final)
  (title "Reconciled Records")
  (author "Marc Nieper-Wißkirchen")
  (see-also 9 57 76 99 131 136 150 237)
  (keywords data-structure)
- (draft-date "2022-11-05"))
+ (draft-date "2022-11-05")
+ (done-date "2023-05-02"))
 ((number 241)
  (status final)
  (title "Match — Simple Pattern-Matching Syntax to Express Catamorphisms on Scheme Data")

index.html

@@ -39,8 +39,8 @@ <h2>The SRFIs</h2><noscript>
               <div class="abstract">    <p>This SRFI defines a language to describe control-flow graphs       (CFGs) suitable for formulating iterative and recursive       algorithms.  Using the notion of a CFG term, this language can       be seamlessly embedded in the Scheme language.  Complex CFG       terms can be composed from simple CFG terms.</p></div></li>
             <li class="card final"><a class="card-anchor" href="srfi-241/"></a><a href="srfi-241/"><span class="number">241</span></a>: <span class="name">Match — Simple Pattern-Matching Syntax to Express Catamorphisms on Scheme Data</span><span class="authors">, by Marc Nieper-Wißkirchen</span><span class="based-on"></span><span class="date-group">Final: <span class="date">2023-03-23</span></span><span class="keywords" data-keywords="pattern-matching,syntax">Keywords: <a href="https://srfi.schemers.org/?keywords=pattern-matching">Pattern Matching</a>, <a href="https://srfi.schemers.org/?keywords=syntax">Syntax</a></span><span class="library-name">Library name: match</span><span class="status" data-status="final"></span><span class="see-also">See also <a href="/srfi-200/">SRFI 200: Pattern Matching</a> and <a href="/srfi-204/">SRFI 204: Wright-Cartwright-Shinn Pattern Matcher</a>.</span>
               <div class="abstract">    <p>       This SRFI describes a simple pattern matcher based on one       originally devised by Kent Dybvig, Dan Friedman, and Eric       Hilsdale, which has a catamorphism feature to perform recursion       automatically.     </p></div></li>
-            <li class="card draft"><a class="card-anchor" href="srfi-240/"></a><a href="srfi-240/"><span class="number">240</span></a>: <span class="name">Reconciled Records</span><span class="authors">, by Marc Nieper-Wißkirchen</span><span class="based-on"></span><span class="date-group">Draft: <span class="date">2022-11-05</span></span><span class="keywords" data-keywords="data-structure">Keywords: <a href="https://srfi.schemers.org/?keywords=data-structure">Data Structure</a></span><span class="status" data-status="draft"></span><span class="see-also">See also <a href="/srfi-9/">SRFI 9: Defining Record Types</a>, <a href="/srfi-57/">SRFI 57: Records</a>, <a href="/srfi-76/">SRFI 76: R6RS Records</a>, <a href="/srfi-99/">SRFI 99: ERR5RS Records</a>, <a href="/srfi-131/">SRFI 131: ERR5RS Record Syntax (reduced)</a>, <a href="/srfi-136/">SRFI 136: Extensible record types</a>, <a href="/srfi-150/">SRFI 150: Hygienic ERR5RS Record Syntax (reduced)</a>, and <a href="/srfi-237/">SRFI 237: R6RS Records (refined)</a>.</span>
-              <div class="abstract">    <p>This SRFI defines a version of       the <code>define-record-type</code> definition       of <code>R<sup>6</sup>RS</code>       and <a href="https://srfi.schemers.org/srfi-237/srfi-237.html">SRFI       237</a> that extends the <code>define-record-type</code> syntax       of <code>R<sup>7</sup>RS</code>, reconciling both systems.</p>      <p>This SRFI is meant to be adopted by R<sup>7</sup>RS-large to       integrate essentially the R<sup>6</sup>RS record system       compatibly with the existing R<sup>7</sup>RS-small record       system.</p></div></li>
+            <li class="card final"><a class="card-anchor" href="srfi-240/"></a><a href="srfi-240/"><span class="number">240</span></a>: <span class="name">Reconciled Records</span><span class="authors">, by Marc Nieper-Wißkirchen</span><span class="based-on"></span><span class="date-group">Final: <span class="date">2023-05-02</span></span><span class="keywords" data-keywords="data-structure">Keywords: <a href="https://srfi.schemers.org/?keywords=data-structure">Data Structure</a></span><span class="status" data-status="final"></span><span class="see-also">See also <a href="/srfi-9/">SRFI 9: Defining Record Types</a>, <a href="/srfi-57/">SRFI 57: Records</a>, <a href="/srfi-76/">SRFI 76: R6RS Records</a>, <a href="/srfi-99/">SRFI 99: ERR5RS Records</a>, <a href="/srfi-131/">SRFI 131: ERR5RS Record Syntax (reduced)</a>, <a href="/srfi-136/">SRFI 136: Extensible record types</a>, <a href="/srfi-150/">SRFI 150: Hygienic ERR5RS Record Syntax (reduced)</a>, and <a href="/srfi-237/">SRFI 237: R6RS Records (refined)</a>.</span>
+              <div class="abstract">    <p>This SRFI defines a version of       the <code>define-record-type</code> definition       of <code>R<sup>6</sup>RS</code>       and <a href="https://srfi.schemers.org/srfi-237/">SRFI       237</a> that extends the <code>define-record-type</code> syntax       of <code>R<sup>7</sup>RS</code>, reconciling both systems.</p>      <p>This SRFI is meant to be adopted by R<sup>7</sup>RS-large to       integrate essentially the R<sup>6</sup>RS record system       compatibly with the existing R<sup>7</sup>RS-small record       system.</p></div></li>
             <li class="card final"><a class="card-anchor" href="srfi-239/"></a><a href="srfi-239/"><span class="number">239</span></a>: <span class="name">Destructuring Lists</span><span class="authors">, by Marc Nieper-Wißkirchen</span><span class="based-on"></span><span class="date-group">Final: <span class="date">2023-01-23</span></span><span class="keywords" data-keywords="syntax">Keywords: <a href="https://srfi.schemers.org/?keywords=syntax">Syntax</a></span><span class="library-name">Library name: list-case</span><span class="status" data-status="final"></span>
               <div class="abstract">    <p>This SRFI provides the <code>list-case</code>, the       syntactic fundamental list destructor.</p></div></li>
             <li class="card final"><a class="card-anchor" href="srfi-238/"></a><a href="srfi-238/"><span class="number">238</span></a>: <span class="name">Codesets</span><span class="authors">, by Lassi Kortela</span><span class="based-on"></span><span class="date-group">Final: <span class="date">2023-01-16</span></span><span class="keywords" data-keywords="operating-system,error-handling,introspection">Keywords: <a href="https://srfi.schemers.org/?keywords=operating-system">Operating System</a>, <a href="https://srfi.schemers.org/?keywords=error-handling">Error Handling</a>, <a href="https://srfi.schemers.org/?keywords=introspection">Introspection</a></span><span class="library-name">Library name: codesets</span><span class="status" data-status="final"></span><span class="see-also">See also <a href="/srfi-170/">SRFI 170: POSIX API</a>, <a href="/srfi-198/">SRFI 198: Foreign Interface Status</a>, and <a href="/srfi-199/">SRFI 199: POSIX errno manipulation</a>.</span>

srfi.rss

@@ -3,7 +3,17 @@
       and record constructor descriptors can be effectively ignored
       and replaced with the single notion of a record descriptor.  We
       also remove the restriction that the syntactic layer can only
-      define one constructor per record type defined.&lt;/p>&lt;/blockquote></description><dc:creator>Marc Nieper-Wißkirchen</dc:creator><pubDate>Tue, 02 May 2023 12:00:00 -0800</pubDate></item><item><title>SRFI 153: Ordered Sets</title><link>https://srfi.schemers.org/srfi-153/</link><guid>https://srfi.schemers.org/srfi-153</guid><description>SRFI 153 is now in &lt;em>final&lt;/em> status.&lt;blockquote>&lt;p>&lt;em>Osets&lt;/em> are immutable collections that can contain any Scheme objects as long as a total order exists among the objects.  Osets enforce the constraint that no two elements can be the same in the sense of the oset's associated &lt;em>equality predicate&lt;/em>. The elements in an oset appear in a fixed order determined by the comparator used to create it.&lt;/p>&lt;/blockquote></description><dc:creator>John Cowan</dc:creator><pubDate>Mon, 01 May 2023 12:00:00 -0800</pubDate></item><item><title>SRFI 226: Control Features</title><link>https://srfi.schemers.org/srfi-226/</link><guid>https://srfi.schemers.org/srfi-226</guid><description>SRFI 226 is now in &lt;em>final&lt;/em> status.&lt;blockquote>    &lt;p>Whenever an expression is evaluated during the run of a Scheme program,
+      define one constructor per record type defined.&lt;/p>&lt;/blockquote></description><dc:creator>Marc Nieper-Wißkirchen</dc:creator><pubDate>Tue, 02 May 2023 12:00:00 -0800</pubDate></item><item><title>SRFI 240: Reconciled Records</title><link>https://srfi.schemers.org/srfi-240/</link><guid>https://srfi.schemers.org/srfi-240</guid><description>SRFI 240 is now in &lt;em>final&lt;/em> status.&lt;blockquote>    &lt;p>This SRFI defines a version of
+      the &lt;code>define-record-type&lt;/code> definition
+      of &lt;code>R&lt;sup>6&lt;/sup>RS&lt;/code>
+      and &lt;a href="https://srfi.schemers.org/srfi-237/">SRFI
+      237&lt;/a> that extends the &lt;code>define-record-type&lt;/code> syntax
+      of &lt;code>R&lt;sup>7&lt;/sup>RS&lt;/code>, reconciling both systems.&lt;/p>
+
+    &lt;p>This SRFI is meant to be adopted by R&lt;sup>7&lt;/sup>RS-large to
+      integrate essentially the R&lt;sup>6&lt;/sup>RS record system
+      compatibly with the existing R&lt;sup>7&lt;/sup>RS-small record
+      system.&lt;/p>&lt;/blockquote></description><dc:creator>Marc Nieper-Wißkirchen</dc:creator><pubDate>Tue, 02 May 2023 12:00:00 -0800</pubDate></item><item><title>SRFI 153: Ordered Sets</title><link>https://srfi.schemers.org/srfi-153/</link><guid>https://srfi.schemers.org/srfi-153</guid><description>SRFI 153 is now in &lt;em>final&lt;/em> status.&lt;blockquote>&lt;p>&lt;em>Osets&lt;/em> are immutable collections that can contain any Scheme objects as long as a total order exists among the objects.  Osets enforce the constraint that no two elements can be the same in the sense of the oset's associated &lt;em>equality predicate&lt;/em>. The elements in an oset appear in a fixed order determined by the comparator used to create it.&lt;/p>&lt;/blockquote></description><dc:creator>John Cowan</dc:creator><pubDate>Mon, 01 May 2023 12:00:00 -0800</pubDate></item><item><title>SRFI 226: Control Features</title><link>https://srfi.schemers.org/srfi-226/</link><guid>https://srfi.schemers.org/srfi-226</guid><description>SRFI 226 is now in &lt;em>final&lt;/em> status.&lt;blockquote>    &lt;p>Whenever an expression is evaluated during the run of a Scheme program,
     there is a continuation awaiting the values of the expression. It is a
     distinguishing property of the Scheme programming language to offer a
     procedure (named &lt;code>call/cc&lt;/code>) that captures the current
@@ -128,17 +138,7 @@ and reduce the need for ad hoc lambdas.&lt;/p>&lt;/blockquote></description><dc:
       (CFGs) suitable for formulating iterative and recursive
       algorithms.  Using the notion of a CFG term, this language can
       be seamlessly embedded in the Scheme language.  Complex CFG
-      terms can be composed from simple CFG terms.&lt;/p>&lt;/blockquote></description><dc:creator>Marc Nieper-Wißkirchen</dc:creator><pubDate>Fri, 11 Nov 2022 12:00:00 -0800</pubDate></item><item><title>SRFI 240: Reconciled Records</title><link>https://srfi.schemers.org/srfi-240/</link><guid>https://srfi.schemers.org/srfi-240</guid><description>SRFI 240 is now in &lt;em>draft&lt;/em> status.&lt;blockquote>    &lt;p>This SRFI defines a version of
-      the &lt;code>define-record-type&lt;/code> definition
-      of &lt;code>R&lt;sup>6&lt;/sup>RS&lt;/code>
-      and &lt;a href="https://srfi.schemers.org/srfi-237/srfi-237.html">SRFI
-      237&lt;/a> that extends the &lt;code>define-record-type&lt;/code> syntax
-      of &lt;code>R&lt;sup>7&lt;/sup>RS&lt;/code>, reconciling both systems.&lt;/p>
-
-    &lt;p>This SRFI is meant to be adopted by R&lt;sup>7&lt;/sup>RS-large to
-      integrate essentially the R&lt;sup>6&lt;/sup>RS record system
-      compatibly with the existing R&lt;sup>7&lt;/sup>RS-small record
-      system.&lt;/p>&lt;/blockquote></description><dc:creator>Marc Nieper-Wißkirchen</dc:creator><pubDate>Sat, 05 Nov 2022 12:00:00 -0800</pubDate></item><item><title>SRFI 233: INI files</title><link>https://srfi.schemers.org/srfi-233/</link><guid>https://srfi.schemers.org/srfi-233</guid><description>SRFI 233 is now in &lt;em>final&lt;/em> status.&lt;blockquote>&lt;p>An INI file is a configuration file that consists of key-value
+      terms can be composed from simple CFG terms.&lt;/p>&lt;/blockquote></description><dc:creator>Marc Nieper-Wißkirchen</dc:creator><pubDate>Fri, 11 Nov 2022 12:00:00 -0800</pubDate></item><item><title>SRFI 233: INI files</title><link>https://srfi.schemers.org/srfi-233/</link><guid>https://srfi.schemers.org/srfi-233</guid><description>SRFI 233 is now in &lt;em>final&lt;/em> status.&lt;blockquote>&lt;p>An INI file is a configuration file that consists of key-value
 pairs for properties, and sections that group the properties. The
 name of these configuration files comes from the filename extension
 &lt;code>INI&lt;/code>, short for initialization.