X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fwww%2Fmatita%2Fpapers.shtml;h=2e67afd9aa42584a36860ed046c6dcaf00b71660;hb=cc3629bdd8e527c98c30ba3133269de2a72d703e;hp=694f7143b34825b9041cc803753563f43037b041;hpb=7c8b19607fe15a92603113275d016724db8f09c7;p=helm.git

diff --git a/helm/www/matita/papers.shtml b/helm/www/matita/papers.shtml
index 694f7143b..2e67afd9a 100644
--- a/helm/www/matita/papers.shtml
+++ b/helm/www/matita/papers.shtml
@@ -1,3 +1,25 @@
+<script type="text/javascript">
+  function toggleAbstracts() {
+    abstracts = document.getElementsByTagName("span");
+    len = abstracts.length;
+    for (i=0; i != len-1; i++) {
+      elt = abstracts.item(i);
+      if (elt.hasAttribute("class")) {
+	if (elt.getAttribute("class") == "paper_abstract") {
+	  if (elt.style.display != "none") {
+	    elt.style.display = "none";
+	  } else {
+	    elt.style.display = "inline";
+	  }
+	}
+      }
+    }
+  }
+</script>
+<small>
+  <a style="text-decoration: none;" href="javascript:toggleAbstracts()">[ Toggle abstracts ]</a>
+</small>
+
 <ul>
   
   <li class="paper">
@@ -14,7 +36,7 @@
   <span class="paper_info">
     Accepted for publication in the proceedings of MKM 2007: The 6th
     International Conference on Mathematical Knowledge Management.
-  </span><br/>
+  </span>
   <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
@@ -38,7 +60,7 @@
   <span class="paper_info">
     Accepted for publication in the proceedings of MKM 2007: The 6th
     International Conference on Mathematical Knowledge Management.
-  </span><br/>
+  </span>
   <span class="paper_abstract">
     The disambiguation approach to the input of formulae enables the user to
     type correct formulae in a terse syntax close to the usual ambiguous
@@ -63,7 +85,7 @@
   <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>
   <span class="paper_abstract">
      Proof assistants are complex applications whose develop-
      ment has never been properly systematized or documented. This work is
@@ -93,7 +115,7 @@
   <span class="paper_info">
     Accepted for publication in Journal of Automated Reasoning, Special Issue
     on User Interfaces for Theorem Proving.
-  </span><br/>
+  </span>
   <span class="paper_abstract">
      Matita is a new, document-centric, tactic-based interactive theorem
      prover. This paper focuses on some of the distinctive features of the user interaction
@@ -118,7 +140,7 @@
     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>
   <span class="paper_abstract">
       Most of the state-of-the-art proof assistants are based on procedural
       proof languages, scripts, and rely on LCF tacticals as the primary tool
@@ -149,7 +171,7 @@
       Accepted for publication in the proceedings of MKM 2006: The 5th
       International Conference on Mathematical Knowledge Management.
       Wokingham, UK -- August 11-12, 2006.
-  </span><br/>
+  </span>
   <span class="paper_abstract">
       Mathematical notation is a structured, open, and ambiguous language.  In
       order to support mathematical notation in MKM applications one must
@@ -180,7 +202,7 @@
       In Proceedings of TYPES 2004 conference Types for Proofs and Programs.
       Paris, France -- December 15-18, 2004.  LNCS 3839/2004, Springer-Verlag
       Heidelberg, ISBN 3-540-31428-8, pp. 17-32
-  </span><br/>
+  </span>
   <span class="paper_abstract">
       The prototype of a content based search engine for mathematical knowledge
       supporting a small set of queries requiring matching and/or typing
@@ -209,7 +231,7 @@
       Third International Conference on Mathematical Knowledge Management.
       September 19th - 21st, 2004 Bialowieza - Poland. LNCS 3119/2004,
       Springer-Verlag Heidelberg, ISBN 3-540-23029-7, pp. 347-362
-  </span><br/>
+  </span>
   <span class="paper_abstract">
       Mathematical notation has the characteristic of being ambiguous:
       operators can be overloaded and information that can be deduced is often