Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Build cubical with latest Agda master (2022-05-09) #791

Merged
merged 1 commit into from
May 12, 2022
Merged

Build cubical with latest Agda master (2022-05-09) #791

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions Cubical/Data/FinData/Properties.agda
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -141,8 +141,8 @@ toℕ∘enum {n = ℕsuc n} (ℕsuc m) p i = ℕsuc (toℕ∘enum m (pred-≤-pr
enumExt : {m m' : ℕ}(p : m < n)(p' : m' < n) → m ≡ m' → enum m p ≡ enum m' p'
enumExt p p' q i = enum (q i) (isProp→PathP (λ i → isProp≤ {m = ℕsuc (q i)}) p p' i)

enumInj : {p : m < k}{q : n < k} → enum m p ≡ enum n q → m ≡ n
enumInj p = sym (toℕ∘enum _ _) ∙ cong toℕ p ∙ toℕ∘enum _ _
enumInj : (p : m < k) (q : n < k) → enum m p ≡ enum n q → m ≡ n
enumInj p q path = sym (toℕ∘enum _ p) ∙ cong toℕ path ∙ toℕ∘enum _ q

enumIndStep :
(P : Fin n → Type ℓ)
Expand Down
4 changes: 2 additions & 2 deletions Cubical/Data/W/Indexed.agda
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -21,8 +21,8 @@ private
ℓX ℓS ℓP : Level

module Types {X : Type ℓX} (S : X → Type ℓS) (P : ∀ x → S x → Type ℓP) (inX : ∀ x (s : S x) → P x s → X) where
data IW : (x : X) → Type (ℓ-max ℓX (ℓ-max ℓS ℓP)) where
node : ∀ {x} → (s : S x) → (subtree : (p : P x s) → IW (inX x s p)) → IW x
data IW (x : X) : Type (ℓ-max ℓX (ℓ-max ℓS ℓP)) where
node : (s : S x) → (subtree : (p : P x s) → IW (inX x s p)) → IW x

Subtree : ∀ {x} → (s : S x) → Type (ℓ-max (ℓ-max ℓX ℓS) ℓP)
Subtree {x} s = (p : P x s) → IW (inX x s p)
Expand Down