Search is not available for this dataset
text string | meta dict |
|---|---|
open import Common.Reflection
open import Common.Prelude
open import Common.Equality
open import Agda.Builtin.Sigma
pattern `Nat = def (quote Nat) []
pattern _`→_ a b = pi (vArg a) (abs "_" b)
pattern `Set = sort (lit 0)
pattern `⊥ = def (quote ⊥) []
pattern `zero = con (quote zero) []
pattern `suc n = co... | {
"alphanum_fraction": 0.511517077,
"avg_line_length": 26.2291666667,
"ext": "agda",
"hexsha": "15170e75a845fccf29acde8443d184475635d913",
"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... |
{- Byzantine Fault Tolerant Consensus Verification in Agda, version 0.9.
Copyright (c) 2020, 2021, 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.ImplShared.Base.Types
open import LibraBFT.Abstra... | {
"alphanum_fraction": 0.7361464159,
"avg_line_length": 37.1132075472,
"ext": "agda",
"hexsha": "e23c3ff48cf82582086fb852928bee209ea4676f",
"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 _ where
open import Common.Prelude hiding (_>>=_)
open import Common.Reflection
open import Common.Equality
infix 0 case_of_
case_of_ : ∀ {a b} {A : Set a} {B : Set b} → A → (A → B) → B
case x of f = f x
blockOnFresh : TC ⊤
blockOnFresh =
checkType unknown unknown >>= λ
{ (meta m _) → blockOnMeta m
; _... | {
"alphanum_fraction": 0.6865671642,
"avg_line_length": 21.44,
"ext": "agda",
"hexsha": "32fe6f6609c93ea2a836e23e8f59acb921f432f4",
"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:... |
-- There was a bug with the open M es syntax.
module Issue31 where
record M : Set1 where
field
A : Set
module MOps (m : M) where
open M m public
postulate m : M
open MOps m hiding (A)
open MOps m using (A)
postulate foo : A -> Set
module AnotherBug where
postulate Z : Set
module A (X : Set) where
... | {
"alphanum_fraction": 0.6339869281,
"avg_line_length": 12.75,
"ext": "agda",
"hexsha": "1fd3ab9fe73e0df6b231ca6462da7e03ee700f7f",
"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 Control.Monad.Reader where
open import Prelude
open import Control.Monad.Zero
open import Control.Monad.Identity
open import Control.Monad.Transformer
record ReaderT {a} (R : Set a) (M : Set a → Set a) (A : Set a) : Set a where
no-eta-equality
constructor readerT
field runReaderT : R → M A
open ReaderT... | {
"alphanum_fraction": 0.6208625878,
"avg_line_length": 31.6507936508,
"ext": "agda",
"hexsha": "ed9d8c08c13764fa0a4a4013c8bd292500bd22fa",
"lang": "Agda",
"max_forks_count": 24,
"max_forks_repo_forks_event_max_datetime": "2021-04-22T06:10:41.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-03-12... |
module BasicT.Metatheory.GentzenNormalForm-Unknown where
open import BasicT.Syntax.GentzenNormalForm public
-- Forcing. (In a particular model?)
infix 3 _⊩_
_⊩_ : Cx Ty → Ty → Set
Γ ⊩ α P = Γ ⊢ⁿᶠ α P
Γ ⊩ A ▻ B = Γ ⊢ⁿᵉ A ▻ B ⊎ ∀ {Γ′} → Γ ⊆ Γ′ → Γ′ ⊩ A → Γ′ ⊩ B
Γ ⊩ A ∧ B = Γ ⊢ⁿᵉ A ∧ B ⊎ Γ ⊩ A × Γ ⊩ B
Γ ⊩ ⊤ = Γ ... | {
"alphanum_fraction": 0.4814814815,
"avg_line_length": 27.4682080925,
"ext": "agda",
"hexsha": "4dd08a6a469b53f09b204d9e2045cefa41681e20",
"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 Logics.And where
open import Function
------------------------------------------------------------------------
-- definitions
infixl 5 _∧_
infixl 4 _⇔_
data _∧_ (P Q : Set) : Set where
∧-intro : P → Q → P ∧ Q
_⇔_ : (P Q : Set) → Set
p ⇔ q = (p → q) ∧ (q → p)
----------------------------------------------... | {
"alphanum_fraction": 0.3535911602,
"avg_line_length": 23.6086956522,
"ext": "agda",
"hexsha": "6c97c3591f3e96fc0336ece9cc7ab262f74172ee",
"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 NoQualifiedInstances.ParameterizedImport.A (T : Set) where
record I : Set where
postulate instance i : I
| {
"alphanum_fraction": 0.7807017544,
"avg_line_length": 19,
"ext": "agda",
"hexsha": "dcc04e1544f126e424519c78ab8a07108ce45307",
"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:08.... |
module Data.Tuple.List{ℓ} where
import Lvl
open import Data using (Unit ; <>)
open import Data.Tuple using (_⨯_ ; _,_)
import Data.List
open Data.List using (List)
open import Type{ℓ}
-- Constructs a tuple from a list
Tuple : List(Type) → Type
Tuple(List.∅) = Unit
Tuple(T List.⊰ List.∅) = T
... | {
"alphanum_fraction": 0.5351851852,
"avg_line_length": 29.4545454545,
"ext": "agda",
"hexsha": "2cafc335918adbfd02ba4661f1b7d7e6b00fd942",
"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.Data.Empty.Properties where
open import Cubical.Core.Everything
open import Cubical.Foundations.Prelude
open import Cubical.Data.Empty.Base
isProp⊥ : isProp ⊥
isProp⊥ ()
isContr⊥→A : ∀ {ℓ} {A : Type ℓ} → isContr (⊥ → A)
fst isContr⊥→A ()
snd isContr... | {
"alphanum_fraction": 0.6918429003,
"avg_line_length": 20.6875,
"ext": "agda",
"hexsha": "fdc609563a0452c919bd941b47b1f88673b67f5b",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-11-22T02:02:01.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-11-22T02:02:... |
{- Byzantine Fault Tolerant Consensus Verification in Agda, version 0.9.
Copyright (c) 2021, 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.Impl.Consensus.EpochManagerTypes
import LibraBFT.Im... | {
"alphanum_fraction": 0.7425200169,
"avg_line_length": 43.1454545455,
"ext": "agda",
"hexsha": "7e96b8c7fc538c4290f4508423425c9913578658",
"lang": "Agda",
"max_forks_count": 6,
"max_forks_repo_forks_event_max_datetime": "2022-02-18T01:04:32.000Z",
"max_forks_repo_forks_event_min_datetime": "2020-12-16T... |
{-# OPTIONS --without-K --safe #-}
module Dodo.Unary.Intersection where
-- Stdlib imports
import Relation.Binary.PropositionalEquality as Eq
open Eq using (refl; _≡_)
open import Level using (Level; _⊔_)
open import Function using (_∘₂_)
open import Data.Product using (_×_; _,_; swap; proj₁; proj₂)
open import Relati... | {
"alphanum_fraction": 0.5079465989,
"avg_line_length": 25.3709677419,
"ext": "agda",
"hexsha": "254f41123241614b94da94e6c7d6c439f6a7bb81",
"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 #-}
open import Agda.Primitive.Cubical
open import Agda.Builtin.Cubical.Path
open import Agda.Builtin.Unit
data S : Set where
base : S
foo : ∀ i j k → Partial _ S
foo i j k (i = i0)(k = i1) = base
foo i j k (j = i1) = base
-- Testing that fallthrough patterns get expanded when compi... | {
"alphanum_fraction": 0.6666666667,
"avg_line_length": 27,
"ext": "agda",
"hexsha": "f65357e3f10a375b43ed20ff2f2c3d30563cb1d9",
"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:08.... |
module Relation.Unary.Membership {a} (A : Set a) where
open import Level
open import Data.Product using (_×_; _,_; proj₁; proj₂)
open import Relation.Unary
open import Relation.Binary
infixl 4 _≋_
_≋_ : Rel (Pred A a) _
P ≋ Q = P ⊆′ Q × Q ⊆′ P
⊆-refl : Reflexive (_⊆′_ {a} {A} {a})
⊆-refl {pred} x P = P
≋-refl : Ref... | {
"alphanum_fraction": 0.5506736965,
"avg_line_length": 23.3835616438,
"ext": "agda",
"hexsha": "46f863ac7f1129cb961fd30cf7fce6d11b3de91e",
"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 Agda standard library
--
-- Sums of binary relations
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Data.Sum.Relation.Binary.LeftOrder where
open import Data.Sum as Sum
... | {
"alphanum_fraction": 0.5344431688,
"avg_line_length": 42.3157894737,
"ext": "agda",
"hexsha": "06edca09ccb86e4c1781107c3498239b51163964",
"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 Golden where
open import Basics
open import Vec
open import Ix
open import Cutting
open import Interior
open import Tensor
open RECTANGLE
open INTERIOR RectCut
ind : (n : Nat)(P : Nat -> Set) -> P zero ->
((k : Nat) -> P k -> P (suc k)) -> P n
ind zero P pz ps = pz
ind (suc n) P pz ps = ps n (ind n P ... | {
"alphanum_fraction": 0.5066518847,
"avg_line_length": 33,
"ext": "agda",
"hexsha": "cfedca298ef3b6928c6b7f9756fb65e315421a92",
"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": "454... |
{-# OPTIONS --without-K --safe #-}
module Experiment.Categories.Category.Monoidal.Strict where
| {
"alphanum_fraction": 0.75,
"avg_line_length": 24,
"ext": "agda",
"hexsha": "1e5c9ea6b680509b76dbbc5f1ff37d06ff4f76c8",
"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": "37200ea91d3... |
{-# OPTIONS --rewriting --prop #-}
open import common
open import syntx as N
open import derivability as N2
open import typingrules
open import structuralrules
open import typetheories
open import examples
open import traditional as T
Σ : Signature
Σ = TTSig ΠUEl-TT
{- Maps between expressions -}
T→N : {n : ℕ} {... | {
"alphanum_fraction": 0.4903649478,
"avg_line_length": 59.4179104478,
"ext": "agda",
"hexsha": "c62a5543c82bdf364aa287006d9a1a5cce135df0",
"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 --rewriting --confluence-check #-}
open import Agda.Builtin.List
open import Agda.Builtin.Nat
open import Agda.Builtin.Equality
open import Agda.Builtin.Equality.Rewrite
variable
A B : Set
x y z : A
xs ys zs : List A
f : A → B
m n : Nat
cong : (f : A → B) → x ≡ y → f x ≡ f y
cong f refl = refl
... | {
"alphanum_fraction": 0.5003903201,
"avg_line_length": 20.015625,
"ext": "agda",
"hexsha": "ad35f5c9419f1752354034e0ba2f2f86d29d14d2",
"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... |
module Luau.Var.ToString where
open import Agda.Builtin.String using (String)
open import Luau.Var using (Var)
varToString : Var → String
varToString x = x
| {
"alphanum_fraction": 0.7672955975,
"avg_line_length": 17.6666666667,
"ext": "agda",
"hexsha": "10cd915b64022e094dcfc20eb593685faae7d609",
"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 Issue739 where
record ⊤ : Set where
constructor tt
record Σ (A : Set) (B : A → Set) : Set where
constructor _,_
field
fst : A
snd : B fst
uncurry : {A : Set} {B : A → Set} →
((x : A) → B x → Set) →
Σ A B → Set
uncurry f (x , y) = f x y
data U : Set₁
El : U → Set
infixl 5 ... | {
"alphanum_fraction": 0.4750542299,
"avg_line_length": 13.6930693069,
"ext": "agda",
"hexsha": "797e7796ebb4b5dad3a466c477b7126e9ca6cfe9",
"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... |
{-# OPTIONS --safe --warning=error --without-K #-}
open import LogicalFormulae
open import Setoids.Setoids
open import Groups.Definition
open import Sets.EquivalenceRelations
open import Groups.Abelian.Definition
open import Groups.Homomorphisms.Definition
open import Groups.DirectSum.Definition
open import Groups.Iso... | {
"alphanum_fraction": 0.6913849509,
"avg_line_length": 73.36,
"ext": "agda",
"hexsha": "ce0f764ccaff81fc03a4466bc8412f4c2b22033f",
"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-29T13:23:07... |
open import Agda.Primitive
variable
a : Level
postulate
works : Set a → {a : Set} → a
fails : Set a → {a : Set} → {!a!}
module _ (A : Set a) (a : A) where
x : A
x = a
| {
"alphanum_fraction": 0.5359116022,
"avg_line_length": 12.9285714286,
"ext": "agda",
"hexsha": "1e50dba5e509ca01d213aa27fc9724b63be8fbe5",
"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 --cubical --no-import-sorts --safe #-}
module Cubical.ZCohomology.KcompPrelims where
open import Cubical.ZCohomology.Base
open import Cubical.Homotopy.Connected
open import Cubical.HITs.Hopf
open import Cubical.Homotopy.Freudenthal hiding (encode)
open import Cubical.HITs.Sn
open import Cubical.HITs.S1
ope... | {
"alphanum_fraction": 0.5911798071,
"avg_line_length": 47.6486486486,
"ext": "agda",
"hexsha": "30c94aecd33299100ccbcd687356b2bcd5cc3d54",
"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 lib.Basics
open import lib.types.Sigma
open import lib.types.Bool
open import lib.types.Int
module lib.types.List where
infixr 60 _::_
data List {i} (A : Type i) : Type i where
nil : List A
_::_ : A → List A → List A
module _ {i} {A : Type i} where
infixr 8... | {
"alphanum_fraction": 0.4710689046,
"avg_line_length": 30.1866666667,
"ext": "agda",
"hexsha": "073ff81fc654dc42e92daaa8b68852d6c045f8f6",
"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, 2016-01-18, Issue1778, reported by mechvel
-- record pattern elimination must preserve hiding information
-- {-# OPTIONS --show-implicit #-}
open import Common.Prelude using (⊤)
open import Common.Equality
open import Common.Product
-- assuming _×_ is a record type (not data type)
module _ (A : Set) (let... | {
"alphanum_fraction": 0.6511627907,
"avg_line_length": 27.7419354839,
"ext": "agda",
"hexsha": "c3e5beed387a45bf46b36f497c38f72693ef1001",
"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 #-}
-- Given a predicate on the objects of a Category C, build another category
-- with just those that satisfy a pr
module Categories.Category.Construction.ObjectRestriction where
open import Level
open import Data.Product using (Σ; proj₁)
open import Relation.Unary using (Pred)
open ... | {
"alphanum_fraction": 0.6725768322,
"avg_line_length": 24.1714285714,
"ext": "agda",
"hexsha": "607556fd7a030f53147f8c6e636f47a84bd3c84c",
"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... |
module Cats.Category.Setoids.Facts.Terminal where
open import Data.Unit using (⊤)
open import Level
open import Cats.Category
open import Cats.Category.Setoids using (Setoids)
module Build {l} {l≈} where
open Category (Setoids l l≈)
One : Obj
One = record
{ Carrier = Lift l ⊤
; _≈_ = λ _ _ → Li... | {
"alphanum_fraction": 0.6352313167,
"avg_line_length": 16.0571428571,
"ext": "agda",
"hexsha": "a586cdc46896716cd602e17b8c0d93d5b681afbf",
"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 BTA6 where
----------------------------------------------
-- Preliminaries: Imports and List-utilities
----------------------------------------------
open import Data.Nat hiding (_<_)
open import Data.Bool
open import Function using (_∘_)
open import Data.List
open import Relation.Nullary
open import Relation.... | {
"alphanum_fraction": 0.5365696626,
"avg_line_length": 39.371356147,
"ext": "agda",
"hexsha": "12ec94499394b4a24e2b520bad5c3e2c0b00c284",
"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-15T0... |
module Prelude where
id : {A : Set} -> A -> A
id x = x
_·_ : {A B C : Set} -> (B -> C) -> (A -> B) -> (A -> C)
f · g = \ x -> f (g x)
flip : {A B C : Set} -> (A -> B -> C) -> B -> A -> C
flip f x y = f y x
Rel : Set -> Set1
Rel X = X -> X -> Set
data False : Set where
record True : Set where
tt : True
tt = _
! ... | {
"alphanum_fraction": 0.495049505,
"avg_line_length": 19.2921348315,
"ext": "agda",
"hexsha": "95c9defc30a18b5b09df754ae9fc41378aa7b079",
"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... |
postulate
@0 A : Set
_ : (@0 B : Set) .(C : Set) → Set
_ = λ B C → ?
| {
"alphanum_fraction": 0.4305555556,
"avg_line_length": 12,
"ext": "agda",
"hexsha": "853a95ce76a537792f82712059a8c8538f07caa4",
"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:08.... |
import Common.Level
open import Common.Equality
record Sigma (A : Set)(B : A -> Set) : Set where
constructor _,_
field
fst : A
snd : B fst
open Sigma
-- projected bound var
fail : (A : Set) (B : A -> Set) ->
let X : A -> Sigma A B
X = _
in (z : Sigma A B) -> X (fst z) ≡ z
fail A B z = refl
| {
"alphanum_fraction": 0.5597484277,
"avg_line_length": 16.7368421053,
"ext": "agda",
"hexsha": "a9525b76e54ed104829ca1aa7c14452633011824",
"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... |
------------------------------------------------------------------------
-- Another definition of indexed containers
------------------------------------------------------------------------
-- Partly based on "Indexed containers" by Altenkirch, Ghani, Hancock,
-- McBride and Morris, and partly based on "Non-wellfounde... | {
"alphanum_fraction": 0.4224859422,
"avg_line_length": 41.3351351351,
"ext": "agda",
"hexsha": "22e8a27442c92ee48072d4de492520c077fe99e1",
"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... |
import Lvl
-- TODO: Just testing how it goes with creating an axiomatic system
module Geometry.Test (Point : Set(Lvl.𝟎)) where
open import Functional
open import Logic.Propositional{Lvl.𝟎}
open import Logic.Predicate{Lvl.𝟎}{Lvl.𝟎}
open import Relator.Equals{Lvl.𝟎}{Lvl.𝟎}
-- open import Structure.Setoid.Uniquene... | {
"alphanum_fraction": 0.6548971446,
"avg_line_length": 41.7564102564,
"ext": "agda",
"hexsha": "e9a148383668fee882e6d2277fa04ef5ceb321e1",
"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 Oscar.Data.Permutation where
--open import Data.Permutation public
import Data.Permutation as P
open import Data.Permutation renaming (delete to deleteP; _∘_ to _∘P_; enum to allInj)
open import Oscar.Data.Vec renaming (delete to deleteV; map to mapV)
open import Relation.Binary.PropositionalEquality
open i... | {
"alphanum_fraction": 0.5015330705,
"avg_line_length": 46.4338983051,
"ext": "agda",
"hexsha": "0e9b90e1cff47752e8d5e3241056316a6623cde0",
"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 Type.Quotient where
open import Logic
open import Relator.Equals
open import Type
open import Lvl
private variable ℓ₁ : Lvl.Level
private variable ℓ₂ : Lvl.Level
data _/_ (T : Type{ℓ₁}) (_≅_ : T → T → Stmt{ℓ₂}) : Type{ℓ₁ Lvl.⊔ ℓ₂} where
[_] : T → (T / (_≅_))
[/]-equiv-to-eq : ∀{x y : T} → (x ≅ y) → ([ x ... | {
"alphanum_fraction": 0.525,
"avg_line_length": 28.2352941176,
"ext": "agda",
"hexsha": "fdc8e6d10f86b9a195ec450754a3821f7a4f3565",
"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 Issue292-27 where
postulate A : Set
data D : Set → Set where
d₁ : D A
d₂ : D (A → A)
data P : (B : Set) → B → D B → Set₁ where
p₁ : (x : A) → P A x d₁
p₂ : (f : A → A) → P (A → A) f d₂
Foo : (x : A) → P A x d₁ → Set₁
Foo x (p₁ .x) = Set
-- Cannot decide whether there should be a case for ... | {
"alphanum_fraction": 0.5755813953,
"avg_line_length": 21.5,
"ext": "agda",
"hexsha": "877df5443c75707d475db564ec36b2b4168c58cd",
"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:0... |
{-# OPTIONS --cubical --safe #-}
module Algebra.Construct.Free.Semilattice.FromList where
open import Prelude
open import Algebra.Construct.Free.Semilattice.Definition
open import Algebra.Construct.Free.Semilattice.Eliminators
open import Algebra.Construct.Free.Semilattice.Relation.Unary
open import Data.List
import ... | {
"alphanum_fraction": 0.6906290116,
"avg_line_length": 32.4583333333,
"ext": "agda",
"hexsha": "2ebbccc32e64debc1c9e60087cdec51fcf3d12fc",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-01-05T14:05:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-01-05T... |
------------------------------------------------------------------------
-- Integers
------------------------------------------------------------------------
-- This module contains some basic definitions with few dependencies
-- (in particular, not Groupoid). See Integer for more definitions.
-- The definitions below... | {
"alphanum_fraction": 0.4735766423,
"avg_line_length": 22.5328947368,
"ext": "agda",
"hexsha": "afd8e5521271f7d43996283561b959048ff4c502",
"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 --experimental-lossy-unification #-}
module Cubical.Categories.Limits.RightKan where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Structure
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Powerset
open import Cubical.Data.Sigma
open import Cubical.... | {
"alphanum_fraction": 0.5020095694,
"avg_line_length": 41.1417322835,
"ext": "agda",
"hexsha": "7dd85972e3e866fe6252b5b46e3110ee7aac3248",
"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, 2012-09-13
module RelevanceSubtyping where
-- this naturally type-checks:
one : {A B : Set} → (.A → B) → A → B
one f x = f x
-- this type-checks because of subtyping
one' : {A B : Set} → (.A → B) → A → B
one' f = f
| {
"alphanum_fraction": 0.5895196507,
"avg_line_length": 20.8181818182,
"ext": "agda",
"hexsha": "1c3260ba57cb4256532dcd6fbd8b2d5d24d55e2b",
"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... |
-- also importing warnings from A
import A
| {
"alphanum_fraction": 0.75,
"avg_line_length": 11,
"ext": "agda",
"hexsha": "21bf38678c83efeff1e9340db8e84f4239ab967b",
"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:08.000Z",
... |
{-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.HITs.S1.Properties where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.GroupoidLaws
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Isomorphism
open import Cubical.F... | {
"alphanum_fraction": 0.6004803843,
"avg_line_length": 35.6857142857,
"ext": "agda",
"hexsha": "c5c56ceae337d70b405a575d3a6bf46538fab515",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-11-22T02:02:01.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-11-22T... |
{-# OPTIONS --safe #-}
open import Data.List as List hiding ([_])
module JVM.Compiler.Monad (T : Set) (⟨_⇒_⟩ : T → T → List T → Set) (nop : ∀ {τ} → ⟨ τ ⇒ τ ⟩ []) where
open import Level
open import Function using (_∘_)
open import Data.Product hiding (_<*>_)
open import Relation.Unary
open import Relation.Unary.Predi... | {
"alphanum_fraction": 0.7045454545,
"avg_line_length": 33.2444444444,
"ext": "agda",
"hexsha": "625a2d6e8ef5f90ea6e201d9e88a781ec79c8d9c",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-12-28T17:37:15.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-12-28T... |
open import MLib.Prelude.FromStdlib
module MLib.Prelude.TransitiveProver {a p} {A : Set a} (_⇒_ : A → A → Set p) (trans : Transitive _⇒_) where
import MLib.Prelude.DFS as DFS
open import MLib.Prelude.Path
open List using ([]; _∷_)
open import Relation.Nullary using (yes; no)
open import Relation.Binary using (Deci... | {
"alphanum_fraction": 0.6542119565,
"avg_line_length": 30.0408163265,
"ext": "agda",
"hexsha": "b51be75a7a44fcd1a15db0e55bbead3d18422e9e",
"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 Agda standard library
--
-- The unit type and the total relation on unit
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Data.Unit.Base where
----------------------------... | {
"alphanum_fraction": 0.4018348624,
"avg_line_length": 28.6842105263,
"ext": "agda",
"hexsha": "1e7d2986664a627f370e5122c773cf31b5a2b717",
"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... |
------------------------------------------------------------------------------
-- Agda-Prop Library.
-- Properties.
------------------------------------------------------------------------------
open import Data.Nat using ( ℕ )
module Data.PropFormula.Properties ( n : ℕ ) where
--------------------------------------... | {
"alphanum_fraction": 0.4171497102,
"avg_line_length": 27.9497206704,
"ext": "agda",
"hexsha": "41b34ddffd9f4acb7c6215f0d2752e44803d2d0d",
"lang": "Agda",
"max_forks_count": 2,
"max_forks_repo_forks_event_max_datetime": "2017-12-01T17:01:25.000Z",
"max_forks_repo_forks_event_min_datetime": "2017-03-30T... |
------------------------------------------------------------------------
-- The Agda standard library
--
-- This module is DEPRECATED. Please use `Algebra` or
-- `Algebra.Definitions` instead.
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
open import Relat... | {
"alphanum_fraction": 0.5604575163,
"avg_line_length": 29.1428571429,
"ext": "agda",
"hexsha": "0e0b30442d3498a0d2177ebb8aa17e203e178a2e",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-11-04T06:54:45.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-11-04T... |
{-# OPTIONS --type-in-type #-}
module Lec6 where
open import Lec1Done
ListF : Set -> Set -> Set
ListF X T = One + (X * T)
data List (X : Set) : Set where
<_> : (ListF X) (List X) -> (List X)
infixr 4 _,-_
listF : {X T U : Set} -> (T -> U) -> (ListF X) T -> (ListF X) U
listF g (inl <>) = inl <>
listF g (inr ... | {
"alphanum_fraction": 0.4815202232,
"avg_line_length": 26.8037383178,
"ext": "agda",
"hexsha": "19534027526ee6c0d06cace1adfb2dc71022b2e9",
"lang": "Agda",
"max_forks_count": 8,
"max_forks_repo_forks_event_max_datetime": "2021-09-21T15:58:10.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-04-13T... |
{-# OPTIONS --safe #-}
module Cubical.Functions.Surjection where
open import Cubical.Core.Everything
open import Cubical.Data.Sigma
open import Cubical.Data.Unit
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Isomorphism
open import Cubical.Foundations.E... | {
"alphanum_fraction": 0.660247093,
"avg_line_length": 33.975308642,
"ext": "agda",
"hexsha": "d03594b963e8cbc6124c80d32fe51e13c9f105a5",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-03-12T20:08:45.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-03-12T20... |
module Prelude where
-- Simple data
open import Data.Bool public
using (Bool ; false ; true ; not)
open import Data.Empty public
using (⊥ ; ⊥-elim)
open import Data.Nat public
using (
ℕ ; zero ; suc
; _+_ ; _*_
; _≤_ ; z≤n ; s≤s
; _<_ ; _≟_ ; pred
)
open import Data.Maybe public
using (Maybe ; just ;... | {
"alphanum_fraction": 0.6119974474,
"avg_line_length": 22.3857142857,
"ext": "agda",
"hexsha": "dae94ab2595f98b00c47dffb2844cccbe08b71b6",
"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 #-}
module Model.Size where
open import Relation.Binary using (Rel ; Preorder ; IsPreorder)
import Data.Nat as ℕ
import Data.Nat.Induction as ℕ
import Data.Nat.Properties as ℕ
import Relation.Binary.Construct.On as On
open import Model.RGraph as RG using (RGraph)
open import Source.Size as S ... | {
"alphanum_fraction": 0.4378064645,
"avg_line_length": 23.6241134752,
"ext": "agda",
"hexsha": "1cafa22d9efc9d5fceec345738804c4d675e3df8",
"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 Nat
open import Prelude
open import contexts
open import core
open import type-assignment-unicity
module canonical-indeterminate-forms where
-- this type gives somewhat nicer syntax for the output of the canonical
-- forms lemma for indeterminates at base type
data cif-base : (Δ : hctx) (d : ihexp) ... | {
"alphanum_fraction": 0.4695514407,
"avg_line_length": 46.7546296296,
"ext": "agda",
"hexsha": "88455b1b624fd998c168215cf3717ed355a3d69d",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2019-09-13T18:20:02.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-09-13T... |
module Cats.Util.SetoidReasoning where
open import Relation.Binary.SetoidReasoning public
open import Relation.Binary using (Setoid)
open import Relation.Binary.EqReasoning as EqR using (_IsRelatedTo_)
infixr 2 _≡⟨⟩_
_≡⟨⟩_ : ∀ {c l} {S : Setoid c l} → ∀ x {y} → _IsRelatedTo_ S x y → _IsRelatedTo_ S x y
_≡⟨⟩_ {S ... | {
"alphanum_fraction": 0.6291262136,
"avg_line_length": 20.6,
"ext": "agda",
"hexsha": "1f3ba15e102866697103dc70ac2f31e0a5fb00f0",
"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": "a... |
{-# OPTIONS --without-K --exact-split --safe #-}
module Fragment.Extensions.CSemigroup.Base where
open import Fragment.Equational.Theory.Bundles
open import Fragment.Algebra.Signature
open import Fragment.Algebra.Free Σ-magma hiding (_~_)
open import Fragment.Algebra.Homomorphism Σ-magma
open import Fragment.Algebra... | {
"alphanum_fraction": 0.4032755431,
"avg_line_length": 36.851010101,
"ext": "agda",
"hexsha": "6068c298befdbeb551e89782a061eb181585f3bd",
"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-15T1... |
{-# OPTIONS --omega-in-omega --no-termination-check --overlapping-instances #-}
open import Light.Library.Data.Natural as ℕ using (ℕ ; predecessor ; zero)
open import Light.Package using (Package)
module Light.Literals.Level ⦃ natural‐package : Package record { ℕ } ⦄ where
open import Light.Literals.Definition.Natur... | {
"alphanum_fraction": 0.762925599,
"avg_line_length": 39.65,
"ext": "agda",
"hexsha": "51a1fe974b67ec2f2130253588de5b24ff7b3fa3",
"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": "4... |
{-# OPTIONS --without-K #-}
open import lib.Basics
open import lib.types.Paths
open import lib.types.Pi
open import lib.types.Unit
module lib.types.Circle where
{-
Idea :
data S¹ : Type₀ where
base : S¹
loop : base == base
I’m using Dan Licata’s trick to have a higher inductive type with definitional
reduction... | {
"alphanum_fraction": 0.5051090859,
"avg_line_length": 26.4306569343,
"ext": "agda",
"hexsha": "4078e56ab4ecfa88a34e6a489a19cecbaea80711",
"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, 2015-06-24
{-# OPTIONS --copatterns #-}
-- {-# OPTIONS -v tc.with.strip:20 #-}
module _ where
open import Common.Equality
open import Common.Product
module SynchronousIO (I O : Set) where
F : Set → Set
F S = I → O × S
record SyncIO : Set₁ where
field
St : Set
tr : St → F St
m... | {
"alphanum_fraction": 0.6112956811,
"avg_line_length": 27.3636363636,
"ext": "agda",
"hexsha": "7468c07907eeb1ebb504c27d641ecf2ed5526c8d",
"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... |
-- MIT License
-- Copyright (c) 2021 Luca Ciccone and Luca Padovani
-- Permission is hereby granted, free of charge, to any person
-- obtaining a copy of this software and associated documentation
-- files (the "Software"), to deal in the Software without
-- restriction, including without limitation the rights to use... | {
"alphanum_fraction": 0.6372328459,
"avg_line_length": 49.1936758893,
"ext": "agda",
"hexsha": "619435d86b8eb31995758505e6aa6a507e99efa6",
"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 type for values that should be erased at run-time
------------------------------------------------------------------------
-- Most of the definitions in this module are reexported, in one way
-- or another, from Erased.
-- This module impor... | {
"alphanum_fraction": 0.444066461,
"avg_line_length": 39.8701149425,
"ext": "agda",
"hexsha": "2324772ccbf95efab9de11df8f332af7ed2cb540",
"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... |
{-# OPTIONS --safe #-}
module Cubical.Categories.Instances.FunctorAlgebras where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Function
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Isomorphism renaming (Iso to _≅_)
open import Cubical.Foundations.Univalence
open im... | {
"alphanum_fraction": 0.65606469,
"avg_line_length": 40.9191176471,
"ext": "agda",
"hexsha": "be02f448b469fe6949dc67d52847089c3dea1ba6",
"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_hexs... |
module Prelude where
--------------------------------------------------------------------------------
open import Agda.Primitive public
using (Level ; _⊔_)
renaming (lzero to ℓ₀)
id : ∀ {ℓ} → {X : Set ℓ}
→ X → X
id x = x
_◎_ : ∀ {ℓ ℓ′ ℓ″} → {X : Set ℓ} {P : X → Set ℓ′} {Q : ∀ {x} → P x → Set ℓ″}
... | {
"alphanum_fraction": 0.3432147563,
"avg_line_length": 22,
"ext": "agda",
"hexsha": "1531e68a14afbfb95f827dd7c15021ffa0e43636",
"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": "bd6... |
-- Andreas, 2013-11-23
-- checking that postulates are allowed in new-style mutual blocks
open import Common.Prelude
-- new style mutual block
even : Nat → Bool
postulate
odd : Nat → Bool
even zero = true
even (suc n) = odd n
-- No error
| {
"alphanum_fraction": 0.6907630522,
"avg_line_length": 14.6470588235,
"ext": "agda",
"hexsha": "f94e615890b672472f91209551f43a41559b73db",
"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 Data.Num.Bijective where
open import Data.Nat
open import Data.Fin as Fin using (Fin; #_; fromℕ≤)
open import Data.Fin.Extra
open import Data.Fin.Properties using (bounded)
open ≤-Reasoning renaming (begin_ to start_; _∎ to _□; _≡⟨_⟩_ to _≈⟨_⟩_)
open import Level using () renaming (suc to lsuc)
open import Func... | {
"alphanum_fraction": 0.4694211495,
"avg_line_length": 33.0337837838,
"ext": "agda",
"hexsha": "bb4982935061721f6182e76ddc08e78b43140690",
"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... |
module z-06 where
open import Data.Nat using (ℕ; zero; suc; _+_; _*_; _<?_; _<_; ≤-pred)
open import Relation.Binary.PropositionalEquality using (_≡_; refl)
import Relation.Binary.PropositionalEquality.Core as PE
{-
--------------------------------------------------------------------... | {
"alphanum_fraction": 0.5076216968,
"avg_line_length": 26.8083519761,
"ext": "agda",
"hexsha": "789f702ba5816e10596c3e00db961eb8bc20c872",
"lang": "Agda",
"max_forks_count": 8,
"max_forks_repo_forks_event_max_datetime": "2021-09-21T15:58:10.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-04-13T... |
module TrustMe where
open import Data.String
open import Data.String.Unsafe
open import Data.Unit.Polymorphic using (⊤)
open import IO
import IO.Primitive as Prim
open import Relation.Binary.PropositionalEquality
open import Relation.Nullary
-- Check that trustMe works.
testTrustMe : IO ⊤
testTrustMe with "apa" ≟ "a... | {
"alphanum_fraction": 0.7372093023,
"avg_line_length": 21.5,
"ext": "agda",
"hexsha": "862c17e1d3eafe036454fb7ca666aba9b7291ca1",
"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": "e... |
-- Mapping of Haskell types to Agda Types
module Foreign.Haskell.Types where
open import Prelude
open import Builtin.Float
{-# FOREIGN GHC import qualified GHC.Float #-}
{-# FOREIGN GHC import qualified Data.Text #-}
HSUnit = ⊤
HSBool = Bool
HSInteger = Int
HSList = List
HSChar = Char
HSString = HSList HSChar
HSTe... | {
"alphanum_fraction": 0.6727799228,
"avg_line_length": 25.2682926829,
"ext": "agda",
"hexsha": "1b80b2fabb82d4d0d34e210b82c80d0650c8bed6",
"lang": "Agda",
"max_forks_count": 24,
"max_forks_repo_forks_event_max_datetime": "2021-04-22T06:10:41.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-03-12... |
open import Prelude
module Implicits.Resolution.Termination.Lemmas
where
open import Induction.WellFounded
open import Induction.Nat
open import Data.Fin.Substitution
open import Implicits.Syntax
open import Implicits.Syntax.Type.Unification
open import Implicits.Substitutions
open import Implicits.Substitutions.Le... | {
"alphanum_fraction": 0.8435672515,
"avg_line_length": 32.5714285714,
"ext": "agda",
"hexsha": "be2cc9ca4bffa43282636c1111f71f7106475be6",
"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 --warning=error --without-K #-}
open import Groups.Definition
open import Setoids.Orders.Partial.Definition
open import Setoids.Orders.Total.Definition
open import Setoids.Setoids
open import Functions.Definition
open import Rings.Definition
open import Rings.Orders.Partial.Definition
open import A... | {
"alphanum_fraction": 0.7222914072,
"avg_line_length": 34.9130434783,
"ext": "agda",
"hexsha": "15218ef80c28f9c1e549532768aa5d788de0d008",
"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 --without-K #-}
open import HoTT
open import cohomology.FunctionOver
open import cohomology.FlipPushout
module cohomology.CofiberSequence {i} where
{- Lemma: pushing flip-susp through susp-fmap -}
flip-susp-fmap : {A B : Type i} (f : A → B)
→ ∀ σ → flip-susp (susp-fmap f σ) == susp-fmap f (flip-susp σ)... | {
"alphanum_fraction": 0.5021925245,
"avg_line_length": 35.7388059701,
"ext": "agda",
"hexsha": "8dea6683351008cf0caf894be9eef94a26a7dc98",
"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, 2016-06-20
-- Issue #436 fixed by Ulf's instantiating parameters sprint
-- (Agda meeting April 2016 Strathclyde)
data _==_ {A : Set} (x : A) : A -> Set where
refl : x == x
foo : {A : Set} (x y : A) -> x == y -> A
foo x y = \ { eq → {!eq!} } -- load and do C-c C-c in the shed
-- Should work now (and is ... | {
"alphanum_fraction": 0.5902578797,
"avg_line_length": 29.0833333333,
"ext": "agda",
"hexsha": "47fd1f85b84e718f7ee914161be3fd5b380fbe16",
"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 --safe --warning=error --without-K #-}
-- These are explicitly with-K, because we currently encode an element of Zn as
-- a natural together with a proof that it is small.
open import LogicalFormulae
open import Numbers.Naturals.Semiring
open import Numbers.Naturals.Order
open import Semirings.Definition
o... | {
"alphanum_fraction": 0.6431293432,
"avg_line_length": 89.22,
"ext": "agda",
"hexsha": "2f0d3ee388ad2f7d5533ec83970bc8fc7eb05ad6",
"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-29T13:23:07... |
module Prelude where
infixr 90 _∘_
infixr 0 _$_
id : {A : Set} -> A -> A
id x = x
_∘_ : {A B C : Set} -> (B -> C) -> (A -> B) -> A -> C
(f ∘ g) x = f (g x)
_$_ : {A B : Set} -> (A -> B) -> A -> B
f $ x = f x
flip : {A B C : Set} -> (A -> B -> C) -> B -> A -> C
flip f x y = f y x
const : {A B : Set} -> A -> B -> ... | {
"alphanum_fraction": 0.4123006834,
"avg_line_length": 15.6785714286,
"ext": "agda",
"hexsha": "51cf6c419fc56933a5a2a013e7a2fa787eb4538a",
"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 #-}
module HoTT.Sigma.Transport where
open import HoTT.Base
open import HoTT.Identity
open import HoTT.Identity.Sigma
Σ-transport : ∀ {i j k} {A : 𝒰 i} {P : A → 𝒰 j} {Q : (Σ A λ x → P x) → 𝒰 k} {x y : A} →
(p : x == y) (uz : Σ (P x) λ u → Q (x , u)) →
transport (... | {
"alphanum_fraction": 0.5074626866,
"avg_line_length": 36.0769230769,
"ext": "agda",
"hexsha": "91add779fe72a988b30aae2560294174285bd861",
"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, 2015-01-19 Forced constructor arguments should not
-- give rise to unification constraints.
-- Andreas, 2015-02-27 Forcing analysis is too fragile to have
-- such a huge impact. The problem has to be addressed by
-- putting heterogeneous unification on a solid foundation.
-- Jesper, 2015-12-18 The ne... | {
"alphanum_fraction": 0.5981161695,
"avg_line_length": 33.5263157895,
"ext": "agda",
"hexsha": "ec433bc6ed57459ea890becad63f9537d45be6be",
"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 Relation.Binary.Core
module BBSTree.Properties {A : Set}
(_≤_ : A → A → Set)
(trans≤ : Transitive _≤_) where
open import BBSTree _≤_
open import Bound.Total A
open import Bound.Total.Order.Properties _≤_ trans≤
open import List.Order.Simple _≤_
open import List.... | {
"alphanum_fraction": 0.6012891344,
"avg_line_length": 43.44,
"ext": "agda",
"hexsha": "4ad3c06cc886e1fccd72b9d044ff3379d6110948",
"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": "... |
{-# OPTIONS --without-K #-}
open import hott.core
open import hott.core.theorems
open import hott.functions
-- An important theorem in topology is to show the 2-dimensional loop
-- space is abelian. To avoid notational clutter we parameterize the
-- common variables as module parameters.
module hott.topology.loopspa... | {
"alphanum_fraction": 0.473897497,
"avg_line_length": 31.7803030303,
"ext": "agda",
"hexsha": "0ad6aa34e6d1a3055712f61d566ab0e98540e6a7",
"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 Issue512 where
open import Common.Equality
data A : Set where
a b : A
proof : a ≡ a
proof = refl
f : A → A → A
f x y rewrite proof = {!!}
-- gave error below (now complains about LEVELZERO instead of STRING):
-- No binding for builtin thing STRING, use {-# BUILTIN STRING name #-} to bind it to 'name'
-- ... | {
"alphanum_fraction": 0.65625,
"avg_line_length": 24.7272727273,
"ext": "agda",
"hexsha": "25cbd6a7d97ad7f838208c9e659ce54a9945202e",
"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:... |
{-# OPTIONS --allow-unsolved-metas #-}
open import Tutorials.Monday-Complete
module Tutorials.Tuesday where
-----------
-- Pi and Sigma types
-----------
module Product where
-- The open keyword opens a given module in the current namespace
-- By default all of the public names of the module are opened
-- The ... | {
"alphanum_fraction": 0.5468695953,
"avg_line_length": 25.3596491228,
"ext": "agda",
"hexsha": "564f8167f1258e2ffa46bf5fbfb33ad66725075c",
"lang": "Agda",
"max_forks_count": 2,
"max_forks_repo_forks_event_max_datetime": "2021-11-24T10:50:55.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-11-23T... |
{-# OPTIONS --no-termination-check #-}
module AC where
import Nat
import Bool
import List
import Fin
import Logic
import Vec
import EqProof
open Nat hiding (_<_) renaming (_==_ to _=Nat=_)
open Bool
open List hiding (module Eq)
open Fin renaming (_==_ to _=Fin=_)
open Logic
open Vec
infix 20 _○_
infix 10 _≡_
ForAl... | {
"alphanum_fraction": 0.4527239609,
"avg_line_length": 31.1288659794,
"ext": "agda",
"hexsha": "7625729d648096f78cfa71988de638acf2efdd88",
"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... |
{-# OPTIONS --type-in-type #-}
module _ where
Set' : ∀ i → Set _
Set' i = Set i
postulate
A : Set
a : A
T : Set → Set
comp : (P : A → Set) (g : (a : A) → P a) → P a
foo : ∀ i (Q : A → Set' i) → T (comp _ Q)
-- (no issue if Set' is replaced by Set)
bar : T {!_!} -- Try to give _
bar = foo _ _
-- WAS:
--... | {
"alphanum_fraction": 0.5530973451,
"avg_line_length": 19.652173913,
"ext": "agda",
"hexsha": "f221d2bc0b5916c77a21c625f887d91cc34359b6",
"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... |
-- New NO_POSITIVITY_CHECK pragma for data definitions and mutual
-- blocks
-- Skipping a single data definition in an abstract block.
abstract
{-# NO_POSITIVITY_CHECK #-}
data D : Set where
lam : (D → D) → D
| {
"alphanum_fraction": 0.7018348624,
"avg_line_length": 24.2222222222,
"ext": "agda",
"hexsha": "f9ac6fc7755eb5d3e9054c0127171e0d12328e15",
"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, 2017-03-23, issue #2510
-- Error message in case of --no-pattern-matching
{-# OPTIONS --no-pattern-matching #-}
test : Set
test x = x
-- Expected error:
-- Cannot eliminate type Set with pattern x (did you supply too many arguments?)
| {
"alphanum_fraction": 0.6947791165,
"avg_line_length": 22.6363636364,
"ext": "agda",
"hexsha": "4e3a1f8dd62ca165ffe24ae4b3f05f1e1daf8cf8",
"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... |
record ⊤ : Set where
abstract
a : ⊤
a = {!!}
| {
"alphanum_fraction": 0.48,
"avg_line_length": 8.3333333333,
"ext": "agda",
"hexsha": "30e23ef44b2be7036aa8b2d756b36dcb6d3807c2",
"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:0... |
------------------------------------------------------------------------------
-- From ListP as the least fixed-point to ListP using data
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no... | {
"alphanum_fraction": 0.449117175,
"avg_line_length": 30.5392156863,
"ext": "agda",
"hexsha": "7d8d8f04d91a3ad233282e93288d8cee8b92d5a0",
"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-19T1... |
-- 2011-08-22 Andreas (reported and fixed by Dominique Devriese)
{-# OPTIONS --no-universe-polymorphism #-}
module Issue427 where
data ⊥ : Set where
postulate f : {I : ⊥} (B : _) → ⊥
data A : Set where a : {x y : ⊥} → A
test : A → Set
test (a {x = x} {y = y}) with f {_}
test (a {x = x} {y = y}) | _ = A
{- old erro... | {
"alphanum_fraction": 0.6222222222,
"avg_line_length": 27.5,
"ext": "agda",
"hexsha": "9f09a9836fd9c29fd22b860c964c93a747117d43",
"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": "7... |
module InstanceArgumentsSections where
postulate A : Set
module Basic where
record B : Set where
field bA : A
open B {{...}}
bA' : {{_ : B}} → A
bA' = bA
module Parameterised (a : A) where
record C : Set where
field cA : A
open C {{...}}
cA' : {{_ : C}} → A
cA' = cA
module RecordFromPar... | {
"alphanum_fraction": 0.5513577332,
"avg_line_length": 14.3559322034,
"ext": "agda",
"hexsha": "f4b1d767200299f28e95351a8dd98cb5f6d9412c",
"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 Algebra.Bundles using (Group)
module GGT.Group.Facts
{a b ℓ}
(G : Group a ℓ)
where
open import Relation.Unary using (Pred)
open import Relation.Binary
open import GGT.Group.Structures
open import Algebra.Bundles using (Group)
open import Algebra.Properties.Group G
open Group G
open import Relation.B... | {
"alphanum_fraction": 0.4443991853,
"avg_line_length": 35.5797101449,
"ext": "agda",
"hexsha": "081b380f3bfceca946ef2c1d473bacfe0a4905a3",
"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.Bool as Bool using (Bool; false; true; if_then_else_; not)
open import Data.String using (String)
open import Data.Nat using (ℕ; _+_; _≟_; suc; _>_; _<_; _∸_)
open import Relation.Nullary.Decidable using (⌊_⌋)
open import Data.List as l using (List; filter; map; take; foldl; length; []; _∷_)
open impor... | {
"alphanum_fraction": 0.5540616489,
"avg_line_length": 31.2581081081,
"ext": "agda",
"hexsha": "15d67d67db7164ee357a04d20c932cc4ea33ca52",
"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 AmbiguousConstructor where
module Foo where
data D : Set where
c0 : D
c1 : D
module Bar where
open Foo public
data B : Set where
tt : B
ff : B
open Foo renaming (c0 to c2)
open Bar renaming (c1 to c2)
foo : D -> B
-- c2 is ambiguous: it could refer to c0 or c1.
foo c2 = tt
foo _ = ff
| {
"alphanum_fraction": 0.6485623003,
"avg_line_length": 14.2272727273,
"ext": "agda",
"hexsha": "de0b10b612ef75f7d6fd7c29c2a3d8a58d2a50c9",
"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 List where
import Bool
open Bool
infixr 15 _::_
data List (A : Set) : Set where
[] : List A
_::_ : A -> List A -> List A
module Eq {A : Set}(_=A=_ : A -> A -> Bool) where
infix 10 _==_
_==_ : List A -> List A -> Bool
[] == [] = true
x :: xs == y :: ys = (x =A= y) && xs == ys
[] ... | {
"alphanum_fraction": 0.4070543375,
"avg_line_length": 23.3111111111,
"ext": "agda",
"hexsha": "d2d631172ecc7f7cbbef6ba8020d7ba52661ae48",
"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, 2014-09-09
{-# TERMINATING #-}
Foo : Set
Foo = Foo
| {
"alphanum_fraction": 0.59375,
"avg_line_length": 10.6666666667,
"ext": "agda",
"hexsha": "ce6ed6bdaa9c8ac2dae1d50fc11f361553131f7f",
"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:... |
-- Reported by Nisse on 2018-03-13
-- The `x` in the parent pattern was eta-expanded to `record{}`,
-- but with-abstraction didn't like this.
open import Agda.Builtin.Equality
record R : Set where
postulate
easy : (A : Set) → A
F : (x : R) → Set₁
F x with easy (x ≡ x)
F x | refl with Set
F x | refl | _ = Set
--... | {
"alphanum_fraction": 0.6833631485,
"avg_line_length": 22.36,
"ext": "agda",
"hexsha": "1813f877030cd6c9392d57e9d8f48bacd0c24969",
"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 -vtc.with.strip:60 -v tc.lhs.top:50 #-}
open import Agda.Builtin.Nat
open import Agda.Builtin.Equality
postulate trustMe : {A : Set} (x y : A) → x ≡ y
data Fin : Nat → Set where
fzero : ∀ n → Fin (suc n)
fsuc : ∀{n} → Fin n → Fin (suc n)
test1 : ∀{n} → Fin n → Nat
test1 (fzero _) = 0
test1 {.(s... | {
"alphanum_fraction": 0.5495824635,
"avg_line_length": 28.5970149254,
"ext": "agda",
"hexsha": "02b1b01f73d00d883b332e6dd22492a0f2ff44c0",
"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 Prelude
open import core
module grounding where
grounding : ∀{ τ1 τ2} →
τ1 ▸gnd τ2 →
((τ2 ground) × (τ1 ~ τ2) × (τ1 ≠ τ2))
grounding (MGArr x) = GHole , TCArr TCHole1 TCHole1 , x
grounding (MGProd x) = GProd , TCProd TCHole1 TCHole1 , x
| {
"alphanum_fraction": 0.5382165605,
"avg_line_length": 31.4,
"ext": "agda",
"hexsha": "ba23a2f32888277d8374d605342a35177af46ecd",
"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 unit type
------------------------------------------------------------------------
module Data.Unit where
open import Data.Sum
open import Relation.Nullary
open import Relation.Binary
open import Relation.Binary.PropositionalEquality as P... | {
"alphanum_fraction": 0.443877551,
"avg_line_length": 22.9090909091,
"ext": "agda",
"hexsha": "a1683638be767ed9c73d9fc90c7fc417e81492e9",
"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-21T1... |
------------------------------------------------------------------------
-- The Agda standard library
--
-- Empty type
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Data.Empty where
open import Level
data ⊥ : Set where
⊥-elim : ∀ {w} {Whatever : ... | {
"alphanum_fraction": 0.3579545455,
"avg_line_length": 20.7058823529,
"ext": "agda",
"hexsha": "43f99b82c1fc17c31d8414dd70d812f76b0f8607",
"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 #-}
open import Categories.Category
open import Categories.Object.Terminal
open import Level
module Categories.Object.Terminal.Products {o ℓ e : Level}
(C : Category o ℓ e)
(T : Terminal C) where
open import Categories.Object.Product
open Category C
open Terminal T
[⊤×⊤]... | {
"alphanum_fraction": 0.4361054767,
"avg_line_length": 20.5416666667,
"ext": "agda",
"hexsha": "99415c054f73e4e380d789290bac66abe8f477a1",
"lang": "Agda",
"max_forks_count": 23,
"max_forks_repo_forks_event_max_datetime": "2021-11-11T13:50:56.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-02-05... |
module everything where
open import lib public
| {
"alphanum_fraction": 0.8333333333,
"avg_line_length": 12,
"ext": "agda",
"hexsha": "42af961bdd4824ac695d4ef0219a8c7799ad5705",
"lang": "Agda",
"max_forks_count": 17,
"max_forks_repo_forks_event_max_datetime": "2021-11-28T20:13:21.000Z",
"max_forks_repo_forks_event_min_datetime": "2018-12-03T22:38:15.0... |
{-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.HITs.SetQuotients where
open import Cubical.HITs.SetQuotients.Base public
open import Cubical.HITs.SetQuotients.Properties public
| {
"alphanum_fraction": 0.7929292929,
"avg_line_length": 33,
"ext": "agda",
"hexsha": "5e6bf8236baee8836719fb21533e75513a26fe5d",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-11-22T02:02:01.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-11-22T02:02:01.00... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.