#CSLib
The CSLib Maintainers welcome two new maintainers: Ching-Tsun Chou and Thomas K. Waring! 🎉

Ching-Tsun and Thomas bring important expertise and leadership in automata theory, logic, formal languages, distributed computing, transition systems, and circuit complexity.

#CSLib #FormalMethods
November 11, 2026 at 7:45 AM
CSLib doesn’t have enough machinery for these definitions. There is no reason to stick to it.
November 1, 2026 at 12:42 AM
And frankly at this point cslib is using the same models to generate code as the big AI companies. I’d take CSLib’s track B theory very seriously. For track A, it’s best to cook your own definitions for the moment.
November 1, 2026 at 12:44 AM
So apparently the ETH result isn’t built on CSLib and they cooked up their own definitions of a lot of CS theory foundations all the way down to Turing machines which sure is one way to go about things
Just got a subject-only email to the grad dept theory@ list lol
October 27, 2026 at 4:17 PM
on this: even way behind the "frontier" there's so much useful groundwork to do. Mathlib/CSLib/OptLib etc are starting points but with huge gaps in between. Formalizing proofs of day to day algorithms will be a boon to applications
October 22, 2026 at 6:33 AM
🎉 CSLib now includes a verified translation from Mathlib's partial recursive functions to SKI combinatory logic, the well-known tiny language based on three simple combinators (S, K and I).

1/
October 21, 2026 at 6:30 AM
SKI is famously Turing complete. What's new here is a machine-verified bridge between CSLib's and Mathlib's computability APIs. In the Formal Frontier taxonomy, this is a brilliant example of Amplification: connecting existing formal knowledge to increase what we can accomplish with it.

3/
feat(CombinatoryLogic): Partrec → SKI computability by jessealama · Pull Request #403 · leanprover/cslib
Prove that every Nat.Partrec function on ℕ is SKI-computable (natPartrec_skiComputable). Translates all eight Nat.Partrec.Code constructors to SKI terms and proves correctness, exercising the Recur...
github.com
October 21, 2026 at 6:30 AM
Great work by Jesse Alama, building on equally great previous work by Thomas K. Waring on CSLib's SKI formalisation.

The guarantee: take any partial recursive function on natural numbers; for every input where the function is defined, the SKI translation computes the same output.

2/
feat(CombinatoryLogic): Partrec → SKI computability by jessealama · Pull Request #403 · leanprover/cslib
Prove that every Nat.Partrec function on ℕ is SKI-computable (natPartrec_skiComputable). Translates all eight Nat.Partrec.Code constructors to SKI terms and proves correctness, exercising the Recur...
github.com
October 21, 2026 at 6:30 AM
I'd be interested to hear whether these traits resonate with your own research, and what you would refine.

🔗 Read the article: www.fabriziomontesi.com/bliki/Formal...

#AI #FormalMethods #CSLib #Lean #FORM

4/4
The Formal Frontier and Formal-First Research
Follow with Edit this page on Go back to the Bliki index
www.fabriziomontesi.com
October 19, 2026 at 3:31 PM
What does it mean to do library-grade computer science?

Lessons from our recent work, on the occasion of CSLib reaching its 1,000th pull request.

www.fabriziomontesi.com/bliki/CSLibL...
CSLib: Library-Grade Computer Science
Follow with Edit this page on Go back to the Bliki index
www.fabriziomontesi.com
October 12, 2026 at 7:01 AM
🎉 'Modal Logic' is now in CSLib!

Happy to announce that CSLib now includes a reusable Lean formalisation of the generic framework for modal logic from Blackburn, de Rijke, and Venema's Modal Logic textbook (Cambridge University Press).

1/
October 7, 2026 at 6:59 AM
Having existing implementations of specific logics in CSLib has been particularly useful: whenever the new framework could not easily reconstruct one of the existing modal logics or fit naturally with an existing CSLib interface, we went back and improved the design.

4/
Library-Grade Modal Logic
Library-Grade Modal Logic
www.fabriziomontesi.com
October 7, 2026 at 6:59 AM
The framework now supports, among other things, basic modal logic, the modal cube, basic temporal logic, and Hennessy–Milner Logic, together with reusable metatheory and automation.

Preprint: www.fabriziomontesi.com/publication/...

