<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://mw.hh.se/wg211/index.php?action=history&amp;feed=atom&amp;title=WG211%2FM26Mullanix</id>
	<title>WG211/M26Mullanix - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://mw.hh.se/wg211/index.php?action=history&amp;feed=atom&amp;title=WG211%2FM26Mullanix"/>
	<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M26Mullanix&amp;action=history"/>
	<updated>2026-10-26T17:10:27Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.5</generator>
	<entry>
		<id>http://mw.hh.se/wg211/index.php?title=WG211/M26Mullanix&amp;diff=2918&amp;oldid=prev</id>
		<title>Jacques: Created page with &quot;Proof assistants based off of dependent types all use roughly the same core calculi, but use a variety of implementation strategies for their front-ends. To compare and constrast the performance of these systems, we have developed \emph{Panbench}, an extensible DSL for generating programs of increasing size for Agda 2, Rocq, Lean 4, and Idris 2. In this talk, I will discuss the design of the Panbench DSL, and detail a refinement of tagless embeddings used to encode it in...&quot;</title>
		<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M26Mullanix&amp;diff=2918&amp;oldid=prev"/>
		<updated>2026-10-09T19:08:54Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;Proof assistants based off of dependent types all use roughly the same core calculi, but use a variety of implementation strategies for their front-ends. To compare and constrast the performance of these systems, we have developed \emph{Panbench}, an extensible DSL for generating programs of increasing size for Agda 2, Rocq, Lean 4, and Idris 2. In this talk, I will discuss the design of the Panbench DSL, and detail a refinement of tagless embeddings used to encode it in...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;Proof assistants based off of dependent types all use roughly the same&lt;br /&gt;
core calculi, but use a variety of implementation strategies for their&lt;br /&gt;
front-ends. To compare and constrast the performance of these systems,&lt;br /&gt;
we have developed \emph{Panbench}, an extensible DSL for generating programs&lt;br /&gt;
of increasing size for Agda 2, Rocq, Lean 4, and Idris 2. In this talk, I will&lt;br /&gt;
discuss the design of the Panbench DSL, and detail a refinement of tagless embeddings used to encode it in Haskell.&lt;/div&gt;</summary>
		<author><name>Jacques</name></author>
	</entry>
</feed>