Frederik Hanghøj Iversen
d1981ec0fa
Update CHANGELOG and remove --allow-unsolved-metas pragma
2018-05-08 18:35:22 +02:00
Frederik Hanghøj Iversen
7cbaf996f1
Use implicit arguments for fun and profit
2018-05-01 18:54:08 +02:00
Frederik Hanghøj Iversen
e3eca8d90a
Prove other identity-law for monads
2018-05-01 11:33:12 +02:00
Frederik Hanghøj Iversen
313c7593d1
Distinguish isomorphism of categories and of types
2018-04-19 12:23:12 +02:00
Frederik Hanghøj Iversen
1c963db7e6
Make AreInveres an alias for \Sigma
2018-04-11 13:53:33 +02:00
Frederik Hanghøj Iversen
db5fb3603a
Banish qualified import of Function - use \o for fun-comp!
2018-04-11 11:12:09 +02:00
Frederik Hanghøj Iversen
c90b064bb0
Rename \o to <<<
2018-04-11 10:58:50 +02:00
Frederik Hanghøj Iversen
fd18985e53
Export TypeIsomorphism as an alias for Equivalence.Isomorphism
2018-04-09 18:10:39 +02:00
Frederik Hanghøj Iversen
8276deb4aa
Rename proj. to fst and snd
2018-04-05 10:41:56 +02:00
Frederik Hanghøj Iversen
1c6d9ad2b5
Rename identity in category to ascii-name
2018-04-03 11:36:09 +02:00
Frederik Hanghøj Iversen
d3864dbae5
Move properties about natural transformations to that module
2018-03-23 15:20:26 +01:00
Frederik Hanghøj Iversen
ef688202a2
Move identity functor laws to functor module...
...
and make progress on univalence in the functor category
2018-03-23 13:55:03 +01:00
Frederik Hanghøj Iversen
96fb1d3a3b
Formatting
2018-03-23 10:08:28 +01:00
Frederik Hanghøj Iversen
ae0ff092f8
Use prelude everywhere
2018-03-21 14:56:43 +01:00
Frederik Hanghøj Iversen
4beb48e066
Use correct order for left- and right identity
...
Define and use helpers left- and right identity
2018-03-21 11:58:50 +01:00
Andrea Vezzosi
f7f8953a42
Voe: Use the isomorphism directly for better computation
2018-03-15 13:39:42 +00:00
Frederik Hanghøj Iversen
438978973d
Construct isomorphism from equivalence
...
Using this somewhat round-about way of constructing an isomorphism from
an equivalence has made typechecking slower in some situations.
E.g. if you're constructing an equivalence from gradLemma and later use
that constructed equivalence to recover the isomorphism, then you
might as well have kept using those functions.
2018-03-15 12:33:00 +01:00
Frederik Hanghøj Iversen
360e2b95dd
Make parameter to monad equivalence explicit
2018-03-14 11:20:07 +01:00
Frederik Hanghøj Iversen
7aec22b30a
Expose both monad formulations qualified from Cat.Category.Monad
2018-03-14 11:00:52 +01:00
Frederik Hanghøj Iversen
6229decfb2
Merge branch 'master' into dev
2018-03-14 10:50:57 +01:00
Frederik Hanghøj Iversen
41e2d02c8d
[WIP] Prove voe §2.3
...
By Andrea
The reason you cannot use cong in [1] is that §2-fromMonad result type
depends on the input, you need a dependent version of cong:
cong-d : ∀ {ℓ} {A : Set ℓ} {ℓ'} {B : A → Set ℓ'} {x y : A}
→ (f : (x : A) → B x)
→ (eq : x ≡ y)
→ PathP (\ i → B (eq i)) (f x) (f y)
cong-d f p = λ i → f (p i)
I attach a modified Voevodsky.agda.
Notice that the definition of "t" is still highlighted in yellow,
that's because it being a homogeneous path depends on the exact
definition of lem, see the comment with the two definitional equality
constraints.
2018-03-14 10:30:42 +01:00
Frederik Hanghøj Iversen
7065455712
More readable goal for voevodsky's construction
2018-03-13 11:29:13 +01:00
Frederik Hanghøj Iversen
fe453a6d3a
Trying to prove cummulativity of homotopy levels
2018-03-12 16:00:27 +01:00
Frederik Hanghøj Iversen
c52384b012
Change name of fromMonad
2018-03-12 14:43:43 +01:00
Frederik Hanghøj Iversen
5e092964c8
Change naming and fuse some modules
2018-03-12 14:38:52 +01:00
Frederik Hanghøj Iversen
ccf753d438
Move monoidal and kleisli representation to own modules
2018-03-12 14:23:23 +01:00
Frederik Hanghøj Iversen
aa645fb11e
Move voevodsky's construction to own module
2018-03-12 14:04:10 +01:00