Preparing infrastructure for general FORALL_PRS

split quotient.ML into two files

slightly saner way of parsing the quotient_def

merged

changed Type.typ_match to Sign.typ_match

Fixes after optimization and preparing for a general FORALL_PRS

Optimization

Map does not fully work yet.

Fixed quotdata_lookup.

fixed problem with maps_update

merged

fixed the problem with types in map

Automatic computation of application preservation and manually finished "alpha.induct". Slow...

Regularize for equalities and a better tactic. "alpha.cases" now lifts.

Regularization

merged

added some facts about fresh and support of lam

Finally merged the code of the versions of regularize and tested examples.

Lemmas about fv.

changed the order of rfv and reformulated a3 with rfv

merged

not sure what changed here

added fv-function

The proper real_alpha

Finding applications and duplicates filtered out in abstractions

Cleaning also in Lam

Cleaning of the interface to lift.

Tried manually lifting real_alpha

More tests in Lam

Cleaning of 'map id' and 'prod_fun id id' in lower_defs.

Using subst for identity definition.

Lifting of the 3 lemmas in LamEx

Fixed wrong CARD definition and removed the "Does not work anymore" comment.

merged

updated some definitions; had to give sometimes different names; somewhere I introduced a bug, since not everything is working anymore (needs fixing!)

ported all constant definitions to new scheme

fixed the definition of alpha; this *breaks* some of the experiments

disambiguate ===> syntax

More cleaning in Lam code

cleaned FSet

Some cleaning

Cleaning the unnecessary theorems in 'IntEx'.

Fix also in the general procedure.

merge

Fixes

updated all definitions

merged

added infrastructure for defining lifted constants

First experiments with Lambda

Fixed mistake in const generation, will postpone this.

More finshed proofs and cleaning

Proof of append_rsp

merged

added a function for matching types

Manual conversion of equality to equivalence allows lifting append_assoc.

Simplfied interface to repabs_injection.

map_append lifted automatically.

Manually lifted Map_Append.

Merged

Fixed APPLY_RSP vs Cong in the InjRepAbs tactic.

tuned

merged

added equiv-thm to the quot_info

Simplifying FSet with new functions.

added an example about lambda-terms

made quotients compatiple with Nominal; updated keyword file

merged

Completely cleaned Int.

Further reordering in Int code.

Simplifying Int.

Merge

Simplifying Int and Working on map

merged

Simplifying code in int

Symmetry of integer addition

Finished the code for adding lower defs, and more things moved to QuotMain

Making all the definitions from the original ones

Finished COND_PRS proof.

Cleaning and fixing.

updated with quotient_def

added code for declaring map-functions

added "print_quotients" command to th ekeyword file

proved the two lemmas in QuotScript (reformulated them without leading forall)

added data-storage about the quotients

added another example file about integers (see HOL/Int.thy)

changed the definitions of liftet constants to use fun_maps

Merge

Finally lifted induction, with some manually added simplification lemmas.

changed encoding from utf8 to ISO8 (needed to work with xemacs)

Merge

Preparing infrastructire for LAMBDA_PRS

moved the map_funs setup into QuotMain

Finally completely lift the previously lifted theorems + clean some old stuff

More infrastructure for automatic lifting of theorems lifted before

More infrastructure for automatic lifting of theorems lifted before

Undid wrong merge

Tried rolling back

Cleaning the mess

Merge

Better tactic and simplified the proof further

fixed problem with incorrect ABS/REP name

Stronger tactic, simpler proof.

Split Finite Set example into separate file

eqsubst_tac

Trying to get a simpler lemma with the whole infrastructure

Using RANGE tactical allows getting rid of the quotients immediately.

Further developing the tactic and simplifying the proof

res_forall_rsp_tac further simplifies the proof

Working on the proof and the tactic.

The proof gets simplified

Removed an assumption

The proof now including manually unfolded higher-order RES_FORALL_RSP.

The problems with 'abs' term.

Simplified the proof with some tactic... Still hangs sometimes.

More proof

Got rid of instantiations in the proof

Removed some debugging messages

tuned and attempted to store data about the quotients (does not work yet)

tuned

slight tuning

fixed my_reg

Reorganization of the construction part

Simplified proof more

Cleaning the code

Further reorganization

Further reorganizing the file

Reordering

cterm_instantiate also fails for some strange reason...

