# HG changeset patch # User wenzelm # Date 910038880 -3600 # Node ID 4fe5d5aff4df7086d9bade40d044ed79835f9a23 # Parent 96ab3e0977326885dd1527c20c42e28f2e3ca528 tuned; fixed links; diff -r 96ab3e097732 -r 4fe5d5aff4df Admin/page/index.html --- a/Admin/page/index.html Mon Nov 02 21:22:03 1998 +0100 +++ b/Admin/page/index.html Mon Nov 02 21:34:40 1998 +0100 @@ -82,10 +82,9 @@ Barendregt's Lambda Cube. There are also some sequent calculus examples under Sequents, -including modal or linear logics. There are a few more examples, -again see the Isabelle theory -library. +library for other examples.

Defining Logics

@@ -107,8 +106,8 @@
  • instantiate generic proof tools (simplifier, classical tableau prover etc.), -
  • manually code special proof procedures (via tacticals or hand -written ML). +
  • manually code special proof procedures (via tacticals or +hand-written ML). @@ -123,17 +122,18 @@ prover involves only minimal ML-based setup. One may also write arbitrary proof procedures or even theory extension packages in ML, without breaching system soundness (Isabelle follows the well-known -"LCF system approach" to achieve a secure system). +LCF system approach to achieve a secure system).

    Further information

    -[Cambridge] [Munich] The local Isabelle pages at Cambridge -and Munich provide -further information on Isabelle and related projects. +href="http://www.in.tum.de/~isabelle/munich.html">[Munich] The local +Isabelle pages at Cambridge +and Munich +provide further information on Isabelle and related projects.