update cslib

Author: twwar

math.html

@@ -37,7 +37,7 @@ <h1>Mathematics</h1>
 
   <li>A talk, given to a general audience, giving a brief history of the connection between proof theory and computation: <a href="https://thomaskwaring.github.io/proofs-computation-notes.pdf">notes</a>, and <a href="https://thomaskwaring.github.io/proofs-computation-slides.pdf">slides</a>. Given at il Collegio Universitario "Lamaro Pozziani" (February 2025).</li>
 
-  <li>I have been learning the <a href="https://lean-lang.org/">Lean proof assistant</a>. Recently, I contributed a <a href="https://github.com/cs-lean/cslib/tree/main/Cslib/Computability/CombinatoryLogic">formalisation of Combinatory Logic</a> to a project developing a general-purpose computer-science library.</li>
+  <li>I have been learning the <a href="https://lean-lang.org/">Lean proof assistant</a>. Recently, I contributed a <a href="https://github.com/leanprover/cslib/tree/main/Cslib/Languages/CombinatoryLogic">formalisation of Combinatory Logic</a> to a project developing a general-purpose computer-science library.</li>
 
   <li><a href="https://thomaskwaring.github.io/f-norm.pdf">Notes</a> on Girard's strong normalisation theorem for System F (polymorphic lambda-calculus). Also includes some discussion of the relationship to Gödel's incompleteness theorems and second-order Peano arithmetic, expanding on some fairly cryptic remarks in Proofs and Types. (September 2020.) I gave a talk to the <a href="https://cglseminar.github.io/">Computation, Geometry, Logic</a> seminar based on these notes (July 2021, video lost to lockdown restrictions).</li>