Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Make function composition a definition instead of an axiomatization (should ↵ | Josh Chen | 2018-08-17 | 1 | -9/+1 |
| | | | | not need to worry about preconditions) | ||||
* | Prod.thy now has the correct definitional equality structure rule. ↵ | Josh Chen | 2018-08-16 | 1 | -17/+11 |
| | | | | Definition of function composition and properties. | ||||
* | Rename to distinguish function and path composition; function composition ↵ | Josh Chen | 2018-08-15 | 1 | -8/+18 |
| | | | | proofs, which have issues... | ||||
* | Basic compute method | Josh Chen | 2018-08-15 | 1 | -1/+1 |
| | |||||
* | Tweak proof methods, some type rules; add HoTT Book examples | Josh Chen | 2018-08-15 | 1 | -1/+1 |
| | |||||
* | Function composition, rename path composition to differentiate the two. | Josh Chen | 2018-08-15 | 1 | -0/+16 |
| | |||||
* | rcompose done | Josh Chen | 2018-08-13 | 1 | -14/+8 |
| | |||||
* | Commit before testing polymorphic equality eliminator | Josh Chen | 2018-08-12 | 1 | -10/+12 |
| | |||||
* | Old application syntax incompatible with Eisbach | Josh Chen | 2018-08-07 | 1 | -6/+6 |
| | |||||
* | Experiment with polymorphic dependent eliminators, i.e. we leave type and ↵ | Josh Chen | 2018-08-07 | 1 | -5/+5 |
| | | | | type family decorations implicit. | ||||
* | Partway through changing function application syntax style. | Josh Chen | 2018-08-06 | 1 | -17/+17 |
| | |||||
* | Reorganize theories | Josh Chen | 2018-08-04 | 1 | -26/+30 |
| | |||||
* | Unit and Null types. Methods. | Josh Chen | 2018-07-12 | 1 | -0/+19 |
| | |||||
* | Universes implemented. Type rules modified accordingly. No more automatic ↵ | Josh Chen | 2018-07-11 | 1 | -4/+4 |
| | | | | derivation of "A:U" from "a:A". | ||||
* | Library snapshot. Methods written, everything nicely organized. | Josh Chen | 2018-07-07 | 1 | -0/+1 |
| | |||||
* | Remove extra attributes for elimination rules, unneeded for now. | Josh Chen | 2018-07-06 | 1 | -2/+1 |
| | |||||
* | Added attributes to type elimination rules, not sure if these will actually ↵ | Josh Chen | 2018-07-06 | 1 | -0/+2 |
| | | | | be needed or useful later. Added [comp] attribute to be used by simplification met methods. | ||||
* | Trivial changes | Josh Chen | 2018-07-04 | 1 | -1/+1 |
| | |||||
* | Rewrote methods: wellformed now two lines, uses named theorems. New, more ↵ | Josh Chen | 2018-07-03 | 1 | -2/+1 |
| | | | | powerful derive method. Used these to rewrite proofs. | ||||
* | Proving path composition. Need to set up the Simplifier to simplify ↵ | Josh Chen | 2018-06-30 | 1 | -0/+1 |
| | | | | application of object-lambdas to arguments. | ||||
* | Finished proofs of projections | Josh Chen | 2018-06-30 | 1 | -1/+1 |
| | |||||
* | Fixed wrong definition of snd_dep. Proved projection property of snd_dep. ↵ | Josh Chen | 2018-06-18 | 1 | -5/+13 |
| | | | | Added type formation rules expressing necessity of the conditions. | ||||
* | Removed all [simp] attributes, these will be added later when I set up the ↵ | Josh Chen | 2018-06-18 | 1 | -12/+19 |
| | | | | simplifier. Proved simplification rule for dependent fst. | ||||
* | Decided on a new proper scheme for type rules using the idea of implicit ↵ | Josh Chen | 2018-06-17 | 1 | -1/+1 |
| | | | | well-formed contexts and guaranteed conclusion well-formedness. Product type rules now follow this scheme. | ||||
* | Type rules now have \"all\" premises explicitly stated, matching the ↵ | Josh Chen | 2018-06-12 | 1 | -6/+13 |
| | | | | formulation in the HoTT book. | ||||
* | Reorganize code | Josh Chen | 2018-06-09 | 1 | -0/+48 |