Mercurial > cpdt > repo
view src/toc.html @ 377:252ba054a1cd
One more example of avoiding axioms (getNat)
author | Adam Chlipala <adam@chlipala.net> |
---|---|
date | Wed, 28 Mar 2012 13:20:50 -0400 |
parents | 3322367e955d |
children | d5112c099fbf |
line wrap: on
line source
<html><head> <title>Certified Programming with Dependent Types</title> </head><body> <h1>Certified Programming with Dependent Types</h1> <li><a href="Intro.html">Introduction</a> <li><a href="StackMachine.html">Some Quick Examples</a> <li><a href="InductiveTypes.html">Introducing Inductive Types</a> <li><a href="Predicates.html">Inductive Predicates</a> <li><a href="Coinductive.html">Infinite Data and Proofs</a> <li><a href="Subset.html">Subset Types and Variations</a> <li><a href="GeneralRec.html">General Recursion</a> <li><a href="MoreDep.html">More Dependent Types</a> <li><a href="DataStruct.html">Dependent Data Structures</a> <li><a href="Equality.html">Reasoning About Equality Proofs</a> <li><a href="Generic.html">Generic Programming</a> <li><a href="Universes.html">Universes and Axioms</a> <li><a href="LogicProg.html">Proof Search by Logic Programming</a> <li><a href="Match.html">Proof Search in Ltac</a> <li><a href="Reflection.html">Proof by Reflection</a> <li><a href="Large.html">Proving in the Large</a> </body></html>