aboutsummaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
* make development shift really obviousJosh Chen2020-01-241-2/+2
|
* Update README.mdJosh Chen2020-01-241-1/+1
|
* Update README.mdJosh Chen2020-01-241-1/+1
|
* Update README.mdJosh Chen2020-01-241-3/+3
|
* Change linkJosh Chen2019-11-291-1/+1
|
* Update README.mdJosh Chen2019-10-291-3/+3
|
* Update README.mdJosh Chen2019-10-291-1/+2
|
* Update README.mdJosh Chen2019-10-291-1/+5
|
* Update README.mdJosh Chen2019-10-151-0/+1
|
* More progress. I think we are reaching the limit of what can be conveniently ↵Josh Chen2019-03-272-24/+83
| | | | proved with the current implementation.
* working towards biinv_imp_qinvJosh Chen2019-03-264-5/+202
|
* prune import listsJosh Chen2019-03-083-153/+10
|
* type lemmas for derived functions should type the functions themselvesJosh Chen2019-03-082-29/+102
|
* some options, renamingJosh Chen2019-03-083-2/+3
|
* Make functions object-levelJosh Chen2019-03-064-146/+173
|
* Removed transport section from Eq.thyJosh Chen2019-03-031-99/+1
|
* Move definition of transport to Type_Families.thy, and change it to use ↵Josh Chen2019-03-032-79/+147
| | | | meta-functions for type families again. This together with the previous commit simplifies the definitions and proofs for idtoeqv greatly.
* Improve automated handling of universes. derive now can automatically handle ↵Josh Chen2019-03-032-2/+13
| | | | more proofs requiring the use of "U i: U (Suc i)", and shouldn't loop as much.
* Defined idtoeqv. Should next state univalence in terms of an explicit ↵Josh Chen2019-03-031-13/+50
| | | | inverse equivalence.
* finished proof of transport_biinvJosh Chen2019-03-012-17/+21
|
* Proving transport is bi-invertible is harder than expectedJosh Chen2019-03-011-83/+87
|
* change id precedenceJosh Chen2019-03-012-14/+16
|
* transport and homotopyJosh Chen2019-03-012-22/+81
|
* Working on univalenceJosh Chen2019-03-011-46/+115
|
* Syntax changes. Transport inverse lemmas.Josh Chen2019-03-011-18/+70
|
* tweak mixfix prioritiesJosh Chen2019-02-282-7/+16
|
* more convenient syntaxJosh Chen2019-02-282-72/+100
|
* 1. Remove all type inference functionality (feature development moving to ↵Josh Chen2019-02-286-577/+178
| | | | | | another branch). 2. Eq.thy complete.
* touchupsJosh Chen2019-02-232-2/+2
|
* compute method solves subgoals arising from substJosh Chen2019-02-231-6/+8
|
* readmeJosh Chen2019-02-231-3/+12
|
* more proofs involving equalityJosh Chen2019-02-231-44/+97
|
* change mixfix pretty-printing indentationJosh Chen2019-02-232-8/+8
|
* rewrite associativity proofJosh Chen2019-02-231-17/+16
|
* Cleanups and reorganizationJosh Chen2019-02-2210-397/+153
|
* Proof of pathcomp associativity done. Some commentsJosh Chen2019-02-223-23/+249
|
* Partway through associativity proof. Lots to work on to make this more usable.Josh Chen2019-02-181-28/+58
|
* Dependent elimator for Eq now has the correct form. Cleaned up theoremsJosh Chen2019-02-171-20/+104
|
* finalize quantify methodsJosh Chen2019-02-171-3/+2
|
* Method "quantify" converts product inhabitation into Pure universal ↵Josh Chen2019-02-176-41/+132
| | | | statements. Also misc. cleanups.
* Organize this commit as a backup of the work on type inference done so far; ↵Josh Chen2019-02-113-61/+60
| | | | learnt that I probably need to take a different approach. In particular, should first make the constants completely monomorphic, and then work on full proper type inference, rather than the heuristic approach taken here.
* Put typing functionality into a .thy and clean up antiquotations, which ↵Josh Chen2019-02-114-109/+125
| | | | results in some reorganization of the theory import structure.
* get_this more robust. Functions to convert ML terms and types to strings.Josh Chen2019-02-111-3/+23
|
* restructure libraryJosh Chen2019-02-104-104/+108
|
* Fix antiquotation situationJosh Chen2019-02-101-5/+8
|
* Explicit references in antiquotations in typing.ML. Move trace switch ↵Josh Chen2019-02-102-6/+6
| | | | definition to HoTT_Base.
* Type information storage functionality (assume_type, assume_types keywords) ↵Josh Chen2019-02-103-64/+237
| | | | done! Inference and pretty-printing for function composition done.
* Merge branch '2019': beginning type inference automation.Josh Chen2019-02-055-122/+226
|\
| * Add cong named theorem for congruence rulesJosh Chen2019-02-052-5/+9
| |
| * Basic type inference for composed lambda terms!Josh Chen2019-02-051-18/+11
| |
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-19 17:07:59 +0000