(* 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/. *) (******************************************************************************) (* *) (* PROJECT HELM *) (* *) (* Claudio Sacerdoti Coen *) (* 29/11/2000 *) (* *) (* This module defines the internal representation of the objects (variables, *) (* blocks of (co)inductive definitions and constants) and the terms of cic *) (* *) (******************************************************************************) (* STUFF TO MANAGE IDENTIFIERS *) type id = string (* the abstract type of the (annotated) node identifiers *) type anntarget = Object of annobj | Term of annterm | Conjecture of annconjecture | Hypothesis of annhypothesis (* INTERNAL REPRESENTATION OF CIC OBJECTS AND TERMS *) and sort = Prop | Set | Type and name = Name of string | Anonimous and term = Rel of int (* DeBrujin index *) | Var of UriManager.uri (* uri *) | Meta of int * (term option) list (* numeric id, *) (* local context *) | Sort of sort (* sort *) | Implicit (* *) | Cast of term * term (* value, type *) | Prod of name * term * term (* binder, source, target *) | Lambda of name * term * term (* binder, source, target *) | LetIn of name * term * term (* binder, term, target *) | Appl of term list (* arguments *) | Const of UriManager.uri * int (* uri, number of cookings*) | MutInd of UriManager.uri * int * int (* uri, cookingsno, typeno*) | MutConstruct of UriManager.uri * int * (* uri, cookingsno, *) int * int (* typeno, consno *) (*CSC: serve cookingsno?*) | MutCase of UriManager.uri * int * (* ind. uri, cookingsno, *) int * (* ind. typeno, *) term * term * (* outtype, ind. term *) term list (* patterns *) | Fix of int * inductiveFun list (* funno, functions *) | CoFix of int * coInductiveFun list (* funno, functions *) and obj = Definition of string * term * term * (* id, value, type, *) (int * UriManager.uri list) list (* parameters *) | Axiom of string * term * (int * UriManager.uri list) list (* id, type, parameters *) | Variable of string * term option * term (* name, body, type *) | CurrentProof of string * metasenv * (* name, conjectures, *) term * term (* value, type *) | InductiveDefinition of inductiveType list * (* inductive types, *) (int * UriManager.uri list) list * int (* parameters, n ind. pars *) and inductiveType = string * bool * term * (* typename, inductive, arity *) constructor list (* constructors *) and constructor = string * term * bool list option ref (* id, type, really recursive *) and inductiveFun = string * int * term * term (* name, ind. index, type, body *) and coInductiveFun = string * term * term (* name, type, body *) (* a metasenv is a list of declarations of metas *) and conjecture = int * context * term and metasenv = conjecture list (* a metasenv is a list of declarations of metas *) and annconjecture = id * int * anncontext * annterm and annmetasenv = annconjecture list and annterm = ARel of id * int * string (* DeBrujin index, binder *) | AVar of id * UriManager.uri (* uri *) | AMeta of id * int * (annterm option) list (* numeric id, *) (* local context *) | ASort of id * sort (* sort *) | AImplicit of id (* *) | ACast of id * annterm * annterm (* value, type *) | AProd of id * name * annterm * annterm (* binder, source, target *) | ALambda of id * name * annterm * annterm (* binder, source, target *) | ALetIn of id * name * annterm * annterm (* binder, term, target *) | AAppl of id * annterm list (* arguments *) | AConst of id * UriManager.uri * int (* uri, number of cookings*) | AMutInd of id * UriManager.uri * int * int (* uri, cookingsno, typeno*) | AMutConstruct of id * UriManager.uri * int * (* uri, cookingsno, *) int * int (* typeno, consno *) (*CSC: serve cookingsno?*) | AMutCase of id * UriManager.uri * int * (* ind. uri, cookingsno *) int * (* ind. typeno, *) annterm * annterm * (* outtype, ind. term *) annterm list (* patterns *) | AFix of id * int * anninductiveFun list (* funno, functions *) | ACoFix of id * int * anncoInductiveFun list (* funno, functions *) and annobj = ADefinition of id * string * (* id, *) annterm * annterm * (* value, type, *) (int * UriManager.uri list) list exactness (* parameters *) | AAxiom of id * string * annterm * (* id, type *) (int * UriManager.uri list) list (* parameters *) | AVariable of id * string * annterm option * annterm (* name, body, type *) | ACurrentProof of id * string * annmetasenv * (* name, conjectures, *) annterm * annterm (* value, type *) | AInductiveDefinition of id * anninductiveType list * (* inductive types , *) (int * UriManager.uri list) list * int (* parameters,n ind. pars*) and anninductiveType = string * bool * annterm * (* typename, inductive, arity *) annconstructor list (* constructors *) and annconstructor = string * annterm * bool list option ref (* id, type, really recursive *) and anninductiveFun = string * int * annterm * annterm (* name, ind. index, type, body *) and anncoInductiveFun = string * annterm * annterm (* name, type, body *) and annotation = string and 'a exactness = Possible of 'a (* an approximation to something *) | Actual of 'a (* something *) and context_entry = (* A declaration or definition *) Decl of term | Def of term and hypothesis = (name * context_entry) option (* None means no more accessible *) and context = hypothesis list and anncontext_entry = (* A declaration or definition *) ADecl of annterm | ADef of annterm and annhypothesis = id * (name * anncontext_entry) option (* None means no more accessible *) and anncontext = annhypothesis list;;