summary |
shortlog |
changelog |
graph |
tags |
bookmarks |
branches |
files | gz |
help

(0) -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip

(0) -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip

the_equality: more careful use of addSIs and addIs

cons_fun_eq: modified strange uses of classical reasoner

moved Cantors theorem to ZF/ZF.ML and ZF/Perm.ML
hom_tac: removed to simplify the proof of comp_homs

moved version of Cantors theorem to ZF/Perm.ML

Thu, 24 Nov 1994 00:32:12 +0100
ZF INDUCTIVE DEFINITIONS: Simplifying the type checking for mutually

ZF INDUCTIVE DEFINITIONS: Simplifying the type checking for mutually
recursive datatypes, especially with monotone operators
Inductive_Fun,CoInductive_Fun: deleted as obsolete
inductive_decl: now reads a SINGLE domain for the mutually
recursive construction. This could be a sum, perhaps not! CONCRETE SYNTAX
has changed too (but there are no examples of this to change).

Thu, 24 Nov 1994 00:31:41 +0100
ZF/Datatype/datatype_decl: supplies a SINGLE domain for the mutually

ZF/Datatype/datatype_decl: supplies a SINGLE domain for the mutually
recursive construction. This is [q]univ(A), which is closed under sum.

updated for new deepen_tac

trivial changes

new reference to HO patterns

Pure/tctical/protect_subgoal: simplified to use Sequence.hd
Pure/tctical/DEPTH_FIRST: now suppresses duplicate solutions