From: Ferruccio Guidi <ferruccio.guidi@unibo.it>
Date: Mon, 26 May 2008 13:43:02 +0000 (+0000)
Subject: better presentation of lambda-delta
X-Git-Tag: make_still_working~5128
X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=commitdiff_plain;h=708e70e2b90c71c9caedef2665a8d4971cf7b8d9;p=helm.git

better presentation of lambda-delta
---

diff --git a/helm/www/matita/library.shtml b/helm/www/matita/library.shtml
index c22db5e1c..3c4246f31 100644
--- a/helm/www/matita/library.shtml
+++ b/helm/www/matita/library.shtml
@@ -59,8 +59,30 @@
       </p>
 
       <h2>The Formal System &lambda;&delta; (lambda-delta)<a name="lambda-delta"></a></h2>
+      
+      <p>The formal system &lambda;&delta; is a typed &lambda;-calculus that
+         pursues the unification of terms, types, environments and contexts
+	 as the main goal.
+         &lambda;&delta; takes some features from the Automath-related
+	 &lambda;-calculi and some from the pure type systems, but differs
+	 from both in that it does not include the &Pi; construction while it
+	 provides for an abbreviation mechanism at the level of terms.
+      </p>
+
+      <p> The development presents the proofs of some important properties that
+          &lambda;&delta; enjoys. In particular: 
+          <ul> <li> the confluence of reduction </li>
+               <li> the correctness of types </li>
+               <li> the uniqueness of types up to conversion </li>
+               <li> the subject reduction of the type assignment </li>
+               <li> the strong normalization of the typed terms </li>
+               <li> the decidability of type inference problem </li>
+          </ul>
+      </p>
+      
       <p>
-      See the <a href="http://helm.cs.unibo.it/lambda-delta/">&lambda;&delta; home page</a>.
+       See the <a href="http://helm.cs.unibo.it/lambda-delta/">&lambda;&delta; home page</a>
+       for more information.
       </p>
 
       <!--#include virtual="bottombar.shtml" -->