------------------------------------------------------------------------
-- The Agda standard library
--
-- Argument visibility used in the reflection machinery
------------------------------------------------------------------------
{-# OPTIONS --cubical-compatible --safe #-}
module Reflection.AST.Argument.Visibility where
open import Relation.Nullary.Decidable.Core using (yes; no)
open import Relation.Binary.Definitions using (DecidableEquality)
open import Relation.Binary.PropositionalEquality.Core using (refl)
------------------------------------------------------------------------
-- Re-exporting the builtins publicly
open import Agda.Builtin.Reflection public using (Visibility)
open Visibility public
------------------------------------------------------------------------
-- Decidable equality
infix 4 _≟_
_≟_ : DecidableEquality Visibility
visible ≟ visible = yes refl
hidden ≟ hidden = yes refl
instance′ ≟ instance′ = yes refl
visible ≟ hidden = no λ()
visible ≟ instance′ = no λ()
hidden ≟ visible = no λ()
hidden ≟ instance′ = no λ()
instance′ ≟ visible = no λ()
instance′ ≟ hidden = no λ()
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