Generate.

Author: arthurgleckler

index.html

@@ -82,12 +82,11 @@ <h2>Abstract</h2>      <p>This SRFI describes a set of syntax extensions
       humans to read. The sweet-expression syntax enables the use of
       syntactically-meaningful indentation to group expressions (similar to
       Python), and it builds on the infix and traditional function notation
-      defined in <a href="/srfi-105/">SRFI-105 (curly-infix-expressions)</a>.
+      defined in <a href="https://srfi.schemers.org/srfi-105/">SRFI-105 (curly-infix-expressions)</a>.
       Unlike nearly all past efforts to improve s-expression readability,
       sweet-expressions are general (the notation is independent from any
       underlying semantic) and homoiconic (the underlying data structure is
-      clear from the syntax). This notation was developed by the “<a href=
-      "http://readable.sourceforge.net/">Readable Lisp S-expressions
+      clear from the syntax). This notation was developed by the “<a href="http://readable.sourceforge.net/">Readable Lisp S-expressions
       Project</a>” and can be used for both programs and data.
       <p>Sweet-expressions can be considered a set of
       additional abbreviations, just as <code>'x</code> already abbreviates