annotate 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 |
| rev |
line source |
|
adamc@39
|
1 <html><head>
|
|
adamc@39
|
2 <title>Certified Programming with Dependent Types</title>
|
|
adamc@39
|
3 </head><body>
|
|
adamc@39
|
4
|
|
adamc@39
|
5 <h1>Certified Programming with Dependent Types</h1>
|
|
adamc@39
|
6
|
|
adamc@39
|
7 <li><a href="Intro.html">Introduction</a>
|
|
adamc@39
|
8 <li><a href="StackMachine.html">Some Quick Examples</a>
|
|
adamc@57
|
9 <li><a href="InductiveTypes.html">Introducing Inductive Types</a>
|
|
adamc@56
|
10 <li><a href="Predicates.html">Inductive Predicates</a>
|
|
adamc@62
|
11 <li><a href="Coinductive.html">Infinite Data and Proofs</a>
|
|
adamc@70
|
12 <li><a href="Subset.html">Subset Types and Variations</a>
|
|
adamc@83
|
13 <li><a href="MoreDep.html">More Dependent Types</a>
|
|
adamc@105
|
14 <li><a href="DataStruct.html">Dependent Data Structures</a>
|
|
adamc@118
|
15 <li><a href="Equality.html">Reasoning About Equality Proofs</a>
|
|
adamc@226
|
16 <li><a href="Generic.html">Generic Programming</a>
|
|
adamc@227
|
17 <li><a href="Universes.html">Universes and Axioms</a>
|
|
adamc@132
|
18 <li><a href="Match.html">Proof Search in Ltac</a>
|
|
adamc@142
|
19 <li><a href="Reflection.html">Proof by Reflection</a>
|
|
adamc@153
|
20 <li><a href="Firstorder.html">First-Order Abstract Syntax</a>
|
|
adamc@158
|
21 <li><a href="Hoas.html">Higher-Order Abstract Syntax</a>
|
|
adamc@170
|
22 <li><a href="Interps.html">Type-Theoretic Interpreters</a>
|
|
adamc@181
|
23 <li><a href="Extensional.html">Extensional Transformations</a>
|
|
adamc@182
|
24 <li><a href="Intensional.html">Intensional Transformations</a>
|
|
adamc@190
|
25 <li><a href="Impure.html">Modeling Impure Languages</a>
|
|
adamc@39
|
26
|
|
adamc@39
|
27 </body></html>
|
