Skip to content

[Refractor] contradiction over ⊥-elim in module Constant #2666

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

Merged
jamesmckinna merged 1 commit into from
Mar 15, 2025
Merged

[Refractor] contradiction over ⊥-elim in module Constant #2666

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
10 changes: 6 additions & 4 deletions src/Data/Container/Combinator/Properties.agda
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,13 +11,15 @@ module Data.Container.Combinator.Properties where
open import Axiom.Extensionality.Propositional using (Extensionality)
open import Data.Container.Core using (Container; ⟦_⟧)
open import Data.Container.Combinator
open import Data.Empty using (⊥-elim)
open import Data.Product.Base as P using (∃; _,_; proj₁; proj₂; <_,_>; uncurry; curry)
open import Data.Product.Base as P
using (∃; _,_; proj₁; proj₂; <_,_>; uncurry; curry)
open import Data.Sum.Base as S using (inj₁; inj₂; [_,_]′; [_,_])
open import Function.Base as F using (_∘′_)
open import Function.Bundles using (_↔_; mk↔ₛ′)
open import Level using (_⊔_; lower)
open import Relation.Binary.PropositionalEquality.Core using (_≡_; _≗_; refl; cong)
open import Relation.Binary.PropositionalEquality.Core
using (_≡_; _≗_; refl; cong)
open import Relation.Nullary.Negation.Core using (contradiction)

-- I have proved some of the correctness statements under the
-- assumption of functional extensionality. I could have reformulated
Expand All @@ -34,7 +36,7 @@ module Constant (ext : ∀ {ℓ ℓ′} → Extensionality ℓ ℓ′) where
correct {x} {y} X {Y} = mk↔ₛ′ (from-const X) (to-const X) (λ _ → refl) from∘to
where
from∘to : (x : ⟦ const X ⟧ Y) → to-const X (proj₁ x) ≡ x
from∘to xs = cong (proj₁ xs ,_) (ext (λ x → ⊥-elim (lower x)))
from∘to xs = cong (proj₁ xs ,_) (ext (λ x → contradiction x lower ))

module Composition {s₁ s₂ p₁ p₂} (C₁ : Container s₁ p₁) (C₂ : Container s₂ p₂) where

Expand Down