- nodes count is now working for aut and meta

[helm.git] / helm / software / lambda-delta / automath / aut.ml

diff --git a/helm/software/lambda-delta/automath/aut.ml b/helm/software/lambda-delta/automath/aut.ml
index 66c252d5ec91e6e536d3b6aa5769db017f2e7dda..dc938821eedeb8f2794330eef70f8c7b1de31af3 100644 (file)
--- a/helm/software/lambda-delta/automath/aut.ml
+++ b/helm/software/lambda-delta/automath/aut.ml
@@ -1,31 +1,17 @@
-(* Copyright (C) 2000, HELM Team.
- * 
- * This file is part of HELM, an Hypertextual, Electronic
- * Library of Mathematics, developed at the Computer Science
- * Department, University of Bologna, Italy.
- * 
- * HELM is free software; you can redistribute it and/or
- * modify it under the terms of the GNU General Public License
- * as published by the Free Software Foundation; either version 2
- * of the License, or (at your option) any later version.
- * 
- * HELM is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with HELM; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
- * MA  02111-1307, USA.
- * 
- * For details, see the HELM World-Wide-Web page,
- * http://cs.unibo.it/helm/.
- *)
+(*
+    ||M||  This file is part of HELM, an Hypertextual, Electronic        
+    ||A||  Library of Mathematics, developed at the Computer Science     
+    ||T||  Department, University of Bologna, Italy.                     
+    ||I||                                                                
+    ||T||  HELM is free software; you can redistribute it and/or         
+    ||A||  modify it under the terms of the GNU General Public License   
+    \   /  version 2 or (at your option) any later version.              
+     \ /   This software is distributed as is, NO WARRANTY.              
+      V_______________________________________________________________ *)
 
 type id = string (* identifier *)
 
-type qid = id * bool * id list (* qualified identifier: name, is local?, qualifiers *)
+type qid = id * bool * id list (* qualified identifier: name, local?, path *)
 
 type term = Sort of bool              (* sorts: true = TYPE, false = PROP *)
          | GRef of qid * term list   (* reference: name, arguments *)