# Index of Error Messages

ident`is already used`, 7.3.5 ident2 is already used, 7.3.4 ident is used in the conclusion, 7.3.2 ident is used in the hypothesis ident', 7.3.2 A record cannot be recursive, 2.1 A Setoid Theory is already declared for A, 19.2 All terms must have the same type, 18.4 Attempt to save an incomplete proof, 6.1.2 already exists, 6.1.2 Bad explicitation number, 2.7.1 Bad magic number, 5.4.2 Bound head variable, 7.12, 7.12 Can't find file ident on loadpath, 5.3.1 Can't find module toto on loadpath, 5.4.2 Cannot find the source class, 14.6.1 Cannot load ident: no physical path bound to dirpath, 5.4.2 Cannot move ident1 after ident2: it depends on ident2, 7.3.3 Cannot move ident1 after ident2: it occurs in ident2, 7.3.3 Cannot refine to conclusions with meta-variables, 7.3.6, 7.7.1 Cannot solve the goal., 7.13.10 Clash with previous constant ident, 1.3.1, 1.3.1, 1.3.2, 1.3.2, 1.3.5, 14.6.2 cannot be used as a hint, 7.12, 7.12 Delta must be specified before, 7.5.1 Does not correspond to a coercion, 14.6.1 Don't know what to do with this goal, 18.4 does not denote an evaluable constant, 7.5.5 does not respect the inheritance uniform condition, 14.6.1 File not found on loadpath : string, 5.4.4 FUNCLASS cannot be a source class, 14.6.1 goal does not satisfy the expected preconditions, 7.9.4 Impossible to unify ... with .., 7.8.4 Impossible to unify ... with ..., 7.3.6, 7.7.1 In environment ...the term: term2 does not have type term1, 1.3.2 invalid argument, 7.2.2 is already a coercion, 14.6.1 is not a projectable equality, 7.9.4 is not an inductive type, 7.12 Loading of ML object file forbidden in a native Coq, 5.4.4 Module/section module not found, 5.2.8 must be a transparent constant, 14.6.2 No applicable tactic., 7.13.9 No Declared Ring Theory for term., 18.4 No discriminable equalities, 7.9.3 No focused proof, 6 No focused proof, 6.1.5, 6.3.1 No focused proof (No proof-editing in progress), 6.2.1 No focused proof to restart, 6.2.4 No product even after head-reduction, 7.3.5, 7.3.5, 7.3.5 | No proof-editing in progress, 6.1.7 No such assumption, 7.3.1, 7.3.2, 7.3.4, 7.4.2 No such assumption: identi, 7.3.3 No such goal, 6.3.1 No such hypothesis, 7.3.5, 7.3.5, 7.5.8 No such hypothesis in current goal, 7.3.5, 7.3.5 No such proof, 6.1.7 Non strictly positive occurrence of ident in type, 1.3.3 Not a discriminable equality, 7.9.3 Not a proposition or a type, 7.3.8 Not a valid (semi)ring theory, 18.5 Not a valid setoid theory, 19.2 Not an equation, 7.9.4 Not an exact proof, 7.2.1 Not an inductive product, 7.6.1, 7.7.1 Not convertible, 7.3.10 Not enough Constructors, 7.6.1 Not reducible, 7.5.2 Not the right number of dependent arguments, 7.7.1 Not the right number of missing arguments, 7.3.6 name ident is already bound , 7.3.5 no such entry, 5.6.1 not a defined object, 5.1.1 not declared, 7.12, 14.6.1 Omega can't solve this system, 15.1.2 Omega: Can't solve a goal with equality on type, 15.1.2 Omega: Can't solve a goal with non-linear products, 15.1.2 Omega: Can't solve a goal with proposition variables, 15.1.2 Omega: Not a quantifier-free goal, 15.1.2 Omega: Unrecognized atomic proposition:prop, 15.1.2 Omega: Unrecognized predicate or connective:ident, 15.1.2 Omega: Unrecognized proposition, 15.1.2 Prolog failed, 7.11.3 Quote: not a simple fixpoint, 7.10.3, 8.6 Reached begin of command history, 5.6.2 repeated goal not permitted in refining mode, 6.1.1 Section ident does not exist (or is already closed), 2.4.2 Section ident is not the innermost section, 2.4.2 SORTCLASS cannot be a source class, 14.6.1 Tactic generated a subgoal identical to the original goal, 7.8.1 The conclusion is not a substitutive equation, 7.8.4 The reference qualid was not found in the current environment, 5.2.4, 5.2.5, 5.2.6 The target class does not correspond to class2, 14.6.1 The term term is already declared as a morphism, 19.3 The term term is not a product, 19.3 The term term should not be a dependent product, 19.3 The term provided does not end with an equation, 7.8.1 There is an unknown subterm I cannot solve, 2.7, 7.2.2 This goal is not an equality, 18.4 Type of Constructor not well-formed, 1.3.3 the term form has type ... which should be Set, Prop or Type, 6.1.1 Undo stack would be exhausted, 6.2.1

1
  This research was partly supported by ESPRIT Basic Research Action ``Types''
1
  This is similar to the expression ``symbol { `sep` symbol }'' in standard BNF, or ``symbol ( `sep` symbol )*'' in the syntax of regular expressions.
2
  except if no equation is given, to match the term in an empty type, e.g. the type `False`
1
  These constructions are defined in the `Prelude` module in directory `theories/Init` at the Coq root directory; this includes the modules `Logic`, `Datatypes`, `Specif`, `Peano`, and `Wf` plus the module `Logic_Type`
2
  This syntax is defined in module `LogicSyntax`
3
  They are in `Datatypes.v`
4
  They are defined in module `Specif.v`
5
  This syntax can be found in the module `SpecifSyntax.v`
6
  This is in module `Peano.v`
7
  This is defined in module `Wf.v`
8
  This is in module `Logic_Type.v`
9
  This syntax is defined in module `Logic_TypeSyntax`
10
  `http://coq.inria.fr`
1
  This requirement could be relaxed if we instead introduced an explicit mechanism for instantiating constants. At the external level, the Coq engine works accordingly to this view that all the definitions in the environment were built in a sub-context of the current context.
1
  but it does not rename the hypothesis in the proof-term...
2
  Actually, only the second subgoal will be generated since the other one can be automatically checked.
3
  This corresponds to the cut rule of sequent calculus.
4
  Recall: opaque constants will not be expanded by d reductions
5
  The behavior of this tactic has much changed compared to the versions available in the previous distributions (V6). This may cause significant changes in your theories to obtain the same result. As a drawback of the reenginering of the code, this tactic has also been completely revised to get a very compact and readable version.
1
  This research was partly supported by ESPRIT Basic Research Action ``Types''
2
  It turns out that "|-" is already a token defined for other purposes, then the first rule cannot parse "|- (A:Prop)A->A" and indeed requires the insertion of a blank

> This document was translated from LATEX by HEVEA.