Search is not available for this dataset
text string | meta dict |
|---|---|
module _ where
open import Agda.Builtin.Equality
module _ (Ty : Set) where
data Cxt : Set where
sg : (A : Ty) → Cxt
_∙_ : (Γ₁ Γ₂ : Cxt) → Cxt
postulate Sub : Cxt → Cxt → Set
variable Γ Δ : Cxt
data Var (A : Ty) : Cxt → Set where
• : Var A (sg A)
inl : (x : Var A Γ) → Var A (Γ ∙ Δ)
post... | {
"alphanum_fraction": 0.525462963,
"avg_line_length": 16,
"ext": "agda",
"hexsha": "370a2ec929012269839aaa3d853e91d79be4e8e8",
"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.0... |
module _ where
open import Common.Prelude
data Vec (A : Set) : Nat → Set where
[] : Vec A 0
_∷_ : ∀ {@0 n} → A → Vec A n → Vec A (suc n)
sum : ∀ {@0 n} → Vec Nat n → Nat
sum (x ∷ xs) = x + sum xs
sum [] = 0
foldl : ∀ {A} {B : Nat → Set} → (∀ {@0 n} → B n → A → B (suc n)) → B 0 → ∀ {@0 n} → Vec A n → B n
foldl {... | {
"alphanum_fraction": 0.50625,
"avg_line_length": 24.6153846154,
"ext": "agda",
"hexsha": "594d7c8583c31d61c0025526a41773954111726f",
"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 --safe --without-K #-}
------------------------------------------------------------------------
-- Group objects in a cartesian category.
------------------------------------------------------------------------
open import Categories.Category
open import Categories.Category.Cartesian
module Categories.Obj... | {
"alphanum_fraction": 0.6099337748,
"avg_line_length": 26.9642857143,
"ext": "agda",
"hexsha": "b575714821a88ff4a856f51c632e6b83972e0539",
"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 --disable-positivity-check #-}
module univ where
import Logic.ChainReasoning
module Chain {A : Set}
( _==_ : A -> A -> Set)
(refl : {x : A} -> x == x)
(trans : {x y z : A} -> x == y -> y == z -> x == z) =
Logic.ChainReasoning.Mono.Homogenous _==_ (\x -> ... | {
"alphanum_fraction": 0.3997606224,
"avg_line_length": 31.1366459627,
"ext": "agda",
"hexsha": "fa37bf22144fd7a59e883628266cd5e3a660f388",
"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... |
module _ where
open import utility
open import Function using (_∘_)
open import Esterel.Lang
open import Esterel.Lang.Properties
open import Esterel.Lang.CanFunction
using (Canₛ ; Canₛₕ)
open import Esterel.Environment as Env
using (Env ; Θ ; _←_ ; module SigMap ; module ShrMap ; module VarMap ; []env ; sig-stats... | {
"alphanum_fraction": 0.5874045802,
"avg_line_length": 33.8064516129,
"ext": "agda",
"hexsha": "c0c6346a50d31626da04fafbf4ca85692c812a17",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2020-04-15T20:02:49.000Z",
"max_forks_repo_forks_event_min_datetime": "2020-04-15T... |
-- The comonad named Store by Russel O'Connor.
-- See his WGP 2011 paper.
{-# OPTIONS --copatterns #-}
module Control.Comonad.Store where
open import Function using (id) renaming (_∘′_ to _∘_)
open import Relation.Binary.PropositionalEquality
using (_≡_; refl; sym; trans; cong; cong₂; module ≡-Reasoning)
open ≡-Re... | {
"alphanum_fraction": 0.5728565082,
"avg_line_length": 29.0451612903,
"ext": "agda",
"hexsha": "4065077113d4cb066722abfe750bb59fec2263c4",
"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 z04-lists where
open import bool
open import eq
open import nat
open import nat-thms
open import product-thms using (keep)
open import logic -- needed for filter-idem
{-
-- p 75
'data' : datatype declaration
'𝕃' : name of type being declared
{ℓ} : level
A : element type (polymorphic)
𝕃 is a type... | {
"alphanum_fraction": 0.3800706621,
"avg_line_length": 36.6522781775,
"ext": "agda",
"hexsha": "ff6fb52052a86db45f26d510887608f0182e603c",
"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 -v tc.proj.like:10 #-}
-- {-# OPTIONS -v tc.conv:10 #-}
open import Common.Level
module ProjectionLikeAndModules (A : Set) (a : A) where
record ⊤ : Set where
constructor tt
data Wrap (W : Set) : Set where
wrap : W → Wrap W
data Bool : Set where
true false : Bool
-- postulate
-- `or' should be... | {
"alphanum_fraction": 0.6115591398,
"avg_line_length": 21.8823529412,
"ext": "agda",
"hexsha": "788165820d62d76ea1a1ad7976e54c9b547bf768",
"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 --safe #-}
open import Algebra.Structures.Bundles.Field
open import Algebra.Linear.Structures.Bundles
module Algebra.Linear.Space.Product
{k ℓ} (K : Field k ℓ)
{a₁ ℓ₁} (V₁-space : VectorSpace K a₁ ℓ₁)
{a₂ ℓ₂} (V₂-space : VectorSpace K a₂ ℓ₂)
where
open import Relation.Binary
open impo... | {
"alphanum_fraction": 0.5424511545,
"avg_line_length": 25.9447004608,
"ext": "agda",
"hexsha": "fcda9498d211da87f491dcdd6db183a84c302ff7",
"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... |
{- 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.Prelude
import LibraBFT.Concrete.Properties.Pr... | {
"alphanum_fraction": 0.7205882353,
"avg_line_length": 44.347826087,
"ext": "agda",
"hexsha": "8957f5ccecf6ef11768787fae465ff3548a283ce",
"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 --experimental-lossy-unification #-}
module Cubical.ZCohomology.Gysin where
open import Cubical.Foundations.Path
open import Cubical.Foundations.Equiv.HalfAdjoint
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Transport
open import Cubical.Foundations.Function
open import Cu... | {
"alphanum_fraction": 0.4884532991,
"avg_line_length": 41.0915492958,
"ext": "agda",
"hexsha": "6c1c88d4db1e01dbe9876e105d1b1ad1e7981599",
"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
open import Type
module Structure.Logic.Constructive.Propositional {ℓₗ} {Formula : Type{ℓₗ}} {ℓₘₗ} (Proof : Formula → Type{ℓₘₗ}) where
open import Logic.Predicate
private variable X Y Z : Formula
-- Rules of bottom (falsity).
record Bottom(⊥ : Formula) : Type{ℓₘₗ Lvl.⊔ ℓₗ} where
field
elim : P... | {
"alphanum_fraction": 0.5545138889,
"avg_line_length": 33.8823529412,
"ext": "agda",
"hexsha": "ba6094bf5a18b54ece7b5bf4c079029f1cd35ef5",
"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... |
------------------------------------------------------------------------------
-- Properties for the equality on Conat
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorph... | {
"alphanum_fraction": 0.4108108108,
"avg_line_length": 31.8965517241,
"ext": "agda",
"hexsha": "bd2f3033243080fb4a4ad6810784360bcd88e022",
"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... |
------------------------------------------------------------------------
-- Quotients, defined as families of equivalence classes
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
-- Partly based on the presentation of quotients in the HoTT book.
-- Perhaps th... | {
"alphanum_fraction": 0.4427044993,
"avg_line_length": 42.491943128,
"ext": "agda",
"hexsha": "7480f8306545c6c35c433fba620065e70e85e582",
"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 --without-K --safe #-}
module Definition.Typed.Consequences.Injectivity where
open import Definition.Untyped hiding (wk)
import Definition.Untyped as U
open import Definition.Untyped.Properties
open import Definition.Typed
open import Definition.Typed.Weakening
open import Definition.Typed.Properties
ope... | {
"alphanum_fraction": 0.5482315113,
"avg_line_length": 41.4666666667,
"ext": "agda",
"hexsha": "3bf0080bcd721d7852b941ef0935469149dfbac5",
"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 Relation.Binary.PropositionalEquality as PEq
module Relation.Binary.PropositionalEquality.Extensionality
(funext : ∀ {ℓ₁ ℓ₂} → PEq.Extensionality ℓ₁ ℓ₂) where
funext² : ∀ {p q r}{P : Set p}{Q : P → Set q}
{R : (p : P) → Q p → Set r} →
{f g : ∀ (p : P)(q : Q p) → R p q} → (∀ p q → f p q P... | {
"alphanum_fraction": 0.4771428571,
"avg_line_length": 38.8888888889,
"ext": "agda",
"hexsha": "7148ddb0ea100b95938a4a3148178007d8a06116",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-12-28T17:38:05.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-12-28T... |
{-# OPTIONS --prop --without-K --rewriting #-}
module Data.Nat.Log2 where
open import Data.Nat
open import Data.Nat.Properties
open import Relation.Nullary
open import Relation.Binary
open import Relation.Binary.PropositionalEquality as Eq using (_≡_; refl)
open import Agda.Builtin.Equality.Rewrite
private
aux :... | {
"alphanum_fraction": 0.5296875,
"avg_line_length": 34.5945945946,
"ext": "agda",
"hexsha": "e954d0d6a9d9c1d8c55914591975b8c9bcd12233",
"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-06T10:... |
import Lvl
module Structure.Category.Dual {ℓₒ ℓₘ ℓₑ : Lvl.Level} where
open import Data.Tuple as Tuple using ()
open import Functional using (swap)
open import Structure.Category
open import Structure.Categorical.Names
open import Structure.Categorical.Properties
import Structure.Operator.Properties as Prop... | {
"alphanum_fraction": 0.7416612165,
"avg_line_length": 39.2051282051,
"ext": "agda",
"hexsha": "751aee5dec7c6bf3f0583b00d7816aa8b2030d99",
"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 RecordsAndModules where
module Setoids where
record Equiv (a : Set) : Set where
field
x : a
y : a
record Setoid : Set1 where
field
carrier : Set
equiv : Equiv carrier
module RegExps (S : Setoids.Setoid) where
data RegExp : Set where
ε : RegExp
module SimpleMatch... | {
"alphanum_fraction": 0.6354916067,
"avg_line_length": 15.4444444444,
"ext": "agda",
"hexsha": "7e6d83d417565c829e536329132de30f3620f901",
"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... |
------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- The values of terms in Nehemiah.Change.Term.
------------------------------------------------------------------------
module Nehemiah.Change.Value where
open import Nehemiah.Syntax.Type
open import Nehemiah.Syntax... | {
"alphanum_fraction": 0.6209223847,
"avg_line_length": 28.6774193548,
"ext": "agda",
"hexsha": "f15f47633e97fd814b617d3eef424e930384bd60",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2016-02-18T12:26:44.000Z",
"max_forks_repo_forks_event_min_datetime": "2016-02-18T... |
module Data.QuadTree.Implementation.Functors 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.Definition
open import Data.QuadTree.Implementation.ValidTypes
open import Data.QuadTree.Implementation.QuadrantLenses... | {
"alphanum_fraction": 0.6776636019,
"avg_line_length": 42.0227272727,
"ext": "agda",
"hexsha": "9422d539f65900ca6742df7d1c0fdac09448644d",
"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 Issue978 where
module A where
infixr 4 _,_
record _×_ (A B : Set) : Set where
constructor _,_
field
fst : A
snd : B
module B where
infixl 2 _,_
data Ty : Set where
data Cxt : Set where
ε : Cxt
_,_ : (Γ : Cxt) (a : Ty) → Cxt
open A
open B
test : (Γ : Cxt) → Set₁
te... | {
"alphanum_fraction": 0.5324324324,
"avg_line_length": 12.3333333333,
"ext": "agda",
"hexsha": "e1800fe98b80e3b19118f52d81d5fd60ce18dbc3",
"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... |
{-
Setting an unknown signal can only shrink Can.
canₖ-set-sig-monotonic : ∀ p S θ S∈ status →
Env.sig-stats {S} θ S∈ ≡ Signal.unknown →
∀ k →
k ∈ Canₖ p (Env.set-sig {S} θ S∈ status) →
k ∈ Canₖ p θ
(And its counterpart for Canₛ and Canₛₕ.)
There are also corresponding Canθ versions: Setting ... | {
"alphanum_fraction": 0.5328647703,
"avg_line_length": 49.0399408284,
"ext": "agda",
"hexsha": "b62259e7aefdc48122993b6e6d71d710292e401d",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2020-04-15T20:02:49.000Z",
"max_forks_repo_forks_event_min_datetime": "2020-04-15T... |
module Issue1624 where
open import Common.Char
open import Common.String
open import Common.List
test : List Char → String
test ('0' ∷ ('x' ∷ xs)) = "x"
test ('0' ∷ ('b' ∷ xs)) = "b"
test xs = "f"
open import Common.IO
open import Common.Unit
main : IO Unit
main = putStr (test x)
where x = '0' ∷ ('... | {
"alphanum_fraction": 0.5845697329,
"avg_line_length": 17.7368421053,
"ext": "agda",
"hexsha": "dd1661a201ddf76d4f72a93741b5ccbaea0abd92",
"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 coinductive definition of (strong) similarity
------------------------------------------------------------------------
{-# OPTIONS --sized-types #-}
open import Labelled-transition-system
module Similarity {ℓ} (lts : LTS ℓ) where
open imp... | {
"alphanum_fraction": 0.5458452722,
"avg_line_length": 25.1531531532,
"ext": "agda",
"hexsha": "7efa0bb4e5932edf1215046927ebca0c68f3442f",
"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 Cubical.Data.Empty.Properties where
open import Cubical.Core.Everything
open import Cubical.Foundations.Prelude
open import Cubical.Data.Empty.Base
isProp⊥ : isProp ⊥
isProp⊥ x = ⊥-elim x
| {
"alphanum_fraction": 0.7543103448,
"avg_line_length": 19.3333333333,
"ext": "agda",
"hexsha": "f21ca377833c58d6f104ea5fc0cf9447426f3e98",
"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 Numbers.Naturals.Definition
open import Numbers.Naturals.Semiring
open import Numbers.Naturals.Naturals
open import Numbers.Naturals.Order
open import Numbers.Naturals.Order.Lemmas
open import Numbers.Naturals.Order.WellFounded
... | {
"alphanum_fraction": 0.6366613928,
"avg_line_length": 76.1670190275,
"ext": "agda",
"hexsha": "0463dffb48f10e7f1b34f6cd1265b4bf0f426fc1",
"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... |
------------------------------------------------------------------------
-- Functional semantics for a non-deterministic untyped λ-calculus
-- with constants
------------------------------------------------------------------------
{-# OPTIONS --no-termination-check #-}
module Lambda.Closure.Functional.Non-determinist... | {
"alphanum_fraction": 0.4532601563,
"avg_line_length": 32.4235976789,
"ext": "agda",
"hexsha": "2158082d93cb2a806b96979d1878432f7e17b0fd",
"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 CoinductiveConstructorsAndLet where
open import Common.Coinduction
data D : Set where
foo : D → ∞ D
foo x = let y = x in ♯ y
-- CoinductiveConstructorsAndLet.agda:9,24-25
-- Panic: thing out of context ([CtxId 1] is not a sub context of
-- [CtxId 3])
-- when checking that the expression y has type D
| {
"alphanum_fraction": 0.7211538462,
"avg_line_length": 22.2857142857,
"ext": "agda",
"hexsha": "00f33ca8336a232205a43a5ba703509bd2ad62dd",
"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... |
module SystemF.NormalForm where
open import Prelude
open import SystemF.Syntax
open import SystemF.WellTyped
open import SystemF.Substitutions
open import Data.Vec hiding ([_])
open import Data.List hiding ([_])
mutual
-- The eta-long beta-normal form described by Andreas Abel in:
-- Abel, A., 2008, November.
... | {
"alphanum_fraction": 0.529957204,
"avg_line_length": 32.6046511628,
"ext": "agda",
"hexsha": "b347fac3faf650ba52f501617e45e6b0ecef6e78",
"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
--
-- Properties of operations on M-types
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe --sized-types #-}
module Codata.M.Properties where
open import Level
... | {
"alphanum_fraction": 0.5376439327,
"avg_line_length": 37.6333333333,
"ext": "agda",
"hexsha": "b1cbbeb6f5e3c8c4a59c12653bd844ff268d9f0b",
"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... |
-- Andreas, 2012-01-17
-- {-# OPTIONS -v tc.proj.like:50 #-}
-- {-# OPTIONS -v tc.conv.atom:50 #-}
module Issue553c where
postulate
A : Set
a : A
data Bool : Set where
true false : Bool
data WrapBool (C : Set) : Set where
wrap : Bool -> WrapBool C
-- a projection-like function (must not be constructor-head... | {
"alphanum_fraction": 0.6542372881,
"avg_line_length": 27.65625,
"ext": "agda",
"hexsha": "04061c9f92aa3df636b4a963f13a67e151e6acdc",
"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 STLC1.Kovacs.Substitution where
open import STLC1.Kovacs.Embedding public
open import Category
--------------------------------------------------------------------------------
-- Substitutions (Sub ; ∙ ; _,_)
infix 3 _⊢⋆_
data _⊢⋆_ : 𝒞 → 𝒞 → Set
where
∅ : ∀ {Γ} → Γ ⊢⋆ ∅
_,_ : ∀ {Γ Ξ A} → (σ :... | {
"alphanum_fraction": 0.2970024362,
"avg_line_length": 28.5226586103,
"ext": "agda",
"hexsha": "211a5f0660175be469a28011730742afe443e892",
"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
--
-- Properties, related to products, that rely on the K rule
------------------------------------------------------------------------
{-# OPTIONS --with-K --safe #-}
module Data.Product.Properties.WithK where
open... | {
"alphanum_fraction": 0.4787928222,
"avg_line_length": 32.2631578947,
"ext": "agda",
"hexsha": "0d3a8dafb04ece27f1300d0f87353562da1df1de",
"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.Object {𝔣} (FunctionName : Set 𝔣) where
open import Oscar.Category.Category
open import Oscar.Category.Functor
open import Oscar.Category.Morphism
open import Oscar.Category.Semifunctor
open import Oscar.Category.Semigroupoid
open import Oscar.Category.Setoid
open import Oscar.Data.Nat
{-
open import O... | {
"alphanum_fraction": 0.6332601135,
"avg_line_length": 35.5895765472,
"ext": "agda",
"hexsha": "c701136a207356f982c526cfb3dad7ae86fab3c9",
"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 Syntax where
open import Stack public
-- Abstract symbols, or atoms.
abstract
Atom : Set
Atom = Nat
-- Types, or propositions in constructive logic.
infixl 9 _⩕_
infixr 7 _⇒_
data Type : Set where
α_ : Atom → Type
_⇒_ : Type → Type → Type
_⩕_ : Type → Type → Type
⫪ : Type
-- Contexts, o... | {
"alphanum_fraction": 0.4974611235,
"avg_line_length": 27.6403508772,
"ext": "agda",
"hexsha": "3f4acfad961f1d1768d8544b1d9efffebbe7b43d",
"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... |
------------------------------------------------------------------------
-- Encoder and decoder instances
------------------------------------------------------------------------
open import Atom
module Coding.Instances (atoms : χ-atoms) where
open import Prelude
open import Chi atoms
open import Free-va... | {
"alphanum_fraction": 0.582278481,
"avg_line_length": 25.0793650794,
"ext": "agda",
"hexsha": "e37e6d2f764d6c2e802d6291cdd41a765aecfcb2",
"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 Nat where
import Bool
open Bool
data Nat : Set where
zero : Nat
suc : Nat -> Nat
infixr 25 _+_
_+_ : Nat -> Nat -> Nat
zero + m = m
suc n + m = suc (n + m)
infix 10 _==_ _<_
_==_ : Nat -> Nat -> Bool
zero == zero = true
suc n == zero = false
zero == suc m = false
suc n == suc m = n == m
_<_ : N... | {
"alphanum_fraction": 0.5354058722,
"avg_line_length": 15.6486486486,
"ext": "agda",
"hexsha": "88aa22dac0138be998c44c544769852b631cbf36",
"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 #1 where
open import Level
open import Relation.Binary.PropositionalEquality
{-
Exercise 1.1. Given functions f : A → B and g : B → C, define their composite g ◦ f : A → C.
Show that we have h ◦ (g ◦ f ) ≡ (h ◦ g) ◦ f .
-}
-- Function composition
_∘_ : ∀ {a b c}{A : Set a}{B : Set b}{C : Set c} → (B → C) → (A... | {
"alphanum_fraction": 0.5008635579,
"avg_line_length": 28.95,
"ext": "agda",
"hexsha": "ec70a3709984c7365fced018163bc1c184809a65",
"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 Miscellaneous.InstanceLoop where
open import Type
postulate A : TYPE
postulate B : TYPE
postulate C : TYPE
instance
postulate ab : ⦃ A ⦄ → B
instance
postulate ba : ⦃ B ⦄ → A
postulate a : A
test-a : B
test-a = ab
| {
"alphanum_fraction": 0.683982684,
"avg_line_length": 12.1578947368,
"ext": "agda",
"hexsha": "9455e90059edec99f6d278a21feaa8aa2624424e",
"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 Lemmachine.Resource.Universe where
open import Lemmachine.Request
open import Lemmachine.Response
open import Data.Maybe
open import Data.List
open import Data.Product
open import Data.Bool
open import Data.String
AuthHead = Bool
MediaType = String
Handler = String
Charset = String
CharsetConverter = String
Enc... | {
"alphanum_fraction": 0.7998328458,
"avg_line_length": 34.6811594203,
"ext": "agda",
"hexsha": "edbbf5ae73758795f3fe90df5701a7d6cf5dcb43",
"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... |
------------------------------------------------------------------------------
-- FOTC list terms properties
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorphism #-}
{-... | {
"alphanum_fraction": 0.4032051282,
"avg_line_length": 30,
"ext": "agda",
"hexsha": "f96a72748bcce2fe7f59b2330212c25825eb6c5f",
"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-19T14:18:30.00... |
{-# OPTIONS --without-K #-}
open import HoTT.Base
open import HoTT.Equivalence
module HoTT.Equivalence.Empty where
open variables
𝟎-equiv : {A : 𝒰 i} → ¬ A → 𝟎 {i} ≃ A
𝟎-equiv ¬a = 𝟎-rec , qinv→isequiv (𝟎-rec ∘ ¬a , 𝟎-ind , 𝟎-rec ∘ ¬a)
| {
"alphanum_fraction": 0.6317991632,
"avg_line_length": 21.7272727273,
"ext": "agda",
"hexsha": "d06600309078b58961a2bddacd8f091a17ccb058",
"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... |
-- 2014-05-27 Jesper and Andreas
postulate
A : Set
{-# BUILTIN REWRITE A #-}
-- Expected error:
-- A does not have the right type for a rewriting relation
-- because it should accept at least two arguments
-- when checking the pragma BUILTIN REWRITE A
| {
"alphanum_fraction": 0.7209302326,
"avg_line_length": 21.5,
"ext": "agda",
"hexsha": "c230084a611da1e9e62f83b36443cee1c9ea26cb",
"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-12T11:35:18.... |
{-# OPTIONS --without-K --rewriting #-}
open import HoTT
open import homotopy.elims.SuspSmash
-- (ΣX)∧Y ≃ Σ(X∧Y)
module homotopy.SuspSmash where
module _ {i j} (X : Ptd i) (Y : Ptd j) where
private
x₀ = pt X
y₀ = pt Y
Σ∧-out-smgluel-merid : ∀ (x : de⊙ X) →
Square idp
(ap (Susp-fmap (λ x... | {
"alphanum_fraction": 0.4431211626,
"avg_line_length": 48.0162962963,
"ext": "agda",
"hexsha": "850d9a465e226389701003dd23143b57b3848ff6",
"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-10... |
{-# OPTIONS --show-implicit #-}
-- {-# OPTIONS -v tc.data:25 #-}
-- {-# OPTIONS -v tc.conv.coerce:0 -v tc.with:25 #-}
module FilterSub where
open import Common.Level
open import Common.Equality
_∘_ : ∀ {a b c}
{A : Set a} {B : A → Set b} {C : {x : A} → B x → Set c} →
(∀ {x} (y : B x) → C y) → (g : (x :... | {
"alphanum_fraction": 0.4683870968,
"avg_line_length": 25.4098360656,
"ext": "agda",
"hexsha": "a2cd1ff53db0e1277f6757bcebfa86a79f743a04",
"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 #-}
module Cubical.Categories.Instances.CommAlgebras where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Function
open import Cubical.Foundations.Powerset
open import Cubical.Algebra.CommRing
open import Cubical.Algebra.Algebra
open import Cubical.Algebra.CommAlgebra
open... | {
"alphanum_fraction": 0.6387122417,
"avg_line_length": 39.9365079365,
"ext": "agda",
"hexsha": "29e3a8eb9c0e9d19b155ff219991289ce6919bb4",
"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 Definition.Typed.RedSteps where
open import Definition.Untyped
open import Definition.Typed
-- Concatenation of type reduction closures
_⇨*_ : ∀ {Γ A B C r} → Γ ⊢ A ⇒* B ^ r → Γ ⊢ B ⇒* C ^ r → Γ ⊢ A ⇒* C ^ r
id ⊢B ⇨* B⇒C = B⇒C
(A⇒A′ ⇨ A′⇒B) ⇨* B⇒C = A⇒A′ ⇨ (A′⇒B ⇨* B⇒C)
-- Concatenati... | {
"alphanum_fraction": 0.4547413793,
"avg_line_length": 37.6216216216,
"ext": "agda",
"hexsha": "9a23a27f7630a99bffb8ae427b523f870ad9a73c",
"lang": "Agda",
"max_forks_count": 2,
"max_forks_repo_forks_event_max_datetime": "2022-02-15T19:42:19.000Z",
"max_forks_repo_forks_event_min_datetime": "2022-01-26T... |
{- 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
-}
import LibraBFT.Impl.Types.BlockInfo as BlockInfo
import ... | {
"alphanum_fraction": 0.7617554859,
"avg_line_length": 39.875,
"ext": "agda",
"hexsha": "f45047dae812aa42f8432801c970fcb074a4c156",
"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": ... |
open import Prelude
open import Nat
open import core
open import contexts
module lemmas-env where
env-ctx-same-1 : ∀{Δ Σ' Γ E x} →
Δ , Σ' , Γ ⊢ E →
x # E →
x # Γ
env-ctx-same-1 EnvId h = x#∅
env-ctx-same-1 {x = x} (EnvInd {E = E} {x = x'} ctxcons _) ... | {
"alphanum_fraction": 0.3948302078,
"avg_line_length": 34.0172413793,
"ext": "agda",
"hexsha": "af4bf8b07fe35590492400f8791121ae336d217e",
"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 --allow-unsolved-metas #-}
open import Level
open import Ordinals
module OPair {n : Level } (O : Ordinals {n}) where
open import zf
open import logic
import OD
import ODUtil
import OrdUtil
open import Relation.Nullary
open import Relation.Binary
open import Data.Empty
open import Relation.Binary
open ... | {
"alphanum_fraction": 0.4747063054,
"avg_line_length": 38.9813084112,
"ext": "agda",
"hexsha": "d07511ba5696cc5ba7b2cd5a9ff365c898d073f7",
"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 PreludeString where
import RTP -- magic module
import PreludeList
open PreludeList using (List)
open import AlonzoPrelude
infixr 50 _++_
private
primitive
primStringAppend : String -> String -> String
-- primStringReverse : String -> String
primStringToList : String -> List Cha... | {
"alphanum_fraction": 0.7217806041,
"avg_line_length": 17.9714285714,
"ext": "agda",
"hexsha": "c5518ca6f89ab2d8be41d51cb37b7ddc3093192f",
"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... |
-- ----------------------------------------------------------------------
-- The Agda Descriptor Library
--
-- (Closed) Sets
-- ----------------------------------------------------------------------
module Data.Set where
open import Data.Empty using (⊥)
open import Data.Fin using (Fin; suc; zero)
open import Data.Na... | {
"alphanum_fraction": 0.4105815479,
"avg_line_length": 20.4196428571,
"ext": "agda",
"hexsha": "ae1e438db49e8db007f43b019e9a77feb2c32e5c",
"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... |
------------------------------------------------------------------------
-- Universe levels
------------------------------------------------------------------------
module Common.Level where
postulate
Level : Set
lzero : Level
lsuc : (i : Level) → Level
_⊔_ : Level -> Level -> Level
{-# IMPORT Common.FFI ... | {
"alphanum_fraction": 0.4661016949,
"avg_line_length": 22.6923076923,
"ext": "agda",
"hexsha": "e4d6278bd4002cc606aff23331bf1b77f799a37c",
"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... |
------------------------------------------------------------------------
-- "Equational" reasoning combinator setup
------------------------------------------------------------------------
{-# OPTIONS --safe #-}
open import Labelled-transition-system
-- Note that the module parameter is explicit. If the LTS is not g... | {
"alphanum_fraction": 0.4716596241,
"avg_line_length": 34.315,
"ext": "agda",
"hexsha": "f5baa7a6f1a8f561e052859bc2f7b5a18943718c",
"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": ... |
{- 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.7298292601,
"avg_line_length": 43.9264705882,
"ext": "agda",
"hexsha": "f10883e652f829ac224c82a01bec1230f6d36b17",
"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 Relation.Binary.PropositionalEquality as Eq
open Eq using (_≡_; refl; sym; trans; cong; cong₂; _≢_)
open import Data.Empty using (⊥; ⊥-elim)
open import Data.List using (List; []; _∷_; dropWhile)
open import Data.Char using (Char)
open import Data.Bool using (Bool; true; false)
import Data.Char as Char using (_≟... | {
"alphanum_fraction": 0.5479331574,
"avg_line_length": 27.7317073171,
"ext": "agda",
"hexsha": "53639a4fa453618d5c2aec2396ca1c0b95120d5a",
"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-1... |
------------------------------------------------------------------------------
-- A proof that is rejected using the --without-K option
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-u... | {
"alphanum_fraction": 0.4894009217,
"avg_line_length": 33.90625,
"ext": "agda",
"hexsha": "93be4dc7668c84e9f07e1b2333236d45c0a8cd3d",
"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-19T14:18... |
module Data.Fin.Properties.Extra where
open import Data.Fin hiding (_≤_)
open import Data.Nat
open import Data.Nat.Properties
open import Relation.Binary.PropositionalEquality
inject≤-trans : ∀ {l m n} i (p : l ≤ m)(q : m ≤ n) → inject≤ (inject≤ i p) q ≡ inject≤ i (≤-trans p q)
inject≤-trans () z≤n q
inject≤-trans z... | {
"alphanum_fraction": 0.6650717703,
"avg_line_length": 32.1538461538,
"ext": "agda",
"hexsha": "4fd90f854ed4745976eceb2cead5ccd758544e51",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-12-28T17:38:05.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-12-28T... |
{-# OPTIONS --universe-polymorphism #-}
module Categories.Comma.Functors where
open import Categories.Category
open import Categories.Functor renaming (_∘_ to _∘F_)
open import Categories.FunctorCategory renaming (Functors to [_⇒_])
open import Categories.NaturalTransformation using (module NaturalTransformation)
open... | {
"alphanum_fraction": 0.5357269819,
"avg_line_length": 32.3333333333,
"ext": "agda",
"hexsha": "7547d083d7dd62441c155c0a5a570a763d5ee23c",
"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... |
-- Andreas, Bentfest 2016-04-28 Marsstrand
-- Issue 1944: also resolve overloaded projections in checking position
module _ (A : Set) (a : A) where
record R B : Set where
field f : B
open R
record S B : Set where
field f : B
open S
test : R A → A
test = f
test1 : ∀{A} → R A → A
test1 = f
test2 : ∀ A → R A → A... | {
"alphanum_fraction": 0.5649122807,
"avg_line_length": 15,
"ext": "agda",
"hexsha": "5e0adefe4654d4b1999d59ae434c143dfe918ac9",
"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:38.00... |
module nat-thms where
open import bool
open import bool-thms
open import bool-thms2
open import eq
open import nat
open import neq
open import product
open import product-thms
open import sum
open import level
open import negation
--------------------------------------------------
-- properties of addition
----------... | {
"alphanum_fraction": 0.4408203034,
"avg_line_length": 33.8351648352,
"ext": "agda",
"hexsha": "3782a7c2e42c5b3c698afcc4a13288e7f194a51b",
"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
module M (X : Set) where
postulate
F : Set
G : Set
data ⊥ : Set where
open M ⊥ hiding (F)
easy : M.G ⊥
easy = {!!} -- G
hard : M.F ⊥
hard = {!!} -- M.F ⊥ (and not .Issue1640._.F)
data ⊤ : Set where
tt : ⊤
module With where
private
F : ⊤ → Set
F x with x
F _ | tt = ⊥... | {
"alphanum_fraction": 0.4962406015,
"avg_line_length": 12.46875,
"ext": "agda",
"hexsha": "39e81b9cbc22ca8bee876244b1bfab9f9f1cc67a",
"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 --rewriting --confluence-check #-}
open import Agda.Builtin.Nat using (Nat; zero; suc)
open import Agda.Builtin.Equality
open import Agda.Builtin.Equality.Rewrite
variable
k l m n : Nat
postulate
max : Nat → Nat → Nat
max-0l : max 0 n ≡ n
max-0r : max m 0 ≡ m
max-diag : max m m ≡ m
max-ss : ... | {
"alphanum_fraction": 0.6132596685,
"avg_line_length": 22.625,
"ext": "agda",
"hexsha": "cbf49c5c36f0507d252af84a749fe41c44e119a5",
"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 bstd.bake where
open import Agda.Builtin.Nat
open import Agda.Builtin.String
open import Data.Word8.Primitive
open import Data.ByteString.Primitive.Strict
open import Data.Tuple.Base
module bpace
(Scalar : Set)
(Point : Set)
(scalarMul : Scalar → Point → Point)
(2ᴸ : Set)
(Key : Set)
(enc dec : Key... | {
"alphanum_fraction": 0.5550070522,
"avg_line_length": 23.2459016393,
"ext": "agda",
"hexsha": "4602983066cfd30e87682d889351c285c223842e",
"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
--
-- Pretty Printing
-- This module is based on Jean-Philippe Bernardy's functional pearl
-- "A Pretty But Not Greedy Printer"
------------------------------------------------------------------------
{-# OPTIONS --wi... | {
"alphanum_fraction": 0.5493293592,
"avg_line_length": 25.2255639098,
"ext": "agda",
"hexsha": "bcdb3f71f7d348b220b27e1c344569dbcfc43ffd",
"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 --safe #-}
module Cubical.Data.NatPlusOne.MoreNats.AssocNat where
open import Cubical.Data.NatPlusOne.MoreNats.AssocNat.Base public
open import Cubical.Data.NatPlusOne.MoreNats.AssocNat.Properties public
| {
"alphanum_fraction": 0.8248847926,
"avg_line_length": 36.1666666667,
"ext": "agda",
"hexsha": "90b08ba6fd40056dca951f61319570511365c23a",
"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 #-}
open import Algebra.Structures.Bundles.Field
module Algebra.Linear.Construct.Matrix
{k ℓ} (K : Field k ℓ)
where
open import Level using (_⊔_)
open import Data.Product hiding (map)
open import Data.Fin using (Fin; toℕ; fromℕ; _≤_)
open import Data.Fin.Properties using (¬Fin0)
op... | {
"alphanum_fraction": 0.4842244149,
"avg_line_length": 32.7054409006,
"ext": "agda",
"hexsha": "e7a6bd35228317af73d23029c9dd306733529e30",
"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 Setoids.Setoids
open import Groups.Definition
open import Groups.Subgroups.Definition
open import Groups.Actions.Definition
open import Sets.EquivalenceRelations
open import Groups.Actions.Definition
module Groups.Actions.Stabiliser {a b c d : _} {A : Set... | {
"alphanum_fraction": 0.737534626,
"avg_line_length": 43.7575757576,
"ext": "agda",
"hexsha": "50fa96831a26b26807355f2caa8c6a95644fc654",
"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-29T1... |
module TelescopingLet3 where
module Star where
★ : Set₁
★ = Set
★₁ : Set₂
★₁ = Set₁
module MEndo (open Star) (A : ★) where
Endo = A → A
-- at this point, ★ should no longer be in scope
data D3 (open Star using (★₁)) : ★₁ where
c : (A : ★) → D3
-- ★₁ is in scope
-- ★ is not in scope since it was not bro... | {
"alphanum_fraction": 0.6059782609,
"avg_line_length": 18.4,
"ext": "agda",
"hexsha": "3bfba5977817264de55eb1b232f73348facba002",
"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... |
variable {A} : Set _
id : A → A
id a = a
test : Set₁
test = id {A = Set₁} Set
| {
"alphanum_fraction": 0.5308641975,
"avg_line_length": 9,
"ext": "agda",
"hexsha": "b5b7bc12a2c05024cbfd8b28dea5dac2563e605b",
"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.0... |
{-# OPTIONS --without-K --safe #-}
open import Categories.Category
open import Categories.Category.Monoidal
open import Categories.Category.Monoidal.Closed
module Categories.Category.Monoidal.Closed.IsClosed.Dinatural
{o ℓ e} {C : Category o ℓ e} {M : Monoidal C} (Cl : Closed M) where
open import Data.Product usin... | {
"alphanum_fraction": 0.527173913,
"avg_line_length": 49.5384615385,
"ext": "agda",
"hexsha": "3d0a12e4cd489739dba01e2b6000ad839e13fefe",
"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... |
-- Andreas, 2016-10-11, AIM XXIV
-- COMPILED pragma accidentially also accepted for abstract definitions
open import Common.String
data Unit : Set where
unit : Unit
{-# COMPILED_DATA Unit () () #-}
postulate
IO : Set → Set
doNothing : IO Unit
{-# COMPILED_TYPE IO IO #-}
{-# BUILTIN IO IO #-}
{-# COMPILED doN... | {
"alphanum_fraction": 0.679933665,
"avg_line_length": 19.4516129032,
"ext": "agda",
"hexsha": "eeb3d19d82384a6d8288ce2f9a3ad8aed1f97152",
"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
A : Set
data D : Set → Set₁ where
d : (A : Set) → D A
f : Set → (D A → Set) → Set
f A f = f (d A)
-- Expected error:
-- A != A of type Set
-- (because one is a variable and one a defined identifier)
-- when checking that the pattern d A has type D A
| {
"alphanum_fraction": 0.6029962547,
"avg_line_length": 19.0714285714,
"ext": "agda",
"hexsha": "bfd382bb318e1505d1b6d114c8434a7cda9de073",
"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... |
module Numeral.Natural.Relation.Order.Existence.Proofs where
import Lvl
open import Data.Tuple as Tuple using (_⨯_ ; _,_)
open import Functional
open import Logic.Propositional
open import Logic.Propositional.Theorems
open import Logic.Predicate
open import Numeral.Natural
open import Numeral.Natural.Oper
open import ... | {
"alphanum_fraction": 0.4791100124,
"avg_line_length": 35.4824561404,
"ext": "agda",
"hexsha": "6ee5b3e528a88c141887e428e8536de170348dd6",
"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... |
------------------------------------------------------------------------
-- Propositional (intensional) equality
------------------------------------------------------------------------
module Relation.Binary.PropositionalEquality where
open import Relation.Binary
open import Relation.Binary.Consequences
open import ... | {
"alphanum_fraction": 0.5324165029,
"avg_line_length": 26.7894736842,
"ext": "agda",
"hexsha": "24392199b4bdb47e4be015aee958e4fef8319cf8",
"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... |
module _ where
open import Agda.Primitive
module _ (a ℓ ℓ' : Level) where
mutual
X : Level
X = _ -- Agda 2.5.1.1 solves this level meta
hyp : Set₁
hyp with (lsuc ℓ')
... | _ = Set
where
X<=a : Set (X ⊔ a) → Set a
X<=a A = A
test : Set₁
test with (lsuc ℓ)
..... | {
"alphanum_fraction": 0.4623115578,
"avg_line_length": 15.92,
"ext": "agda",
"hexsha": "d0f092b42373af96a5bf977f9cf9e32986bc6197",
"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:... |
{-A
Polynomials over commutative rings
==================================
-}
{-# OPTIONS --safe #-}
----------------------------------
module Cubical.Algebra.Polynomials.Univariate.Properties where
open import Cubical.HITs.PropositionalTruncation
open import Cubical.Foundations.Prelude
open import Cubical.Foundation... | {
"alphanum_fraction": 0.322786417,
"avg_line_length": 51.7405582923,
"ext": "agda",
"hexsha": "812225b2a6ab65aac311ed79905ceb8f6fa08317",
"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... |
------------------------------------------------------------------------
-- Conversion of ≤ to <, along with a number of properties
------------------------------------------------------------------------
-- Possible TODO: Prove that a conversion ≤ → < → ≤ returns a
-- relation equivalent to the original one (and simi... | {
"alphanum_fraction": 0.5,
"avg_line_length": 32.2077922078,
"ext": "agda",
"hexsha": "edffbc93e70a9b199ed93be4d9c130e19eafa967",
"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-21T16:37:58.... |
------------------------------------------------------------------------
-- The Agda standard library
--
-- This module is DEPRECATED. Please use Data.List.Relation.Unary.All
-- directly.
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Data.List.All w... | {
"alphanum_fraction": 0.5093167702,
"avg_line_length": 26.8333333333,
"ext": "agda",
"hexsha": "c53c76a27ad96ea668d9619b4a9170958c52f48c",
"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 -v impossible:100 #-}
module Issue882a where
open import Common.Level
open import Common.Equality
private
primitive
primTrustMe : ∀ {a} {A : Set a} {x y : A} → x ≡ y
-- trustMe {x = x} {y = y} evaluates to refl if x and y are
-- definitionally equal.
--
-- For an example of the use of trustMe, see Da... | {
"alphanum_fraction": 0.6461336828,
"avg_line_length": 19.5641025641,
"ext": "agda",
"hexsha": "062944f5ddbc3befeccaaa19e16cce803263ff77",
"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 --cubical --guardedness --postfix-projections #-}
module Data.Graph where
open import Prelude
open import Data.List
open import Data.Nat
-- record Thunk (A : Type a) : Type a where
-- coinductive
-- constructor ⟪_⟫
-- field force : A
-- open Thunk
-- infixr 5 _◃_
-- record Stream (A : Type a) : Ty... | {
"alphanum_fraction": 0.5599022005,
"avg_line_length": 22.7222222222,
"ext": "agda",
"hexsha": "c31118ce3b56b767f151245f18fa46e3250b45b9",
"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... |
open import Agda.Builtin.Bool
open import Agda.Builtin.Nat
open import Agda.Builtin.Equality
record D (A : Set) : Set where
constructor mkD
field d : A
open D {{...}}
module test where
instance
_ : D Bool
_ = mkD true
a : D Nat
a = mkD 0
_ : d ≡ true
_ = refl
_ : d ≡ zero
_ = refl
... | {
"alphanum_fraction": 0.5776081425,
"avg_line_length": 11.9090909091,
"ext": "agda",
"hexsha": "263aef8550f7b83c65f0b3ffc376db667491cb3d",
"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 Agda.Builtin.List
open import Agda.Builtin.Unit
open import Agda.Builtin.Nat
open import Agda.Builtin.String
renaming (primShowNat to show)
open import Agda.Builtin.Reflection
renaming (bindTC to _>>=_; returnTC to return)
pattern vArg t = arg (arg-info visible relevant) t
pattern var₀ x = var x []
in... | {
"alphanum_fraction": 0.622329428,
"avg_line_length": 28.4509803922,
"ext": "agda",
"hexsha": "8c1f7d2d2fc1b3d02a86e0f778696125dc00cff2",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-04-01T18:30:09.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-04-01T1... |
{-# OPTIONS --without-K #-}
open import HoTT
module homotopy.HSpace where
record HSpaceStructure {i} (A : Type i) : Type i where
constructor hSpaceStructure
field
e : A
μ : A → A → A
μe- : (a : A) → μ e a == a
μ-e : (a : A) → μ a e == a
module ConnectedHSpace {i} (A : Type i) (c : is-connected ⟨... | {
"alphanum_fraction": 0.5533807829,
"avg_line_length": 27.4146341463,
"ext": "agda",
"hexsha": "f8504db895309189e8a312ca86a1fee0a27c5af8",
"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... |
-- WARNING: This file was generated automatically by Vehicle
-- and should not be modified manually!
-- Metadata
-- - Agda version: 2.6.2
-- - AISEC version: 0.1.0.1
-- - Time generated: ???
{-# OPTIONS --allow-exec #-}
open import Vehicle
open import Vehicle.Data.Tensor
open import Data.Product
open import Data.I... | {
"alphanum_fraction": 0.6401384083,
"avg_line_length": 33.0285714286,
"ext": "agda",
"hexsha": "b40a6be846c6ef022d62c30138b4891ce8a51cea",
"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 Imports.ATP-A where
postulate
D : Set
_≡_ : D → D → Set
a b : D
postulate p : a ≡ b
| {
"alphanum_fraction": 0.5480769231,
"avg_line_length": 11.5555555556,
"ext": "agda",
"hexsha": "5206ea2c778c4fd845ecd782270323251943f540",
"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 --cubical-compatible #-}
-- {-# OPTIONS -v tc.lhs.unify:15 #-}
open import Common.Equality
open import Common.Prelude
data Fin : (n : Nat) → Set where
zero : {n : Nat} → Fin (suc n)
suc : {n : Nat} (i : Fin n) → Fin (suc n)
data _≅_ {A : Set} (a : A) : {B : Set} (b : B) → Set1 where
refl : a ≅ a
... | {
"alphanum_fraction": 0.5038402458,
"avg_line_length": 26.04,
"ext": "agda",
"hexsha": "46ca7c9be6cffe8e8f2b40d3b3f3f41de44fd664",
"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 Cxt (K : Set) where
open import Basics
open import Pr
open import Nom
mutual
data Cxt : Set where
EC : Cxt
_[_-_] : (G : Cxt)(x : Nom) -> K -> {p : [| G Hasn't x |]} -> Cxt
HAS : Cxt -> Nom -> Bool
HAS EC x = false
HAS (G [ y - S ]) x with nomEq y x
HAS (G [ y - S ]) .y | yes refl = true
... | {
"alphanum_fraction": 0.4362176628,
"avg_line_length": 26.6904761905,
"ext": "agda",
"hexsha": "5b495bb9e80bf057fea05226778b834b6ba1b25f",
"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 --sized-types #-}
module SOList.Lower.Properties {A : Set}(_≤_ : A → A → Set) where
open import Bound.Lower A
open import Bound.Lower.Order _≤_
open import Size
open import List.Sorted _≤_
open import SOList.Lower _≤_
lemma-solist-sorted : {ι : Size}{b : Bound} → (xs : SOList {ι} b) → Sorted (forget xs)... | {
"alphanum_fraction": 0.6561886051,
"avg_line_length": 29.9411764706,
"ext": "agda",
"hexsha": "fb0b907750865875e404b8e12fe16d0f24cf3d70",
"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 Float where
import Lvl
open import Type
postulate Float : Type{Lvl.𝟎}
{-# BUILTIN FLOAT Float #-}
| {
"alphanum_fraction": 0.6964285714,
"avg_line_length": 14,
"ext": "agda",
"hexsha": "3ff72daa13374862d2954b423c07c30cd80e7a18",
"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": "70f... |
{-# OPTIONS --copatterns #-}
open import Common.Equality
open import Common.Product
id : {A : Set} → A → A
id x = x
record Functor (F : Set → Set) : Set₁ where
field
map : ∀ {A B} → (A → B) → F A → F B
map-id : ∀ {A}{x : F A} → map id x ≡ x
open Functor
test : {C : Set} → Functor (_×_ C)
map test f (c ... | {
"alphanum_fraction": 0.5400843882,
"avg_line_length": 23.7,
"ext": "agda",
"hexsha": "38b9c99d43b89335e56640828f68aea3c221b943",
"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 --without-K --exact-split #-}
module 02-pi where
import 00-preamble
open 00-preamble public
-- Section 2.3 The identity function, composition, and their laws
-- Definition 2.3.1
id : {i : Level} {A : UU i} → A → A
id a = a
-- Definition 2.3.2
_∘_ :
{i j k : Level} {A : UU i} {B : UU j} {C : UU k} →
... | {
"alphanum_fraction": 0.4555160142,
"avg_line_length": 23.4166666667,
"ext": "agda",
"hexsha": "accb85bc3f9f4748b2cf889d46827cfb515dfad5",
"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... |
------------------------------------------------------------------------
-- Some parsers which require a decidable token equality
------------------------------------------------------------------------
open import Relation.Binary
module RecursiveDescent.Inductive.Token (D : DecSetoid) where
open DecSetoid D using (... | {
"alphanum_fraction": 0.600877193,
"avg_line_length": 26.8235294118,
"ext": "agda",
"hexsha": "222894395697c7ab72266a3161085b70d6c135c0",
"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
--
-- Propositional (intensional) equality
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Relation.Binary.PropositionalEquality where
open import A... | {
"alphanum_fraction": 0.5051534715,
"avg_line_length": 32.9440298507,
"ext": "agda",
"hexsha": "8178ed79d99065c45a6a29e9289774e369f3850d",
"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... |
{-# TERMINATING #-}
{-# NO_POSITIVITY_CHECK #-}
mutual
data D₁ : Set where
lam : (D₁ → D₁) → D₁
Foo₁ : Set
Foo₁ = Foo₁
{-# NON_TERMINATING #-}
{-# NO_POSITIVITY_CHECK #-}
mutual
data D₂ : Set where
lam : (D₂ → D₂) → D₂
Foo₂ : Set
Foo₂ = Foo₂
| {
"alphanum_fraction": 0.5467625899,
"avg_line_length": 14.6315789474,
"ext": "agda",
"hexsha": "92d5a18ea64e1ecd6fd10142e05b5863efbb60a5",
"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 R0 : Set₁ where
constructor c0
field f0 : Set
record R1 : Set₁ where
constructor c1
field f1 : R0
test : R1 → Set₁
test x@(c1 x) = Set
| {
"alphanum_fraction": 0.6578947368,
"avg_line_length": 13.8181818182,
"ext": "agda",
"hexsha": "5f9b331549595ef299774fac30f130831dd43d66",
"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... |
-- forcePi should be allowed to generate constraints
module Lambda where
data Bool : Set where
true : Bool
false : Bool
T : Bool -> Set
T true = Bool -> Bool
T false = Bool
id : {x : Bool} -> T x -> T x
id y = y
f : Bool -> Bool
f = id (\x -> x)
| {
"alphanum_fraction": 0.5953307393,
"avg_line_length": 13.5263157895,
"ext": "agda",
"hexsha": "1d6430c8e62015c24a861dfa9431415ec03c21cd",
"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... |
-- Andreas, 2013-03-20 Problem was that CompiledClause.Match.unfoldCoinduction
-- did not instantiate metas
-- {-# OPTIONS -v tc.meta.assign:10 -v tc.reduce:100 -v tc.with.abstract:50 #-}
{-# OPTIONS --allow-unsolved-metas #-}
module Issue826 where
open import Common.Coinduction
postulate
A : Set
x : A
P : A → ... | {
"alphanum_fraction": 0.6133625411,
"avg_line_length": 20.2888888889,
"ext": "agda",
"hexsha": "7f47bc3dabe788e96b407c356afceb9d2283bbb4",
"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... |
module SetInf where
id : ∀ {A} → A → A
id x = x
| {
"alphanum_fraction": 0.5306122449,
"avg_line_length": 9.8,
"ext": "agda",
"hexsha": "56dba006b564eab880908b4a5ecf80d101ce6adb",
"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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.