15 July disjoint work with 2020 Evan Cavallo / Carlo Angiuli - - PowerPoint PPT Presentation

15
SMART_READER_LITE
LIVE PREVIEW

15 July disjoint work with 2020 Evan Cavallo / Carlo Angiuli - - PowerPoint PPT Presentation

ICMS 15 July disjoint work with 2020 Evan Cavallo / Carlo Angiuli Anders Mrtberg / Andrea Vezzosi Favonia floor wall floor wall wall floor comp wall wall floor cubes +) composition cubical TT major difficulty: composition


slide-1
SLIDE 1

ICMS

15

July

disjoint work with

Favonia

2020

Evan Cavallo / Carlo Angiuli Anders Mörtberg / Andrea Vezzosi

slide-2
SLIDE 2
slide-3
SLIDE 3
slide-4
SLIDE 4
slide-5
SLIDE 5
slide-6
SLIDE 6
slide-7
SLIDE 7
slide-8
SLIDE 8
slide-9
SLIDE 9

floor

slide-10
SLIDE 10

floor

wall

slide-11
SLIDE 11

floor

wall

wall

slide-12
SLIDE 12

floor comp

wall

wall

slide-13
SLIDE 13

cubes composition

major difficulty: composition for univalent universes

+) cubical TT

slide-14
SLIDE 14
slide-15
SLIDE 15
slide-16
SLIDE 16
slide-17
SLIDE 17

null compositions = no walls

slide-18
SLIDE 18

Brunerie's number

a program that should output 2*

*read Guillaume Brunerie's thesis

slide-19
SLIDE 19

(p = (<i> <j> <k> ((test0To4 @ j) @ k) @ i))))), i = 1))))))))))))))))))))))))))))))))))))))))))) ))) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) []) [])

2019.03.04-cubicaltt-fbdb422ada0287dbfc7b097c4a9355ed501be6e6-stack-lts9.5-brunerie2-brunerie_opt-2.output.gz

slide-20
SLIDE 20

nullable compositions

slide-21
SLIDE 21

nullable

not covering every corner not “true” under double negation not “true” under some closed substitutions

slide-22
SLIDE 22

kill nullable compositions!

slide-23
SLIDE 23

Plan A

reduces to floor if null?

slide-24
SLIDE 24

Plan A

reduces to floor if null?

difficult with univalence

keyword: regularity

slide-25
SLIDE 25

Plan B

ban nullable compositions?

slide-26
SLIDE 26

Plan B

ban nullable compositions?

but universes need them

in current constructions

slide-27
SLIDE 27

Plan C

a different composition based on non-nullable ones

with a different set of equations to avoid regularity

slide-28
SLIDE 28

Plan C

a different composition based on non-nullable ones

method 1: decision tree

no general construction yet

method 2: reflection

with a different set of equations to avoid regularity

slide-29
SLIDE 29
slide-30
SLIDE 30
slide-31
SLIDE 31
slide-32
SLIDE 32
slide-33
SLIDE 33
slide-34
SLIDE 34
slide-35
SLIDE 35
slide-36
SLIDE 36
slide-37
SLIDE 37

cofibrations

slide-38
SLIDE 38

method 1: decision tree

slide-39
SLIDE 39

method 1: decision tree

slide-40
SLIDE 40

method 1: decision tree

slide-41
SLIDE 41

reduced reduced

method 1: decision tree

slide-42
SLIDE 42

neocomp

See [AFH] and/or Carlo's thesis

method 1: decision tree

slide-43
SLIDE 43

neocomp

comp comp comp

See [AFH] and/or Carlo's thesis

method 1: decision tree

neocomp neocomp

slide-44
SLIDE 44

neocomp

comp comp comp

See [AFH] and/or Carlo's thesis

neocomp

method 1: decision tree

neocomp neocomp

slide-45
SLIDE 45

neocomp

limitation: the way/order to check dimension expressions needs to respect all equalities (e.g., subst.)

method 1: decision tree

slide-46
SLIDE 46

I P D S removal of inconsistent walls permutation of walls removal of duplicate walls symmetry of wall constraints

variants of [AFH]-style composition

σ symmetry for non-diagonals only

method 1: decision tree

slide-47
SLIDE 47

I P D S removal of inconsistent walls permutation of walls removal of duplicate walls symmetry of wall constraints

unsolved cases: -P+S

variants of [AFH]-style composition

σ symmetry for non-diagonals only

(no permutation, but with symmetry)

method 1: decision tree

slide-48
SLIDE 48

[AFH]-style + conjunctions

method 1: decision tree

slide-49
SLIDE 49

[AFH]-style + conjunctions

trickier with +I

how about

method 1: decision tree

slide-50
SLIDE 50

[AFH]-style + conjunctions

trickier with +I

how about [AFH], research notes, ...

solved case by case

method 1: decision tree

slide-51
SLIDE 51

[CCHM]-style composition

method 2: reflection

slide-52
SLIDE 52

[CCHM]-style composition

make intervals richer so that

method 2: reflection

is surjective

slide-53
SLIDE 53

method 2: reflection

neocomp

slide-54
SLIDE 54

method 2: reflection

neocomp

comp

slide-55
SLIDE 55

method 2: reflection

neocomp

comp

used in Cubical Agda

slide-56
SLIDE 56

Plan C

a different composition based on non-nullable ones

with a different set of equations to avoid regularity

but, is it worth it?

slide-57
SLIDE 57

none works for unknown cofibrations

slide-58
SLIDE 58

none works for unknown cofibrations

we can quantify over cofibrations in cooltt

def mycom/fun (A : 𝕁 → type) (B : 𝕁 → type) (com/A : (r : 𝕁) (φ : 𝔾) (p : (i : 𝕁) (_ : [i=r ∨ φ] (com/B : (r : 𝕁) (φ : 𝔾) (p : (i : 𝕁) (_ : [i=r ∨ φ] (r : 𝕁) (φ : 𝔾) (p : (i : 𝕁) (_ : [i=r ∨ φ]) (_ : A

no known way to kill nullable compositions

slide-59
SLIDE 59

general theory?

slide-60
SLIDE 60

general theory?

build univalent Kan universes with only these cofibrations

still very open

slide-61
SLIDE 61

further reading

[Angiuli] [VMA]

Computational Semantics of Cartesian Cubical Type Theory Cubical Agda: a dependently typed programming language with univalence and higher inductive types

thesis