#CSLib #Lean #FormalMethods #FORM

5/5
Library-Grade Modal Logic
Library-Grade Modal Logic
www.fabriziomontesi.com
October 7, 2026 at 6:59 AM
The goal is to distribute responsibility while preserving CSLib's collaborative and consensus-oriented nature.

Decision making: github.com/leanprover/c...
Governance: github.com/leanprover/c...

#CSLib #Lean #FormalMethods

3/3
cslib/DECISION_MAKING.md at main · leanprover/cslib
The Lean Computer Science Library (CSLib). Contribute to leanprover/cslib development by creating an account on GitHub.
github.com
October 6, 2026 at 1:20 PM
As CSLib grows, we also need to scale and clarify how decisions are made. We have now written an explicit (but still flexible) decision-making process and updated our governance model accordingly.

1/
cslib/DECISION_MAKING.md at main · leanprover/cslib
The Lean Computer Science Library (CSLib). Contribute to leanprover/cslib development by creating an account on GitHub.
github.com
October 6, 2026 at 1:20 PM
Maintainers take responsibility for their areas as technical architects, while reviewers provide trusted technical scrutiny and guidance. We also describe when votes are used and how disagreements are resolved.

2/
cslib/DECISION_MAKING.md at main · leanprover/cslib
The Lean Computer Science Library (CSLib). Contribute to leanprover/cslib development by creating an account on GitHub.
github.com
October 6, 2026 at 1:20 PM
29 September, 09:00–10:30 — DIAS Auditorium, Odense

#HybridThreats #Europe #FormalMethods #DIAS #Lean #FORM #CSLib

7/7
September 22, 2026 at 6:30 AM
This is also an area where I hope tools and initiatives such as Lean and CSLib can spread their wings. Formal methods and stronger programming communities may have an important role to play in building technological resilience.

5/
Europrogramming: From Eurotheory to Practice
Follow with Edit this page on Go back to the Bliki index
www.fabriziomontesi.com
September 22, 2026 at 6:30 AM
CSLib: The Lean Computer Science Library

Clark Barrett, Swarat Chaudhuri, Fabrizio Montesi, Jim Grundy, Pushmeet Kohli, Leonardo de Moura, Alexandre Rademaker, Sorrachai Yingchareonthawornchai

arxiv.org/abs/2602.04846
#LeanLang
CSLib: The Lean Computer Science Library
We introduce CSLib, an open-source framework for proving computer-science-related theorems and writing formally verified code in the Lean proof assistant. CSLib aims to be for computer science what Le...
arxiv.org
September 17, 2026 at 5:01 PM
A tour through Eurotheory and formal methods to Lean, Mathlib, CSLib, AI-assisted formalisation, and the question of what we should actually choose to verify.

www.fabriziomontesi.com/bliki/Europr...

#CSLib #Lean #FormalMethods

2/2
Europrogramming: From Eurotheory to Practice
Follow with Edit this page on Go back to the Bliki index
www.fabriziomontesi.com
September 16, 2026 at 7:22 PM
C'est dans cslib, pas mathlib.
September 9, 2026 at 11:51 AM
This is an important stepping stone in our roadmap towards logical methods for reasoning about concurrent behaviour, from data sharing policies to causal analyses. Looking forward to implementing this in Lean and #CSLib in the future.

Link to the paper below. 👇️

#FormalMethods #Logic #FORM
September 7, 2026 at 7:00 AM
RE: https://mastodon.acm.org/@acp/115921453909423834

The recording for @fmontesi's Lean Together talk, "CSLib: The Lean Computer Science Library", is now online:

https://inv.nadeko.net/KfIZn2zH8CA

#cslib #leanprover
@fmontesi is presenting the first results and next steps of CSLib – the Lean Computer Science library – at Lean Together tomorrow (20 Jan) at 14:00 CET. The event is online and open to all, so feel free to join if you're curious […]

[Original post on mastodon.acm.org]
January 30, 2026 at 10:14 AM
@fmontesi is presenting the first results and next steps of CSLib – the Lean Computer Science library – at Lean Together tomorrow (20 Jan) at 14:00 CET. The event is online and open to all, so feel free to join if you're curious […]

[Original post on mastodon.acm.org]
January 19, 2026 at 11:10 AM