Skip to content
Draft
Show file tree
Hide file tree
Changes from all commits
Commits
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
3 changes: 3 additions & 0 deletions CHANGELOG.md
Original file line number Diff line number Diff line change
Expand Up @@ -42,6 +42,9 @@ Non-backwards compatible changes
Minor improvements
------------------

* In `Induction.WellFoudned`, the final parameter of `Acc` has been changed to
an index.

Deprecated modules
------------------

Expand Down
4 changes: 2 additions & 2 deletions src/Induction/WellFounded.agda
Original file line number Diff line number Diff line change
Expand Up @@ -43,8 +43,8 @@ WfRec _<_ P x = ∀ {y} → y < x → P y
-- The accessibility predicate: x is accessible if everything which is
-- smaller than x is also accessible (inductively).

data Acc {A : Set a} (_<_ : Rel A ℓ) (x : A) : Set (a ⊔ ℓ) where
acc : (rs : WfRec _<_ (Acc _<_) x) → Acc _<_ x
data Acc {A : Set a} (_<_ : Rel A ℓ) : (x : A) Set (a ⊔ ℓ) where
acc : ∀ {x} (rs : WfRec _<_ (Acc _<_) x) → Acc _<_ x

-- The accessibility predicate encodes what it means to be
-- well-founded; if all elements are accessible, then _<_ is
Expand Down
Loading