------------------------------------------------------------------------
-- The Agda standard library
--
-- Lists made up entirely of unique elements (setoid equality)
------------------------------------------------------------------------
{-# OPTIONS --cubical-compatible --safe #-}
open import Relation.Binary.Bundles using (DecSetoid)
open import Relation.Binary.Definitions using (DecidableEquality)
open import Relation.Binary.PropositionalEquality.Properties using (decSetoid)
module Data.List.Relation.Unary.Unique.DecPropositional
{a} {A : Set a} (_≟_ : DecidableEquality A) where
------------------------------------------------------------------------
-- Re-export setoid definition
open import Data.List.Relation.Unary.Unique.DecSetoid (decSetoid _≟_) public
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4