Addition of compression, that is, sharing.
Uses refs and Symtab (binary search trees) to get reasonable speed.
Types and terms can be compressed.
<HTML><HEAD><TITLE>Isabelle Logics</TITLE></HEAD>
<H2>Isabelle Logics</H2>
Click on the logic's name to view a list of its theories.
<HR>
First-Order Logic
<UL>
<LI><A HREF = "FOL/index.html">FOL</A>
<LI><A HREF = "ZF/index.html">ZF</A>
<LI><A HREF = "CCL/index.html">CCL</A>
<LI><A HREF = "LCF/index.html">LCF</A>
</UL>
<HR>
Higher-Order Logic
<UL>
<LI><A HREF = "HOL/index.html">HOL</A>
<LI><A HREF = "HOLCF/index.html">HOLCF</A>
</UL>
<HR>
Sequent Calculus
<UL>
<LI><A HREF = "LK/index.html">LK</A>
<LI><A HREF = "Modal/index.html">Modal</A>
</UL>
<HR>
Miscellaneous
<UL>
<LI><A HREF = "CTT/index.html">CTT</A>
<LI><A HREF = "Cube/index.html">Cube</A>
<LI><A HREF = "FOLP/index.html">FOLP</A>
</UL>
<HR>
</BODY></HTML>