simplified proofs for splitI and splitD, added splitD'
added split_conv_tac (also to claset()) as an optimization
made split_all_tac safe introducing safe_full_simp_tac,EXISTING PROOFS MAY FAIL
<HTML><HEAD><TITLE>CTT/README</TITLE></HEAD><BODY>
<H2>CTT: Constructive Type Theory</H2>
This directory contains the ML sources of the Isabelle system for
Constructive Type Theory (extensional equality, no universes).<p>
The <tt>ex</tt> subdirectory contains some examples.<p>
Useful references on Constructive Type Theory:
<UL>
<LI> B. Nordström, K. Petersson and J. M. Smith,<BR>
Programming in Martin-Löf's Type Theory<BR>
(Oxford University Press, 1990)
<LI> Simon Thompson,<BR>
Type Theory and Functional Programming (Addison-Wesley, 1991)
</UL>
</BODY>
</HTML>