<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="../assets/xml/rss.xsl" media="all"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Lean community blog (Posts about simproc)</title><link>https://leanprover-community.github.io/blog/</link><description></description><atom:link href="https://leanprover-community.github.io/blog/categories/simproc.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2026 &lt;a href="mailto:"&gt;The Lean prover community&lt;/a&gt; </copyright><lastBuildDate>Thu, 18 Jun 2026 09:41:59 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Fantastic Simprocs and How to Write Them</title><link>https://leanprover-community.github.io/blog/posts/simprocs-tutorial/</link><dc:creator>Yaël Dillies, Paul Lezeau</dc:creator><description>&lt;div&gt;&lt;p&gt;This is the final post in our simproc series.
In our first two posts, we gave an informal introduction to the concept of a &lt;em&gt;simproc&lt;/em&gt;,
and a brief overview of the inner workings of the &lt;code&gt;simp&lt;/code&gt; tactic.
The aim of this final post is to build on this by demonstrating how Lean users can write their own simprocs.&lt;/p&gt;
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/simprocs-tutorial/"&gt;Read more…&lt;/a&gt; (12 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><category>meta</category><category>simp</category><category>simproc</category><guid>https://leanprover-community.github.io/blog/posts/simprocs-tutorial/</guid><pubDate>Fri, 27 Feb 2026 11:00:00 GMT</pubDate></item><item><title>Simp, made simple.</title><link>https://leanprover-community.github.io/blog/posts/simp-made-simple/</link><dc:creator>Yaël Dillies, Paul Lezeau</dc:creator><description>&lt;div&gt;&lt;p&gt;This is the second blog post in a series of three.
In &lt;a href="https://leanprover-community.github.io/blog/posts/simprocs-for-the-working-mathematician/"&gt;the first blog post&lt;/a&gt;, we introduced the notion of a &lt;em&gt;simproc&lt;/em&gt;, which can be thought of as a form of "modular" simp lemma.
In this sequel, we give a more detailed exposition of the inner workings of the simp tactic in preparation of our third post, where we will see how to write new simprocs.&lt;/p&gt;
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/simp-made-simple/"&gt;Read more…&lt;/a&gt; (12 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><category>meta</category><category>simp</category><category>simproc</category><guid>https://leanprover-community.github.io/blog/posts/simp-made-simple/</guid><pubDate>Tue, 02 Dec 2025 11:00:00 GMT</pubDate></item><item><title>Simprocs for the Working Mathematician</title><link>https://leanprover-community.github.io/blog/posts/simprocs-for-the-working-mathematician/</link><dc:creator>Yaël Dillies, Paul Lezeau</dc:creator><description>&lt;div&gt;&lt;p&gt;Lean v4.6.0 (back in February 2024!) added support for custom simplification procedures, aka &lt;em&gt;simprocs&lt;/em&gt;.
This blog post is the first in a series of three aimed at explaining what a simproc is, what kind of problems can be solved with simprocs, and what tools we have to write them.
Here is &lt;a href="https://leanprover-community.github.io/blog/posts/simp-made-simple/"&gt;the second blog post&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;&lt;a href="https://leanprover-community.github.io/blog/posts/simprocs-for-the-working-mathematician/"&gt;Read more…&lt;/a&gt; (9 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><category>meta</category><category>simp</category><category>simproc</category><guid>https://leanprover-community.github.io/blog/posts/simprocs-for-the-working-mathematician/</guid><pubDate>Mon, 26 May 2025 14:00:00 GMT</pubDate></item></channel></rss>