<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>A Catalog of Research Compiler Infrastructures and Tools &#187; Theorem provers</title>
	<atom:link href="http://compiler-tools.org/archives/category/theorem-provers/feed/" rel="self" type="application/rss+xml" />
	<link>http://compiler-tools.org</link>
	<description>Links to and information about research compiler infrastructures, curated by Will Benton</description>
	<lastBuildDate>Wed, 12 Mar 2008 16:42:02 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
		<item>
		<title>POPL Coq tutorial</title>
		<link>http://compiler-tools.org/archives/2008/01/07/popl-coq-tutorial/</link>
		<comments>http://compiler-tools.org/archives/2008/01/07/popl-coq-tutorial/#comments</comments>
		<pubDate>Mon, 07 Jan 2008 22:53:49 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
				<category><![CDATA[Theorem provers]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2008/01/07/popl-coq-tutorial/</guid>
		<description><![CDATA[The Penn PL Club is presenting a Coq tutorial at POPL 2008. It covers Coq basics, the simply-typed lambda calculus, and System F&#60;:. If you can&#8217;t attend, you can download the code, which is intended to be self-contained and looks quite clear.]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2008/01/07/popl-coq-tutorial/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Twelf</title>
		<link>http://compiler-tools.org/archives/2007/12/22/twelf/</link>
		<comments>http://compiler-tools.org/archives/2007/12/22/twelf/#comments</comments>
		<pubDate>Sun, 23 Dec 2007 04:28:00 +0000</pubDate>
		<dc:creator>Will Benton</dc:creator>
				<category><![CDATA[Theorem provers]]></category>

		<guid isPermaLink="false">http://compiler-tools.org/archives/2007/12/22/twelf/</guid>
		<description><![CDATA[Twelf is a language based on the LF logical framework and can be used for specifying the metatheory of logics and programming languages. It includes a theorem prover and a theorem checker. Here are some resources on Twelf: Andrew Appel&#8217;s tutorial, John Boyland&#8217;s tutorial, and Mechanizing Metatheory in a Logical Framework, by Robert Harper and [...]]]></description>
		<wfw:commentRss>http://compiler-tools.org/archives/2007/12/22/twelf/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
