Update abstract for SRFI 261.

Author: arthurgleckler

admin/abstracts/261.html

@@ -1,5 +1,6 @@
 <p>This SRFI proposal addresses systemic compatibility issues exposed by
-the library reference format defined in SRFI 97
+the <a href="https://srfi.schemers.org/srfi-97">SRFI-97</a>-defined library reference format
 <code>(srfi :&lt;SRFI number&gt; &lt;identifier&gt; ...)</code> and
-advocates for a modernized, portable alternative:
-<code>(srfi srfi-&lt;SRFI number&gt;  &lt;identifier&gt; ...)</code>.</p>
+advocates for two more modernized, portable and readable alternatives:
+<code>(srfi srfi-&lt;SRFI number&gt;)</code> and
+<code>(srfi &lt;identifier&gt;-&lt;SRFI number&gt;)</code>.</p>

index.html

@@ -36,7 +36,7 @@ <h2>The SRFIs</h2><noscript>
             <li class="card draft"><a class="card-anchor" href="srfi-262/"></a><a href="srfi-262/"><span class="number">262</span></a>: <span class="name">Extensible pattern matcher</span><span class="authors">, by Daphne Preston-Kendal</span><span class="based-on"></span><span class="date-group">Draft: <span class="date">2025-05-07</span></span><span class="keywords" data-keywords="pattern-matching">Keywords: <a href="https://srfi.schemers.org/?keywords=pattern-matching">Pattern Matching</a></span><span class="status" data-status="draft"></span><span class="see-also">See also <a href="/srfi-200/">SRFI 200: Pattern Matching</a>, <a href="/srfi-204/">SRFI 204: Wright-Cartwright-Shinn Pattern Matcher</a>, <a href="/srfi-241/">SRFI 241: Match — Simple Pattern-Matching Syntax to Express Catamorphisms on Scheme Data</a>, and <a href="/srfi-257/">SRFI 257: Simple extendable pattern matcher with backtracking</a>.</span>
               <div class="abstract"><p>A pattern matching form which can operate on arbitrary Scheme values is defined. It conforms to the following design principles.</p>  <p>The syntax of patterns is declarative. The syntax is extensible in the same way that Scheme’s procedural syntax is extensible by macros.</p>  <p>For most use cases, the use of the pattern matcher should produce code which is essentially as efficient at run time as equivalent procedural Scheme code would be, assuming a moderately optimizing Scheme implementation. This applies only when the equivalent code is also equivalently correct in terms of handling of error cases (i.e.&nbsp;including all type checks done automatically by the pattern matcher). However, using extension syntax should not cause this principle to be violated (provided the extension syntax is appropriately implemented).</p></div></li>
             <li class="card draft"><a class="card-anchor" href="srfi-261/"></a><a href="srfi-261/"><span class="number">261</span></a>: <span class="name">Portable SRFI Library Reference</span><span class="authors">, by WANG Zheng</span><span class="based-on"></span><span class="date-group">Draft: <span class="date">2025-05-07</span></span><span class="keywords" data-keywords="modules">Keywords: <a href="https://srfi.schemers.org/?keywords=modules">Modules</a></span><span class="status" data-status="draft"></span><span class="see-also">See also <a href="/srfi-97/">SRFI 97: SRFI Libraries</a>.</span>
-              <div class="abstract"><p>This SRFI proposal addresses systemic compatibility issues exposed by the library reference format defined in SRFI 97 <code>(srfi :&lt;SRFI number&gt; &lt;identifier&gt; ...)</code> and advocates for a modernized, portable alternative: <code>(srfi srfi-&lt;SRFI number&gt;  &lt;identifier&gt; ...)</code>.</p></div></li>
+              <div class="abstract"><p>This SRFI proposal addresses systemic compatibility issues exposed by the <a href="https://srfi.schemers.org/srfi-97">SRFI-97</a>-defined library reference format <code>(srfi :&lt;SRFI number&gt; &lt;identifier&gt; ...)</code> and advocates for two more modernized, portable and readable alternatives: <code>(srfi srfi-&lt;SRFI number&gt;)</code> and <code>(srfi &lt;identifier&gt;-&lt;SRFI number&gt;)</code>.</p></div></li>
             <li class="card final"><a class="card-anchor" href="srfi-260/"></a><a href="srfi-260/"><span class="number">260</span></a>: <span class="name">Generated Symbols</span><span class="authors">, by Marc Nieper-Wißkirchen</span><span class="based-on"></span><span class="date-group">Final: <span class="date">2025-05-07</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-258/">SRFI 258: Uninterned symbols</a>.</span>
               <div class="abstract"><p>This SRFI defines the procedure <code>generate-symbol</code>. Each time it is invoked, the procedure returns a new symbol whose name cannot be guessed. The returned symbol is a standard symbol for all purposes; it obeys write/read invariance and it is equal to another symbol if and only if their names are spelled the same.</p></div></li>
             <li class="card final"><a class="card-anchor" href="srfi-259/"></a><a href="srfi-259/"><span class="number">259</span></a>: <span class="name">Tagged procedures with type safety</span><span class="authors">, by Daphne Preston-Kendal</span><span class="based-on"></span><span class="date-group">Final: <span class="date">2025-05-07</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="library-name">Library name: tagged-procedures</span><span class="status" data-status="final"></span><span class="see-also">See also <a href="/srfi-229/">SRFI 229: Tagged Procedures</a>.</span>