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

Mon, 21 Nov 1994 18:48:03 +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
ZF/add_ind_def/add_fp_def: deleted as obsolete
ZF/add_ind_def/add_fp_def_i: now takes dom_sum instead of domts. We no
longer automatically construct a sum of separate domains, but could use a
sum-closed set such as univ(A).

ZF/intr_elim/elim: now "folds" definitions of the mutually recursive sets!

replaced 'val ... = result();' by 'qed "...";'

ZF/indrule/mutual_ind_tac: backtracks using DEPTH_SOLVE to be certain of
solving the subgoal. Entire tactic is enclosed in DETERM to prevent
backtracking between subgoals.

ZF/EquivClass/congruent_commuteI: uncommented and simplified proof

ZF/ZF.ML/UN_iff, INT_iff: added to the signature

Pure/thm/norm_term_skip: new, for skipping normalization of the context
Pure/thm/bicompose_aux: now computes nlift (number of lifted assumptions in
new subgoals) and avoids normalizing the first nlift assumptions in the
case where the proof state is not affected.
Pure/thm/norm_term_skip: now normalizes types of parameters
Pure/thm/THM: aligned colons

Pure/sequence: added comment explaining that memoing sequences were found
to be much slower (due to overheads) than the sequences currently used.

Pure/envir/norm_term: replaced equality test for [] by null

page 157 erratum