view src/toc.html @ 227:d8c54a25c81f

Update DataStruct with a new reason to use reflexive types; start Universes
author Adam Chlipala <adamc@hcoop.net>
date Wed, 18 Nov 2009 15:38:01 -0500
parents 9d0b9577f8b1
children 52b9e43be069
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="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="Match.html">Proof Search in Ltac</a>
<li><a href="Reflection.html">Proof by Reflection</a>
<li><a href="Firstorder.html">First-Order Abstract Syntax</a>
<li><a href="Hoas.html">Higher-Order Abstract Syntax</a>
<li><a href="Interps.html">Type-Theoretic Interpreters</a>
<li><a href="Extensional.html">Extensional Transformations</a>
<li><a href="Intensional.html">Intensional Transformations</a>
<li><a href="Impure.html">Modeling Impure Languages</a>

</body></html>