merged

added a paper for possible notes

Removed lambdas on the right hand side. This fixes all 'PROBLEM' comments.

lambda_prs & solve_quotient_assum cleaned.

some commenting

Fixed previous commit.

merge

Moved DETERM inside Repeat & added SOLVE around quotient_tac.

merge.

FIXME/TODO.

reply to question in code

Reply in code.

Replies to questions from the weekend: Uncommenting the renamed theorem commented out in 734.

a few code annotations

another pass on apply_rsp

managed to simplify apply_rsp

tried to simplify apply_rsp_tac; failed at the moment; added some questions

some trivial changes

trivial cleaning of make_inst

tried to improve test; but fails

merged

annotated some questions to the code; some simple changes

Answering the question in code.

merged

trivial

tuned code

Minor

Some proofs.

Proof of finite_set_storng_cases_raw.

A bracket was missing; with it proved the 'definitely false' lemma.

renamed quotient.ML to quotient_typ.ML

merged

tuned

started to have a look at it; redefined the relation

More name and indentation cleaning.

Merge + Added LarryInt & Fset3 to tests.

Renaming

merged

deleted struct_match by Pattern.match (fixes a problem in LarryInt)

FSet3 minor fixes + cases

added Int example from Larry

Added FSet3 with a formalisation of finite sets based on Michael's one.

Updated TODO list together.

Merge

More theorem renaming.

Renamed theorems in IntEx2 to conform to names in Int.

Updated comments.

merged

tuned

renamed Larrys example

New syntax for definitions.

changed error message

reformulated the lemma lifting_procedure as ML value; gave better warning message for injection case

slightly tuned

merged

added Larry's theory; introduced lemma equivpI; added something to the TODO about error messages

added maps-printout and tuned some comments

Option and Sum quotients.

Regularized the hard lemma.

Simplification of Babses for regularize; will probably become injection

Found the problem with ttt3.

minor

Moved Unused part of locale to Unused QuotMain.

Moved 'int_induct' to IntEx to keep IntEx2 being just theory of integers in order.

Removed 'Presburger' as it introduces int & other minor cleaning in Int2.

more tuning

tuned

simplified the instantiation of QUOT_TRUE in procedure_tac

completed previous commit

deleted DT/NDT diagnostic code

moved the interpretation code into Unused.thy

added an attempt to get a finite set theory

removed memb and used standard mem (member from List.thy)

merged

simplified proofs

removed quot_respect attribute of a non-standard lemma

With int_of_nat as a quotient_def, lemmas about it can be easily lifted.

merged

naming in this file cannot be made to agree to the original (PROBLEM?)

Lifted some kind of induction.

more proofs in IntEx2

Finished one proof in IntEx2.

slightly more on IntEx2

proved (with a lot of pain) that times_raw is respectful

merged

fixed minor stupidity

Exception handling.

Code cleaning.

merge

foldr_rsp.

tuned

merge

Different syntax for definitions that allows overloading and retrieving of definitions by matching whole constants.

deleted make_inst3

tuned

tuned

moved function and tuned comment

improved fun_map_conv

Arbitrary number of fun_map_tacs.

Temporarily repeated fun_map_tac 4 times. Cleaning for all examples work.

tuned code

tuned the examples and flagged the problematic cleaning lemmas in FSet

merged

implemented cleaning strategy with fun_map.simps on non-bounded variables; still a few rough edges

merge

manually cleaned the hard lemma.

merged

decoupled QuotProd from QuotMain and also started new cleaning strategy

merge

An example which is hard to lift because of the interplay between lambda_prs and unfolding.

proper formulation of all preservation theorems

started to reformulate preserve lemmas

properly set up the prs_rules

merged

added preserve rules to the cleaning_tac

merge

cleaning.

merged

chnaged syntax to "lifting theorem"

changed names of attributes

merge

Manual regularization of a goal in FSet.

merged

added methods for the lifting_tac and the other tacs

make_inst3

Merge

trans2 replaced with equals_rsp_tac

corrected name of FSet in ROOT.ML

