 Amélia Liao
|
e52995a27b
|
Remove `(φ = i0) as p` syntax + clean up proof of univalence + formalise theorems 4.7.6, 4.7.7, 7.2.2
|
3 years ago |
|
Amélia Liao
|
37506acdb9
|
Rearrange definitions in example code
|
3 years ago |
|
Amélia Liao
|
bba4c5705d
|
Some fixes to prove univalence
|
3 years ago |
|
Amélia Liao
|
79f6bfa85a
|
optimise transport in Glue using gcomp
|
3 years ago |
|
Amélia Liao
|
d9ac1c4563
|
Fixes to composition of HITs
|
3 years ago |
|
Amélia Liao
|
e9691c46f8
|
Small tweaks to some builtins
* Remove [φ] since it's the same thing as φ ≡s i1
* Change the type of comp to reflect that the returned element agrees
with the sides on i1.
|
3 years ago |
|
Amélia Liao
|
b65c2e71ae
|
Use GluedVl to improve printing of isEquiv
|
3 years ago |
|
Amélia Liao
|
81ed8ae8ae
|
Add strict equality
|
3 years ago |
|
Amélia Liao
|
942151811e
|
implement composition for HITs
|
3 years ago |
|
Amélia Liao
|
8a27ec29de
|
Fix recursive local lets
|
3 years ago |
|
Amélia Liao
|
fd5d162883
|
Allow computing past 'case'
It's possible to move many elimination forms into 'case', unsticking
computations.
Additionally: Prove that T² ≃ S¹ × S¹
|
3 years ago |
|
Amélia Liao
|
35a32471cd
|
Consolidate definitions of wired-in names
|
3 years ago |
|
Amélia Liao
|
f745f7357d
|
fix composition for the universe
|
3 years ago |
|
Amélia Liao
|
b4cf411a1b
|
more pain and suffering
|
3 years ago |
|
Amélia Liao
|
d5c221c93d
|
some initial work on HITs
|
3 years ago |
|
Amélia Liao
|
9c37655544
|
some fixes to inductive types
|
3 years ago |
|
Amélia Liao
|
6827a8838c
|
Implement proper inductive types
|
3 years ago |
|
Amélia Liao
|
7aa7a3fac8
|
Add where clauses
|
3 years ago |
|
Amélia Liao
|
6d065cdddd
|
Use glued evaluation to get shorter normal forms
|
3 years ago |
|
Amélia Liao
|
6d82ecd85f
|
Fix composition for pairs
|
3 years ago |
|
Amélia Liao
|
0a68d57f80
|
include proof of strong funext
|
3 years ago |
|
Amélia Liao
|
e521e7f10e
|
Report unsolved metas & composition for the universe
|
3 years ago |
|
Amélia Liao
|
57970721b9
|
Composition for the universe
|
3 years ago |
|
Amélia Liao
|
8937bc16cc
|
Remove special handling of neutral I-eliminations in unifier
|
3 years ago |
|
Amélia Liao
|
8079ef845d
|
built-in bools (to be removed later)
|
3 years ago |
|
Amélia Liao
|
4ad87302c1
|
Document glueing + univalence
|
3 years ago |
|
Amélia Liao
|
e09d03572f
|
Add let definitions
|
3 years ago |
|
Amélia Liao
|
1e6e17c3d8
|
Implement Glueing
|
3 years ago |
|
Amélia Liao
|
eb83b77bf3
|
Implement cubical subtypes and composition
|
3 years ago |
|
Amélia Liao
|
30b2984e1d
|
Implement partial elements and systems
|
3 years ago |
|
Amélia Liao
|
134c24cb13
|
Implement dependent paths (PathP's)
|
3 years ago |
|
Amélia Liao
|
818b816860
|
Wired in definitions for the interval algebra
|
3 years ago |
|
Amélia Liao
|
9be5402444
|
Polish up the type checker
|
3 years ago |
|
Amélia Liao
|
c4a2fee7a2
|
Implement offside rule for toplevel statements
|
3 years ago |
|
Amélia Liao
|
b819f56aed
|
Definitional eta equality
|
3 years ago |
|
Amélia Liao
|
1de859f568
|
Tweak the parser a bit
|
3 years ago |
|
Amélia Liao
|
6eae8f2d2e
|
Implement MLTT elaborator w/ type inference
|
3 years ago |
|
Amélia Liao
|
6f0cef0065
|
initial commit w/ lexer & parser
|
3 years ago |
