From: Enrico Tassi <enrico.tassi@inria.fr>
Date: Mon, 28 May 2007 08:52:07 +0000 (+0000)
Subject: aded papers
X-Git-Tag: make_still_working~6282
X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=commitdiff_plain;h=3af196f19d0ffa25a294f6f6c1247ac427ad37d1;p=helm.git

aded papers
---

diff --git a/helm/www/matita/documentation.shtml b/helm/www/matita/documentation.shtml
index 084df460f..3fb209455 100644
--- a/helm/www/matita/documentation.shtml
+++ b/helm/www/matita/documentation.shtml
@@ -31,24 +31,8 @@
       <a href="http://helm.cs.unibo.it/websvn/listing.php?repname=helm&amp;path=%2Ftrunk%2Fhelm%2Fsoftware%2Fmatita%2Fhelp%2FC%2F&amp;rev=0&amp;sc=0">matita/help/C/</a> folder. </p>
 
 
-      <h2>Publications<a name="manual"></a></h2>
-      <ul>
-	<li>A.Asperti, C.Sacerdoti Coen, E.Tassi, S.Zacchiroli.<br>
-	    <a href="PAPERS/matita_types.ps.gz">
-	      Crafting a Proof Assistant.</a>
-	    Submitted for publication to the TYPES06 Post Proceedings.
-	</li>
-	<li>A.Asperti, C.Sacerdoti Coen, E.Tassi, S.Zacchiroli.<br>
-	    <a href="PAPERS/matita.ps.gz">
-	      User Interaction with the Matita Proof Assistant.</a>
-	    To appear in the Journal of Automated Reasoning, 
-	    Special Issue on User Interfaces for Theorem Proving.
-	</li>
-      </ul>
-      <!--
-      <h2>Papers</h2>
-      <!+-#include virtual="papers.shtml" -+>
-      -->
+      <h2>Publications</h2>
+      <!--#include virtual="papers.shtml" -->
 
       <!--#include virtual="bottombar.shtml" -->
     </div>
diff --git a/helm/www/matita/papers.shtml b/helm/www/matita/papers.shtml
index 9f5bbafaa..d6f7e0294 100644
--- a/helm/www/matita/papers.shtml
+++ b/helm/www/matita/papers.shtml
@@ -1,27 +1,79 @@
 <ul>
   
+  <li class="paper">
+  <span class="paper_author">
+    Andrea Asperti, Enrico Tassi
+  </span><br/>
+  <span class="paper_title">
+    Higher order proof reconstruction from paramodulation-based refutations:
+    the unit equality case
+  </span>
+  <a class="paper_download" href="PAPERS/hopr.pdf">
+    <span class="pdf_logo">.pdf</span>
+  </a>
+  <span class="paper_info">
+    Accepted for publication in the proceedings of MKM07
+  </span><br/>
+  <span class="paper_abstract">
+    In this paper we address the problem of reconstructing a
+    higher order, checkable proof object starting from a proof trace left by a
+    first order automatic proof searching procedure, in a restricted equational
+    framework. The automatic procedure is based on superposition rules for
+    the unit equality case. Proof transformation techniques aimed to improve
+    the readability of the final proof are discussed.
+  </span>
+  </li>
+  
+  <li class="paper">
+  <span class="paper_author">
+    Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli
+  </span><br/>
+  <span class="paper_title">
+    Crafting a Proof Assistant
+  </span>
+  <a class="paper_download" href="PAPERS/matita_types.pdf">
+    <span class="pdf_logo">.pdf</span>
+  </a>
+  <span class="paper_info">
+    Accepted for publication in the Proceedings of Types 2006: Conference of
+    the Types Project. Nottingham, UK -- April 18-21, 2006.
+  </span><br/>
+  <span class="paper_abstract">
+     Proof assistants are complex applications whose develop-
+     ment has never been properly systematized or documented. This work is
+     a contribution in this direction, based on our experience with the devel-
+     opment of Matita: a new interactive theorem prover based—as Coq—on
+     the Calculus of Inductive Constructions (CIC). In particular, we analyze
+     its architecture focusing on the dependencies of its components, how they
+     implement the main functionalities, and their degree of reusability.
+     The work is a first attempt to provide a ground for a more direct com-
+     parison between different systems and to highlight the common func-
+     tionalities, not only in view of reusability but also to encourage a more
+     systematic comparison of different softwares and architectural solutions.
+  </span>
+  </li>
+  
+  
   <li class="paper">
   <span class="paper_author">
     Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli
   </span><br/>
   <span class="paper_title">
