Skip to content
Merged
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
6 changes: 6 additions & 0 deletions CHANGELOG.md
Original file line number Diff line number Diff line change
Expand Up @@ -149,3 +149,9 @@ Additions to existing modules
```agda
filter-↭ : ∀ (P? : Pred.Decidable P) → xs ↭ ys → filter P? xs ↭ filter P? ys
```

* In `Relation.Nullary.Decidable.Core`:
```agda
⊤-dec : Dec {a} ⊤
⊥-dec : Dec {a} ⊥
```
11 changes: 10 additions & 1 deletion src/Relation/Nullary/Decidable/Core.agda
Original file line number Diff line number Diff line change
Expand Up @@ -18,7 +18,8 @@ open import Agda.Builtin.Maybe using (Maybe; just; nothing)
open import Agda.Builtin.Equality using (_≡_)
open import Level using (Level)
open import Data.Bool.Base using (Bool; T; false; true; not; _∧_; _∨_)
open import Data.Unit.Polymorphic.Base using (⊤)
open import Data.Unit.Polymorphic.Base using (⊤; tt)
open import Data.Empty.Polymorphic using (⊥)
open import Data.Product.Base using (_×_)
open import Data.Sum.Base using (_⊎_; inj₁; inj₂)
open import Function.Base using (_∘_; const; _$_; flip)
Expand Down Expand Up @@ -95,10 +96,18 @@ T? x = x because T-reflects x
does (¬? a?) = not (does a?)
proof (¬? a?) = ¬-reflects (proof a?)

⊤-dec : Dec {a} ⊤
does ⊤-dec = true
proof ⊤-dec = ofʸ tt

_×-dec_ : Dec A → Dec B → Dec (A × B)
does (a? ×-dec b?) = does a? ∧ does b?
proof (a? ×-dec b?) = proof a? ×-reflects proof b?

⊥-dec : Dec {a} ⊥
does ⊥-dec = false
proof ⊥-dec = ofⁿ λ ()

_⊎-dec_ : Dec A → Dec B → Dec (A ⊎ B)
does (a? ⊎-dec b?) = does a? ∨ does b?
proof (a? ⊎-dec b?) = proof a? ⊎-reflects proof b?
Expand Down