Made fset work again to test all.

Finished the proof of ttt2 and found bug in regularize when trying ttt3.

Another lambda example theorem proved. Seems it starts working properly.

Removed pattern from quot_rel_rsp, since list_rel and all used introduced ones cannot be patterned

Proper checked map_rsp.

Nitpick found a counterexample for one lemma.

Added a 'rep_abs' in inj_repabs_trm of babs; and proved two lam examples.

It also regularizes.

inj_repabs also works.

merge

An example of working cleaning for lambda lifting. Still not sure why Babs helps.

tuned

the lift_tac produces a warning message if one of the three automatic proofs fails

added a thm list for ids

removed a fixme: map_info is now checked

tuning of the code

merged

removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>

3 lambda examples in FSet. In the last one regularize_term fails.

Handling of errors in lambda_prs_conv.

babs_prs

clarified the function examples

first attempt to deal with Babs in regularise and cleaning (not yet working)

isabelle make tests all examples

merge

make_inst for lambda_prs where the second quotient is not identity.

added "end" to each example theory

List moved after QuotMain

cleaning

final move

directory re-arrangement

inj_repabs_tac handles Babs now.

Fix of regularize for babs and proof of babs_rsp.

Using pair_prs; debugging the error in regularize of a lambda.

QuotProd with product_quotient and a 3 respects and preserves lemmas.

merge

3 new example thms in MyInt; reveal problems with handling of lambdas; regularize fails with "Loose Bound".

simplified the regularize simproc

now simpler regularize_tac with added solver works

removed usage of HOL_basic_ss by using a slighly extended version of empty_ss

merged

fixed examples

Fix IntEx2 for equiv_list

merged

working state again

added a theorem list for equivalence theorems

Merge

Name changes.

Solved all quotient goals.

updated Isabelle and deleted mono rules

more tuning of the code

puting code in separate sections

Handle 'find_qt_asm' exception. Now all inj_repabs_goals should be solved automatically.

merge

Simpler definition code that works with any type maps.

working on lambda_prs with examples; polished code of clean_tac

renamed lambda_allex_prs

added more to IntEx2

merged

added new example for Ints; regularise does not work in all instances

Definitions folded first.

Used symmetric definitions. Moved quotient_rsp to QuotMain.

Proved foldl_rsp and ho_map_rsp

moved all_prs and ex_prs out from the conversion into the simplifier

further cleaning

Merge

Added nil_rsp and cons_rsp to quotient_rsp; simplified IntEx.

simplified inj_repabs_trm

merged

merged

merged

simpler version of clean_tac

Handling of respects in the fast inj_repabs_tac; includes respects with quotient assumptions.

Solutions to IntEx tests.

made some slight simplifications to the examples

added three examples to IntEx for testing ideas - regularisation and injection seem to be not quite right yet

tuned code

merged

not yet quite functional treatment of constants

Changed FOCUS to SUBGOAL in rep_abs_rsp_tac; another 20% speedup :)

Changing FOCUS to CSUBGOAL (part 1)

abs_rep as ==

Cleaning the Quotients file

Minor renames and moving

Cleaning/review of QuotScript.

More cleaning

more name cleaning and removing

More code cleaning and renaming: moved rsp and prs lemmas from Int to QuotList

Cleaning & Renaming coming from QuotList

Cleaning in Quotients

Even more name changes and cleaning

More code cleaning and name changes

merge

merged

smaller theory footprint

merged

merge

smaller theory footprint

More name changes

Naming changes

code cleaning and renaming

merge

Removed previous inj_repabs_tac

some tuning

merge

rep_abs_rsp_tac to replace the last use of instantiate_tac with matching and unification.

merged

merged

Change equiv_trans2 to EQUALS_RSP, since we can prove it for any quotient type, not only for eqv relations.

compose_tac instead of rtac to avoid unification; some code cleaning.

Got to about 5 seconds for the longest proof. APPLY_RSP_TAC' solves the quotient internally without instantiation resulting in a faster proof.

Using APPLY_RSP1; again a little bit faster.