-    The Matita Proof Assistant
+    User Interaction with the Matita Proof Assistant
   </span>
   <a class="paper_download" href="PAPERS/matita.pdf">
     <span class="pdf_logo">.pdf</span>
   </a>
-  <a class="paper_download" href="PAPERS/matita.ps">
-    <span class="ps_logo">.ps</span>
-  </a><br/>
   <span class="paper_info">
-      Submitted to Journal of Automated Reasoning, Special Issue on User
-      Interfaces for Theorem Proving
+    Accepted for publication in Journal of Automated Reasoning, Special Issue
+    on User Interfaces for Theorem Proving.
   </span><br/>
   <span class="paper_abstract">
-      Matita is a new document-centric proof assistant that integrates several
-      Mathematical Knowledge Management tools and techniques. In this paper we
-      describe the architecture of Matita and the peculiarities of its user
-      interface.
+     Matita is a new, document-centric, tactic-based interactive theorem
+     prover. This paper focuses on some of the distinctive features of the user interaction
+     with Matita, mostly characterized by the organization of the library as a search-
+     able knowledge base, the emphasis on a high-quality notational rendering, and the
+     complex interplay between syntax, presentation, and semantics.
   </span>
   </li>
   
@@ -36,12 +88,10 @@
   <a class="paper_download" href="PAPERS/tinycals.pdf">
     <span class="pdf_logo">.pdf</span>
   </a>
-  <a class="paper_download" href="PAPERS/tinycals.ps">
-    <span class="ps_logo">.ps</span>
-  </a><br/>
   <span class="paper_info">
-      Submitted to UITP 2006 User Interfaces for Theorem Provers. Seattle, WA
-      -- August 21, 2006.
+    In Proceedings of UITP 2006: User Interfaces for Theorem Provers. Seattle,
+    WA -- August 21, 2006. ENTCS, Volume 174, Issue 2 (May 2007), Pages 125 -
+    142, ISSN:1571-0661
   </span><br/>
   <span class="paper_abstract">
       Most of the state-of-the-art proof assistants are based on procedural
@@ -69,9 +119,6 @@
   <a class="paper_download" href="PAPERS/notation.pdf">
     <span class="pdf_logo">.pdf</span>
   </a>
-  <a class="paper_download" href="PAPERS/notation.ps">
-    <span class="ps_logo">.ps</span>
-  </a><br/>
   <span class="paper_info">
       Accepted for publication in the proceedings of MKM 2006: The 5th
       International Conference on Mathematical Knowledge Management.
@@ -103,9 +150,6 @@
   <a class="paper_download" href="PAPERS/whelp.pdf">
     <span class="pdf_logo">.pdf</span>
   </a>
-  <a class="paper_download" href="PAPERS/whelp.ps">
-    <span class="ps_logo">.ps</span>
-  </a><br/>
   <span class="paper_info">
       In Proceedings of TYPES 2004 conference Types for Proofs and Programs.
       Paris, France -- December 15-18, 2004.  LNCS 3839/2004, Springer-Verlag
@@ -134,9 +178,6 @@
   <a class="paper_download" href="PAPERS/disambiguation.pdf">
     <span class="pdf_logo">.pdf</span>
   </a>
-  <a class="paper_download" href="PAPERS/disambiguation.ps">
-    <span class="ps_logo">.ps</span>
-  </a><br/>
   <span class="paper_info">
       In Proceedings of MKM 2004
       Third International Conference on Mathematical Knowledge Management.