Skip to content

[ fix #2153 ] Properly re-export specialised combinators #2161

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
merged 2 commits into from
Oct 19, 2023
Merged

[ fix #2153 ] Properly re-export specialised combinators #2161

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
b732929
[ fix #2153 ] Properly re-export specialised combinators
gallais Oct 17, 2023
fa6cde5
Add CHANGELOG entry
MatthewDaggitt Oct 19, 2023
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
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -33,6 +33,9 @@ Bug-fixes
in `Function.Construct.Composition` had their arguments in the wrong order. They have
been flipped so they can actually be used as a composition operator.

* The operations `_∷=_` and `_─_` exported from `Data.List.Membership.Setoid`
had an extraneous `{A : Set a}` parameter. This has been removed.

* The combinators `_≃⟨_⟩_` and `_≃˘⟨_⟩_` in `Data.Rational.Properties.≤-Reasoning`
now correctly accepts proofs of type `_≃_` instead of the previous proofs of type `_≡_`.

Expand Down
5 changes: 3 additions & 2 deletions src/Data/List/Membership/Setoid.agda
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@ module Data.List.Membership.Setoid {c ℓ} (S : Setoid c ℓ) where

open import Function.Base using (_∘_; id; flip)
open import Data.List.Base as List using (List; []; _∷_; length; lookup)
open import Data.List.Relation.Unary.Any
open import Data.List.Relation.Unary.Any as Any
using (Any; index; map; here; there)
open import Data.Product.Base as Prod using (∃; _×_; _,_)
open import Relation.Unary using (Pred)
Expand All @@ -35,7 +35,8 @@ x ∉ xs = ¬ x ∈ xs
------------------------------------------------------------------------
-- Operations

open Data.List.Relation.Unary.Any using (_∷=_; _─_) public
_∷=_ = Any._∷=_ {A = A}
_─_ = Any._─_ {A = A}

mapWith∈ : ∀ {b} {B : Set b}
(xs : List A) → (∀ {x} → x ∈ xs → B) → List B
Expand Down