Search is not available for this dataset
text string | meta dict |
|---|---|
{-# OPTIONS --safe #-}
module Cubical.Algebra.Group.Instances.DiffInt where
open import Cubical.Foundations.Prelude
open import Cubical.Data.Int.MoreInts.DiffInt renaming ( _+_ to _+ℤ_ ; _-_ to _-ℤ_)
open import Cubical.Algebra.Group.Base
open import Cubical.Algebra.Semigroup.Base
open import Cubical.Algebra.Monoid.... | {
"alphanum_fraction": 0.7264573991,
"avg_line_length": 30.7586206897,
"ext": "agda",
"hexsha": "e5276df7ae733ecd827bd75a80b78751045ede3e",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --without-K --rewriting #-}
{- Remember to keep CodeBP.agda in sync. -}
open import HoTT
import homotopy.RelativelyConstantToSetExtendsViaSurjection as SurjExt
module homotopy.vankampen.CodeAP {i j k l}
(span : Span {i} {j} {k})
{D : Type l} (h : D → Span.C span) (h-is-surj : is-surj h) where
open... | {
"alphanum_fraction": 0.5404271845,
"avg_line_length": 47.6851851852,
"ext": "agda",
"hexsha": "9131de1c9617bb44170c717ee9a533ef39130001",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2018-12-26T21:31:57.000Z",
"max_forks_repo_forks_event_min_datetime": "2018-12-26T... |
{-# OPTIONS --without-K #-}
-- this is mostly reference for an unused intermediate step.
module Cauchy2 where
open import Data.Nat
open import Data.Vec renaming (map to mapV; _++_ to _++V_; concat to concatV)
open import Data.Fin using (Fin; inject+; raise; inject≤; fromℕ; toℕ)
open import Function using (id)
open im... | {
"alphanum_fraction": 0.6117945007,
"avg_line_length": 33.3012048193,
"ext": "agda",
"hexsha": "595a2bd1f4cf569782a017b6fc64f368110792bb",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2019-09-10T09:47:13.000Z",
"max_forks_repo_forks_event_min_datetime": "2016-05-29T... |
{-# OPTIONS --without-K --exact-split --rewriting #-}
open import lib.Basics
open import lib.types.Truncation
open import lib.types.Fin
open import lib.types.Nat
open import lib.types.Empty
open import lib.types.Unit
open import lib.types.Coproduct
open import lib.types.Sigma
open import lib.types.Paths
open import li... | {
"alphanum_fraction": 0.5599797537,
"avg_line_length": 37.5126582278,
"ext": "agda",
"hexsha": "62df9649813bea30b54cd2118c835a6868b8e928",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --universe-polymorphism #-}
module SortDependingOnIndex where
open import Imports.Level
data Bad : (l : Level) → Set l where
| {
"alphanum_fraction": 0.7338129496,
"avg_line_length": 19.8571428571,
"ext": "agda",
"hexsha": "6dfa7c6fdf28bdb96f8c3686dae0a15fa2f11614",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --warning=error --safe --without-K #-}
open import LogicalFormulae
open import Orders.Total.Definition
open import Orders.Total.Lemmas
open import Maybe
open import Agda.Primitive using (Level; lzero; lsuc; _⊔_)
open import Vectors
open import Numbers.Naturals.Semiring
open import Numbers.Naturals.Order
... | {
"alphanum_fraction": 0.7208856287,
"avg_line_length": 122.3004115226,
"ext": "agda",
"hexsha": "41c66894751d8b73f7078e995d22b4dd4fc529b4",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-11-29T13:23:07.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-11-29... |
{-# OPTIONS --without-K #-}
open import HoTT
open import homotopy.PtdAdjoint
module homotopy.SuspAdjointLoop where
module Σ⊣Ω {i} where
SuspFunctor : PtdFunctor i i
SuspFunctor = record {
obj = ⊙Susp;
arr = ⊙susp-fmap;
id = ⊙susp-fmap-idf;
comp = ⊙susp-fmap-∘}
LoopFunctor : PtdFunctor i i
L... | {
"alphanum_fraction": 0.4459333126,
"avg_line_length": 29.1727272727,
"ext": "agda",
"hexsha": "45f75ab6d03fd666ba9f21f6ff314ca937ec5da7",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module EvenOdd where
open import Data.Nat
data Even : ℕ → Set where
evenZero : Even 0
evenSuc : {n : ℕ} → Even n → Even (suc (suc n))
data Odd : ℕ → Set where
oddOne : Odd 1
oddSuc : {n : ℕ} → Odd n → Odd (suc (suc n))
_e+e_ : {n m : ℕ} → Even n → Even m → Even (n + m)
evenZero e+e b = b
evenSuc a e+e b = e... | {
"alphanum_fraction": 0.5809399478,
"avg_line_length": 25.5333333333,
"ext": "agda",
"hexsha": "8ed5ff2ba3740aeb87f91ca55ff1dacd3b893d3f",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
-- {-# OPTIONS -v tc.meta:40 #-}
-- {-# OPTIONS --verbose tc.conv.term:40 #-}
-- {-# OPTIONS --verbose tc.conv.level:40 #-}
-- {-# OPTIONS --verbose tc.conv.atom:50 #-}
-- {-# OPTIONS --verbose tc.conv.elim:50 #-}
module Issue680-NeutralLevels where
open import Common.Level
postulate
N : Set
A : N → Set
... | {
"alphanum_fraction": 0.5377358491,
"avg_line_length": 21.9310344828,
"ext": "agda",
"hexsha": "e21d331ac4ca3e226a5a61229988f22b6efe6b02",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
module sum where
open import level
open import bool
open import eq
open import maybe
open import product
open import functions
open import empty public
----------------------------------------------------------------------
-- datatypes
----------------------------------------------------------------------
data _⊎_ {... | {
"alphanum_fraction": 0.4176731079,
"avg_line_length": 34.985915493,
"ext": "agda",
"hexsha": "d9202268faaea4bd5fbffacad61aadbbbe4f05dc",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hex... |
module Text.Greek.Script.Unicode where
open import Text.Greek.Script
-- U+0390 - U+03CE
ΐ : Token -- U+0390 GREEK SMALL LETTER IOTA WITH DIALYTIKA AND TONOS
ΐ = with-accent-diaeresis ι′ lower (acute ι-vowel) ι-diaeresis
Α : Token -- U+0391 GREEK CAPITAL LETTER ALPHA
Α = unmarked α′ upper
Β : Token -- U+0392 GREEK CAP... | {
"alphanum_fraction": 0.7291100791,
"avg_line_length": 57.6414141414,
"ext": "agda",
"hexsha": "6a8f76af66530f1c516c5401b51fed2c3a7b3c81",
"lang": "Agda",
"max_forks_count": 5,
"max_forks_repo_forks_event_max_datetime": "2017-06-11T11:25:09.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-02-27T... |
{-# OPTIONS --safe --warning=error --without-K #-}
open import LogicalFormulae
open import Numbers.Naturals.Semiring -- for length
open import Lists.Lists
open import Functions.Definition
--open import Groups.Actions
module Groups.FinitePermutations where
allInsertions : {a : _} {A : Set a} (x : A) (l : List A) → Li... | {
"alphanum_fraction": 0.6696315121,
"avg_line_length": 57.3854166667,
"ext": "agda",
"hexsha": "3698e70ec144bae45ba794d74b4cbc40d4e73d05",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-11-29T13:23:07.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-11-29T... |
{-# OPTIONS --safe #-}
module RevRev where
open import Relation.Binary.PropositionalEquality
open import Data.List
open import Data.List.Properties
rev : ∀ {ℓ} {A : Set ℓ} → List A → List A
rev [] = []
rev (x ∷ xs) = rev xs ++ x ∷ []
lemma : ∀ {ℓ} {A : Set ℓ} (a b : List A) → rev (a ++ b) ≡ rev b ++ rev a
lemma [] b... | {
"alphanum_fraction": 0.5738831615,
"avg_line_length": 30.6315789474,
"ext": "agda",
"hexsha": "18af3d0e94e08557428b7293ad64c1b83bb314cc",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2019-12-13T04:50:46.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-12-13T... |
------------------------------------------------------------------------
-- Some properties about subsets
------------------------------------------------------------------------
module Data.Fin.Subset.Props where
open import Data.Nat
open import Data.Vec hiding (_∈_)
open import Data.Empty
open import Data.Function
... | {
"alphanum_fraction": 0.4479302832,
"avg_line_length": 37.0161290323,
"ext": "agda",
"hexsha": "cbac082a07b0ea51feba646378d293b3ccd40d59",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2022-03-12T11:54:10.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-07-21T... |
postulate
A B : Set
f : @0 {{A}} → B
g : @0 {{A}} → B
g = f
| {
"alphanum_fraction": 0.3636363636,
"avg_line_length": 8.25,
"ext": "agda",
"hexsha": "8024e6d2bd3cc3b0eecea5d7b0971dc54b48675d",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hexsha": "b... |
{-# OPTIONS --without-K #-}
module sets.nat.struct where
open import sum
open import equality
open import function
open import container.core
open import container.w
open import sets.empty
open import sets.unit
open import sets.nat.core
open import sets.fin
open import sets.vec.dependent
open import hott.level
ℕ-c : ... | {
"alphanum_fraction": 0.4024186822,
"avg_line_length": 31.3464052288,
"ext": "agda",
"hexsha": "6a134aae6a46537190d8a070dade0821782dfe04",
"lang": "Agda",
"max_forks_count": 4,
"max_forks_repo_forks_event_max_datetime": "2019-02-26T06:17:38.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-04-11T... |
module Category.Functor.Lawful where
open import Agda.Primitive using (lsuc; _⊔_)
open import Category.Functor
open import Category.Applicative
open import Function using (id; _∘_)
open import Relation.Binary.PropositionalEquality using (_≡_; module ≡-Reasoning; sym; cong)
record LawfulFunctorImp {l₁ l₂} {F : Set l₁ →... | {
"alphanum_fraction": 0.5574526996,
"avg_line_length": 50.3953488372,
"ext": "agda",
"hexsha": "5b34c43eb121d8a498fce1fa6c42f314042e2b4e",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module Common.Equality where
open import Common.Level
infix 4 _≡_
data _≡_ {a} {A : Set a} (x : A) : A → Set a where
refl : x ≡ x
{-# BUILTIN EQUALITY _≡_ #-}
{-# BUILTIN REFL refl #-}
subst : ∀ {a p}{A : Set a}(P : A → Set p){x y : A} → x ≡ y → P x → P y
subst P refl t = t | {
"alphanum_fraction": 0.541958042,
"avg_line_length": 20.4285714286,
"ext": "agda",
"hexsha": "b9a84df0fda80d5570299dade21768b9458e5fa2",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hex... |
------------------------------------------------------------------------
-- The Agda standard library
--
-- Unary relations
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Relation.Unary where
open import Data.Empty
open import Data.Unit.Base using (... | {
"alphanum_fraction": 0.4055366683,
"avg_line_length": 23.3977272727,
"ext": "agda",
"hexsha": "5c72d2245eccbf866f8184dff95997ba09a1e620",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.HITs.Sn.Base where
open import Cubical.HITs.Susp
open import Cubical.Foundations.Pointed
open import Cubical.Data.Nat
open import Cubical.Data.NatMinusOne
open import Cubical.Data.Empty
open import Cubical.Foundations.Prelude
open import Cubical.Data.Bo... | {
"alphanum_fraction": 0.6645962733,
"avg_line_length": 21.4666666667,
"ext": "agda",
"hexsha": "a8c656e722f9edfb8578f88ccfbe4f0790463b66",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --cubical --safe #-}
module Data.List.Syntax where
open import Data.List
open import Prelude
open import Data.Vec.Sigma using () renaming (toList to [_]) public
open import Data.Vec.Sigma
[_][_] : ∀ n → Vec A n → List A
[ n ][ xs ] = toList {n = n} xs
-- record ListSyntax {a b} (A : Type a) (B : Type b... | {
"alphanum_fraction": 0.5614334471,
"avg_line_length": 21.7037037037,
"ext": "agda",
"hexsha": "e07dc5e0a096f38e209f7c9f0ff1ad7dac3fc352",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-11-11T12:30:21.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-11-11T... |
module Data.Nat.DivMod.Properties where
open import Data.Nat
open ≤-Reasoning
open import Data.Nat.DivMod
open import Data.Nat.Etc
open import Data.Nat.Properties using (≰⇒>; m≤m+n)
open import Data.Nat.Properties.Simple using (+-right-identity; +-suc; +-assoc; +-comm; distribʳ-*-+)
open import Data.Fin using (Fin; t... | {
"alphanum_fraction": 0.4437824732,
"avg_line_length": 39.6565934066,
"ext": "agda",
"hexsha": "e4ccf5eb7e17aea9cd3465edfd027429a2504e1b",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2015-05-30T05:50:50.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-05-30T... |
open import Relation.Binary.Core
module Heapsort.Impl2.Correctness.Permutation {A : Set}
(_≤_ : A → A → Set)
(tot≤ : Total _≤_)
(trans≤ : Transitive _≤_) where
open import BBHeap _≤_ hiding (forget) renaming (flatten to flatten')
open import BBHeap.Compound _≤_
... | {
"alphanum_fraction": 0.5742449664,
"avg_line_length": 48.6530612245,
"ext": "agda",
"hexsha": "520565ae25c850ee1bd6d726711cf8ff97480c64",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module Rec2 where
open import Data.Nat
open import Rec1
x : ℕ
x = 42
z : ℕ
z = y
| {
"alphanum_fraction": 0.5729166667,
"avg_line_length": 8.7272727273,
"ext": "agda",
"hexsha": "a355d47f47a5c8330c1df1deedcf8fa082b2e594",
"lang": "Agda",
"max_forks_count": 304,
"max_forks_repo_forks_event_max_datetime": "2022-03-28T11:35:02.000Z",
"max_forks_repo_forks_event_min_datetime": "2018-07-16... |
-- Following A CUBICAL TYPE THEORY FOR HIGHER INDUCTIVE TYPES
-- by Simon Huber at https://simhu.github.io/misc/hcomp.pdf
-- as closely as possible.
open import Cubical.Core.Primitives
open import Cubical.Core.Glue
import Agda.Builtin.Cubical.HCompU as HCompU
open HCompU using (primFaceForall)
open HCompU.Helpers usin... | {
"alphanum_fraction": 0.4822891885,
"avg_line_length": 24.4854368932,
"ext": "agda",
"hexsha": "4c6ee76d259ef31211a648971b59707b17e8e3a7",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --without-K #-}
open import HoTT.Base
module HoTT.Identity where
open variables
private variable x y z w : A
-- Lemma 2.1.4
-- (i)
unitᵣ : {p : x == y} → p == p ∙ refl
unitᵣ {p = refl} = refl
unitₗ : {p : x == y} → p == refl ∙ p
unitₗ {p = refl} = refl
-- (ii)
invₗ : {p : x == y} → p ⁻¹ ∙ p == refl
i... | {
"alphanum_fraction": 0.4350364964,
"avg_line_length": 25.1376146789,
"ext": "agda",
"hexsha": "170d26688b8672ebc147ab3aa0aa6d7998e4dd3e",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
open import Coinduction using ( ♭ ; ♯_ )
open import Data.Empty using ( ⊥-elim )
open import Data.Sum using ( _⊎_ ; inj₁ ; inj₂ )
open import Relation.Binary.PropositionalEquality
using ( _≡_ ; _≢_ ; refl ; sym ; cong ; cong₂ )
open import Relation.Nullary using ( ¬_ ; Dec ; yes ; no )
open import System.IO.Transduc... | {
"alphanum_fraction": 0.4445519729,
"avg_line_length": 39.5356521739,
"ext": "agda",
"hexsha": "eb831d291e99571663a86fd5d3376878ecedfbd4",
"lang": "Agda",
"max_forks_count": 2,
"max_forks_repo_forks_event_max_datetime": "2022-03-12T11:40:23.000Z",
"max_forks_repo_forks_event_min_datetime": "2017-08-10T... |
open import Proc
module Silence (param : Param) where
open import Basics
import Interp
import Hear
open Process param
open Interp param
open Hear param
NoSpeak : {a : U} -> Proc a -> Set
NoSpeak {a} p = (w : LT a)(q : Proc a) -> ¬ (p -! w !-> q)
silent-nospeak : {a : U}{p : Proc a} -> Silent p -> NoSpeak p
silent... | {
"alphanum_fraction": 0.5667060213,
"avg_line_length": 34.5714285714,
"ext": "agda",
"hexsha": "ee8a8559debc022d8945185622168e70025fab30",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
{-# OPTIONS --without-K #-}
open import HoTT.Base
open import HoTT.Equivalence
module HoTT.Equivalence.Transport where
open variables
transport-equiv : {x y : A} → x == y → P x ≃ P y
transport-equiv {A = A} {P = P} p = f , qinv→isequiv (g , η p , ε p)
where
f = transport P p
g = transport P (p ⁻¹)
variable x... | {
"alphanum_fraction": 0.5855670103,
"avg_line_length": 25.5263157895,
"ext": "agda",
"hexsha": "7c3d5322f30dbf8cd7bf09a3dfb973cec3c1765a",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module Data where
import Lvl
open import Type
-- An empty type which cannot be constructed.
-- By default, this should be used to represent _the_ empty type.
data Empty {ℓ} : Type{ℓ} where
{-# FOREIGN GHC data Empty ℓ #-}
{-# COMPILE GHC Empty = data Empty () #-}
-- Empty functions.
-- The empty type eliminator... | {
"alphanum_fraction": 0.6594663278,
"avg_line_length": 28.1071428571,
"ext": "agda",
"hexsha": "214383e4dc3e8ebaab0603f364448129eda726ae",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --cubical --safe #-}
module Data.Maybe.Base where
open import Level
data Maybe (A : Type a) : Type a where
nothing : Maybe A
just : A → Maybe A
maybe : {B : Maybe A → Type b} → B nothing → ((x : A) → B (just x)) → (x : Maybe A) → B x
maybe b f nothing = b
maybe b f (just x) = f x
| {
"alphanum_fraction": 0.5880398671,
"avg_line_length": 21.5,
"ext": "agda",
"hexsha": "6fc33d91c2220c3b4fdb3968c7a258f5f5b429a7",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hexsha": "3... |
{-# OPTIONS --without-K --exact-split --safe #-}
open import Fragment.Algebra.Signature
module Fragment.Algebra.Homomorphism.Definitions (Σ : Signature) where
open import Fragment.Algebra.Algebra Σ
open import Level using (Level; _⊔_)
open import Relation.Binary using (Setoid)
open import Data.Vec using (Vec; map)
... | {
"alphanum_fraction": 0.5985185185,
"avg_line_length": 28.125,
"ext": "agda",
"hexsha": "997d7cfac7c8f6d48d17b92c199264e01357e9c6",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2021-06-16T08:04:31.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-06-15T15:34:5... |
{-# OPTIONS --without-K --safe #-}
module Categories.Category.Helper where
open import Level
open import Relation.Binary using (Rel; IsEquivalence)
open import Categories.Category.Core using (Category)
-- Since we add extra proofs in the definition of `Category` (i.e. `sym-assoc` and
-- `identity²`), we might still ... | {
"alphanum_fraction": 0.5342913129,
"avg_line_length": 31.2448979592,
"ext": "agda",
"hexsha": "4cef9e39f6ce2c5af0f90b394ee96b3a14c3478d",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --warning=error #-}
module Issue329 where
mutual
infixl 0 D Undeclared
data D : Set where
| {
"alphanum_fraction": 0.7009345794,
"avg_line_length": 15.2857142857,
"ext": "agda",
"hexsha": "48948c488f609473fc936dccf0b90db95a75f7fb",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
module PLRTree {A : Set} where
open import BTree {A} hiding (flatten)
open import Data.List
data Tag : Set where
perfect : Tag
left : Tag
right : Tag
data PLRTree : Set where
leaf : PLRTree
node : Tag → A → PLRTree → PLRTree → PLRTree
forget : PLRTree → BTree
forget leaf = leaf
forget (node _ x l r) = no... | {
"alphanum_fraction": 0.6629213483,
"avg_line_length": 20.2272727273,
"ext": "agda",
"hexsha": "118b59ab75a76a9603de5488e9d76cf8663093a9",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
open import Data.Product using ( _×_ )
open import Web.Semantic.DL.Signature using ( Signature ; CN ; RN )
module Web.Semantic.DL.FOL where
-- A fragment of first order logic with no existentials or disjunctions.
infixr 4 _∧_
data Formula (Σ : Signature) (Δ : Set) : Set where
true : Formula Σ Δ
false : Formula ... | {
"alphanum_fraction": 0.6152671756,
"avg_line_length": 31.1904761905,
"ext": "agda",
"hexsha": "6cda59c91985174c6ee0bcb736196ae33bb1e915",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2022-03-12T11:40:03.000Z",
"max_forks_repo_forks_event_min_datetime": "2017-12-03T... |
-- Andreas, 2015-07-16
-- For printing lambda-bound names, name _ should behave as no name.
-- {-# OPTIONS -v tc.term.lambda:60 #-}
module _ where
Test = (A : Set) {A : Set} → A → A
works : Test
works = λ C x → {!!}
-- the goal should be displayed as ?0 : .A
g : Test
g = λ C {_} x → {!!}
-- the goal should be di... | {
"alphanum_fraction": 0.5472103004,
"avg_line_length": 17.9230769231,
"ext": "agda",
"hexsha": "2617883f9a8cc5f499c19a23660624ab1ce82629",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
-- Andreas, 2018-09-12, issue #3167-2: --(no-)prop option
--
-- A local --prop option should override a global --no-prop flag.
-- Issue3167prop.flags has --no-prop.
{-# OPTIONS --prop #-}
-- The following depends on Prop enabled
data _≡_ {a} {A : Prop a} (x : A) : A → Prop a where
refl : x ≡ x
data P : Prop where... | {
"alphanum_fraction": 0.5951742627,
"avg_line_length": 20.7222222222,
"ext": "agda",
"hexsha": "5936c9983e2e992a50da077df72aef4d04d1ff1b",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
module BTA10 where
----------------------------------------
--equivalence between two typing systems
----------------------------------------
------------
--system one
------------
-- module annotated-type-one where
-- open import Data.Bool
-- open import Data.List
-- open import Data.Nat
-- infix 4 _∈_... | {
"alphanum_fraction": 0.4597405122,
"avg_line_length": 47.0915331808,
"ext": "agda",
"hexsha": "83139cfb6b550c141286d65fa08f15fee6c8d0e2",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2019-10-15T09:01:37.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-10-15T... |
{-# OPTIONS --prop --rewriting #-}
open import Examples.Sorting.Sequential.Comparable
module Examples.Sorting.Sequential.MergeSort (M : Comparable) where
open Comparable M
open import Examples.Sorting.Sequential.Core M
open import Calf costMonoid
open import Calf.Types.Bool
open import Calf.Types.Nat
open import Ca... | {
"alphanum_fraction": 0.5396088503,
"avg_line_length": 38.7892720307,
"ext": "agda",
"hexsha": "c661568b6d3839bf946bbe1ba87469ecce851e39",
"lang": "Agda",
"max_forks_count": 2,
"max_forks_repo_forks_event_max_datetime": "2022-01-29T08:12:01.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-10-06T... |
module Data.Union.Relation.Binary.Subtype.Instances where
open import Data.List using (List)
open import Data.List.Relation.Binary.Subset.Propositional.Instances using (⦅_⊆_⦆; [_])
open import Data.Union using (Union)
open import Data.Union.Relation.Binary.Subtype
using (_≼_; _,_⊢_≼_; refl; trans; generalize; func... | {
"alphanum_fraction": 0.4436133487,
"avg_line_length": 27.5873015873,
"ext": "agda",
"hexsha": "cfaab33cbb5977792664306d088dd285beb6bc8b",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
data _≡_ {a} {A : Set a} (x : A) : A → Set a where
refl : x ≡ x
record Σ (A : Set) (B : A → Set) : Set where
constructor _,_
field
proj₁ : A
proj₂ : B proj₁
open Σ
postulate
I : Set
U : I → Set
El : ∀ {i} → U i → Set
Ctxt : Set
Env : Ctxt → Set
Type : Ctxt → Set
Type Γ = Σ I λ i → Env Γ →... | {
"alphanum_fraction": 0.483490566,
"avg_line_length": 19.7209302326,
"ext": "agda",
"hexsha": "f253ae6615d7c2eefb4b7f9dfb0258f474bb7ed4",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-03... |
{-# OPTIONS --rewriting #-}
module NewEquations where
open import Common.Prelude hiding (map; _++_)
open import Common.Equality
infixr 5 _++_
map : ∀ {A B : Set} → (A → B) → List A → List B
map f [] = []
map f (x ∷ xs) = (f x) ∷ (map f xs)
_++_ : ∀ {A : Set} → List A → List A → List A
[] ++ ys = ys
(x ∷ xs) ++ ys ... | {
"alphanum_fraction": 0.4460325283,
"avg_line_length": 28.1805555556,
"ext": "agda",
"hexsha": "751fa62b7188341f9f6e5b421f846c6ab9121723",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2019-03-05T20:02:38.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-03-05T... |
{-# OPTIONS --without-K --rewriting #-}
open import lib.Basics
open import lib.NType2
open import lib.NConnected
open import lib.types.Nat
open import lib.types.Subtype
open import lib.types.Truncation
-- classifying types of automorphism groups of types
module lib.types.BAut where
BAut : ∀ {i} → Type i → Type (lsuc... | {
"alphanum_fraction": 0.545210385,
"avg_line_length": 36.0322580645,
"ext": "agda",
"hexsha": "e6ca12224092ab74eadd52bd9b57576b71fddbd8",
"lang": "Agda",
"max_forks_count": 50,
"max_forks_repo_forks_event_max_datetime": "2022-02-14T03:03:25.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-10T... |
{-# OPTIONS --without-K #-}
module GroupoidStructure {a} {A : Set a} where
open import PathOperations
open import Types
p·p⁻¹ : {a b : A} (p : a ≡ b) → p · p ⁻¹ ≡ refl
p·p⁻¹ = J (λ _ _ p → p · p ⁻¹ ≡ refl) (λ _ → refl) _ _
p⁻¹·p : {a b : A} (p : a ≡ b) → p ⁻¹ · p ≡ refl
p⁻¹·p = J (λ _ _ p → p ⁻¹ · p ≡ refl) (λ _ → r... | {
"alphanum_fraction": 0.4005235602,
"avg_line_length": 28.2962962963,
"ext": "agda",
"hexsha": "f7908c7e69baed5ef87e5201c977ab8d9b21ed8b",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
------------------------------------------------------------------------
-- An example of how Abstract-binding-tree can be used
------------------------------------------------------------------------
{-# OPTIONS --cubical --safe #-}
module README.Abstract-binding-tree where
open import Dec
open import Equality.Path... | {
"alphanum_fraction": 0.527721919,
"avg_line_length": 26.2716981132,
"ext": "agda",
"hexsha": "5bd5374b845952d3ecbed4ec6652f6d4d3ccf7ae",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hex... |
module Lib.Bool where
open import Lib.Logic
data Bool : Set where
true : Bool
false : Bool
{-# BUILTIN BOOL Bool #-}
{-# BUILTIN TRUE true #-}
{-# BUILTIN FALSE false #-}
{-# COMPILED_DATA Bool Bool True False #-}
isTrue : Bool -> Set
isTrue true = True
isTrue false = False
isFalse : Bool -> Set
isFalse tr... | {
"alphanum_fraction": 0.6252796421,
"avg_line_length": 17.1923076923,
"ext": "agda",
"hexsha": "d60d5585ba277bdfab5c251e73a8e702b87cd8df",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2022-03-12T11:35:18.000Z",
"max_forks_repo_forks_event_min_datetime": "2022-03-12T... |
-- Andreas, 2020-01-28, issue #4399
-- Pattern @{{_ = p}}@ should not be parsed as cubical partial split.
postulate
A : Set
data T : Set where
tt : T
f : {x : A} {{_ : T}} → Set
f ⦃ _ = tt ⦄ = A
-- Expected: Parse error
-- Not a valid named argument: _ = tt
| {
"alphanum_fraction": 0.5864661654,
"avg_line_length": 17.7333333333,
"ext": "agda",
"hexsha": "656dc0f4fbfbf171215770ee7f0783e07a9be1b0",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
------------------------------------------------------------------------
-- A universe which includes several kinds of functions
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
open import Equality
module Function-universe
{reflexive} (eq : ∀ {a p} → Equa... | {
"alphanum_fraction": 0.4486350187,
"avg_line_length": 37.2425972927,
"ext": "agda",
"hexsha": "f083e0bb93e7c34844c8f1a9a5e317517735b254",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module Ambient where
open import Relation.Nullary
using (yes; no)
open import Data.String
using (String; _≟_)
open import Data.Bool
using (Bool; true; false)
open import Relation.Binary.PropositionalEquality
using (_≢_; refl)
renaming (_≡_ to _≡≡_)
open import Data.List
using (List; [... | {
"alphanum_fraction": 0.2844814534,
"avg_line_length": 28.4698275862,
"ext": "agda",
"hexsha": "3401ef5d5334a83bd2f34862e3383abe1a2ebdbc",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
------------------------------------------------------------------------
-- The untyped SKI combinator calculus
------------------------------------------------------------------------
{-# OPTIONS --safe --without-K #-}
module FOmegaInt.Undecidable.SK where
open import Data.Bool
open import Data.Product as Prod usin... | {
"alphanum_fraction": 0.4705882353,
"avg_line_length": 35.8571428571,
"ext": "agda",
"hexsha": "dcb120169094163c31b226995e21346bf823fae2",
"lang": "Agda",
"max_forks_count": 2,
"max_forks_repo_forks_event_max_datetime": "2021-05-14T10:25:05.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-05-13T... |
{- Byzantine Fault Tolerant Consensus Verification in Agda, version 0.9.
Copyright (c) 2020 Oracle and/or its affiliates.
Licensed under the Universal Permissive License v 1.0 as shown at https://opensource.oracle.com/licenses/upl
-}
open import Optics.All
open import LibraBFT.Prelude
open import LibraBFT.Hash
o... | {
"alphanum_fraction": 0.6210817759,
"avg_line_length": 52.2635658915,
"ext": "agda",
"hexsha": "609830bdd8066304fdda11b4d75a251a85997d19",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --cubical-compatible #-}
data D : Set → Set₁ where
c : (@0 A : Set) → D A
| {
"alphanum_fraction": 0.5505617978,
"avg_line_length": 17.8,
"ext": "agda",
"hexsha": "9a96f2a7ca2e97998c413452d1d5a732b1833507",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hexsha": "9... |
module ANF where
open import Data.List
open import Data.List.All
open import Typing
open import DSyntax
open import Syntax
-- transform a direct style expression into and anf expression
anf : ∀ {φ t} → DExpr φ t → Expr φ t
anf (var x) = var x
anf (nat unr-φ i) = nat unr-φ i
anf (unit unr-φ) = unit unr-φ
anf (pair s... | {
"alphanum_fraction": 0.6331034483,
"avg_line_length": 48.3333333333,
"ext": "agda",
"hexsha": "98a1088760dfe98bdd1b43f7143554f9538a9095",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --without-K #-}
open import homotopy.3x3.Common
open import homotopy.3x3.PushoutPushout
module homotopy.3x3.Transpose where
open M using (Pushout^2)
type-of : ∀ {i} {A : Type i} (u : A) → Type i
type-of {A = A} _ = A
module _ {i} (d : Span^2 {i}) where
open Span^2 d
transpose-f : (f : type-of H₁₁... | {
"alphanum_fraction": 0.5030861723,
"avg_line_length": 63.6479591837,
"ext": "agda",
"hexsha": "22cfacdd9945131f2e169d8532962c055c6df568",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module Issue443 where
module M (A : Set) where
record R : Set where
field
a : A
postulate
A : Set
I : A → Set
i : (x : A) → I x
r : M.R A
a = M.R.a A r
Foo : Set₁
Foo with i (M.R.a A r)
Foo | _ = Set
| {
"alphanum_fraction": 0.5223214286,
"avg_line_length": 11.7894736842,
"ext": "agda",
"hexsha": "ab6bd1c38913a69e5c948b88ebae991c6186adb3",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Algebra.RingSolver.CommRingHornerForms where
open import Cubical.Foundations.Prelude
open import Cubical.Data.Nat using (ℕ)
open import Cubical.Data.FinData
open import Cubical.Data.Vec
open import Cubical.Data.Bool using (Bool; true; false; if_then_el... | {
"alphanum_fraction": 0.6010838831,
"avg_line_length": 30.7536231884,
"ext": "agda",
"hexsha": "18a36a364d7407f549da703df573d1a574d353af",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --without-K --rewriting #-}
open import HoTT
module cw.cohomology.GridPtdMap {i j k}
{X : Ptd i} {Y : Ptd j} {Z : Ptd k}
(f : X ⊙→ Y) (g : Y ⊙→ Z) where
open import cw.cohomology.GridMap (fst f) (fst g) public
Y/X = ⊙Cofiber f
Z/X = ⊙Cofiber (g ⊙∘ f)
Z/Y = ⊙Cofiber g
Y/X-to-Z/X : Y/X ⊙→ Z... | {
"alphanum_fraction": 0.5289855072,
"avg_line_length": 20.7,
"ext": "agda",
"hexsha": "dd50bbf352bd4722b6231be616a0701d9d7d0a24",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2018-12-26T21:31:57.000Z",
"max_forks_repo_forks_event_min_datetime": "2018-12-26T21:31:57.... |
{-# OPTIONS --cubical --no-import-sorts --safe #-}
open import Cubical.Core.Everything
open import Cubical.Foundations.HLevels
module Cubical.Algebra.Semigroup.Construct.Left {ℓ} (Aˢ : hSet ℓ) where
open import Cubical.Foundations.Prelude
open import Cubical.Algebra.Semigroup
import Cubical.Algebra.Magma.Construct.... | {
"alphanum_fraction": 0.7424023155,
"avg_line_length": 23.0333333333,
"ext": "agda",
"hexsha": "bd2170437c18f0a55be098c94c934bd4aa6479f9",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-
Base facts about that the ring ℤ is Bézout domain
-}
{-# OPTIONS --safe #-}
module Cubical.Data.Int.Divisibility where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.Function
open import Cubical.Foundations.HLevels
open import Cubical.Data.Nat
hidi... | {
"alphanum_fraction": 0.5179086044,
"avg_line_length": 32.3866666667,
"ext": "agda",
"hexsha": "075e9f1dd4d7ecb397f9e576e183f5d5e57496aa",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --without-K --safe #-}
module Cats.Category.Constructions.Product where
open import Data.Bool using (Bool ; true ; false ; not)
open import Data.Empty using (⊥)
open import Data.Product using (_,_ ; proj₁ ; proj₂) renaming (_×_ to _×T_)
open import Level
open import Cats.Category.Base
open import Cats.Cat... | {
"alphanum_fraction": 0.4769933715,
"avg_line_length": 29.2086466165,
"ext": "agda",
"hexsha": "9ee9f44a71c592666f66ce2f48975e8118b195ee",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2019-03-18T15:35:07.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-03-18T... |
{- Byzantine Fault Tolerant Consensus Verification in Agda, version 0.9.
Copyright (c) 2020 Oracle and/or its affiliates.
Licensed under the Universal Permissive License v 1.0 as shown at https://opensource.oracle.com/licenses/upl
-}
open import LibraBFT.Prelude
open import LibraBFT.Lemmas
open import LibraBFT.A... | {
"alphanum_fraction": 0.7679882526,
"avg_line_length": 40.0588235294,
"ext": "agda",
"hexsha": "d7edbe14f1a245462ed9754909c797e7df8f1e7c",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module Luau.Syntax.ToString where
open import Luau.Syntax using (Block; Stat; Expr; nil; var; addr; _$_; function⟨_⟩_end; return; function_⟨_⟩_end ;local_←_; _∙_; done; block_is_end)
open import FFI.Data.String using (String; _++_)
open import Luau.Addr.ToString using (addrToString)
open import Luau.Var.ToString using... | {
"alphanum_fraction": 0.6188087774,
"avg_line_length": 31.9,
"ext": "agda",
"hexsha": "afec09352b0e393e61f78596daf9b5dc1a28eb77",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hexsha": "5... |
-- This module is responsible for adding the missing scope information to the parse tree.
module ScopeParseTree where
open import ParseTree
open import Data.Empty
open import ScopeState
open import Data.List hiding (_++_)
open import Data.Product hiding (map)
open import Data.Fin
open import Data.Nat
open import Data.... | {
"alphanum_fraction": 0.7467811159,
"avg_line_length": 38.8333333333,
"ext": "agda",
"hexsha": "5e57ab1dfa0c39d8f88f8470b98336e7dfb68764",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2019-01-31T08:40:41.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-01-31T... |
-- Andreas, 2017-10-17, issue #2807
--
-- Refining with an extended lambda gave internal error.
-- Seemed to be triggered only when giving resulted in an error.
{-# OPTIONS --allow-unsolved-metas #-}
-- {-# OPTIONS -v scope.extendedLambda:60 #-}
-- {-# OPTIONS -v impossible:10 #-}
data ⊥ : Set where
actuallyNotEmp... | {
"alphanum_fraction": 0.6440677966,
"avg_line_length": 22.125,
"ext": "agda",
"hexsha": "921edb45906739dc0956aa04a56d6e5d4b52637c",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-03T14:04... |
{-# OPTIONS --without-K #-}
open import HoTT.Base
open import HoTT.Equivalence
open import HoTT.Identity.Pi
open import HoTT.Identity.Sigma
module HoTT.Exercises.Chapter2.Exercise11 where
private
variable
i j k : Level
A B C D : 𝒰 i
pullback : (A : 𝒰 i) (B : 𝒰 j) → (A → C) → (B → C) → 𝒰 _
pullback A B ... | {
"alphanum_fraction": 0.5294117647,
"avg_line_length": 27.2708333333,
"ext": "agda",
"hexsha": "ab92aad811daab991869221e3098bf6f680cae00",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module Cats.Limit where
open import Level
open import Cats.Category.Base
open import Cats.Category.Cones using
(Cone ; Cones ; HasObj-Cone ; HasArrow-⇒ ; cone-iso→obj-iso ; apFunctor)
open import Cats.Functor using (Functor)
open import Cats.Util.Conv
import Cats.Category.Constructions.Terminal as Terminal
import ... | {
"alphanum_fraction": 0.6053639847,
"avg_line_length": 25.2580645161,
"ext": "agda",
"hexsha": "175f925712352af7b8f789cfea88d0e00f9f60b8",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --without-K --rewriting #-}
open import HoTT
module groups.CoefficientExtensionality {i} {A : Type i} where
module _ (dec : has-dec-eq A) where
Word-coef : Word A → (A → ℤ)
Word-coef nil a = 0
Word-coef (inl a' :: w) a with dec a' a
Word-coef (inl a' :: w) a | inl a'=a = succ $ Word-coef w a
W... | {
"alphanum_fraction": 0.544841369,
"avg_line_length": 46.91015625,
"ext": "agda",
"hexsha": "eef123f3f5c19241dd4f401f6b14a3ad4e2a3fec",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2018-12-26T21:31:57.000Z",
"max_forks_repo_forks_event_min_datetime": "2018-12-26T21:... |
{-# OPTIONS --without-K --rewriting #-}
open import lib.Basics
open import lib.NConnected
open import lib.types.Bool
open import lib.types.Nat
open import lib.types.TLevel
open import lib.types.Suspension
module lib.types.IteratedSuspension where
⊙Susp^ : ∀ {i} (n : ℕ) → Ptd i → Ptd i
⊙Susp^ O X = X
⊙Susp^ (S n) X =... | {
"alphanum_fraction": 0.5243264978,
"avg_line_length": 29.6071428571,
"ext": "agda",
"hexsha": "bdaf29bbc039b4ad582aea19f0b8b76f29503ff0",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-
Basic theory about h-levels/n-types:
- Basic properties of isContr, isProp and isSet (definitions are in Prelude)
- Hedberg's theorem can be found in Cubical/Relation/Nullary/DecidableEq
-}
{-# OPTIONS --cubical --safe #-}
module Cubical.Foundations.HLevels where
open import Cubical.Core.Everything
open import... | {
"alphanum_fraction": 0.540521214,
"avg_line_length": 36.4811594203,
"ext": "agda",
"hexsha": "c592d46ed874a6842987632ef070e1bb8f1d54d6",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hex... |
module Type.Core where
open import Context
open import Function
infix 3 _⊢ᵗ_
infixr 6 _⇒ᵏ_ _⇒_
infixl 7 _∙_
-- | A `Kind` is either a star or an arrow.
data Kind : Set where
⋆ : Kind
_⇒ᵏ_ : Kind -> Kind -> Kind
-- | Kind contexts.
Conᵏ : Set
Conᵏ = Con Kind
mutual
-- | Types of kind `⋆`.
Star : Conᵏ -... | {
"alphanum_fraction": 0.4992360581,
"avg_line_length": 28,
"ext": "agda",
"hexsha": "46cfd6f9e60f2b5a3220996ddff3d4498a7d7d90",
"lang": "Agda",
"max_forks_count": 399,
"max_forks_repo_forks_event_max_datetime": "2022-03-31T11:18:25.000Z",
"max_forks_repo_forks_event_min_datetime": "2018-10-05T09:36:10.... |
module Adjunctions where
open import Library
open import Categories
open import Functors
open Cat
open Fun
record Adj {a b c d}(C : Cat {a}{b})(D : Cat {c}{d}) : Set (a ⊔ b ⊔ c ⊔ d)
where
constructor adjunction
field L : Fun C D
R : Fun D C
left : {X : Obj C}{Y : Obj D} →
... | {
"alphanum_fraction": 0.390513834,
"avg_line_length": 36.1428571429,
"ext": "agda",
"hexsha": "3b010400be8aca1a90510163d675f5cbb010dc66",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2019-11-04T21:33:13.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-11-04T2... |
------------------------------------------------------------------------
-- A combined definition of strong and weak bisimilarity and
-- expansion, along with various properties
------------------------------------------------------------------------
{-# OPTIONS --sized-types #-}
module Delay-monad.Sized.Bisimilarity... | {
"alphanum_fraction": 0.4645029167,
"avg_line_length": 32.8857142857,
"ext": "agda",
"hexsha": "1c3fd1a8ceed5b3964db37a029e0905358c9373a",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --without-K --safe #-}
module Categories.Diagram.Cocone.Properties where
open import Level
open import Categories.Category
open import Categories.Functor
open import Categories.Functor.Properties
open import Categories.NaturalTransformation
open import Categories.Diagram.Cone.Properties
open import Categ... | {
"alphanum_fraction": 0.6324274528,
"avg_line_length": 28.9466666667,
"ext": "agda",
"hexsha": "dba9f470867f9e49c2196f72369d85367a8628e4",
"lang": "Agda",
"max_forks_count": 64,
"max_forks_repo_forks_event_max_datetime": "2022-03-14T02:00:59.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-06-02... |
-- Andreas, 2014-10-23
-- We want to split on hidden variables.
data ℕ : Set where
zero : ℕ
suc : ℕ → ℕ
f : {n : ℕ} → Set₁
f = Set
where
g : {n : ℕ} → Set → Set
g _ = {!.n!}
| {
"alphanum_fraction": 0.5079365079,
"avg_line_length": 13.5,
"ext": "agda",
"hexsha": "41f00278ef825c96a4b919b93261746c897a8baf",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hexsha": "c... |
------------------------------------------------------------------------
-- The Agda standard library
--
-- Coinductive "natural" numbers
------------------------------------------------------------------------
module Data.Conat where
open import Coinduction
open import Data.Nat using (ℕ; zero; suc)
open import Relat... | {
"alphanum_fraction": 0.3937716263,
"avg_line_length": 22.2307692308,
"ext": "agda",
"hexsha": "185e892390ce8b46d5a343286bffdfc5cc843fdf",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
-- A DSL example in the language Agda: "polynomial types"
module TypeDSL where
open import Data.Nat using (ℕ;_+_;_*_)
data E : Set where
Zero : E
One : E
Add : (x : E) -> (y : E) -> E
Mul : (x : E) -> (y : E) -> E
two : E
two = Add One One
four : E
four = Mul two two
-- First semantics: compute the n... | {
"alphanum_fraction": 0.6149974836,
"avg_line_length": 23.1046511628,
"ext": "agda",
"hexsha": "4787ff189c69f1dced0db0a5d9886a52813a2a04",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module IsLiteralFormula where
open import OscarPrelude
open import PredicateName
open import Term
open import Formula
open import HasNegation
data IsLiteralFormula : Formula → Set
where
atomic : (𝑃 : PredicateName) → (τs : Terms) → IsLiteralFormula $ 𝑃[ 𝑃 ♭ τs ]
logical : (𝑃 : PredicateName) → (τs : Terms) ... | {
"alphanum_fraction": 0.7233082707,
"avg_line_length": 31.6666666667,
"ext": "agda",
"hexsha": "dc9f89657b1f8dfad1923912f3cb0cd0efe31749",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
open import Agda.Primitive
postulate
X : Set
Id : Set → Set
module Generic1HIT (S : Set) where
module RecType k (C : Set k) (Necc : Set) where
postulate P : Set
module Flattening k (F : Set → Set) (C : Set k) (Necc : Set) where
-- order f before C matters!
module W = Generic1HIT (F X) -- use of F mat... | {
"alphanum_fraction": 0.665480427,
"avg_line_length": 26.7619047619,
"ext": "agda",
"hexsha": "04ef333d30e179f6c0c7ee80169fcb0ca39b49e1",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-03... |
data Nat : Set where
zero : Nat -- Comment which gets eaten
suc : Nat -> Nat
{-# BUILTIN NATURAL
Nat #-}
f : Nat -> Nat
f a = 3
g : Nat -> Nat
g a = 4
--TODO found first bug
function : Nat -> (Nat -> Nat) -> Nat
function a f = f a
apply : Nat
apply = function 2 g
| {
"alphanum_fraction": 0.5833333333,
"avg_line_length": 12.5454545455,
"ext": "agda",
"hexsha": "2a3e172dc82c0652323cb01de6b7a3803961ae11",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2019-01-31T08:40:41.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-01-31T... |
open import Web.Semantic.DL.ABox using ( ABox )
open import Web.Semantic.DL.Signature using ( Signature )
open import Web.Semantic.DL.TBox using ( TBox )
module Web.Semantic.DL.KB where
infixr 4 _,_
data KB (Σ : Signature) (X : Set) : Set where
_,_ : (T : TBox Σ) → (A : ABox Σ X) → KB Σ X
tbox : ∀ {Σ X} → KB Σ X ... | {
"alphanum_fraction": 0.6140350877,
"avg_line_length": 23.4705882353,
"ext": "agda",
"hexsha": "17998e95fd7d5382517d2e00dc0f7ecb1eca26b2",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2022-03-12T11:40:03.000Z",
"max_forks_repo_forks_event_min_datetime": "2017-12-03T... |
-- Andreas, 2022-03-28, issue #5856, reported by Szumi Xie.
-- Patterns in path-lambdas were simply ignored, but should be illegal.
{-# OPTIONS --cubical #-}
open import Agda.Builtin.Cubical.Path
postulate
A E : Set
a : A
data C : Set where
c : E → C
p : a ≡ a
p = λ (c e) → e
-- WAS: panic about unbound ide... | {
"alphanum_fraction": 0.6666666667,
"avg_line_length": 20.7391304348,
"ext": "agda",
"hexsha": "dd3b3d13e1d1899e1d47869e75392ce25db201aa",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module Issue1245AmbiguousParse where
postulate
A : Set
*_* : A → A
_*_ : A → A → A
module M (_ : A) where
module N (a : A) = M * a * a * a *
| {
"alphanum_fraction": 0.5466666667,
"avg_line_length": 13.6363636364,
"ext": "agda",
"hexsha": "ca7022a4240a170d673d301c48590cf233acddf4",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
------------------------------------------------------------------------
-- Safe modules that use --erased-cubical
------------------------------------------------------------------------
{-# OPTIONS --safe --erased-cubical #-}
module README.Safe.Cubical.Erased where
-- Paths, extensionality and univalence.
import ... | {
"alphanum_fraction": 0.7581755594,
"avg_line_length": 22.5631067961,
"ext": "agda",
"hexsha": "9ce94b7caaa0ed9dc1c706d8706133bcc38604b4",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
------------------------------------------------------------------------------
-- Translation of projection-like functions
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polym... | {
"alphanum_fraction": 0.5608108108,
"avg_line_length": 30.8333333333,
"ext": "agda",
"hexsha": "2a9ffb933d0f477895ea25cbd975bb0fe61442f8",
"lang": "Agda",
"max_forks_count": 4,
"max_forks_repo_forks_event_max_datetime": "2016-08-03T03:54:55.000Z",
"max_forks_repo_forks_event_min_datetime": "2016-05-10T... |
module _ where
open import Common.Prelude
open import Lib.Vec
_∘_ : ∀ {a b c} {A : Set a} {B : A → Set b} {C : ∀ x → B x → Set c}
(f : ∀ {x} (y : B x) → C x y) (g : ∀ x → B x) → ∀ x → C x (g x)
(f ∘ g) x = f (g x)
sum : ∀ {n} → Vec Nat n → Nat
sum (x ∷ xs) = x + sum xs
sum [] = 0
foldl : ∀ {A}{B : Nat → S... | {
"alphanum_fraction": 0.4759206799,
"avg_line_length": 25.2142857143,
"ext": "agda",
"hexsha": "2136d8dd0e32c7114cdd4a6e382c6af60e8a9dfe",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --safe #-}
module Cubical.Algebra.NatSolver.Examples where
open import Cubical.Foundations.Prelude
open import Cubical.Data.FinData
open import Cubical.Data.Nat
open import Cubical.Data.Vec.Base
open import Cubical.Algebra.NatSolver.NatExpression
open import Cubical.Algebra.NatSolver.HornerForms
open imp... | {
"alphanum_fraction": 0.479811098,
"avg_line_length": 28.6148648649,
"ext": "agda",
"hexsha": "f177de40487a7f69838d96fd88ea012f1eff04aa",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hex... |
module Tuples where
open import Haskell.Prelude
swap : a × b → b × a
swap (a , b) = b , a
{-# COMPILE AGDA2HS swap #-}
unit2unit : ⊤ → Tuple []
unit2unit tt = []
{-# COMPILE AGDA2HS unit2unit #-}
| {
"alphanum_fraction": 0.6089108911,
"avg_line_length": 13.4666666667,
"ext": "agda",
"hexsha": "0a70371962ff28eaf00b403e53d8229599949e9f",
"lang": "Agda",
"max_forks_count": 18,
"max_forks_repo_forks_event_max_datetime": "2022-03-12T11:42:52.000Z",
"max_forks_repo_forks_event_min_datetime": "2020-10-21... |
-- Andreas, 2016-12-29, issue #2366
-- With clauses need to be printed in fresh environment,
-- as they DON'T shadow the pattern variables of the parent clause.
-- (These are not even in scope)
-- {-# OPTIONS -v error.checkclause:60 #-}
open import Agda.Builtin.List
test : {A : Set} → List A → List A
test (x ∷ y ∷ y... | {
"alphanum_fraction": 0.6192214112,
"avg_line_length": 28.3448275862,
"ext": "agda",
"hexsha": "0030be87b044bdd913b9e3611389fa36091e6cc8",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
open import Agda.Builtin.Equality
open import Agda.Builtin.Nat
foo : Nat → (Nat → Nat) → Nat
foo zero f = f zero
foo (suc n) f = foo n λ n → f (suc n)
fsuc : (Nat → Nat) → Nat → Nat
fsuc f n = f (suc n)
foo' : Nat → (Nat → Nat) → Nat
foo' zero f = f zero
foo' (suc n) f = foo' n (fsuc f)
foo'' : Nat → (Nat → ... | {
"alphanum_fraction": 0.5459459459,
"avg_line_length": 19.8214285714,
"ext": "agda",
"hexsha": "167ec9ae41a6cb029b9db7944a86f39b87aadf56",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
-- Andreas, 2013-02-27 issue reported by Nisse
-- {-# OPTIONS -v tc.polarity:100 -v tc.pos:100 #-}
module Issue802 where
data I : Set where
i : I
mutual
data P : I → Set where
p : (x : I) → Q x x → P x
Q : I → I → Set
Q i = P
-- Polarity of Q should be mixed for both arguments.
f : (x y : I) → Q x y ... | {
"alphanum_fraction": 0.5569358178,
"avg_line_length": 20.125,
"ext": "agda",
"hexsha": "bd27f80cc8686ea63730f8d715a529b920deb413",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-03T14:04... |
module BHeap.Heap {A : Set}(_≤_ : A → A → Set) where
open import BHeap _≤_
open import Bound.Lower A
open import Bound.Lower.Order _≤_
open import BTree.Heap _≤_
lemma-bheap-heap : {b : Bound}(h : BHeap b) → Heap (forget h)
lemma-bheap-heap lf = leaf
lemma-bheap-heap (nd {x = x} _ lf lf) = single x
lemma-bheap-heap ... | {
"alphanum_fraction": 0.6299093656,
"avg_line_length": 47.2857142857,
"ext": "agda",
"hexsha": "a05534c90196e8da324eacb0a1ea129d141c846d",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
-- Andreas, 2013-09-17 catches a bug in constraint solving
-- with meta-variables applied to underapplied record constructors
-- {-# OPTIONS --show-implicit -v tc.meta.assign:50 -v tc.conv.elim:30 #-}
module Issue889 where
record Monad (M : Set → Set) : Set₁ where
field
return : ∀ {A} → A → M A
_>>=_ : ∀ {A... | {
"alphanum_fraction": 0.5662037037,
"avg_line_length": 32.2388059701,
"ext": "agda",
"hexsha": "b4a0570aad1588caa992f606f222db637a129dc4",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
open import AEff
open import EffectAnnotations
open import Renamings
open import Types hiding (``)
open import Relation.Binary.PropositionalEquality hiding ([_])
module Substitutions where
-- SET OF SUBSTITUTIONS BETWEEN CONTEXTS
Sub : Ctx → Ctx → Set
Sub Γ Γ' = {X : VType} → X ∈ Γ → Γ' ⊢V⦂ X
-- IDENTITY AND EXTE... | {
"alphanum_fraction": 0.4680962343,
"avg_line_length": 22.7619047619,
"ext": "agda",
"hexsha": "6427665c6d832413e1dfca80d44c2c0c693576bc",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
------------------------------------------------------------------------------
-- Problem with a simplified version of the combinators for preorder
-- reasoning
------------------------------------------------------------------------------
{-# OPTIONS --allow-unsolved-metas #-}
{-# OPTIONS --exact-split ... | {
"alphanum_fraction": 0.4773901809,
"avg_line_length": 25.5867768595,
"ext": "agda",
"hexsha": "84aef8f47e4e5fb39fd8a0e1b02c9b055396a582",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2018-03-14T08:50:00.000Z",
"max_forks_repo_forks_event_min_datetime": "2016-09-19T... |
{- wip, coming to realise that the instance of IsSetoid defined in Data.Equality.properties is over-eager (defining _≡_ for all (A : Set (a : Level)), _≡̇_ for ∀ (x : A : Set (a : Level)) → (B : A → Set (b : Level)) x -}
-- add samples of stuff from unification (AList, etc.)
module Oscar.Data5 where
record ⊤ : Set whe... | {
"alphanum_fraction": 0.5027402265,
"avg_line_length": 31.28,
"ext": "agda",
"hexsha": "c2545d039caa9d4ec945bf63066f469c0b568c0b",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hexsha": "... |
module ProjectionLikeAndMatching where
data Unit : Set where
* : Unit
data Box A : Set where
[_] : A → Box A
-- Unbox should not be considered projection-like since it's matching on more than
-- the eliminatee.
unbox : ∀ {A} → Box A → Unit → A
unbox [ x ] * = x
postulate
Thm : {A : Set} → A → Set
prf : {A :... | {
"alphanum_fraction": 0.6108291032,
"avg_line_length": 24.625,
"ext": "agda",
"hexsha": "481e6eea60ee108dee60aaa1f7d45f011b94f8c8",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2019-03-05T20:02:38.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-03-05T20:02:3... |
------------------------------------------------------------------------
-- The Agda standard library
--
-- Induced preorders
------------------------------------------------------------------------
open import Relation.Binary
module Relation.Binary.InducedPreorders
{s₁ s₂}
(S : Setoid s₁ s₂) -- Th... | {
"alphanum_fraction": 0.5129682997,
"avg_line_length": 28.3265306122,
"ext": "agda",
"hexsha": "53d343b2d6602e0493bbe84a40a78f4fe9e36374",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --without-K --safe #-}
module Cats.Category.Setoids.Facts.Terminal where
open import Level
open import Relation.Binary using (Setoid)
open import Cats.Category
open import Cats.Category.Setoids using (Setoids)
import Data.Unit as Unit
⊤ : ∀ {l l′} → Setoid l l′
⊤ = record
{ Carrier = Lift _ Unit.⊤
... | {
"alphanum_fraction": 0.6615044248,
"avg_line_length": 19.652173913,
"ext": "agda",
"hexsha": "9f9f5f0f201c65342a02f6fdff6e150c0368e249",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2019-03-18T15:35:07.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-03-18T1... |
module Data.QuadTree.Implementation.SafeFunctions where
open import Haskell.Prelude renaming (zero to Z; suc to S)
open import Data.Lens.Lens
open import Data.Logic
open import Data.QuadTree.Implementation.PropDepthRelation
open import Data.QuadTree.Implementation.Definition
open import Data.QuadTree.Implementation.Va... | {
"alphanum_fraction": 0.7068493151,
"avg_line_length": 40.5555555556,
"ext": "agda",
"hexsha": "d67d72c26800ef95e6f61d246b5d8ae348c6aed3",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.