preparing arguments for res_inst_tac

Trying res_inst_tac

started to write code for storing data about the quotients

some minor tuning

tuned and fixed the earlier fix

fixed the abs case in my_reg and added an app case

my version of regularise (still needs to be completed)

moved the map-info and fun-info section to quotient.ML

Test if we can already do sth with the transformed theorem.

slight fix and tuning

the command "quotient" can now define more than one quotient at the same time; quotients need to be separated by and

Partial simplification of the proof

Some QUOTIENTS

Only QUOTIENSs are left to fnish proof

More higher order unification problems

Merged

Simplified

Further in the proof

compose_tac works with the full instantiation.

slightly simplified get_fun function

The instantiated version is the same modulo beta

Fully manually instantiated. Still fails...

Little progress with match/instantiate

Fighting with the instantiation

Symmetric version of REP_ABS_RSP

Progressing with the proof

Finally fix get_fun.

A fix for one fun_map; doesn't work for more.

fixed the problem with function types; but only type_of works; cterm_of does not work

Description of the problem with get_fun.

A proper build_goal_term function.

Cleaning the code

Merged

Cleaning the proofs

Cleaning the code, part 4

slightly improved tyRel

Reordering the code, part 3

Reordering the code, part 2.

Reordering the code, part 1.

Minor cleaning.

The definition of Fold1

A number of lemmas for REGULARIZE_TAC and regularizing card1.

Proving the proper RepAbs version

Forgot to save, second part of the commit

Manually regularized list_induct2

Fixed bug in regularise types. Now we can regularise list.induct.

Function for checking recursively if lifting is needed

Merge

Proper handling of non-lifted quantifiers, testing type freezing.

slight simplification of atomize_thm

atomize_thm and meta_quantify.

Regularizing HOL all.

":" is used for being in a set, "IN" means something else...

First (untested) version of regularize for abstractions.

restored old version

tuned

slightly modified the parser

deleted diagnostic code

added quotient command (you need to update isar-keywords-prove.el)

added new keyword

Bounded quantifier

The tyREL function.

started some strange functions

Further with the manual proof

Further experiments with proving induction manually

Testing if I can prove the regularized version of induction manually

exported parts of QuotMain into a separate ML-file

consistent usage of rty (for the raw, unquotient type); tuned a bit the Isar proof of atomize_eqv.

simplified typedef_quot_type_tac (using MetaSimplifier.rewrite_rule instead of the simplifier)

renamed unlam_def to unabs_def (matching the function abs_def in drule.ML)

tuned; nothing serious

another improvement to unlam_def

one further improvement to unlam_def

simplified the unlam_def function

added an explicit syntax-argument to the function make_def (is needed if the user gives an syntax annotation for quotient types)

used prop_of to get the term of a theorem (replaces crep_thm)

Merged

First theorem with quantifiers. Learned how to use sledgehammer.

simplified the storage of the map-functions by using TheoryDataFun

Just one atomize is enough for the currently lifted theorems. Properly lift 'all' and 'Ex'.

used new cong_tac

First version of handling of the universal quantifier

Handling abstraction correctly.

second test

Test line

Partially fix lifting of card_suc. The quantified variable still needs to be changed.

Tested new build_goal and removed old one, eq_reflection is included in atomize, card_suc tests.

Checked again with the version on my hard-drive backedup yesterday and fixed small whitespace issues.

Merged

added name to prove

consistent state

some tuning of my code

Cleanup

Merged

Cleaning the code with Makarius

Instnatiation with a schematic variable

added ctxt as explicit argument to build_goal; tuned

slightly tuned the comment for unlam

fixed a bug in my code: function typedef_term constructs now now the correct term when the relation is called x

tuned slightly one proof

A version of the tactic that exports variables correctly. It still does not know how to instantiate the obtained theorems.

Minor cleaning: whitespace, commas etc.

Correctly handling abstractions while building goals Use DatatypeAux cong_tac instead of own functions since it handles universal quantifiers properly.

Minor cleanup

Found the source for the exception and added a handle for it.

Make the tactic use Trueprop_cong and atomize.

Proper code for getting the prop out of the theorem.

Using "atomize" the versions with arbitrary Trueprops can be proven.

Proper definition of CARD and some properties of it. Translation should now support Pure assumptions and Trueprops anywhere, but a problem needs to be fixed with the tactic.

some comments

merged

slight tuning