hexsha stringlengths 40 40 | size int64 3 1.05M | ext stringclasses 163
values | lang stringclasses 53
values | max_stars_repo_path stringlengths 3 945 | max_stars_repo_name stringlengths 4 112 | max_stars_repo_head_hexsha stringlengths 40 78 | max_stars_repo_licenses listlengths 1 10 | max_stars_count float64 1 191k ⌀ | max_stars_repo_stars_event_min_datetime stringlengths 24 24 ⌀ | max_stars_repo_stars_event_max_datetime stringlengths 24 24 ⌀ | max_issues_repo_path stringlengths 3 945 | max_issues_repo_name stringlengths 4 113 | max_issues_repo_head_hexsha stringlengths 40 78 | max_issues_repo_licenses listlengths 1 10 | max_issues_count float64 1 116k ⌀ | max_issues_repo_issues_event_min_datetime stringlengths 24 24 ⌀ | max_issues_repo_issues_event_max_datetime stringlengths 24 24 ⌀ | max_forks_repo_path stringlengths 3 945 | max_forks_repo_name stringlengths 4 113 | max_forks_repo_head_hexsha stringlengths 40 78 | max_forks_repo_licenses listlengths 1 10 | max_forks_count float64 1 105k ⌀ | max_forks_repo_forks_event_min_datetime stringlengths 24 24 ⌀ | max_forks_repo_forks_event_max_datetime stringlengths 24 24 ⌀ | content stringlengths 3 1.05M | avg_line_length float64 1 966k | max_line_length int64 1 977k | alphanum_fraction float64 0 1 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
3dc3c916e5d023ba4479f884bd4be3b523c94c07 | 985 | agda | Agda | test/Fail/Issue1428a.agda | cagix/agda | cc026a6a97a3e517bb94bafa9d49233b067c7559 | [
"BSD-2-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/Issue1428a.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/Issue1428a.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2015-03-16
-- Andreas, 2020-10-26 removed loop during injectivity check
{-# OPTIONS --sized-types #-}
open import Agda.Builtin.Size
-- Note: the assumption of pred is absurd,
-- but still should not make Agda loop.
module _ (pred : ∀ i → Size< i) where
data ⊥ : Set where
data SizeLt (i : Size) : Set w... | 22.386364 | 61 | 0.620305 |
5846283d41d3cf63c68d7d0a34476ac0f28ea132 | 364 | agda | Agda | test/fail/StronglyRigidOccurrence.agda | dagit/agda | 4383a3d20328a6c43689161496cee8eb479aca08 | [
"MIT"
] | 1 | 2019-11-27T07:26:06.000Z | 2019-11-27T07:26:06.000Z | test/fail/StronglyRigidOccurrence.agda | dagit/agda | 4383a3d20328a6c43689161496cee8eb479aca08 | [
"MIT"
] | null | null | null | test/fail/StronglyRigidOccurrence.agda | dagit/agda | 4383a3d20328a6c43689161496cee8eb479aca08 | [
"MIT"
] | null | null | null | {-# OPTIONS --allow-unsolved-metas #-}
-- The option is supplied to force a real error to pass the regression test.
module StronglyRigidOccurrence where
data Nat : Set where
zero : Nat
suc : Nat -> Nat
data _≡_ {A : Set}(a : A) : A -> Set where
refl : a ≡ a
test : let X : Nat; X = _ in X ≡ suc X
test = refl
-... | 24.266667 | 76 | 0.653846 |
060602877b50b42f5ad0aa2016bfd7612db56b69 | 3,432 | agda | Agda | IPC/Metatheory/Gentzen-KripkeExploding.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | 29 | 2016-07-03T18:51:56.000Z | 2022-01-01T10:29:18.000Z | IPC/Metatheory/Gentzen-KripkeExploding.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | 1 | 2018-06-10T09:11:22.000Z | 2018-06-10T09:11:22.000Z | IPC/Metatheory/Gentzen-KripkeExploding.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | null | null | null | module IPC.Metatheory.Gentzen-KripkeExploding where
open import IPC.Syntax.Gentzen public
open import IPC.Semantics.KripkeExploding public
-- Soundness with respect to all models, or evaluation.
eval : ∀ {A Γ} → Γ ⊢ A → Γ ⊨ A
eval (var i) γ = lookup i γ
eval (lam {A} {B} t) γ = return {A ▻... | 33.980198 | 83 | 0.450175 |
414c366b3e3e0d7c1a48660c16dff63772b8d569 | 152 | agda | Agda | Cubical/Data/Sum.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | 1 | 2020-03-23T23:52:11.000Z | 2020-03-23T23:52:11.000Z | Cubical/Data/Sum.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | Cubical/Data/Sum.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --safe #-}
module Cubical.Data.Sum where
open import Cubical.Data.Sum.Base public
open import Cubical.Data.Sum.Properties public
| 25.333333 | 46 | 0.769737 |
2fd0a393fb0e200bbd1c1853a94bcd299233a4d4 | 958 | agda | Agda | Graphs/PathGraph.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 4 | 2019-08-08T12:44:19.000Z | 2022-01-28T06:04:15.000Z | Graphs/PathGraph.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 14 | 2019-01-06T21:11:59.000Z | 2020-04-11T11:03:39.000Z | Graphs/PathGraph.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 1 | 2021-11-29T13:23:07.000Z | 2021-11-29T13:23:07.000Z | {-# OPTIONS --warning=error --safe --without-K #-}
open import LogicalFormulae
open import Agda.Primitive using (Level; lzero; lsuc; _⊔_)
open import Functions.Definition
open import Setoids.Setoids
open import Setoids.Subset
open import Graphs.Definition
open import Sets.FinSet.Definition
open import Sets.FinSet.Lemm... | 35.481481 | 88 | 0.735908 |
0e4a267aa8a4e65a160711b62f4cd340782aef9e | 478 | agda | Agda | Cubical/HITs/S2/Base.agda | barrettj12/cubical | 7b41b9171f90473efc98487cb2ea7a4d02320cb2 | [
"MIT"
] | 301 | 2018-10-17T18:00:24.000Z | 2022-03-24T02:10:47.000Z | Cubical/HITs/S2/Base.agda | barrettj12/cubical | 7b41b9171f90473efc98487cb2ea7a4d02320cb2 | [
"MIT"
] | 584 | 2018-10-15T09:49:02.000Z | 2022-03-30T12:09:17.000Z | Cubical/HITs/S2/Base.agda | barrettj12/cubical | 7b41b9171f90473efc98487cb2ea7a4d02320cb2 | [
"MIT"
] | 134 | 2018-11-16T06:11:03.000Z | 2022-03-23T16:22:13.000Z | {-# OPTIONS --safe #-}
module Cubical.HITs.S2.Base where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.HLevels
data S² : Type₀ where
base : S²
surf : PathP (λ i → base ≡ base) refl refl
S²ToSetRec : ∀ {ℓ} {A : S² → Type ℓ}
→ ((x : S²) → isSet (A x))
→ A base
... | 26.555556 | 79 | 0.608787 |
41c66894751d8b73f7078e995d22b4dd4fc529b4 | 29,719 | agda | Agda | KeyValue/LinearStore/Implementation.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 4 | 2019-08-08T12:44:19.000Z | 2022-01-28T06:04:15.000Z | KeyValue/LinearStore/Implementation.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 14 | 2019-01-06T21:11:59.000Z | 2020-04-11T11:03:39.000Z | KeyValue/LinearStore/Implementation.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 1 | 2021-11-29T13:23:07.000Z | 2021-11-29T13:23:07.000Z | {-# OPTIONS --warning=error --safe --without-K #-}
open import LogicalFormulae
open import Orders.Total.Definition
open import Orders.Total.Lemmas
open import Maybe
open import Agda.Primitive using (Level; lzero; lsuc; _⊔_)
open import Vectors
open import Numbers.Naturals.Semiring
open import Numbers.Naturals.Order
... | 122.300412 | 341 | 0.720886 |
c5bac97156d193f3ffbd67716e8ed36a8a6be4a9 | 10,237 | agda | Agda | Data/List/Kleene/Base.agda | oisdk/agda-kleene-lists | a7e99bc288e12e83440c891dbd3e5077d9b1657e | [
"MIT"
] | null | null | null | Data/List/Kleene/Base.agda | oisdk/agda-kleene-lists | a7e99bc288e12e83440c891dbd3e5077d9b1657e | [
"MIT"
] | null | null | null | Data/List/Kleene/Base.agda | oisdk/agda-kleene-lists | a7e99bc288e12e83440c891dbd3e5077d9b1657e | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
------------------------------------------------------------------------
-- Lists, based on the Kleene star and plus.
--
-- These lists are exatcly equivalent to normal lists, except the "cons"
-- case is split into its own data type. This lets us write all the same
-- functions as b... | 26.248718 | 88 | 0.429032 |
59dc0c5ee55aee7b51f8b850449631f02a5d5390 | 20,312 | agda | Agda | Cubical/Algebra/GradedRing/DirectSumFun.agda | thomas-lamiaux/cubical | 58c0b83bb0fed0dc683f3d29b1709effe51c1689 | [
"MIT"
] | null | null | null | Cubical/Algebra/GradedRing/DirectSumFun.agda | thomas-lamiaux/cubical | 58c0b83bb0fed0dc683f3d29b1709effe51c1689 | [
"MIT"
] | null | null | null | Cubical/Algebra/GradedRing/DirectSumFun.agda | thomas-lamiaux/cubical | 58c0b83bb0fed0dc683f3d29b1709effe51c1689 | [
"MIT"
] | null | null | null | {-# OPTIONS --safe --experimental-lossy-unification #-}
module Cubical.Algebra.GradedRing.DirectSumFun where
{-
This file give a graded ring construction in the case of the fun direct sum.
Because of the current proofs this is done only in the case where
- Idx is ℕ and for a monoid on it
- For the usual ∸ ... | 47.237209 | 122 | 0.425758 |
41419a3cd21500009c60c3e1a383367c46eb43d3 | 8,158 | agda | Agda | Cubical/Algebra/Monoid/Base.agda | L-TChen/cubical | 60226aacd7b386aef95d43a0c29c4eec996348a8 | [
"MIT"
] | null | null | null | Cubical/Algebra/Monoid/Base.agda | L-TChen/cubical | 60226aacd7b386aef95d43a0c29c4eec996348a8 | [
"MIT"
] | 1 | 2022-01-27T02:07:48.000Z | 2022-01-27T02:07:48.000Z | Cubical/Algebra/Monoid/Base.agda | L-TChen/cubical | 60226aacd7b386aef95d43a0c29c4eec996348a8 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Algebra.Monoid.Base where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.Equiv.HalfAdjoint
open import Cubical.Foundations.Function
open import Cubical.Foundations.HLevels
open import Cubica... | 34.567797 | 103 | 0.620863 |
d023c80feddbba23408f4094d9f4d13944c7b5f4 | 3,619 | agda | Agda | Data/List/Relation/Quantification/Proofs.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | Data/List/Relation/Quantification/Proofs.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | Data/List/Relation/Quantification/Proofs.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | module Data.List.Relation.Quantification.Proofs where
import Lvl
open import Data.List
open import Data.List.Functions
open import Data.List.Equiv.Id
open import Data.List.Relation.Permutation
open import Data.List.Relation.Quantification
open import Functional
open import Logic.Propositional
open import Logic
op... | 48.253333 | 143 | 0.640785 |
29986c79bed1789767fa9c46c52afb13462e99cf | 179 | agda | Agda | test/Fail/Issue2386BuiltinReflExtraArg.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/Issue2386BuiltinReflExtraArg.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/Issue2386BuiltinReflExtraArg.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2017-01-12, issue #2386
postulate
B : Set
data _≡_ {A : Set} (x : A) : A → Set where
refl : (b : B) → x ≡ x
{-# BUILTIN EQUALITY _≡_ #-}
-- Wrong type of REFL
| 14.916667 | 42 | 0.547486 |
2f91bfc1ebee8aaec7d5d1329fc8110225006276 | 11,098 | agda | Agda | models/IDesc.agda | dataronio/epigram2 | 17b7858f51a35b3becb8433028c3f1ba25fbba9a | [
"MIT"
] | 48 | 2016-01-09T17:36:19.000Z | 2022-02-11T01:55:28.000Z | models/IDesc.agda | seanwallawalla-forks/Epigram | a2064e63786cc8004cfc9ac7a0c89c2936f0b797 | [
"MIT"
] | null | null | null | models/IDesc.agda | seanwallawalla-forks/Epigram | a2064e63786cc8004cfc9ac7a0c89c2936f0b797 | [
"MIT"
] | 12 | 2016-08-14T21:36:35.000Z | 2022-02-11T01:57:40.000Z | {-# OPTIONS --universe-polymorphism #-}
module IDesc where
--********************************************
-- Prelude
--********************************************
-- Some preliminary stuffs, to avoid relying on the stdlib
--****************
-- Universe polymorphism
--****************
data Level : Set where
... | 36.748344 | 123 | 0.376825 |
c5753eb40854e225914c24ff580db94853e00253 | 4,476 | agda | Agda | agda-stdlib/src/Data/Container/Combinator/Properties.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 5 | 2020-10-07T12:07:53.000Z | 2020-10-10T21:41:32.000Z | agda-stdlib/src/Data/Container/Combinator/Properties.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | null | null | null | agda-stdlib/src/Data/Container/Combinator/Properties.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 1 | 2021-11-04T06:54:45.000Z | 2021-11-04T06:54:45.000Z | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Correctness proofs for container combinators
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Data.Container.Combinator.Properties where
open i... | 36.688525 | 87 | 0.510724 |
4185131bd28719fa68bd6a2f175542705b7aa9b6 | 1,072 | agda | Agda | Cubical/Structures/Group/Morphism.agda | RobertHarper/cubical | d13941587a58895b65f714f1ccc9c1f5986b109c | [
"MIT"
] | null | null | null | Cubical/Structures/Group/Morphism.agda | RobertHarper/cubical | d13941587a58895b65f714f1ccc9c1f5986b109c | [
"MIT"
] | null | null | null | Cubical/Structures/Group/Morphism.agda | RobertHarper/cubical | d13941587a58895b65f714f1ccc9c1f5986b109c | [
"MIT"
] | 1 | 2021-11-22T02:02:01.000Z | 2021-11-22T02:02:01.000Z | {-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Structures.Group.Morphism where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Equiv
open import Cubical.Structures.Group.Base
private
variable
ℓ ℓ' : Level
-- The following definition of GroupHom and GroupEquiv are lev... | 28.210526 | 84 | 0.641791 |
d0918b929c485657077be8602d90e41040604ae7 | 2,266 | agda | Agda | src/sbconst2.agda | shinji-kono/automaton-in-agda | eba0538f088f3d0c0fedb19c47c081954fbc69cb | [
"MIT"
] | null | null | null | src/sbconst2.agda | shinji-kono/automaton-in-agda | eba0538f088f3d0c0fedb19c47c081954fbc69cb | [
"MIT"
] | null | null | null | src/sbconst2.agda | shinji-kono/automaton-in-agda | eba0538f088f3d0c0fedb19c47c081954fbc69cb | [
"MIT"
] | null | null | null | module sbconst2 where
open import Level renaming ( suc to succ ; zero to Zero )
open import Data.Nat
open import Data.Fin
open import Data.List
open import automaton
open import nfa
open import logic
open NAutomaton
open Automaton
open import Relation.Binary.PropositionalEquality hiding ( [_] )
open Bool
δconv : {... | 40.464286 | 127 | 0.599735 |
225634cdec11e75b259a960e5712d51288b6aafb | 483 | agda | Agda | Relator/Congruence.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | Relator/Congruence.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | Relator/Congruence.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | open import Type
module Relator.Congruence {ℓ₁}{ℓ₂} {X : Type{ℓ₁}}{Y : Type{ℓ₂}} where
import Lvl
open import Functional
open import Logic
open import Logic.Propositional
open import Relator.Equals
-- The congruence relation with respect to a relation
infixl 15 _≅_of_
data _≅_of_ (x₁ : X) (x₂ : X) (f : X → Y) :... | 26.833333 | 69 | 0.612836 |
df4fdcb8ee07b0f1810800c434eee013729e6736 | 6,445 | agda | Agda | Cubical/Algebra/CommRing/FGIdeal.agda | maxdore/cubical | ef62b84397396d48135d73ba7400b71c721ddc94 | [
"MIT"
] | null | null | null | Cubical/Algebra/CommRing/FGIdeal.agda | maxdore/cubical | ef62b84397396d48135d73ba7400b71c721ddc94 | [
"MIT"
] | null | null | null | Cubical/Algebra/CommRing/FGIdeal.agda | maxdore/cubical | ef62b84397396d48135d73ba7400b71c721ddc94 | [
"MIT"
] | 1 | 2021-03-12T20:08:45.000Z | 2021-03-12T20:08:45.000Z | {-
Define finitely generated ideals of commutative rings and
show that they are an ideal.
Parts of this should be reusable for explicit constructions
of free modules over a finite set.
-}
{-# OPTIONS --safe #-}
module Cubical.Algebra.CommRing.FGIdeal where
open import Cubical.Foundations.Prelude
open import Cu... | 42.401316 | 99 | 0.518542 |
291b8479737b90d87b15dca9ace739f00831198b | 1,942 | agda | Agda | benchmark/Syntacticosmos/Subst.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | benchmark/Syntacticosmos/Subst.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | benchmark/Syntacticosmos/Subst.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | module Subst (Gnd : Set)(U : Set)(El : U -> Set) where
open import Basics
open import Pr
open import Nom
import Kind
open Kind Gnd U El
import Cxt
open Cxt Kind
import Loc
open Loc Kind
import Term
open Term Gnd U El
import Shift
open Shift Gnd U El
import Inst
open Inst Gnd U El
data _-[_]_ : Cxt -> Kind -> Cxt -> S... | 31.322581 | 73 | 0.443357 |
22585bb964f0f34dbe02e1ad7ebb0d7049e247f8 | 1,026 | agda | Agda | BasicIS4/Metatheory/DyadicGentzen-BasicKripkeBozicDosen.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | 29 | 2016-07-03T18:51:56.000Z | 2022-01-01T10:29:18.000Z | BasicIS4/Metatheory/DyadicGentzen-BasicKripkeBozicDosen.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | 1 | 2018-06-10T09:11:22.000Z | 2018-06-10T09:11:22.000Z | BasicIS4/Metatheory/DyadicGentzen-BasicKripkeBozicDosen.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | null | null | null | module BasicIS4.Metatheory.DyadicGentzen-BasicKripkeBozicDosen where
open import BasicIS4.Syntax.DyadicGentzen public
open import BasicIS4.Semantics.BasicKripkeBozicDosen public hiding (_⊨_) -- TODO
-- Soundness with respect to all models, or evaluation.
eval : ∀ {A Γ Δ} → Γ ⁏ Δ ⊢ A → Γ ⁏ Δ ⊨ A
eval (var i) ... | 41.04 | 80 | 0.517544 |
225ea7791fc29a7086a551ad9b4f7f33b88fb356 | 1,780 | agda | Agda | test/fail/MixingCoPatternsAndCoConstructors.agda | larrytheliquid/agda | 477c8c37f948e6038b773409358fd8f38395f827 | [
"MIT"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | test/fail/MixingCoPatternsAndCoConstructors.agda | masondesu/agda | 70c8a575c46f6a568c7518150a1a64fcd03aa437 | [
"MIT"
] | null | null | null | test/fail/MixingCoPatternsAndCoConstructors.agda | masondesu/agda | 70c8a575c46f6a568c7518150a1a64fcd03aa437 | [
"MIT"
] | 1 | 2022-03-12T11:35:18.000Z | 2022-03-12T11:35:18.000Z | {-# OPTIONS --copatterns #-}
module MixingCoPatternsAndCoConstructors where
data ℕ : Set where
zero : ℕ
suc : (n : ℕ) → ℕ
module MStream where
record Stream (A : Set) : Set where
coinductive
constructor _∷_
field
head : A
tail : Stream A
open Stream
weird : (n : ℕ) → Stream ℕ
he... | 20.941176 | 65 | 0.575843 |
0eec7714b88dadab59a8e2765e52433deac23f25 | 3,343 | agda | Agda | README/DependentlyTyped/Beta-Eta.agda | nad/dependently-typed-syntax | 498f8aefc570f7815fd1d6616508eeb92c52abce | [
"MIT"
] | 5 | 2020-04-16T12:14:44.000Z | 2020-07-08T22:51:36.000Z | README/DependentlyTyped/Beta-Eta.agda | nad/dependently-typed-syntax | 498f8aefc570f7815fd1d6616508eeb92c52abce | [
"MIT"
] | null | null | null | README/DependentlyTyped/Beta-Eta.agda | nad/dependently-typed-syntax | 498f8aefc570f7815fd1d6616508eeb92c52abce | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- Inductively defined beta-eta-equality
------------------------------------------------------------------------
import Level
open import Data.Universe
module README.DependentlyTyped.Beta-Eta
(Uni₀ : Universe Level.zero Level.zero)
where
o... | 32.456311 | 98 | 0.454981 |
5787ae7ce08ba043b2f52b427e10f11763e3581f | 443 | agda | Agda | Monoids.agda | jmchapman/Relative-Monads | 74707d3538bf494f4bd30263d2f5515a84733865 | [
"MIT"
] | 21 | 2015-07-30T01:25:12.000Z | 2021-02-13T18:02:18.000Z | Monoids.agda | jmchapman/Relative-Monads | 74707d3538bf494f4bd30263d2f5515a84733865 | [
"MIT"
] | 3 | 2019-01-13T13:12:33.000Z | 2019-05-29T09:50:26.000Z | Monoids.agda | jmchapman/Relative-Monads | 74707d3538bf494f4bd30263d2f5515a84733865 | [
"MIT"
] | 1 | 2019-11-04T21:33:13.000Z | 2019-11-04T21:33:13.000Z | module Monoids where
open import Library
record Monoid {a} : Set (lsuc a) where
field S : Set a
ε : S
_•_ : S → S → S
lid : ∀{m} → ε • m ≅ m
rid : ∀{m} → m • ε ≅ m
ass : ∀{m n o} → (m • n) • o ≅ m • (n • o)
infix 10 _•_
Nat+Mon : Monoid
Nat+Mon = record {
S = ℕ;... | 18.458333 | 50 | 0.426637 |
a1e92e49737b632cf442d73cf74332c358d18fc2 | 1,540 | agda | Agda | Cubical/Reflection/Base.agda | rnarkk/cubical | 8dea02ee105b45898dbf1f77271ead38994f4d61 | [
"MIT"
] | null | null | null | Cubical/Reflection/Base.agda | rnarkk/cubical | 8dea02ee105b45898dbf1f77271ead38994f4d61 | [
"MIT"
] | null | null | null | Cubical/Reflection/Base.agda | rnarkk/cubical | 8dea02ee105b45898dbf1f77271ead38994f4d61 | [
"MIT"
] | null | null | null | {-
Some basic utilities for reflection
-}
{-# OPTIONS --no-exact-split --safe #-}
module Cubical.Reflection.Base where
open import Cubical.Foundations.Prelude
open import Cubical.Data.List.Base
open import Cubical.Data.Nat.Base
import Agda.Builtin.Reflection as R
open import Agda.Builtin.String
_>>=_ = R.bindTC
_<... | 25.666667 | 84 | 0.609091 |
2f4201767181f5035e305ef783aefe38d8521640 | 2,598 | agda | Agda | src/Data/Finitude.agda | tizmd/agda-finitary | abacd166f63582b7395d9cc10b6323c0f69649e5 | [
"MIT"
] | null | null | null | src/Data/Finitude.agda | tizmd/agda-finitary | abacd166f63582b7395d9cc10b6323c0f69649e5 | [
"MIT"
] | null | null | null | src/Data/Finitude.agda | tizmd/agda-finitary | abacd166f63582b7395d9cc10b6323c0f69649e5 | [
"MIT"
] | null | null | null | module Data.Finitude where
open import Data.Fin as Fin
open import Data.Nat as ℕ
open import Level
open import Function as Fun hiding (id; _∘_)
open import Function.Equality as F using (_⟨$⟩_)
open import Function.Injection as Inj hiding (id; _∘_)
open import Function.Bijection as Bij hiding (id; _∘_)
open import Fun... | 39.969231 | 89 | 0.518091 |
1c9685761194addcba6e963d9983de929a574621 | 3,138 | agda | Agda | examples/outdated-and-incorrect/NestedDataTypes/DeBruijnExSubst.agda | asr/agda-kanso | aa10ae6a29dc79964fe9dec2de07b9df28b61ed5 | [
"MIT"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | examples/outdated-and-incorrect/NestedDataTypes/DeBruijnExSubst.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | examples/outdated-and-incorrect/NestedDataTypes/DeBruijnExSubst.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | module DeBruijnExSubst where
open import Prelude -- using (_∘_) -- composition, identity
open import Data.Maybe
open import Logic.Identity renaming (subst to subst≡)
import Logic.ChainReasoning
module Chain = Logic.ChainReasoning.Poly.Homogenous _≡_ (\x -> refl) (\x y z -> trans)
open Chain
open import DeBruijn... | 34.866667 | 86 | 0.537285 |
df7a8e34d7b55391fd732ebac8089a8f7a95f9aa | 716 | agda | Agda | test/Succeed/Issue421.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue421.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue421.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Positivity for functions in instantiated parameterised modules.
module Issue421 where
module Foo (_ : Set₁) where
Id : Set → Set
Id n = n
module FooApp = Foo Set
data ⊤ : Set where
tt : ⊤
⟦_⟧₁ : ⊤ → Set → Set
⟦ tt ⟧₁ x = FooApp.Id x
-- works: ⟦ tt ⟧ x = Foo.Id Set x
data μ₁ x : Set where
fix : ⟦ x ⟧₁ (μ... | 18.842105 | 66 | 0.574022 |
3d1941c2dd2b2547d45afd834abfef15076e08c5 | 6,269 | agda | Agda | agda/Avionics/SafetyEnvelopes.agda | RPI-WCL/safety-envelopes-sentinels | 896e67a2ad21041a1c9ef5f3ad6318c67d730341 | [
"BSD-3-Clause"
] | null | null | null | agda/Avionics/SafetyEnvelopes.agda | RPI-WCL/safety-envelopes-sentinels | 896e67a2ad21041a1c9ef5f3ad6318c67d730341 | [
"BSD-3-Clause"
] | null | null | null | agda/Avionics/SafetyEnvelopes.agda | RPI-WCL/safety-envelopes-sentinels | 896e67a2ad21041a1c9ef5f3ad6318c67d730341 | [
"BSD-3-Clause"
] | null | null | null | module Avionics.SafetyEnvelopes where
open import Data.Bool using (Bool; true; false; _∧_; _∨_)
open import Data.List using (List; []; _∷_; any; map; foldl; length)
open import Data.List.Relation.Unary.Any as Any using (Any)
open import Data.List.Relation.Unary.All as All using (All)
open import Data.Maybe using (Mayb... | 37.993939 | 117 | 0.55607 |
3d042242579ded224959de5edee318512b4d9230 | 184 | agda | Agda | test/Fail/Issue3945.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 2 | 2019-10-29T09:40:30.000Z | 2020-09-20T00:28:57.000Z | test/Fail/Issue3945.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 3 | 2018-11-14T15:31:44.000Z | 2019-04-01T19:39:26.000Z | test/Fail/Issue3945.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1 | 2015-09-15T14:36:15.000Z | 2015-09-15T14:36:15.000Z | module _ where
data Flat (A : Set) : Set where
flat : @♭ A → Flat A
-- the lambda cohesion annotation must match the domain.
into : {A : Set} → A → Flat A
into = λ (@♭ a) → flat a
| 20.444444 | 56 | 0.608696 |
29ca3d221a2f040a15a7d3268f3bc807a430876d | 6,574 | agda | Agda | Cubical/Experiments/CohomologyGroups.agda | maxdore/cubical | ef62b84397396d48135d73ba7400b71c721ddc94 | [
"MIT"
] | null | null | null | Cubical/Experiments/CohomologyGroups.agda | maxdore/cubical | ef62b84397396d48135d73ba7400b71c721ddc94 | [
"MIT"
] | null | null | null | Cubical/Experiments/CohomologyGroups.agda | maxdore/cubical | ef62b84397396d48135d73ba7400b71c721ddc94 | [
"MIT"
] | 1 | 2021-03-12T20:08:45.000Z | 2021-03-12T20:08:45.000Z | {-# OPTIONS --safe #-}
module Cubical.Experiments.CohomologyGroups where
open import Cubical.Experiments.ZCohomologyOld.Base
open import Cubical.Experiments.ZCohomologyOld.Properties
open import Cubical.Experiments.ZCohomologyOld.MayerVietorisUnreduced
open import Cubical.Experiments.ZCohomologyOld.Groups.Unit
open im... | 46.624113 | 142 | 0.458169 |
4a9ed4420ae32b8fb1aabdba410c31bc3acafe0b | 11,424 | agda | Agda | src/Partiality-monad/Inductive/Monad/Adjunction.agda | nad/partiality-monad | f69749280969f9093e5e13884c6feb0ad2506eae | [
"MIT"
] | 2 | 2020-05-21T22:59:18.000Z | 2020-07-03T08:56:08.000Z | src/Partiality-monad/Inductive/Monad/Adjunction.agda | nad/partiality-monad | f69749280969f9093e5e13884c6feb0ad2506eae | [
"MIT"
] | null | null | null | src/Partiality-monad/Inductive/Monad/Adjunction.agda | nad/partiality-monad | f69749280969f9093e5e13884c6feb0ad2506eae | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- The partiality monad's monad instance, defined via an adjunction
------------------------------------------------------------------------
{-# OPTIONS --cubical --safe #-}
module Partiality-monad.Inductive.Monad.Adjunction where
open import E... | 34.203593 | 131 | 0.503589 |
18c956c57665543f4435e57a80e0767b654f30d8 | 152 | agda | Agda | Cubical/HITs/Colimit.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 301 | 2018-10-17T18:00:24.000Z | 2022-03-24T02:10:47.000Z | Cubical/HITs/Colimit.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 584 | 2018-10-15T09:49:02.000Z | 2022-03-30T12:09:17.000Z | Cubical/HITs/Colimit.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 134 | 2018-11-16T06:11:03.000Z | 2022-03-23T16:22:13.000Z | {-# OPTIONS --safe #-}
module Cubical.HITs.Colimit where
open import Cubical.HITs.Colimit.Base public
open import Cubical.HITs.Colimit.Examples public
| 25.333333 | 48 | 0.789474 |
fbf56a8fd992158d4ef34f5fafdc7792990d31e2 | 124 | agda | Agda | archive/agda-2/Oscar/Builtin/Nat.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null | archive/agda-2/Oscar/Builtin/Nat.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | 1 | 2019-04-29T00:35:04.000Z | 2019-05-11T23:33:04.000Z | archive/agda-2/Oscar/Builtin/Nat.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null |
module Oscar.Builtin.Nat where
open import Agda.Builtin.Nat public
using ()
renaming (Nat to ℕ; zero to ∅; suc to ↑_)
| 17.714286 | 43 | 0.701613 |
cba82cef121f53a28bb3669e8fbb2abc431303ad | 8,735 | agda | Agda | examples/tactics/ac/AC.agda | asr/agda-kanso | aa10ae6a29dc79964fe9dec2de07b9df28b61ed5 | [
"MIT"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | examples/tactics/ac/AC.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | examples/tactics/ac/AC.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | 1 | 2022-03-12T11:35:18.000Z | 2022-03-12T11:35:18.000Z | {-# 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... | 33.339695 | 167 | 0.448197 |
41e0fcb26896c4ad368e2ae7b6dd18462eee8185 | 1,837 | agda | Agda | agda-stdlib-0.9/src/Data/Char.agda | qwe2/try-agda | 9d4c43b1609d3f085636376fdca73093481ab882 | [
"Apache-2.0"
] | 1 | 2016-10-20T15:52:05.000Z | 2016-10-20T15:52:05.000Z | agda-stdlib-0.9/src/Data/Char.agda | qwe2/try-agda | 9d4c43b1609d3f085636376fdca73093481ab882 | [
"Apache-2.0"
] | null | null | null | agda-stdlib-0.9/src/Data/Char.agda | qwe2/try-agda | 9d4c43b1609d3f085636376fdca73093481ab882 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Characters
------------------------------------------------------------------------
module Data.Char where
open import Data.Nat using (ℕ)
import Data.Nat.Properties as NatProp
open import Data.Bool using (Bool;... | 25.873239 | 72 | 0.673381 |
57d959e14d340c6f13d386a9fa0d342be559e4a6 | 5,917 | agda | Agda | src/jarsec.agda | jaywunder/jarsec-verified | 40cca331810f1d3f7dc099614ddca4fa96bd695c | [
"MIT"
] | null | null | null | src/jarsec.agda | jaywunder/jarsec-verified | 40cca331810f1d3f7dc099614ddca4fa96bd695c | [
"MIT"
] | null | null | null | src/jarsec.agda | jaywunder/jarsec-verified | 40cca331810f1d3f7dc099614ddca4fa96bd695c | [
"MIT"
] | null | null | null | module jarsec where
open import Algebra
open import Data.Bool
open import Data.Char
-- open import Data.Empty
-- open import Data.Fin
open import Data.List
open import Data.Maybe hiding (map)
open import Data.Nat
open import Data.Nat.Base
open import Data.Nat.Show
-- open import Data.Integer
open import Data.Product h... | 24.052846 | 80 | 0.584925 |
41c73842cfb1dff804f38c96f68549adc96cc7f6 | 302 | agda | Agda | test/interaction/Issue2543.agda | k-bx/agda | a2a54ce1b97fe103fbe1b961ffda95fe6313abf0 | [
"BSD-3-Clause"
] | 2 | 2019-10-29T09:40:30.000Z | 2020-09-20T00:28:57.000Z | test/interaction/Issue2543.agda | vikfret/agda | 49ad0b3f0d39c01bc35123478b857e702b29fb9d | [
"BSD-3-Clause"
] | null | null | null | test/interaction/Issue2543.agda | vikfret/agda | 49ad0b3f0d39c01bc35123478b857e702b29fb9d | [
"BSD-3-Clause"
] | 1 | 2019-03-05T20:02:38.000Z | 2019-03-05T20:02:38.000Z | -- Andreas, 2017-04-11, Issue 2543
-- Printing of second non-trivial with-pattern
-- {-# OPTIONS -v interaction.case:100 #-}
data D : Set where
c : D → D
f : D → D
f y with c y
... | c z with c y
... | q = {!q!} -- C-c C-c q
-- Was:
-- f y | c z | (c q) = ?
-- Expected:
-- f y | c z | c q = ?
| 15.894737 | 46 | 0.503311 |
22670a71a018246e8bf2cc3dfcffd8de7750dd86 | 2,168 | agda | Agda | Cubical/Experiments/Rng.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | Cubical/Experiments/Rng.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | Cubical/Experiments/Rng.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | 1 | 2021-11-22T02:02:01.000Z | 2021-11-22T02:02:01.000Z | -- This file needs to be rewritten so that Rng's are defined as a
-- record (as is the case for other algebraic structures like
-- rings). As this file isn't used for anything at the moment this
-- rewrite has been postponed.
{-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Experiments.Rng where
open... | 35.540984 | 99 | 0.683118 |
4186dd6c9b453ffc3754eee42442f86c426f9f4c | 123 | agda | Agda | test/Fail/Issue2893.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/Issue2893.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/Issue2893.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | module _ where
module M where
F : Set → Set
F A = A
open M
infix 0 F
syntax F A = [ A ]
G : Set → Set
G A = [ A ]
| 8.2 | 18 | 0.528455 |
df1a7769bb98dcf5863a45b0502a9643b3973e50 | 9,473 | agda | Agda | homotopy/JoinAssoc3x3.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | 1 | 2021-06-30T00:17:55.000Z | 2021-06-30T00:17:55.000Z | homotopy/JoinAssoc3x3.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | null | null | null | homotopy/JoinAssoc3x3.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K #-}
open import homotopy.3x3.Common
open import homotopy.3x3.PushoutPushout
open import homotopy.3x3.Transpose
module homotopy.JoinAssoc3x3 {i} (A B C : Type i) where
open M using (Pushout^2)
join-assoc-span^2 : Span^2 {i}
join-assoc-span^2 =
span^2 A (A × C) (A × C) (A × B) ((A × B) × C) ... | 43.255708 | 285 | 0.484746 |
1897007afa4a5a47d39c68060cca5fc1a12249e6 | 886 | agda | Agda | agda-stdlib/src/Reflection/Argument/Relevance.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 5 | 2020-10-07T12:07:53.000Z | 2020-10-10T21:41:32.000Z | agda-stdlib/src/Reflection/Argument/Relevance.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | null | null | null | agda-stdlib/src/Reflection/Argument/Relevance.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 1 | 2021-11-04T06:54:45.000Z | 2021-11-04T06:54:45.000Z | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Argument relevance used in the reflection machinery
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Reflection.Argument.Relevance where
open i... | 30.551724 | 72 | 0.515801 |
58169acfe7220b25ef99199004a73647bc10d75b | 4,521 | agda | Agda | Source/ALL/Languages/ILL/Syntax.agda | heades/Agda-LLS | c83f5d8201362b26a749138f6dbff2dd509f85b1 | [
"BSD-3-Clause"
] | 3 | 2017-04-09T20:53:53.000Z | 2019-08-02T23:41:23.000Z | Source/ALL/Languages/ILL/Syntax.agda | heades/Agda-LLS | c83f5d8201362b26a749138f6dbff2dd509f85b1 | [
"BSD-3-Clause"
] | 2 | 2017-03-27T14:52:46.000Z | 2017-04-05T17:30:16.000Z | Source/ALL/Languages/ILL/Syntax.agda | heades/Agda-LLS | c83f5d8201362b26a749138f6dbff2dd509f85b1 | [
"BSD-3-Clause"
] | null | null | null | module Languages.ILL.Syntax where
open import level
open import bool
open import nat
open import unit
open import empty
open import eq
open import sum
open import product
open import Utils.HaskellTypes
open import Utils.HaskellFunctions
open import Languages.ILL.TypeSyntax
True : Set
True = ⊤{lzero}
False : Set
Fal... | 39.313043 | 99 | 0.610042 |
50e6e5f5569efd8e21b7d164566bdfbd39c7eb29 | 904 | agda | Agda | test/MonoidTactic.agda | jespercockx/agda-prelude | 1984cf0341835b2f7bfe678098bd57cfe16ea11f | [
"MIT"
] | null | null | null | test/MonoidTactic.agda | jespercockx/agda-prelude | 1984cf0341835b2f7bfe678098bd57cfe16ea11f | [
"MIT"
] | null | null | null | test/MonoidTactic.agda | jespercockx/agda-prelude | 1984cf0341835b2f7bfe678098bd57cfe16ea11f | [
"MIT"
] | null | null | null |
module MonoidTactic where
open import Prelude
open import Container.Traversable
open import Structure.Monoid.Laws
open import Tactic.Monoid
open import Tactic.Reflection
MonoidAnd : Monoid Bool
mempty {{MonoidAnd}} = true
_<>_ {{MonoidAnd}} = _&&_
MonoidLawsAnd : MonoidLaws Bool {{MonoidAnd}}
idLeft {{MonoidLaws... | 30.133333 | 95 | 0.615044 |
294a05aab1137ac29f1af9a7813611fba4d9b048 | 3,180 | agda | Agda | src/Categories/Morphism/IsoEquiv.agda | jaykru/agda-categories | a4053cf700bcefdf73b857c3352f1eae29382a60 | [
"MIT"
] | 279 | 2019-06-01T14:36:40.000Z | 2022-03-22T00:40:14.000Z | src/Categories/Morphism/IsoEquiv.agda | seanpm2001/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | 236 | 2019-06-01T14:53:54.000Z | 2022-03-28T14:31:43.000Z | src/Categories/Morphism/IsoEquiv.agda | seanpm2001/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | 64 | 2019-06-02T16:58:15.000Z | 2022-03-14T02:00:59.000Z | {-# OPTIONS --without-K --safe #-}
open import Categories.Category
module Categories.Morphism.IsoEquiv {o ℓ e} (𝒞 : Category o ℓ e) where
open import Level
open import Function using (flip; _on_)
open import Relation.Binary hiding (_⇒_)
import Relation.Binary.Construct.On as On
open import Categories.Morphism 𝒞
... | 27.179487 | 75 | 0.558176 |
a1a8c460ef29eadf078922d41f233243223a0a3e | 3,044 | agda | Agda | Cubical/Experiments/FunExtFromUA.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | Cubical/Experiments/FunExtFromUA.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | Cubical/Experiments/FunExtFromUA.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | {- Voevodsky's proof that univalence implies funext -}
{-# OPTIONS --cubical --safe #-}
module Cubical.Experiments.FunExtFromUA where
open import Cubical.Foundations.Everything
variable
ℓ ℓ' : Level
_∼_ : {X : Type ℓ} {A : X → Type ℓ'} → (f g : (x : X) → A x) → Type (ℓ-max ℓ ℓ')
f ∼ g = ∀ x → f x ≡ g x
funext : ∀... | 24.95082 | 80 | 0.427398 |
4db1b677cbd367d54438f223a5c32d8e9dd875b2 | 533 | agda | Agda | Light/Library/Data/Either.agda | zamfofex/lightlib | 44b1c724f2de95d3a9effe87ca36ef9eca8b4756 | [
"0BSD"
] | 1 | 2019-12-20T21:33:05.000Z | 2019-12-20T21:33:05.000Z | Light/Library/Data/Either.agda | zamfofex/lightlib | 44b1c724f2de95d3a9effe87ca36ef9eca8b4756 | [
"0BSD"
] | null | null | null | Light/Library/Data/Either.agda | zamfofex/lightlib | 44b1c724f2de95d3a9effe87ca36ef9eca8b4756 | [
"0BSD"
] | null | null | null | {-# OPTIONS --omega-in-omega --no-termination-check --overlapping-instances #-}
module Light.Library.Data.Either where
open import Light.Level using (Level ; Setω ; _⊔_)
open import Light.Variable.Sets
open import Light.Variable.Levels
record Dependencies : Setω where
record Library (dependencies : Dependencies) : ... | 29.611111 | 79 | 0.649156 |
57df3545a769712919a7d92f9ea0a28a84cef572 | 881 | agda | Agda | notes/FOT/Agsy/AddTotality.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 11 | 2015-09-03T20:53:42.000Z | 2021-09-12T16:09:54.000Z | notes/FOT/Agsy/AddTotality.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 2 | 2016-10-12T17:28:16.000Z | 2017-01-01T14:34:26.000Z | notes/FOT/Agsy/AddTotality.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 3 | 2016-09-19T14:18:30.000Z | 2018-03-14T08:50:00.000Z | {-# OPTIONS --allow-unsolved-metas #-}
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorphism #-}
{-# OPTIONS --without-K #-}
module FOT.Agsy.AddTotality where
open import Relation.Binary.PropositionalEquality
infixl 9 _+_
----... | 24.472222 | 78 | 0.441544 |
58be036d3f676fb235e6ba70882e9df8ed78c430 | 6,583 | agda | Agda | benchmark/monad/Monad.agda | alex-mckenna/agda | 78b62cd24bbd570271a7153e44ad280e52ef3e29 | [
"BSD-3-Clause"
] | 1 | 2021-07-07T10:49:57.000Z | 2021-07-07T10:49:57.000Z | benchmark/monad/Monad.agda | andersk/agda | 56928ff709dcb931cb9a48c4790e5ed3739e3032 | [
"BSD-3-Clause"
] | null | null | null | benchmark/monad/Monad.agda | andersk/agda | 56928ff709dcb931cb9a48c4790e5ed3739e3032 | [
"BSD-3-Clause"
] | 1 | 2019-03-05T20:02:38.000Z | 2019-03-05T20:02:38.000Z | ------------------------------------------------------------------------
-- Parser monad
------------------------------------------------------------------------
open import Relation.Binary
open import Relation.Binary.OrderMorphism
open import Relation.Binary.PropositionalEquality
import Relation.Binary.Properties.Str... | 29 | 72 | 0.57451 |
4a8670bccf7ecf66729d60b081a4f3ae3bd01630 | 445 | agda | Agda | Cubical/Algebra/CommRingSolver/IntAsRawRing.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | 1 | 2021-10-31T17:32:49.000Z | 2021-10-31T17:32:49.000Z | Cubical/Algebra/CommRingSolver/IntAsRawRing.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | Cubical/Algebra/CommRingSolver/IntAsRawRing.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | {-# OPTIONS --safe #-}
module Cubical.Algebra.CommRingSolver.IntAsRawRing where
open import Cubical.Data.Nat hiding (_+_; _·_)
open import Cubical.Data.Int
open import Cubical.Data.Int.Base
open import Cubical.Foundations.Prelude
open import Cubical.Algebra.CommRingSolver.RawRing
ℤAsRawRing : RawRing ℓ-zero
ℤAsRawRi... | 27.8125 | 70 | 0.719101 |
2263738d62f6598ee28eb16851293a3e88944048 | 1,413 | agda | Agda | Numbers/Naturals/Definition.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 4 | 2019-08-08T12:44:19.000Z | 2022-01-28T06:04:15.000Z | Numbers/Naturals/Definition.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 14 | 2019-01-06T21:11:59.000Z | 2020-04-11T11:03:39.000Z | Numbers/Naturals/Definition.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 1 | 2021-11-29T13:23:07.000Z | 2021-11-29T13:23:07.000Z | {-# OPTIONS --warning=error --safe --without-K #-}
open import Boolean.Definition
open import LogicalFormulae
open import Decidable.Lemmas
module Numbers.Naturals.Definition where
data ℕ : Set where
zero : ℕ
succ : ℕ → ℕ
infix 100 succ
{-# BUILTIN NATURAL ℕ #-}
succInjective : {a b : ℕ} → (succ a ≡ succ b) → ... | 27.173077 | 75 | 0.642604 |
103e0eb49ecfce74bcf33771b142bdb923df86ea | 5,350 | agda | Agda | OTTTests/TestsInstances.agda | hbasold/Sandbox | 8fc7a6cd878f37f9595124ee8dea62258da28aa4 | [
"MIT"
] | null | null | null | OTTTests/TestsInstances.agda | hbasold/Sandbox | 8fc7a6cd878f37f9595124ee8dea62258da28aa4 | [
"MIT"
] | null | null | null | OTTTests/TestsInstances.agda | hbasold/Sandbox | 8fc7a6cd878f37f9595124ee8dea62258da28aa4 | [
"MIT"
] | null | null | null | {-# OPTIONS --copatterns #-}
module TestsInstances where
open import Function
open import Data.Product
open import Relation.Nullary using (Dec; yes; no; ¬_)
open import Relation.Binary.PropositionalEquality as P
open ≡-Reasoning
open import Data.Empty renaming (⊥ to Empty)
open import Data.Unit renaming (⊤ to One) ... | 27.57732 | 77 | 0.52 |
3daa6eaaa841dee44715702df3e32949bee02987 | 1,694 | agda | Agda | vendor/stdlib/src/Induction.agda | isabella232/Lemmachine | 8ef786b40e4a9ab274c6103dc697dcb658cf3db3 | [
"MIT"
] | 56 | 2015-01-20T02:11:42.000Z | 2021-12-21T17:02:19.000Z | vendor/stdlib/src/Induction.agda | larrytheliquid/Lemmachine | 8ef786b40e4a9ab274c6103dc697dcb658cf3db3 | [
"MIT"
] | 1 | 2022-03-12T12:17:51.000Z | 2022-03-12T12:17:51.000Z | vendor/stdlib/src/Induction.agda | isabella232/Lemmachine | 8ef786b40e4a9ab274c6103dc697dcb658cf3db3 | [
"MIT"
] | 3 | 2015-07-21T16:37:58.000Z | 2022-03-12T11:54:10.000Z | ------------------------------------------------------------------------
-- An abstraction of various forms of recursion/induction
------------------------------------------------------------------------
-- Note: The types in this module can perhaps be easier to understand
-- if they are normalised. Note also that Agd... | 33.88 | 72 | 0.618064 |
41fcbfd5978bffebb18c1a1cb050c2ed9c91718b | 5,297 | agda | Agda | nondet/sort.agda | mihanus/curry-agda | b7cfdda11cdadeba882b6b72d75448acd8b0a294 | [
"BSD-3-Clause"
] | null | null | null | nondet/sort.agda | mihanus/curry-agda | b7cfdda11cdadeba882b6b72d75448acd8b0a294 | [
"BSD-3-Clause"
] | null | null | null | nondet/sort.agda | mihanus/curry-agda | b7cfdda11cdadeba882b6b72d75448acd8b0a294 | [
"BSD-3-Clause"
] | null | null | null | module sort where
open import bool
open import eq
open import nat
open import list
open import nondet
open import nondet-thms
-- non-deterministic insert.
--This takes a nondeterministic list because I need to be able to call it with the result of perm
--
--implementation in curry:
-- ndinsert x [] = []
-- ndinsert x... | 46.06087 | 149 | 0.591278 |
2f2825cdbb0c9095075f55d0665b0659f458592e | 3,110 | agda | Agda | cohesion/david_jaz_261/LEM.agda | glangmead/formalization | 497e720a1ddaa2ec713c060f999f4b3ee2fe5e8a | [
"CC0-1.0"
] | 6 | 2021-10-06T17:39:22.000Z | 2022-02-13T05:51:12.000Z | cohesion/david_jaz_261/LEM.agda | glangmead/formalization | 497e720a1ddaa2ec713c060f999f4b3ee2fe5e8a | [
"CC0-1.0"
] | null | null | null | cohesion/david_jaz_261/LEM.agda | glangmead/formalization | 497e720a1ddaa2ec713c060f999f4b3ee2fe5e8a | [
"CC0-1.0"
] | null | null | null | {-# OPTIONS --without-K --rewriting #-}
module LEM where
open import Basics
open import Flat
open import Bool
open import lib.Basics
open import lib.types.Bool
open import Bool
open import lib.NType2
open import Axiom.LEM public
flat-set-has-dec-eq : {@♭ i : ULevel} (@♭ A : hSet i)
... | 34.555556 | 92 | 0.453698 |
5962098649a993bceddbda012590710692a8d46f | 1,800 | agda | Agda | core/lib/types/Bool.agda | AntoineAllioux/HoTT-Agda | 1037d82edcf29b620677a311dcfd4fc2ade2faa6 | [
"MIT"
] | 294 | 2015-01-09T16:23:23.000Z | 2022-03-20T13:54:45.000Z | core/lib/types/Bool.agda | AntoineAllioux/HoTT-Agda | 1037d82edcf29b620677a311dcfd4fc2ade2faa6 | [
"MIT"
] | 31 | 2015-03-05T20:09:00.000Z | 2021-10-03T19:15:25.000Z | core/lib/types/Bool.agda | AntoineAllioux/HoTT-Agda | 1037d82edcf29b620677a311dcfd4fc2ade2faa6 | [
"MIT"
] | 50 | 2015-01-10T01:48:08.000Z | 2022-02-14T03:03:25.000Z | {-# OPTIONS --without-K --rewriting #-}
open import lib.Basics
module lib.types.Bool where
{-
data Bool : Type₀ where
true : Bool
false : Bool
{-# BUILTIN BOOL Bool #-}
{-# BUILTIN FALSE false #-}
{-# BUILTIN TRUE true #-}
-}
Bool = ⊤ ⊔ ⊤
pattern true = inl unit
pattern false = inr unit
⊙Bool : Ptd₀
⊙Bool = ... | 21.95122 | 67 | 0.645 |
dfdfbcb5ea949f6dfde245931589544aad318e9e | 5,525 | agda | Agda | TotalParserCombinators/BreadthFirst.agda | yurrriq/parser-combinators | b396d35cc2cb7e8aea50b982429ee385f001aa88 | [
"MIT"
] | 7 | 2016-12-13T05:23:14.000Z | 2021-06-22T05:35:31.000Z | TotalParserCombinators/BreadthFirst.agda | yurrriq/parser-combinators | b396d35cc2cb7e8aea50b982429ee385f001aa88 | [
"MIT"
] | 1 | 2018-01-22T22:21:41.000Z | 2018-01-24T16:39:37.000Z | TotalParserCombinators/BreadthFirst.agda | yurrriq/parser-combinators | b396d35cc2cb7e8aea50b982429ee385f001aa88 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- A breadth-first backend which uses the derivative operator
------------------------------------------------------------------------
module TotalParserCombinators.BreadthFirst where
open import Data.List
open import Data.List.Any.Membership.Pr... | 37.331081 | 72 | 0.583529 |
1df7862cb8a4623b5d50d28e1565ce4e3125b74c | 75,146 | agda | Agda | src/Lens/Non-dependent/Traditional.agda | nad/dependent-lenses | f2da6f7e95b87ca525e8ea43929c6d6163a74811 | [
"MIT"
] | 3 | 2020-04-16T12:10:46.000Z | 2020-07-03T08:55:52.000Z | src/Lens/Non-dependent/Traditional.agda | nad/dependent-lenses | f2da6f7e95b87ca525e8ea43929c6d6163a74811 | [
"MIT"
] | null | null | null | src/Lens/Non-dependent/Traditional.agda | nad/dependent-lenses | f2da6f7e95b87ca525e8ea43929c6d6163a74811 | [
"MIT"
] | 1 | 2020-07-01T14:33:26.000Z | 2020-07-01T14:33:26.000Z | ------------------------------------------------------------------------
-- Traditional non-dependent lenses
------------------------------------------------------------------------
{-# OPTIONS --cubical #-}
import Equality.Path as P
module Lens.Non-dependent.Traditional
{e⁺} (eq : ∀ {a p} → P.Equality-with-paths ... | 45.132733 | 146 | 0.350079 |
0bde5aa2155ff924acd6b3f1e5d59974c6af5189 | 4,911 | agda | Agda | H-1.agda | andmkent/misc-HoTT | b05c58ffdaed99932ca2acc632deca8d14742b04 | [
"MIT"
] | 1 | 2016-01-26T18:17:16.000Z | 2016-01-26T18:17:16.000Z | H-1.agda | andmkent/misc-HoTT | b05c58ffdaed99932ca2acc632deca8d14742b04 | [
"MIT"
] | null | null | null | H-1.agda | andmkent/misc-HoTT | b05c58ffdaed99932ca2acc632deca8d14742b04 | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K #-}
module H where
open import Data.Product using (_×_; _,_)
import Relation.Binary.Core as C
import Relation.Binary.PropositionalEquality as P
open P.≡-Reasoning
------------------------------------------------------------------------------
-- Some abbreviations and lemmas about paths
infix... | 25.056122 | 82 | 0.396864 |
58691d885d629df38aa77259a1cefac7645c32fe | 861 | agda | Agda | Definition/Typed/Consequences/SucCong.agda | Vtec234/logrel-mltt | 4746894adb5b8edbddc8463904ee45c2e9b29b69 | [
"MIT"
] | null | null | null | Definition/Typed/Consequences/SucCong.agda | Vtec234/logrel-mltt | 4746894adb5b8edbddc8463904ee45c2e9b29b69 | [
"MIT"
] | null | null | null | Definition/Typed/Consequences/SucCong.agda | Vtec234/logrel-mltt | 4746894adb5b8edbddc8463904ee45c2e9b29b69 | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
module Definition.Typed.Consequences.SucCong where
open import Definition.Untyped
open import Definition.Typed
open import Definition.Typed.Weakening
open import Definition.Typed.Properties
open import Definition.Typed.Consequences.Syntactic
open import Definition.Typed.Consequences... | 31.888889 | 78 | 0.576074 |
3d0bd547dc1c967a8677d49ad7d35259918f8b01 | 86 | agda | Agda | nats.agda | andorp/plfa.github.io | 5468837f55cbea38d5c5a163e1ea5d48edb92bcc | [
"CC-BY-4.0"
] | null | null | null | nats.agda | andorp/plfa.github.io | 5468837f55cbea38d5c5a163e1ea5d48edb92bcc | [
"CC-BY-4.0"
] | null | null | null | nats.agda | andorp/plfa.github.io | 5468837f55cbea38d5c5a163e1ea5d48edb92bcc | [
"CC-BY-4.0"
] | null | null | null | open import Data.Nat
{- This is a test line ∀ , yeah it works ≡ -}
ten : ℕ
ten = 10
| 12.285714 | 45 | 0.604651 |
068b7a28e7b20c37d5f22751325147ee6dd59141 | 2,566 | agda | Agda | Cubical/Codata/M/AsLimit/itree.agda | ryanorendorff/cubical | c67854d2e11aafa5677e25a09087e176fafd3e43 | [
"MIT"
] | 1 | 2020-03-23T23:52:11.000Z | 2020-03-23T23:52:11.000Z | Cubical/Codata/M/AsLimit/itree.agda | ryanorendorff/cubical | c67854d2e11aafa5677e25a09087e176fafd3e43 | [
"MIT"
] | null | null | null | Cubical/Codata/M/AsLimit/itree.agda | ryanorendorff/cubical | c67854d2e11aafa5677e25a09087e176fafd3e43 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --guardedness --safe #-}
module Cubical.Codata.M.AsLimit.itree where
open import Cubical.Data.Unit
open import Cubical.Data.Prod
open import Cubical.Data.Nat as ℕ using (ℕ ; suc ; _+_ )
open import Cubical.Data.Sum
open import Cubical.Data.Empty
open import Cubical.Data.Bool
open import Cubical... | 33.763158 | 137 | 0.564302 |
fb8a343eb0371e1ec0191932f90a9a50a5f14be5 | 4,888 | agda | Agda | Cubical/Algebra/AbGroup/Instances/Hom.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 1 | 2022-03-05T00:29:41.000Z | 2022-03-05T00:29:41.000Z | Cubical/Algebra/AbGroup/Instances/Hom.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | null | null | null | Cubical/Algebra/AbGroup/Instances/Hom.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | null | null | null | -- Given two abelian groups A, B
-- the set of all group homomorphisms from A to B
-- is itself an abelian group.
-- In other words, Ab is cartesian closed.
-- This is needed to show Ab is an abelian category.
{-# OPTIONS --safe #-}
module Cubical.Algebra.AbGroup.Instances.Hom where
open import Cubical.Algebra.AbG... | 33.479452 | 90 | 0.511866 |
4104d1a20e5608266e4c10ffe20d67d93458333c | 6,380 | agda | Agda | src/Categories/Morphism/Lifts/Properties.agda | Trebor-Huang/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | 5 | 2019-05-21T17:07:19.000Z | 2019-05-22T03:54:24.000Z | src/Categories/Morphism/Lifts/Properties.agda | seanpm2001/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | null | null | null | src/Categories/Morphism/Lifts/Properties.agda | seanpm2001/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
open import Categories.Category
module Categories.Morphism.Lifts.Properties {o ℓ e} (𝒞 : Category o ℓ e) where
open import Level
open import Data.Product using (_,_; proj₁; proj₂)
open import Categories.Category.Construction.Arrow 𝒞
open import Categories.Diagram.Pullback 𝒞
op... | 33.229167 | 105 | 0.578683 |
399cfc98e1fb7d6606c97cce2dda615980eb271a | 10,151 | agda | Agda | Cubical/Foundations/Id.agda | Rotsor/cubical | d55cd4834ca1f171f58b4a0c46b804ea6d18191f | [
"MIT"
] | null | null | null | Cubical/Foundations/Id.agda | Rotsor/cubical | d55cd4834ca1f171f58b4a0c46b804ea6d18191f | [
"MIT"
] | null | null | null | Cubical/Foundations/Id.agda | Rotsor/cubical | d55cd4834ca1f171f58b4a0c46b804ea6d18191f | [
"MIT"
] | null | null | null | {-
This file contains:
- Id, refl and J (with definitional computation rule)
- Basic theory about Id, proved using J
- Lemmas for going back and forth between Path and Id
- Function extensionality for Id
- fiber, isContr, equiv all defined using Id
- The univalence axiom expressed using only Id ([EquivContr])
-... | 35.369338 | 136 | 0.544281 |
1ddb9166f697a3dc48df4ada1cc77761a36365d2 | 616 | agda | Agda | agda/Categories/Exponential.agda | oisdk/combinatorics-paper | 3c176d4690566d81611080e9378f5a178b39b851 | [
"MIT"
] | 4 | 2021-01-05T14:07:44.000Z | 2021-01-05T15:32:14.000Z | agda/Categories/Exponential.agda | oisdk/combinatorics-paper | 3c176d4690566d81611080e9378f5a178b39b851 | [
"MIT"
] | null | null | null | agda/Categories/Exponential.agda | oisdk/combinatorics-paper | 3c176d4690566d81611080e9378f5a178b39b851 | [
"MIT"
] | 1 | 2021-01-05T14:05:30.000Z | 2021-01-05T14:05:30.000Z | {-# OPTIONS --cubical --safe #-}
module Categories.Exponential where
open import Prelude hiding (_×_)
open import Categories
open import Categories.Product
module _ {ℓ₁ ℓ₂} (C : Category ℓ₁ ℓ₂) (hasProducts : HasProducts C) where
open Category C
open HasProducts hasProducts
module _ (Y Z : Ob) where
recor... | 26.782609 | 73 | 0.592532 |
223fbfdcba334d12f3a82c758436fd12c121b6f2 | 4,067 | agda | Agda | Agda/models.agda | hemangandhi/HoTT-Intro | 09c710bf9c31ba88be144cc950bd7bc19c22a934 | [
"CC-BY-4.0"
] | 333 | 2018-09-26T08:33:30.000Z | 2022-03-22T23:50:15.000Z | Agda/models.agda | hemangandhi/HoTT-Intro | 09c710bf9c31ba88be144cc950bd7bc19c22a934 | [
"CC-BY-4.0"
] | 8 | 2019-06-18T04:16:04.000Z | 2020-10-16T15:27:01.000Z | Agda/models.agda | hemangandhi/HoTT-Intro | 09c710bf9c31ba88be144cc950bd7bc19c22a934 | [
"CC-BY-4.0"
] | 30 | 2018-09-26T09:08:57.000Z | 2022-03-16T00:33:50.000Z | {-# OPTIONS --without-K #-}
{- Our goal in this file is to observe some structure possessed by the
universes of types, reflexive graphs, type families, and so on. Somewhat
more precisely, we develop an imperfect structure of internal model of type
theory, with enough ingredients to get some type theoretic dev... | 36.3125 | 78 | 0.583231 |
4168610b950481075e5bceb030f676d7824678a6 | 11,400 | agda | Agda | TypeTheory/Common/Context.agda | hbasold/Sandbox | 8fc7a6cd878f37f9595124ee8dea62258da28aa4 | [
"MIT"
] | null | null | null | TypeTheory/Common/Context.agda | hbasold/Sandbox | 8fc7a6cd878f37f9595124ee8dea62258da28aa4 | [
"MIT"
] | null | null | null | TypeTheory/Common/Context.agda | hbasold/Sandbox | 8fc7a6cd878f37f9595124ee8dea62258da28aa4 | [
"MIT"
] | null | null | null | module Common.Context where
import Level
open import Data.Nat as Nat
open import Data.List as List
import Level
open import Relation.Binary.PropositionalEquality as PE hiding ([_])
open import Relation.Binary -- using (Setoid; Rel; IsEquivalence)
open ≡-Reasoning
open import Function as Fun hiding (_∘′_)
open import ... | 31.754875 | 87 | 0.437368 |
cb29732e715d0246f8e59474d528f1e12c231f2d | 21,508 | agda | Agda | src/to-string.agda | xoltar/cedille | acf691e37210607d028f4b19f98ec26c4353bfb5 | [
"MIT"
] | null | null | null | src/to-string.agda | xoltar/cedille | acf691e37210607d028f4b19f98ec26c4353bfb5 | [
"MIT"
] | null | null | null | src/to-string.agda | xoltar/cedille | acf691e37210607d028f4b19f98ec26c4353bfb5 | [
"MIT"
] | null | null | null | import cedille-options
module to-string (options : cedille-options.options) where
open import lib
open import cedille-types
open import constants
open import syntax-util
open import ctxt
open import rename
open import general-util
data expr-side : Set where
left : expr-side
right : expr-side
neither : expr-sid... | 44.995816 | 210 | 0.652362 |
2911314cd50ac61892f1607c1c1214779d257db1 | 681 | agda | Agda | Orders/WellFounded/Induction.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 4 | 2019-08-08T12:44:19.000Z | 2022-01-28T06:04:15.000Z | Orders/WellFounded/Induction.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 14 | 2019-01-06T21:11:59.000Z | 2020-04-11T11:03:39.000Z | Orders/WellFounded/Induction.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 1 | 2021-11-29T13:23:07.000Z | 2021-11-29T13:23:07.000Z | {-# OPTIONS --safe --warning=error --without-K #-}
open import Functions.Definition
open import Orders.WellFounded.Definition
module Orders.WellFounded.Induction {a b : _} {A : Set a} {_<_ : Rel {a} {b} A} (wf : WellFounded _<_) where
private
foldAcc :
{c : _}
(P : A → Set c) →
(∀ x → (∀ y → y < x → P ... | 27.24 | 108 | 0.549192 |
587f30a00a5869f1b4b4b40860884b6ac1d42a2a | 749 | agda | Agda | test/epic/tests/Mutual.agda | asr/agda-kanso | aa10ae6a29dc79964fe9dec2de07b9df28b61ed5 | [
"MIT"
] | 1 | 2019-11-27T07:26:06.000Z | 2019-11-27T07:26:06.000Z | test/epic/tests/Mutual.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | test/epic/tests/Mutual.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | module tests.Mutual where
open import Prelude.IO
open import Prelude.String
open import Prelude.Unit
mutual
data G : Set where
GA : {g : G}(f : F g) -> G
GB : G
data F : G -> Set where
FA : (g : G) -> F g
FB : F GB
mutual
incG : G -> G
incG GB = GA FB
incG (GA f) = GA (incF f)
incF ... | 18.268293 | 50 | 0.511348 |
5816c41ad06765f1a267b366803a612b09c7eb14 | 1,875 | agda | Agda | 04-cubical-type-theory/material/ExerciseSession3.agda | bafain/EPIT-2020 | 34742c0409818f8fe581ffc92992d1b5f29f6b47 | [
"MIT"
] | 1 | 2021-04-03T16:28:06.000Z | 2021-04-03T16:28:06.000Z | 04-cubical-type-theory/material/ExerciseSession3.agda | bafain/EPIT-2020 | 34742c0409818f8fe581ffc92992d1b5f29f6b47 | [
"MIT"
] | null | null | null | 04-cubical-type-theory/material/ExerciseSession3.agda | bafain/EPIT-2020 | 34742c0409818f8fe581ffc92992d1b5f29f6b47 | [
"MIT"
] | 1 | 2021-08-02T16:16:34.000Z | 2021-08-02T16:16:34.000Z | -- Exercises for session 3
--
-- If unsure which exercises to do start with those marked with *
--
{-# OPTIONS --cubical --allow-unsolved-metas #-}
module ExerciseSession3 where
open import Part1
open import Part2
open import Part3
open import Part4
open import ExerciseSession1 hiding (B)
open import Cubical.Foundati... | 27.573529 | 66 | 0.691733 |
3d827cad97a62eca72cfda603f242aeab0a6e966 | 762 | agda | Agda | src/fot/DistributiveLaws/PropertiesI.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 11 | 2015-09-03T20:53:42.000Z | 2021-09-12T16:09:54.000Z | src/fot/DistributiveLaws/PropertiesI.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 2 | 2016-10-12T17:28:16.000Z | 2017-01-01T14:34:26.000Z | src/fot/DistributiveLaws/PropertiesI.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 3 | 2016-09-19T14:18:30.000Z | 2018-03-14T08:50:00.000Z | ------------------------------------------------------------------------------
-- Distributive laws properties
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorphism #-}
... | 31.75 | 78 | 0.419948 |
a1b365025798f3d2f43105d93c6f6bc0833d7613 | 270 | agda | Agda | test/succeed/EtaAndMetas.agda | larrytheliquid/agda | 477c8c37f948e6038b773409358fd8f38395f827 | [
"MIT"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | test/succeed/EtaAndMetas.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | test/succeed/EtaAndMetas.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | 1 | 2022-03-12T11:35:18.000Z | 2022-03-12T11:35:18.000Z |
module EtaAndMetas where
record Functor : Set₁ where
field
F : Set → Set
eta : Functor → Functor
eta S = record { F = F }
where open Functor S
postulate
Π : (To : Functor) → Set
mkΠ : (B : Functor) → Π (eta B)
To : Functor
π : Π (eta To)
π = mkΠ _
| 14.210526 | 33 | 0.596296 |
29543c1de1ec9a6511858b89a56a428b935b9949 | 170 | agda | Agda | Cubical/HITs/MappingCones.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 301 | 2018-10-17T18:00:24.000Z | 2022-03-24T02:10:47.000Z | Cubical/HITs/MappingCones.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 584 | 2018-10-15T09:49:02.000Z | 2022-03-30T12:09:17.000Z | Cubical/HITs/MappingCones.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 134 | 2018-11-16T06:11:03.000Z | 2022-03-23T16:22:13.000Z | {-# OPTIONS --safe #-}
module Cubical.HITs.MappingCones where
open import Cubical.HITs.MappingCones.Base public
open import Cubical.HITs.MappingCones.Properties public
| 24.285714 | 55 | 0.805882 |
22897c9716034e4237eb1a053287c4099bb3080c | 36,397 | agda | Agda | src/interactive-cmds.agda | bmyerz/cedille | a7fa7661c89c71c605b1f7d937d6fab188d96781 | [
"MIT"
] | null | null | null | src/interactive-cmds.agda | bmyerz/cedille | a7fa7661c89c71c605b1f7d937d6fab188d96781 | [
"MIT"
] | null | null | null | src/interactive-cmds.agda | bmyerz/cedille | a7fa7661c89c71c605b1f7d937d6fab188d96781 | [
"MIT"
] | null | null | null | import cedille-options
module interactive-cmds (options : cedille-options.options) where
open import functions
open import cedille-types
open import conversion
open import constants
open import ctxt
open import general-util
open import spans options {Id}
open import subst
open import syntax-util
open import type-util... | 50.064649 | 227 | 0.495068 |
31eced17eb01e560599933b828a6c1f5c8aa9a24 | 2,349 | agda | Agda | test/Compiler/simple/CompileNumbers.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Compiler/simple/CompileNumbers.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Compiler/simple/CompileNumbers.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | {-# OPTIONS -v treeless.opt:20 #-}
module _ where
open import Agda.Builtin.Nat using (_<_)
open import Common.Prelude
open import Common.Integer
-- Should compile to
-- λ a b → case a of
-- "neg" → 0 - b
-- _ → b
match-on-lit : String → Integer → Integer
match-on-lit "neg" x with x
...... | 27.635294 | 67 | 0.572584 |
d07b83666e9cec5f2a02717fa52cf5184fd318b7 | 6,608 | agda | Agda | Lambda/Substitution.agda | nad/codata | 1b90445566df0d3b4ba6e31bd0bac417b4c0eb0e | [
"MIT"
] | 1 | 2021-02-13T14:48:45.000Z | 2021-02-13T14:48:45.000Z | Lambda/Substitution.agda | nad/codata | 1b90445566df0d3b4ba6e31bd0bac417b4c0eb0e | [
"MIT"
] | null | null | null | Lambda/Substitution.agda | nad/codata | 1b90445566df0d3b4ba6e31bd0bac417b4c0eb0e | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- Substitutions
------------------------------------------------------------------------
module Lambda.Substitution where
open import Data.Fin using (Fin; zero; suc)
open import Data.Fin.Substitution
open import Data.Fin.Substitution.Lemmas
ope... | 34.962963 | 86 | 0.470339 |
0e4f27a30cdc743123c9c17d65b0b68bcca11c72 | 3,450 | agda | Agda | archive/agda-2/Oscar/Data/Fin.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null | archive/agda-2/Oscar/Data/Fin.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | 1 | 2019-04-29T00:35:04.000Z | 2019-05-11T23:33:04.000Z | archive/agda-2/Oscar/Data/Fin.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null |
module Oscar.Data.Fin where
open import Data.Fin public using (Fin; zero; suc)
-- open import Oscar.Data.Fin.Core public
-- --open import Data.Fin hiding (thin; thick; check) public
-- --open import Data.Fin.Properties hiding (thin-injective; thick-thin; thin-check-id) public
-- -- module _ where
-- -- open imp... | 36.702128 | 117 | 0.501159 |
3dc81348b7bf9daefbe1898adb01448bc7e17943 | 569 | agda | Agda | test/Common/Path.agda | cagix/agda | cc026a6a97a3e517bb94bafa9d49233b067c7559 | [
"BSD-2-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Common/Path.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Common/Path.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | {-# OPTIONS --erased-cubical #-}
module Common.Path where
open import Agda.Builtin.Cubical.Path public
open import Agda.Builtin.Cubical.HCompU
open import Agda.Primitive.Cubical renaming (primINeg to ~_; primIMax to _∨_; primIMin to _∧_;
primHComp to hcomp; primTransp to tr... | 43.769231 | 104 | 0.606327 |
0b204ba88b7085415bd6fe6e277d901d76be033b | 122 | agda | Agda | test/Fail/IUnivNotFibrant.agda | cagix/agda | cc026a6a97a3e517bb94bafa9d49233b067c7559 | [
"BSD-2-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/IUnivNotFibrant.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/IUnivNotFibrant.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | open import Agda.Primitive
open import Agda.Primitive.Cubical
record Wrap : Set (lsuc lzero) where
field
A : IUniv
| 17.428571 | 36 | 0.745902 |
5831f84d13d42c93dd26d269a1b30eb5f13e8d3b | 772 | agda | Agda | src/Categories/Category/Monoidal.agda | glittershark/agda-categories | 2128fab9e8d341364cbf784bb17c547bf73891de | [
"MIT"
] | null | null | null | src/Categories/Category/Monoidal.agda | glittershark/agda-categories | 2128fab9e8d341364cbf784bb17c547bf73891de | [
"MIT"
] | null | null | null | src/Categories/Category/Monoidal.agda | glittershark/agda-categories | 2128fab9e8d341364cbf784bb17c547bf73891de | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
-- Definition of Monoidal Category
-- Big design decision that differs from the previous version:
-- Do not go through "Functor.Power" to encode variables and work
-- at the level of NaturalIsomorphisms, instead work at the object/morphism
-- level, via the more direct _⊗₀_ _⊗₁_ _⊗-... | 40.631579 | 81 | 0.761658 |
229a1714a70bbdbb47fd9298f40b4edf08e394ec | 2,435 | agda | Agda | examples/simple-lib/Lib/Fin.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | examples/simple-lib/Lib/Fin.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | examples/simple-lib/Lib/Fin.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
module Lib.Fin where
open import Lib.Nat
open import Lib.Bool
open import Lib.Id
data Fin : Nat -> Set where
zero : {n : Nat} -> Fin (suc n)
suc : {n : Nat} -> Fin n -> Fin (suc n)
fromNat : (n : Nat) -> Fin (suc n)
fromNat zero = zero
fromNat (suc n) = suc (fromNat n)
toNat : {n : Nat} -> Fin n -> Nat
toN... | 30.061728 | 73 | 0.590144 |
a16826f44c06bdf7148fe15178743ab2af5034eb | 15,789 | agda | Agda | Lecture3.agda | glangmead/hott_cmu80818 | af64d808630f4f1498a75201b6ca4d74d662516b | [
"Unlicense"
] | 4 | 2018-05-03T20:32:19.000Z | 2018-09-04T02:52:25.000Z | Lecture3.agda | glangmead/hott_cmu80818 | af64d808630f4f1498a75201b6ca4d74d662516b | [
"Unlicense"
] | 3 | 2018-02-22T21:01:16.000Z | 2018-03-25T14:44:31.000Z | Lecture3.agda | glangmead/hott_cmu80818 | af64d808630f4f1498a75201b6ca4d74d662516b | [
"Unlicense"
] | 2 | 2018-02-22T19:58:46.000Z | 2018-06-25T15:05:21.000Z | {-# OPTIONS --without-K #-}
module Lecture3 where
import Lecture2
open Lecture2 public
data unit : U where
star : unit
𝟙 = unit
ind-unit : {i : Level} {P : unit → UU i} → P star → ((x : unit) → P x)
ind-unit p star = p
data empty : U where
𝟘 = empty
ind-empty : {i : Level} {P : empty → UU i} → ((x : empty) ... | 38.322816 | 309 | 0.622712 |
fb0e3c10c7aa93fa5fa9bdf328f985d855ea526b | 3,789 | agda | Agda | src/Integer/Univalence.agda | kcsmnt0/numbers | 67ea7b96228c592daf79e800ebe4a7c12ed7221e | [
"MIT"
] | 9 | 2019-05-20T01:29:41.000Z | 2020-01-16T07:16:26.000Z | src/Integer/Univalence.agda | kcsmnt0/numbers | 67ea7b96228c592daf79e800ebe4a7c12ed7221e | [
"MIT"
] | null | null | null | src/Integer/Univalence.agda | kcsmnt0/numbers | 67ea7b96228c592daf79e800ebe4a7c12ed7221e | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical #-}
module Integer.Univalence where
open import Cubical.Foundations.NTypes
open import Data.Empty
open import Data.Product as Σ
open import Data.Product.Relation.Pointwise.NonDependent
open import Data.Unit
open import Equality
open import Function
open import Integer.Difference as D
open import... | 33.830357 | 95 | 0.494062 |
57d93ff6b26c0c1dfe0b4246aeb0e218b9b65466 | 2,895 | agda | Agda | test/Succeed/Issue1734.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue1734.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue1734.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2015-12-05 issue reported by Conor
-- {-# OPTIONS -v tc.cover.splittree:10 -v tc.cc:20 #-}
module Issue1734 where
infix 4 _≡_
data _≡_ {A : Set} (x : A) : A → Set where
refl : x ≡ x
record One : Set where constructor <>
data Two : Set where tt ff : Two
-- two : ∀{α}{A : Set α} → A → A → Two → A
two... | 23.346774 | 84 | 0.520207 |
dfd92ce8de03c666fd6e7fe0219df134eb406795 | 208 | agda | Agda | test/Succeed/Issue1550a.agda | zgrannan/agda | 5953ce337eb6b77b29ace7180478f49c541aea1c | [
"BSD-3-Clause"
] | 3 | 2015-03-28T14:51:03.000Z | 2015-12-07T20:14:00.000Z | test/Succeed/Issue1550a.agda | andersk/agda | 56928ff709dcb931cb9a48c4790e5ed3739e3032 | [
"BSD-3-Clause"
] | null | null | null | test/Succeed/Issue1550a.agda | andersk/agda | 56928ff709dcb931cb9a48c4790e5ed3739e3032 | [
"BSD-3-Clause"
] | 1 | 2019-03-05T20:02:38.000Z | 2019-03-05T20:02:38.000Z | -- Andreas, 2015-08-27 use imported rewrite rule
{-# OPTIONS --rewriting #-}
open import Common.Nat
open import Common.Equality
open import Issue1550
x+0+0+0 : ∀{x} → ((x + 0) + 0) + 0 ≡ x
x+0+0+0 = refl
| 17.333333 | 48 | 0.639423 |
41f00278ef825c96a4b919b93261746c897a8baf | 189 | agda | Agda | test/interaction/Issue1325a.agda | redfish64/autonomic-agda | c0ae7d20728b15d7da4efff6ffadae6fe4590016 | [
"BSD-3-Clause"
] | null | null | null | test/interaction/Issue1325a.agda | redfish64/autonomic-agda | c0ae7d20728b15d7da4efff6ffadae6fe4590016 | [
"BSD-3-Clause"
] | null | null | null | test/interaction/Issue1325a.agda | redfish64/autonomic-agda | c0ae7d20728b15d7da4efff6ffadae6fe4590016 | [
"BSD-3-Clause"
] | null | null | null | -- Andreas, 2014-10-23
-- We want to split on hidden variables.
data ℕ : Set where
zero : ℕ
suc : ℕ → ℕ
f : {n : ℕ} → Set₁
f = Set
where
g : {n : ℕ} → Set → Set
g _ = {!.n!}
| 13.5 | 40 | 0.507937 |
57a2666df3bfcb6603e155c3eeabf2489f01d84f | 3,269 | agda | Agda | test/asset/agda-stdlib-1.0/Relation/Binary/Construct/Add/Extrema/NonStrict.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Relation/Binary/Construct/Add/Extrema/NonStrict.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Relation/Binary/Construct/Add/Extrema/NonStrict.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- The Agda standard library
--
-- The lifting of a non-strict order to incorporate new extrema
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
-- This module is designed to be used wit... | 30.268519 | 80 | 0.528602 |
22a03950b555f496baf024f561f533a76ce348de | 192 | agda | Agda | Cubical/Data/Sigma/Base.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | Cubical/Data/Sigma/Base.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | Cubical/Data/Sigma/Base.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --safe #-}
module Cubical.Data.Sigma.Base where
open import Cubical.Core.Primitives public
-- Σ-types are defined in Core/Primitives as they are needed for Glue types.
| 27.428571 | 76 | 0.755208 |
fb5f049657bb8a70353b60ef42f9260c5ac811f3 | 2,357 | agda | Agda | Cubical/Data/Unit/Properties.agda | Edlyr/cubical | 5de11df25b79ee49d5c084fbbe6dfc66e4147a2e | [
"MIT"
] | null | null | null | Cubical/Data/Unit/Properties.agda | Edlyr/cubical | 5de11df25b79ee49d5c084fbbe6dfc66e4147a2e | [
"MIT"
] | null | null | null | Cubical/Data/Unit/Properties.agda | Edlyr/cubical | 5de11df25b79ee49d5c084fbbe6dfc66e4147a2e | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Data.Unit.Properties where
open import Cubical.Core.Everything
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Function
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Isomorphism
open import Cubical.Dat... | 33.197183 | 100 | 0.68689 |
57d4b9f11e607b878e64c887e2cc487c5404ec3b | 2,123 | agda | Agda | test/asset/agda-stdlib-1.0/Induction.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | 5 | 2020-10-07T12:07:53.000Z | 2020-10-10T21:41:32.000Z | test/asset/agda-stdlib-1.0/Induction.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Induction.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | 1 | 2021-11-04T06:54:45.000Z | 2021-11-04T06:54:45.000Z | ------------------------------------------------------------------------
-- The Agda standard library
--
-- An abstraction of various forms of recursion/induction
------------------------------------------------------------------------
-- The idea underlying Induction.* comes from Epigram 1, see Section 4
-- of "The v... | 34.803279 | 72 | 0.603391 |
3d69c94e0298fc783e0c3d2fd004ade73130cb5e | 4,773 | agda | Agda | src/Categories/Category/CartesianClosed/Canonical.agda | yourboynico/agda-categories | 6a087c592dbe58fc4bd9d02e1be9b94a9e138aca | [
"MIT"
] | 279 | 2019-06-01T14:36:40.000Z | 2022-03-22T00:40:14.000Z | src/Categories/Category/CartesianClosed/Canonical.agda | seanpm2001/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | 236 | 2019-06-01T14:53:54.000Z | 2022-03-28T14:31:43.000Z | src/Categories/Category/CartesianClosed/Canonical.agda | seanpm2001/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | 64 | 2019-06-02T16:58:15.000Z | 2022-03-14T02:00:59.000Z | {-# OPTIONS --without-K --safe #-}
open import Categories.Category.Core using (Category)
-- A "canonical" presentation of cartesian closed categories.
--
-- This presentation is equivalent to the one in
-- Categories.Category.CartesianClosed but it is easier to work with
-- in some circumstances.
--
-- Here, exponenti... | 29.282209 | 87 | 0.60067 |
417d7f075654a0c2f793b1c9ad530df411345ae3 | 8,349 | agda | Agda | test/asset/agda-stdlib-1.0/Data/List/Relation/Binary/Sublist/Setoid/Properties.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Data/List/Relation/Binary/Sublist/Setoid/Properties.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Data/List/Relation/Binary/Sublist/Setoid/Properties.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | -----------------------------------------------------------------------
-- The Agda standard library
--
-- Properties of the setoid sublist relation
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
open import Relation.Binary using (Setoid; _⇒_; _Preserves_⟶_... | 33.396 | 82 | 0.48401 |
1cc15e4eacce802ad878fea14b5f2fe657c31311 | 6,037 | agda | Agda | old/Homotopy/PullbackInvariantEquiv.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | 294 | 2015-01-09T16:23:23.000Z | 2022-03-20T13:54:45.000Z | old/Homotopy/PullbackInvariantEquiv.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | 31 | 2015-03-05T20:09:00.000Z | 2021-10-03T19:15:25.000Z | old/Homotopy/PullbackInvariantEquiv.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | 50 | 2015-01-10T01:48:08.000Z | 2022-02-14T03:03:25.000Z | {-# OPTIONS --without-K #-}
open import Base
open import Homotopy.PullbackDef
{- In this file we prove that if two diagrams are equivalent (there are
equivalences between the types and the squares are commutative), then the
natural map between the pullbacks is also an equivalence -}
module Homotopy.PullbackInv... | 44.389706 | 80 | 0.511347 |
a1565b8be26fddded38020b93f43474be2252de7 | 299 | agda | Agda | test/Fail/Issue2247.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/Issue2247.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/Issue2247.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | module _ where
open import Agda.Builtin.Equality
module MM1 (A : Set) where
postulate a0 : A
module M1 (a : A) where
postulate
x : A
module M = M1 a0
module MM2 (A : Set) where
open module MM1A = MM1 A
check : M1.x ≡ (λ a → a)
check = refl -- used to be internal error
| 14.95 | 44 | 0.618729 |
39b05d1d1f831a775db4a8a76f7e82e37f440f8f | 138 | agda | Agda | Everything.agda | myuon/agda-cate | 59004994acdbc65fb4f8abf0baa1777a8dbe758e | [
"MIT"
] | 2 | 2018-07-28T04:59:31.000Z | 2019-11-02T07:30:47.000Z | Everything.agda | myuon/agda-cate | 59004994acdbc65fb4f8abf0baa1777a8dbe758e | [
"MIT"
] | null | null | null | Everything.agda | myuon/agda-cate | 59004994acdbc65fb4f8abf0baa1777a8dbe758e | [
"MIT"
] | null | null | null | module Everything where
import Basic
import Category
import Functor
import Nat
import Yoneda
import Adjoint
import Monad
import TAlgebra
| 12.545455 | 23 | 0.855072 |
22ff8b65e7ab6ded3292749b3da385eec416a077 | 2,541 | agda | Agda | SOAS/Coalgebraic/Monoid.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 39 | 2021-11-09T20:39:55.000Z | 2022-03-19T17:33:12.000Z | SOAS/Coalgebraic/Monoid.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 1 | 2021-11-21T12:19:32.000Z | 2021-11-21T12:19:32.000Z | SOAS/Coalgebraic/Monoid.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 4 | 2021-11-09T20:39:59.000Z | 2022-01-24T12:49:17.000Z |
-- Families with compatible monoid and coal
module SOAS.Coalgebraic.Monoid {T : Set} where
open import SOAS.Common
open import SOAS.Context {T}
open import SOAS.Variable
open import SOAS.Families.Core {T}
import SOAS.Families.Delta {T} as δ; open δ.Sorted
open import SOAS.Abstract.Hom {T}
import SOAS.Abstract.Box {T}... | 33.88 | 83 | 0.514758 |
0633216785983a7f3a56ffc2c52b6270e30bff1e | 5,601 | agda | Agda | old/Homotopy/ConnectedSuspension.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | 294 | 2015-01-09T16:23:23.000Z | 2022-03-20T13:54:45.000Z | old/Homotopy/ConnectedSuspension.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | 31 | 2015-03-05T20:09:00.000Z | 2021-10-03T19:15:25.000Z | old/Homotopy/ConnectedSuspension.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | 50 | 2015-01-10T01:48:08.000Z | 2022-02-14T03:03:25.000Z | {-# OPTIONS --without-K #-}
open import Base
open import Homotopy.Truncation
open import Homotopy.Connected
open import Spaces.Suspension
open import Homotopy.PushoutDef
import Homotopy.PushoutUP as PushoutUP
-- In this file I prove that if [A] is n-connected and its (n+1)-truncation is
-- inhabited, then [suspension... | 35.226415 | 79 | 0.599536 |
3147c50fd4be91554a16131ff8420f1a5c5db157 | 4,787 | agda | Agda | Mixfix/Acyclic/Example.agda | yurrriq/parser-combinators | b396d35cc2cb7e8aea50b982429ee385f001aa88 | [
"MIT"
] | 7 | 2016-12-13T05:23:14.000Z | 2021-06-22T05:35:31.000Z | Mixfix/Acyclic/Example.agda | yurrriq/parser-combinators | b396d35cc2cb7e8aea50b982429ee385f001aa88 | [
"MIT"
] | 1 | 2018-01-22T22:21:41.000Z | 2018-01-24T16:39:37.000Z | Mixfix/Acyclic/Example.agda | yurrriq/parser-combinators | b396d35cc2cb7e8aea50b982429ee385f001aa88 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- An example
------------------------------------------------------------------------
module Mixfix.Acyclic.Example where
open import Coinduction
open import Data.Vec using ([]; _∷_; [_])
open import Data.List as List
using (List; []; _∷_) re... | 33.243056 | 72 | 0.555881 |
3d7d7708d47bf42b495c726ce42399b8501829bb | 7,152 | agda | Agda | agda-stdlib/src/Algebra/Consequences/Setoid.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 5 | 2020-10-07T12:07:53.000Z | 2020-10-10T21:41:32.000Z | agda-stdlib/src/Algebra/Consequences/Setoid.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | null | null | null | agda-stdlib/src/Algebra/Consequences/Setoid.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 1 | 2021-11-04T06:54:45.000Z | 2021-11-04T06:54:45.000Z | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Relations between properties of functions, such as associativity and
-- commutativity, when the underlying relation is a setoid
------------------------------------------------------------------------
{-# OPTION... | 36.121212 | 84 | 0.435682 |
Subsets and Splits
HTML Code Excluding Scripts
The query retrieves a limited set of HTML content entries that are longer than 8 characters and do not contain script tags, offering only basic filtering with minimal analytical value.