src/HOL/Induct/README.html
author berghofe
Fri, 24 Jul 1998 13:39:47 +0200
changeset 5191 8ceaa19f7717
parent 3122 2fe26ca380a1
child 5417 1f533238b53b
permissions -rw-r--r--
Renamed '$' to 'Scons' because of clashes with constants of the same name in theories using datatypes.

<!-- $Id$ -->
<HTML><HEAD><TITLE>HOL/Induct/README</TITLE></HEAD><BODY>

<H2>Induct--Examples of (Co)Inductive Definitions</H2>

<P>This directory is a collection of small examples to demonstrate
Isabelle/HOL's (co)inductive definitions package.  Large examples appear on
many other directories, such as Auth, IMP and Lambda.

<UL>
<LI><KBD>Perm</KBD> is a simple theory of permutations of lists.

<LI><KBD>Comb</KBD> proves the Church-Rosser theorem for combinators (<A
HREF="http://www.cl.cam.ac.uk/ftp/papers/reports/TR396-lcp-generic-automatic-proof-tools.ps.gz">paper
available</A>).

<LI><KBD>Mutil</KBD> is the famous Mutilated Chess Board problem (<A
HREF="http://www.cl.cam.ac.uk/ftp/papers/reports/TR394-lcp-mutilated-chess-board.dvi.gz">paper
available</A>).

<LI><KBD>PropLog</KBD> proves the completeness of a formalization of
propositional logic (<A
HREF="http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz">paper
available</A>).

<LI><KBD>LFilter</KBD> is an inductive/corecursive formalization of the
<EM>filter</EM> functional for infinite streams.

<LI><KBD>Exp</KBD> demonstrates the use of iterated inductive definitions to
reason about mutually recursive relations.
</UL>

<HR>
<P>Last modified 7 May 1997

<ADDRESS>
<A NAME="lcp@cl.cam.ac.uk" HREF="mailto:lcp@cl.cam.ac.uk">lcp@cl.cam.ac.uk</A>
</ADDRESS>
</BODY></HTML>