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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
4a1d5e8a5493ac3bf95714a071fe33bcdf42fa99 | 178 | agda | Agda | Cubical/HITs/ListedFiniteSet.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 301 | 2018-10-17T18:00:24.000Z | 2022-03-24T02:10:47.000Z | Cubical/HITs/ListedFiniteSet.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 584 | 2018-10-15T09:49:02.000Z | 2022-03-30T12:09:17.000Z | Cubical/HITs/ListedFiniteSet.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 134 | 2018-11-16T06:11:03.000Z | 2022-03-23T16:22:13.000Z | {-# OPTIONS --safe #-}
module Cubical.HITs.ListedFiniteSet where
open import Cubical.HITs.ListedFiniteSet.Base public
open import Cubical.HITs.ListedFiniteSet.Properties public
| 29.666667 | 58 | 0.820225 |
dc67728d6b964f20dfaf3496797d011f2e64312f | 17,049 | agda | Agda | src-cbpv/GradedCBPVSup.agda | andreasabel/ipl | 9a6151ad1f0977674b8cc9e9cefb49ae83e8a42a | [
"Unlicense"
] | 19 | 2018-05-16T08:08:51.000Z | 2021-04-27T19:10:49.000Z | src-cbpv/GradedCBPVSup.agda | andreasabel/ipl | 9a6151ad1f0977674b8cc9e9cefb49ae83e8a42a | [
"Unlicense"
] | null | null | null | src-cbpv/GradedCBPVSup.agda | andreasabel/ipl | 9a6151ad1f0977674b8cc9e9cefb49ae83e8a42a | [
"Unlicense"
] | 2 | 2018-11-13T16:01:46.000Z | 2021-02-25T20:39:03.000Z | {-# OPTIONS --rewriting #-}
-- Normalization by Evaluation for Graded Call-By-Push-Value.
-- With supremum of effects.
module GradedCBPVSup where
-- Imports from the Agda standard library.
open import Library hiding (_×̇_)
open import Data.Nat using (ℕ)
open import Data.Fin using (Fin)
pattern here! = here refl
... | 29.858144 | 100 | 0.436565 |
c50ffa5cd957bd24dae5e6d58f6dbd39d08d4d60 | 568 | agda | Agda | archive/agda-3/src/Test/Test5.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null | archive/agda-3/src/Test/Test5.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | 1 | 2019-04-29T00:35:04.000Z | 2019-05-11T23:33:04.000Z | archive/agda-3/src/Test/Test5.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null |
open import Everything
module Test.Test5
{𝔵} {𝔛 : Ø 𝔵}
{𝔞} {𝔒₁ : 𝔛 → Ø 𝔞}
{𝔟} {𝔒₂ : 𝔛 → Ø 𝔟}
{ℓ}
{ℓ̇} (_↦_ : ∀ {x} → 𝔒₂ x → 𝔒₂ x → Ø ℓ̇)
⦃ _ : [ExtensibleType] _↦_ ⦄
⦃ _ : Smap!.class (Arrow 𝔒₁ 𝔒₂) (Extension 𝔒₂) ⦄
⦃ _ : Surjextensionality!.class (Arrow 𝔒₁ 𝔒₂) (Pointwise _↦_) (Extens... | 33.411765 | 117 | 0.575704 |
4a22e3e65870ba8d94c94a58f73c60777a14a112 | 8,493 | agda | Agda | src/Tactic/Nat/Simpl/Lemmas.agda | L-TChen/agda-prelude | 158d299b1b365e186f00d8ef5b8c6844235ee267 | [
"MIT"
] | 111 | 2015-01-05T11:28:15.000Z | 2022-02-12T23:29:26.000Z | src/Tactic/Nat/Simpl/Lemmas.agda | L-TChen/agda-prelude | 158d299b1b365e186f00d8ef5b8c6844235ee267 | [
"MIT"
] | 59 | 2016-02-09T05:36:44.000Z | 2022-01-14T07:32:36.000Z | src/Tactic/Nat/Simpl/Lemmas.agda | L-TChen/agda-prelude | 158d299b1b365e186f00d8ef5b8c6844235ee267 | [
"MIT"
] | 24 | 2015-03-12T18:03:45.000Z | 2021-04-22T06:10:41.000Z |
module Tactic.Nat.Simpl.Lemmas where
open import Prelude
open import Tactic.Nat.NF
open import Tactic.Nat.Exp
open import Container.Bag
open import Tactic.Nat.Auto
open import Prelude.Nat.Properties
open import Container.List.Properties
open import Tactic.Nat.Auto.Lemmas
product1-sound : ∀ xs → product1 xs ≡ product... | 42.044554 | 111 | 0.477334 |
238280a4272d90264c6c87906d6c70529f5026d1 | 3,587 | agda | Agda | LibraBFT/Abstract/System.agda | lisandrasilva/bft-consensus-agda-1 | b7dd98dd90d98fbb934ef8cb4f3314940986790d | [
"UPL-1.0"
] | null | null | null | LibraBFT/Abstract/System.agda | lisandrasilva/bft-consensus-agda-1 | b7dd98dd90d98fbb934ef8cb4f3314940986790d | [
"UPL-1.0"
] | null | null | null | LibraBFT/Abstract/System.agda | lisandrasilva/bft-consensus-agda-1 | b7dd98dd90d98fbb934ef8cb4f3314940986790d | [
"UPL-1.0"
] | null | null | null | {- Byzantine Fault Tolerant Consensus Verification in Agda, version 0.9.
Copyright (c) 2020 Oracle and/or its affiliates.
Licensed under the Universal Permissive License v 1.0 as shown at https://opensource.oracle.com/licenses/upl
-}
open import LibraBFT.Prelude
open import LibraBFT.Abstract.Types
-- This modul... | 44.8375 | 111 | 0.638974 |
209f81d43eec8e1809188b41a32aec02dec25fd7 | 317 | agda | Agda | test/interaction/Highlighting.agda | larrytheliquid/agda | 477c8c37f948e6038b773409358fd8f38395f827 | [
"MIT"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | test/interaction/Highlighting.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | test/interaction/Highlighting.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | 1 | 2022-03-12T11:35:18.000Z | 2022-03-12T11:35:18.000Z | module Highlighting where
Set-one : Set₂
Set-one = Set₁
record R (A : Set) : Set-one where
constructor con
field X : Set
F : Set → Set → Set
F A B = B
field P : F A X → Set
Q : F A X → Set
Q = Q
postulate P : _
open import Highlighting.M
data D (A : Set) : Set-one where
d : let X = D in X A
| 12.68 | 34 | 0.589905 |
cb70662292bf43ed1bd6237d7088a8530c954fff | 339 | agda | Agda | test/Compiler/simple/Issue561/Core.agda | zliu41/agda | 73405f70bced057d24dd4bf122d53f9548544aba | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Compiler/simple/Issue561/Core.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/Issue561/Core.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | module Issue561.Core where
postulate Char : Set
{-# BUILTIN CHAR Char #-}
open import Agda.Builtin.IO public
postulate
return : ∀ {a} {A : Set a} → A → IO A
{-# COMPILE GHC return = \_ _ -> return #-}
{-# COMPILE JS return =
function(u0) { return function(u1) { return function(x) { return function(cb) { cb(... | 22.6 | 105 | 0.610619 |
23e22ecd162430b4a8d86a87828a884c47480f20 | 21,739 | agda | Agda | Cubical/HITs/Truncation/Properties.agda | cangiuli/cubical | d103ec455d41cccf9b13a4803e7d3cf462e00067 | [
"MIT"
] | null | null | null | Cubical/HITs/Truncation/Properties.agda | cangiuli/cubical | d103ec455d41cccf9b13a4803e7d3cf462e00067 | [
"MIT"
] | null | null | null | Cubical/HITs/Truncation/Properties.agda | cangiuli/cubical | d103ec455d41cccf9b13a4803e7d3cf462e00067 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.HITs.Truncation.Properties where
open import Cubical.Data.NatMinusOne
open import Cubical.HITs.Truncation.Base
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Function
open import Cubical.Foundations.Equiv
open import Cubical.Fo... | 47.465066 | 146 | 0.556327 |
398748dcb3eda8d2d87374ee6dc9898d3571588b | 24 | agda | Agda | test/interaction/Issue2536-1.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/interaction/Issue2536-1.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/interaction/Issue2536-1.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | id : Set → Set
id A = A
| 8 | 14 | 0.5 |
4a6bbdb7e83937510c75ae59b7e601883c14021a | 528 | agda | Agda | test/Foo.agda | andreasabel/agda2lagda | 93d317c87bddf973e3fa6abd5bf24dcfa9a797f0 | [
"Unlicense"
] | 11 | 2020-10-01T12:10:15.000Z | 2021-08-16T07:28:10.000Z | test/Foo.agda | andreasabel/agda2lagda | 93d317c87bddf973e3fa6abd5bf24dcfa9a797f0 | [
"Unlicense"
] | null | null | null | test/Foo.agda | andreasabel/agda2lagda | 93d317c87bddf973e3fa6abd5bf24dcfa9a797f0 | [
"Unlicense"
] | null | null | null | -- Sample non-literate Agda program
-- ================================
--
-- A remark to test bulleted lists:
--
-- * This file serves as example for agda2lagda.
--
-- * The content may be non-sensical.
--
-- Indeed!
module Foo where
-- Some data type.
data D : Set where
c : D
-- A function.
foo : D → D
foo c = ... | 13.2 | 48 | 0.551136 |
c5f61abd5a97d2d055a50889f55cd0d0e0ae41c3 | 14,088 | agda | Agda | TotalParserCombinators/Congruence/Sound.agda | nad/parser-combinators | 76774f54f466cfe943debf2da731074fe0c33644 | [
"MIT"
] | 1 | 2020-07-03T08:56:13.000Z | 2020-07-03T08:56:13.000Z | TotalParserCombinators/Congruence/Sound.agda | nad/parser-combinators | 76774f54f466cfe943debf2da731074fe0c33644 | [
"MIT"
] | null | null | null | TotalParserCombinators/Congruence/Sound.agda | nad/parser-combinators | 76774f54f466cfe943debf2da731074fe0c33644 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- The parser equivalence proof language is sound
------------------------------------------------------------------------
module TotalParserCombinators.Congruence.Sound where
open import Category.Monad
open import Codata.Musical.Notation
open i... | 58.456432 | 135 | 0.389338 |
dcde433233e311310d93d0affaa71e0bb31849fd | 435 | agda | Agda | archive/agda-3/src/Test/Test1.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null | archive/agda-3/src/Test/Test1.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | 1 | 2019-04-29T00:35:04.000Z | 2019-05-11T23:33:04.000Z | archive/agda-3/src/Test/Test1.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null | {-# OPTIONS --allow-unsolved-metas #-} -- FIXME
open import Everything
module Test.Test1 where
test-functor-transextensionality : ∀
{𝔬₁ 𝔯₁ ℓ₁ 𝔬₂ 𝔯₂ ℓ₂}
⦃ functor : Functor 𝔬₁ 𝔯₁ ℓ₁ 𝔬₂ 𝔯₂ ℓ₂ ⦄
(open Functor functor)
→ {!Transextensionality!.type _∼₁_ _∼̇₁_!}
test-functor-transextensionalit... | 31.071429 | 98 | 0.705747 |
0e09b13a713739e33e0bb5341e26809e487b383f | 1,853 | agda | Agda | SOAS/Metatheory/Semantics.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 39 | 2021-11-09T20:39:55.000Z | 2022-03-19T17:33:12.000Z | SOAS/Metatheory/Semantics.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 1 | 2021-11-21T12:19:32.000Z | 2021-11-21T12:19:32.000Z | SOAS/Metatheory/Semantics.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 4 | 2021-11-09T20:39:59.000Z | 2022-01-24T12:49:17.000Z |
open import SOAS.Common
open import SOAS.Families.Core
open import Categories.Object.Initial
open import SOAS.Coalgebraic.Strength
import SOAS.Metatheory.MetaAlgebra
-- Initial-algebra semantics
module SOAS.Metatheory.Semantics {T : Set}
(⅀F : Functor 𝔽amiliesₛ 𝔽amiliesₛ) (⅀:Str : Strength ⅀F)
(𝔛 : Familyₛ) (o... | 30.377049 | 83 | 0.637345 |
dc1f2e0b54a58c284b6f32c0d2cce8cf2ec1564a | 10,597 | agda | Agda | Cubical/Talks/EPA2020.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 1 | 2022-03-05T00:29:41.000Z | 2022-03-05T00:29:41.000Z | Cubical/Talks/EPA2020.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | null | null | null | Cubical/Talks/EPA2020.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | null | null | null | {-
Cubical Agda - A Dependently Typed PL with Univalence and HITs
==============================================================
Anders Mörtberg
Every Proof Assistant - September 17, 2020
Link to slides: https://staff.math.su.se/anders.mortberg/slides/EPA2020.pdf
Link to video: https://vi... | 30.805233 | 91 | 0.629329 |
39a88769e3a876207b8d1af3b0f2fd860796400b | 1,283 | agda | Agda | agda/Avionics/Probability.agda | RPI-WCL/safety-envelopes-sentinels | 896e67a2ad21041a1c9ef5f3ad6318c67d730341 | [
"BSD-3-Clause"
] | null | null | null | agda/Avionics/Probability.agda | RPI-WCL/safety-envelopes-sentinels | 896e67a2ad21041a1c9ef5f3ad6318c67d730341 | [
"BSD-3-Clause"
] | null | null | null | agda/Avionics/Probability.agda | RPI-WCL/safety-envelopes-sentinels | 896e67a2ad21041a1c9ef5f3ad6318c67d730341 | [
"BSD-3-Clause"
] | null | null | null | {-# OPTIONS --allow-unsolved-metas #-}
module Avionics.Probability where
open import Data.Nat using (ℕ; zero; suc)
open import Relation.Unary using (_∈_)
open import Avionics.Real using (
ℝ; _+_; _-_; _*_; _÷_; _^_; √_; 1/_; _^2;
-1/2; π; e; 2ℝ;
⟨0,∞⟩; [0,∞⟩; [0,1])
--postulate
-- Vec : Set → ℕ → Set
-... | 21.745763 | 111 | 0.47311 |
23f78c7361920216f7bc36d72f3a782430067d85 | 784 | agda | Agda | Cubical/Data/InfNat/Base.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | 1 | 2020-03-23T23:52:11.000Z | 2020-03-23T23:52:11.000Z | Cubical/Data/InfNat/Base.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | Cubical/Data/InfNat/Base.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --no-exact-split --safe #-}
module Cubical.Data.InfNat.Base where
open import Cubical.Data.Nat as ℕ using (ℕ)
open import Cubical.Core.Primitives
data ℕ+∞ : Type₀ where
∞ : ℕ+∞
fin : ℕ → ℕ+∞
suc : ℕ+∞ → ℕ+∞
suc ∞ = ∞
suc (fin n) = fin (ℕ.suc n)
zero : ℕ+∞
zero = fin ℕ.zero
caseInfNat : ∀... | 21.189189 | 57 | 0.443878 |
0e6e6d4c1efa85657fc648cb181a7103dce2b49a | 2,298 | agda | Agda | vendor/stdlib/src/Data/List/Equality.agda | isabella232/Lemmachine | 8ef786b40e4a9ab274c6103dc697dcb658cf3db3 | [
"MIT"
] | 56 | 2015-01-20T02:11:42.000Z | 2021-12-21T17:02:19.000Z | vendor/stdlib/src/Data/List/Equality.agda | larrytheliquid/Lemmachine | 8ef786b40e4a9ab274c6103dc697dcb658cf3db3 | [
"MIT"
] | 1 | 2022-03-12T12:17:51.000Z | 2022-03-12T12:17:51.000Z | vendor/stdlib/src/Data/List/Equality.agda | isabella232/Lemmachine | 8ef786b40e4a9ab274c6103dc697dcb658cf3db3 | [
"MIT"
] | 3 | 2015-07-21T16:37:58.000Z | 2022-03-12T11:54:10.000Z | ------------------------------------------------------------------------
-- List equality
------------------------------------------------------------------------
module Data.List.Equality where
open import Data.List
open import Relation.Nullary
open import Relation.Binary
module Equality (S : Setoid) where
open ... | 25.820225 | 72 | 0.477807 |
dfbcf7e8a17efef13e33d9812d44058cc0f7f4ef | 674 | agda | Agda | test/Fail/ShapeIrrelevantParameterNoBecauseOfRecursion.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/ShapeIrrelevantParameterNoBecauseOfRecursion.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/ShapeIrrelevantParameterNoBecauseOfRecursion.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | {-# OPTIONS --experimental-irrelevance #-}
module ShapeIrrelevantParameterNoBecauseOfRecursion where
data ⊥ : Set where
record ⊤ : Set where
data Bool : Set where
true false : Bool
True : Bool → Set
True false = ⊥
True true = ⊤
data D ..(b : Bool) : Set where
c : True b → D b -- should fail
-- Jesper, 2017-0... | 22.466667 | 78 | 0.651335 |
20ae99d8b2d4486f41f17bad0d8cfebff614daf6 | 2,786 | agda | Agda | src/LibraBFT/Impl/IO/OBM/Properties/Start.agda | LaudateCorpus1/bft-consensus-agda | a4674fc473f2457fd3fe5123af48253cfb2404ef | [
"UPL-1.0"
] | null | null | null | src/LibraBFT/Impl/IO/OBM/Properties/Start.agda | LaudateCorpus1/bft-consensus-agda | a4674fc473f2457fd3fe5123af48253cfb2404ef | [
"UPL-1.0"
] | null | null | null | src/LibraBFT/Impl/IO/OBM/Properties/Start.agda | LaudateCorpus1/bft-consensus-agda | a4674fc473f2457fd3fe5123af48253cfb2404ef | [
"UPL-1.0"
] | null | null | null | {- 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.Base.Types
open import LibraBFT.Concrete.Records
open im... | 48.034483 | 115 | 0.753769 |
0ece5c884cadcbc10ccb7846f8df14d3dfec964c | 185 | agda | Agda | Cubical/Data/DescendingList.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | Cubical/Data/DescendingList.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | Cubical/Data/DescendingList.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --safe #-}
module Cubical.Data.DescendingList where
open import Cubical.Data.DescendingList.Base public
open import Cubical.Data.DescendingList.Properties public
| 30.833333 | 57 | 0.810811 |
cbc389bd2033dd620b687c3d3fd2bb7756a3339e | 442 | agda | Agda | test/Succeed/Issue3134.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue3134.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue3134.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
open import Agda.Builtin.Nat
open import Agda.Builtin.Equality
postulate
⊤ ⊥ : Set
_&_ : Set → Set → Set
_≤_ : Nat → Nat → Set
{-# TERMINATING #-}
_∣_ : Nat → Nat → Set
m ∣ zero = ⊤
zero ∣ suc n = ⊥
suc m ∣ suc n = (suc m ≤ suc n) & (suc m ∣ (n - m))
variable m n : Nat
postulate
divide-to-nat : n ∣ m... | 18.416667 | 61 | 0.570136 |
1881f05bd1ec35505d7144fd0a1364127236e3c2 | 466 | agda | Agda | test/Succeed/Issue353.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue353.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue353.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- {-# OPTIONS -v tc.polarity:10 #-}
module Issue353 where
data Func : Set₁ where
K : (A : Set) → Func
-- Doesn't work.
module M where
const : ∀ {A B : Set₁} → A → B → A
const x = λ _ → x
⟦_⟧ : Func → Set → Set
⟦ K A ⟧ X = const A X
data μ (F : Func) : Set where
⟨_⟩ : ⟦ F ⟧ (μ F) → μ F
-- Error:... | 21.181818 | 71 | 0.564378 |
dc9924299a6d2c4aab8aa21fae49aa8d8977250f | 753 | agda | Agda | Sets/IterativeSet.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | Sets/IterativeSet.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | Sets/IterativeSet.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | module Sets.IterativeSet where
import Lvl
open import Logic
open import Type
module _ where
private variable {ℓ ℓ₁ ℓ₂} : Lvl.Level
-- A model of constructive set theory (CZF) by using W-types (iterative sets).
-- The interpretation of Iset being a type of sets comes from the idea that the image of `elem` ... | 32.73913 | 141 | 0.63081 |
101f2d65360cc65c0e445e87bb5b037c4510928a | 1,684 | agda | Agda | code/SizeLoop.agda | ionathanch/msc-thesis | 8fe15af8f9b5021dc50bcf96665e0988abf28f3c | [
"CC-BY-4.0"
] | null | null | null | code/SizeLoop.agda | ionathanch/msc-thesis | 8fe15af8f9b5021dc50bcf96665e0988abf28f3c | [
"CC-BY-4.0"
] | null | null | null | code/SizeLoop.agda | ionathanch/msc-thesis | 8fe15af8f9b5021dc50bcf96665e0988abf28f3c | [
"CC-BY-4.0"
] | null | null | null | {-
A counterexample from Section 5.1 of Andreas Abel's dissertation [1],
showing that the types of recursive functions must be (semi-)continuous,
i.e. `loop` below should be disallowed.
In the example, `loop` is not used as-is, but rather the size involved
is instantiated to the infinite size in order to pass... | 30.071429 | 74 | 0.635392 |
398aec7a1c4de554f55cbf0e9a1a85ef7cfdf95a | 1,043 | agda | Agda | src/Algebra/LabelledGraph/Reasoning.agda | algebraic-graphs/alga-theory | 0fdb96c0233d9be83eba637f0434d0fd22aefb1d | [
"MIT"
] | 60 | 2017-12-27T14:57:04.000Z | 2022-03-22T23:05:29.000Z | src/Algebra/LabelledGraph/Reasoning.agda | algebraic-graphs/alga-theory | 0fdb96c0233d9be83eba637f0434d0fd22aefb1d | [
"MIT"
] | 3 | 2018-04-12T16:25:13.000Z | 2018-06-23T13:54:02.000Z | src/Algebra/LabelledGraph/Reasoning.agda | algebraic-graphs/alga-theory | 0fdb96c0233d9be83eba637f0434d0fd22aefb1d | [
"MIT"
] | 6 | 2017-12-17T20:48:20.000Z | 2019-05-09T23:53:28.000Z | module Algebra.LabelledGraph.Reasoning where
open import Algebra.Dioid
open import Algebra.LabelledGraph
-- Standard syntax sugar for writing equational proofs
infix 4 _≈_
data _≈_ {A B eq} {d : Dioid B eq} (x y : LabelledGraph d A) : Set where
prove : x ≡ y -> x ≈ y
infix 1 begin_
begin_ : ∀ {A B eq} {d : Dioid... | 32.59375 | 113 | 0.563758 |
107e39e07959ea91c2f80a85579617eb7aaa222d | 2,069 | agda | Agda | agda-stdlib/src/Data/List/Kleene/AsList.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 5 | 2020-10-07T12:07:53.000Z | 2020-10-10T21:41:32.000Z | agda-stdlib/src/Data/List/Kleene/AsList.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | null | null | null | agda-stdlib/src/Data/List/Kleene/AsList.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 1 | 2021-11-04T06:54:45.000Z | 2021-11-04T06:54:45.000Z | ------------------------------------------------------------------------
-- The Agda standard library
--
-- A different interface to the Kleene lists, designed to mimic
-- Data.List.
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Data.List.Kleene.AsL... | 29.985507 | 75 | 0.455776 |
10666ba728d368d4ddbb4dbddef755e4f1c9301a | 3,671 | agda | Agda | examples/outdated-and-incorrect/cbs/Proof.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | examples/outdated-and-incorrect/cbs/Proof.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | examples/outdated-and-incorrect/cbs/Proof.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
module Proof where
open import Basics hiding (_==_)
open import Proc
open import Path
import Graph
private
open module G = Graph Nat
open module P = Process param hiding (U; T; _!_)
{-
Soundness:
if we get an answer there is a path
Completeness:
if there is a path we get an answer
-}
infix 18 _encodes... | 27.601504 | 80 | 0.517298 |
d030e1dbec3b9dda2e98e0782c16d5980adc2d8f | 312 | agda | Agda | test/succeed/IndexOnBuiltin.agda | asr/agda-kanso | aa10ae6a29dc79964fe9dec2de07b9df28b61ed5 | [
"MIT"
] | 1 | 2019-11-27T04:41:05.000Z | 2019-11-27T04:41:05.000Z | test/succeed/IndexOnBuiltin.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | test/succeed/IndexOnBuiltin.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | module IndexOnBuiltin where
data Nat : Set where
zero : Nat
suc : Nat -> Nat
{-# BUILTIN NATURAL Nat #-}
{-# BUILTIN ZERO zero #-}
{-# BUILTIN SUC suc #-}
data Fin : Nat -> Set where
fz : {n : Nat} -> Fin (suc n)
fs : {n : Nat} -> Fin n -> Fin (suc n)
f : Fin 2 -> Fin 1
f fz = fz
f (fs i) = i
| 16.421053 | 40 | 0.538462 |
cb0cefeb35679421ec05bde7c494006e45cdebf0 | 1,384 | agda | Agda | test/Succeed/Issue2101.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 3 | 2015-03-28T14:51:03.000Z | 2015-12-07T20:14:00.000Z | test/Succeed/Issue2101.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 3 | 2018-11-14T15:31:44.000Z | 2019-04-01T19:39:26.000Z | test/Succeed/Issue2101.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1 | 2015-09-15T14:36:15.000Z | 2015-09-15T14:36:15.000Z | -- Andreas, 2016-07-17 issue 2101 reported by Serge Mechveliani.
-- It should be possible to place a single function with a where block
-- inside `abstract`.
-- This will work if type signatures inside a where-block
-- are considered private, since in private type signatures,
-- abstract definitions are transparent.
... | 21.968254 | 70 | 0.631503 |
395aa45da6e443c6d6a7400031f40cf1c078fbd9 | 1,937 | agda | Agda | src/Examples/Sorting/Comparable.agda | jonsterling/agda-calf | e51606f9ca18d8b4cf9a63c2d6caa2efc5516146 | [
"Apache-2.0"
] | 29 | 2021-07-14T03:18:28.000Z | 2022-03-22T20:35:11.000Z | src/Examples/Sorting/Comparable.agda | jonsterling/agda-calf | e51606f9ca18d8b4cf9a63c2d6caa2efc5516146 | [
"Apache-2.0"
] | null | null | null | src/Examples/Sorting/Comparable.agda | jonsterling/agda-calf | e51606f9ca18d8b4cf9a63c2d6caa2efc5516146 | [
"Apache-2.0"
] | 2 | 2021-10-06T10:28:24.000Z | 2022-01-29T08:12:01.000Z | {-# OPTIONS --prop --rewriting #-}
open import Calf.CostMonoid
open import Data.Nat using (ℕ)
module Examples.Sorting.Comparable
(costMonoid : CostMonoid) (fromℕ : ℕ → CostMonoid.ℂ costMonoid) where
open CostMonoid costMonoid using (ℂ)
open import Calf costMonoid
open import Calf.Types.Bool
open import Calf.Types... | 31.754098 | 118 | 0.617966 |
cb871915319534c4077375a3c69f969df259fc6c | 662 | agda | Agda | test/Succeed/Issue2484-3.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 2 | 2019-10-29T09:40:30.000Z | 2020-09-20T00:28:57.000Z | test/Succeed/Issue2484-3.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 3 | 2018-11-14T15:31:44.000Z | 2019-04-01T19:39:26.000Z | test/Succeed/Issue2484-3.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1 | 2015-09-15T14:36:15.000Z | 2015-09-15T14:36:15.000Z | module _ (_ : Set) where
open import Agda.Builtin.Size
postulate
I : Set
record ∃ (B : I → Set) : Set where
constructor _,_
field
proj₁ : I
proj₂ : B proj₁
mutual
data P (i : Size) (x y : I) : Set where
⟨_⟩ : ∃ (Q i x) → P i x y
record Q (i : Size) (x y : I) : Set where
coinductive
f... | 18.914286 | 60 | 0.453172 |
dcb6e3331b852ada164f61679cbde3736594f220 | 71 | agda | Agda | test/Fail/IndentedCheckingMessages.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/IndentedCheckingMessages.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/IndentedCheckingMessages.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | module IndentedCheckingMessages where
import A.M
Foo : Set
Foo = Foo
| 10.142857 | 37 | 0.774648 |
10f3954b1bca967aad685d54960e8cdfd9daeb1e | 30 | agda | Agda | Categories/Topos.agda | copumpkin/categories | 36f4181d751e2ecb54db219911d8c69afe8ba892 | [
"BSD-3-Clause"
] | 98 | 2015-04-15T14:57:33.000Z | 2022-03-08T05:20:36.000Z | Categories/Topos.agda | p-pavel/categories | e41aef56324a9f1f8cf3cd30b2db2f73e01066f2 | [
"BSD-3-Clause"
] | 19 | 2015-05-23T06:47:10.000Z | 2019-08-09T16:31:40.000Z | Categories/Topos.agda | p-pavel/categories | e41aef56324a9f1f8cf3cd30b2db2f73e01066f2 | [
"BSD-3-Clause"
] | 23 | 2015-02-05T13:03:09.000Z | 2021-11-11T13:50:56.000Z | module Categories.Topos where
| 15 | 29 | 0.866667 |
23f2816284495c7828793df5804b81a580c84e57 | 7,732 | agda | Agda | README/DependentlyTyped/NBE.agda | nad/dependently-typed-syntax | 498f8aefc570f7815fd1d6616508eeb92c52abce | [
"MIT"
] | 5 | 2020-04-16T12:14:44.000Z | 2020-07-08T22:51:36.000Z | README/DependentlyTyped/NBE.agda | nad/dependently-typed-syntax | 498f8aefc570f7815fd1d6616508eeb92c52abce | [
"MIT"
] | null | null | null | README/DependentlyTyped/NBE.agda | nad/dependently-typed-syntax | 498f8aefc570f7815fd1d6616508eeb92c52abce | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- Normalisation by evaluation
------------------------------------------------------------------------
import Axiom.Extensionality.Propositional as E
import Level
open import Data.Universe
-- The code makes use of the assumption that propositio... | 35.46789 | 125 | 0.474392 |
4a6e719d59c1cdf7109b53da90597f880b8bcb25 | 1,483 | agda | Agda | notes/FOT/FOTC/Program/Mirror/Induction/InductionPrinciples.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 11 | 2015-09-03T20:53:42.000Z | 2021-09-12T16:09:54.000Z | notes/FOT/FOTC/Program/Mirror/Induction/InductionPrinciples.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 2 | 2016-10-12T17:28:16.000Z | 2017-01-01T14:34:26.000Z | notes/FOT/FOTC/Program/Mirror/Induction/InductionPrinciples.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 3 | 2016-09-19T14:18:30.000Z | 2018-03-14T08:50:00.000Z | ------------------------------------------------------------------------------
-- Induction principles for Tree and Forest
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polym... | 37.075 | 78 | 0.47269 |
d0c0673d7807830d72daa03b51cea3fc559f057b | 326 | agda | Agda | README.agda | jonaprieto/agda-prop | a1730062a6aaced2bb74878c1071db06477044ae | [
"MIT"
] | 13 | 2017-05-01T16:45:41.000Z | 2022-01-17T03:33:12.000Z | README.agda | jonaprieto/agda-prop | a1730062a6aaced2bb74878c1071db06477044ae | [
"MIT"
] | 18 | 2017-03-08T14:33:10.000Z | 2017-12-18T16:34:21.000Z | README.agda | jonaprieto/agda-prop | a1730062a6aaced2bb74878c1071db06477044ae | [
"MIT"
] | 2 | 2017-03-30T16:41:56.000Z | 2017-12-01T17:01:25.000Z | open import Data.Nat using ( ℕ )
module README ( n : ℕ ) where
------------------------------------------------------------------------------
-- Agda-Prop Library.
-- Deep Embedding for Propositional Logic.
------------------------------------------------------------------------------
open import Data.PropFormula n ... | 32.6 | 78 | 0.377301 |
dc90a3f57fee49eafa8283522ef59dee01f7b1d5 | 2,216 | agda | Agda | Syntax/Implication.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | Syntax/Implication.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | Syntax/Implication.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | -- Example:
-- postulate ℓ : Lvl.Level
-- postulate A B C D : Type{ℓ}
-- postulate a : A
-- postulate ab : A → B
-- postulate bc : B → C
-- postulate cd : C → D
--
-- ad : A → D
-- ad =
-- A ⇒-[ ab ]
-- B ⇒-[ bc ]
-- C ⇒-[ cd ]
-- D ⇒-end
--
-- d : D
-- d =
-- a ⇒
-- A ⇒-[ ab... | 26.698795 | 140 | 0.466606 |
230a2144d37701d0bd970977aae5530d7fda0f97 | 8,258 | agda | Agda | LibraBFT/Abstract/Records.agda | oracle/bft-consensus-agda | 49f8b1b70823be805d84ffc3157c3b880edb1e92 | [
"UPL-1.0"
] | 4 | 2020-12-16T19:43:41.000Z | 2021-12-18T19:24:05.000Z | LibraBFT/Abstract/Records.agda | oracle/bft-consensus-agda | 49f8b1b70823be805d84ffc3157c3b880edb1e92 | [
"UPL-1.0"
] | 72 | 2021-02-04T05:04:33.000Z | 2022-03-25T05:36:11.000Z | LibraBFT/Abstract/Records.agda | oracle/bft-consensus-agda | 49f8b1b70823be805d84ffc3157c3b880edb1e92 | [
"UPL-1.0"
] | 6 | 2020-12-16T19:43:52.000Z | 2022-02-18T01:04:32.000Z | {- 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.Abstract.Types.EpochConfig
open import LibraBFT.Ba... | 32.511811 | 111 | 0.581012 |
189b4fb2aeabf0ad7fcda56f7107fe1841b0f6a6 | 10,168 | agda | Agda | src/M.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | 3 | 2020-05-21T22:58:50.000Z | 2021-09-02T17:18:15.000Z | src/M.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | null | null | null | src/M.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- M-types
------------------------------------------------------------------------
{-# OPTIONS --without-K --sized-types #-}
open import Equality
module M
{reflexive} (eq : ∀ {a p} → Equality-with-J a p reflexive) where
open import Bijectio... | 36.974545 | 139 | 0.380016 |
1c10510d44e0775ad2a859ad05a6d61731b10add | 937 | agda | Agda | notes/thesis/report/FOTC/Even.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 11 | 2015-09-03T20:53:42.000Z | 2021-09-12T16:09:54.000Z | notes/thesis/report/FOTC/Even.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 2 | 2016-10-12T17:28:16.000Z | 2017-01-01T14:34:26.000Z | notes/thesis/report/FOTC/Even.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 3 | 2016-09-19T14:18:30.000Z | 2018-03-14T08:50:00.000Z | ------------------------------------------------------------------------------
-- Even predicate
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorphism #-}
{-# OPTIONS --... | 30.225806 | 78 | 0.38207 |
104a9feaf915851e9d3b2e96d604fff0decda834 | 580 | agda | Agda | test/Succeed/Issue1592a.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 3 | 2015-03-28T14:51:03.000Z | 2015-12-07T20:14:00.000Z | test/Succeed/Issue1592a.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 3 | 2018-11-14T15:31:44.000Z | 2019-04-01T19:39:26.000Z | test/Succeed/Issue1592a.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1 | 2015-09-15T14:36:15.000Z | 2015-09-15T14:36:15.000Z | -- Andreas 2015-01-07 fixing polarity of projection-like functions
-- {-# OPTIONS -v tc.polarity:20 -v tc.proj.like:10 #-}
-- {-# OPTIONS -v tc.conv.elim:25 --show-implicit #-}
open import Common.Size
-- List covariant covariant
data List (i : Size) (A : Set) : Set where
[] : List i A
cons : ∀{j : Size< i} → A →... | 26.363636 | 66 | 0.6 |
c53c8f55165034237128f22ec9bed845fe614f4c | 403 | agda | Agda | examples/outdated-and-incorrect/lattice/Chain.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | examples/outdated-and-incorrect/lattice/Chain.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | examples/outdated-and-incorrect/lattice/Chain.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
module Chain
{ A : Set }
(_==_ : A -> A -> Set )
(refl : (x : A) -> x == x)
(trans : (x y z : A) -> x == y -> y == z -> x == z)
where
infix 2 chain>_
infixl 2 _===_
infix 3 _by_
chain>_ : (x : A) -> x == x
chain> x = refl _
_===_ : {x y z : A} -> x == y -> y == z -> x == z
xy === y... | 18.318182 | 55 | 0.369727 |
4a19b0cb190859c8676e0d731bd59ce28857d58d | 992 | agda | Agda | test/Succeed/Issue2607b.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue2607b.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue2607b.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | {-# OPTIONS --overlapping-instances #-}
postulate
Nat : Set
Fin : Nat → Set
Finnat : Nat → Set
fortytwo : Nat
finnatic : Finnat fortytwo
_==_ : Finnat fortytwo → Finnat fortytwo → Set
record Fixer : Set where
field fix : ∀ {x} → Finnat x → Finnat fortytwo
open Fixer {{...}}
postulate
Fixidentity : {{... | 23.069767 | 89 | 0.671371 |
c5ff4733926626f30baed18a671612fefd6eaf2f | 2,482 | agda | Agda | src/Categories/Object/Duality.agda | turion/agda-categories | ad0f94b6cf18d8a448b844b021aeda58e833d152 | [
"MIT"
] | 5 | 2020-10-07T12:07:53.000Z | 2020-10-10T21:41:32.000Z | src/Categories/Object/Duality.agda | turion/agda-categories | ad0f94b6cf18d8a448b844b021aeda58e833d152 | [
"MIT"
] | null | null | null | src/Categories/Object/Duality.agda | turion/agda-categories | ad0f94b6cf18d8a448b844b021aeda58e833d152 | [
"MIT"
] | 1 | 2021-11-04T06:54:45.000Z | 2021-11-04T06:54:45.000Z | {-# OPTIONS --without-K --safe #-}
open import Categories.Category
-- Properties relating Initial and Terminal Objects,
-- and Product / Coproduct via op
module Categories.Object.Duality {o ℓ e} (C : Category o ℓ e) where
open Category C
open import Level
open import Relation.Binary.PropositionalEquality as ≡ using... | 26.126316 | 101 | 0.622885 |
2356b644c5eb0850b67836a08224f03bf39b0819 | 5,125 | agda | Agda | Natural.agda | kands-code/agda-exercise | b3c9c4f678feac75af6f30d0dd941ab58b9f40dd | [
"MIT"
] | null | null | null | Natural.agda | kands-code/agda-exercise | b3c9c4f678feac75af6f30d0dd941ab58b9f40dd | [
"MIT"
] | null | null | null | Natural.agda | kands-code/agda-exercise | b3c9c4f678feac75af6f30d0dd941ab58b9f40dd | [
"MIT"
] | null | null | null | module Natural where
open import Agda.Builtin.Equality
data ℕ : Set where
zero : ℕ
suc : ℕ → ℕ
-- seven = suc (suc (suc (suc (suc (suc (suc zero))))))
{-# BUILTIN NATURAL ℕ #-}
_+_ : ℕ → ℕ → ℕ
infixl 6 _+_
zero + b = b
(suc a) + b = suc (a + b)
{-# BUILTIN NATPLUS _+_ #-}
+-id : ∀ (a : ℕ) → a + zero ≡ ze... | 24.404762 | 63 | 0.431805 |
df51a812afc788d77152c7daac1f461fedca6dce | 782 | agda | Agda | test/Succeed/Issue937.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue937.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue937.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | {-# OPTIONS --copatterns #-}
-- {-# OPTIONS -v interaction.give:20 -v tc.cc:60 -v reify.clause:60 -v tc.section.check:10 -v tc:90 #-}
-- {-# OPTIONS -v tc.lhs:20 #-}
module Issue937 where
open import Common.Equality
data Nat : Set where
zero : Nat
suc : Nat → Nat
record Σ (A : Set) (B : A → Set) : Set where
... | 20.051282 | 104 | 0.544757 |
cb71a2231d2d2b7b6e5dc8c74cb35dede9865ee2 | 12,861 | agda | Agda | Cubical/HITs/Ints/BiInvInt/Base.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | Cubical/HITs/Ints/BiInvInt/Base.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | Cubical/HITs/Ints/BiInvInt/Base.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | 1 | 2021-11-22T02:02:01.000Z | 2021-11-22T02:02:01.000Z | {-
Definition of the integers as a HIT ported from the redtt library:
https://github.com/RedPRL/redtt/blob/master/library/cool/biinv-int.red
For the naive, but incorrect, way to define the integers as a HIT, see HITs.IsoInt
This file contains:
- definition of BiInvInt
- proof that Int ≡ BiInvInt
- [discreteBiInvI... | 41.353698 | 108 | 0.479356 |
1812d3eff3ee73c3d37ba8dc96e38937fe856be2 | 4,860 | agda | Agda | PiFrac/Category.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 5 | 2020-10-07T12:07:53.000Z | 2020-10-10T21:41:32.000Z | PiFrac/Category.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | null | null | null | PiFrac/Category.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 1 | 2021-11-04T06:54:45.000Z | 2021-11-04T06:54:45.000Z | module PiFrac.Category where
open import Categories.Category.Monoidal
open import Categories.Category.Monoidal.Braided
open import Categories.Category.Monoidal.Symmetric
open import Categories.Category.Monoidal.Rigid
open import Categories.Category.Monoidal.CompactClosed
open import Categories.Functor.Bifunctor
open im... | 43.00885 | 129 | 0.445062 |
201ac71e304a024836603e6cf5326769f6145419 | 1,120 | agda | Agda | test/asset/agda-stdlib-1.0/Data/Bool/Base.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Data/Bool/Base.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Data/Bool/Base.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- The Agda standard library
--
-- The type for booleans and some operations
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Data.Bool.Base where
open import Data.Unit.Base usin... | 21.132075 | 72 | 0.485714 |
4a5a0c51cf7e76b0dfcaa2ddfe9ac8e8f9ecee2b | 349 | agda | Agda | test/fail/Issue256.agda | asr/agda-kanso | aa10ae6a29dc79964fe9dec2de07b9df28b61ed5 | [
"MIT"
] | 1 | 2019-11-27T04:41:05.000Z | 2019-11-27T04:41:05.000Z | test/fail/Issue256.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | test/fail/Issue256.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | {-# OPTIONS --universe-polymorphism #-}
module Issue256 where
open import Imports.Level
const : ∀ {a b} {A : Set a} {B : Set b} → A → B → A
const x = λ _ → x
level : ∀ {ℓ} → Set ℓ → Level
level {ℓ} _ = ℓ
-- termination check should fail for the following definition
ℓ : Level
ℓ = const zero (Set ℓ)
-- A : Set (suc... | 18.368421 | 61 | 0.598854 |
4a8264dcd0852a13c8c5775a80b9d1b898c57589 | 647 | agda | Agda | Eq.agda | brunoczim/ual | ea0260e1a0612ba581e4283dfb187f531a944dfd | [
"MIT"
] | null | null | null | Eq.agda | brunoczim/ual | ea0260e1a0612ba581e4283dfb187f531a944dfd | [
"MIT"
] | null | null | null | Eq.agda | brunoczim/ual | ea0260e1a0612ba581e4283dfb187f531a944dfd | [
"MIT"
] | null | null | null | module Ual.Eq where
open import Agda.Primitive
open import Ual.Void
record Eq {a} (A : Set a) : Set (lsuc a) where
infix 30 _==_
infix 30 _≠_
field
_==_ : A → A → Set
self : {x : A} → x == x
sym : {x y : A} → x == y → y == x
trans : {x y z : A} → x == y → y == z → x == z
_≠_ : A → A → Set... | 23.962963 | 64 | 0.469861 |
4a3c3d8917e5ebeaf1a876d64a81c495a0520bee | 1,193 | agda | Agda | public/cloc-1.82/tests/inputs/Lookup.agda | josema62/Memoria | 93ebd98095434bc76d85d3fe8f32c913ed451e43 | [
"MIT"
] | 1 | 2021-12-28T12:50:26.000Z | 2021-12-28T12:50:26.000Z | public/cloc-1.82/tests/inputs/Lookup.agda | josema62/Memoria | 93ebd98095434bc76d85d3fe8f32c913ed451e43 | [
"MIT"
] | null | null | null | public/cloc-1.82/tests/inputs/Lookup.agda | josema62/Memoria | 93ebd98095434bc76d85d3fe8f32c913ed451e43 | [
"MIT"
] | null | null | null | {-
https://raw.githubusercontent.com/agda/agda/master/examples/Lookup.agda
-}
module Lookup where
data Bool : Set where
false : Bool
true : Bool
data IsTrue : Bool -> Set where
isTrue : IsTrue true
data List (A : Set) : Set where
[] : List A
_::_ : A -> List A -> List A
data _×_ (A B : Set) : Set whe... | 22.942308 | 72 | 0.479464 |
cbf2c03f0d5ffb5042a9da359738463ad2595ba2 | 115,097 | agda | Agda | complexity/complexity-final/submit/Interp-WithLet.agda | benhuds/Agda | 2404a6ef2688f879bda89860bb22f77664ad813e | [
"MIT"
] | 2 | 2016-04-26T20:22:22.000Z | 2019-08-08T12:27:18.000Z | complexity/complexity-final/submit/Interp-WithLet.agda | benhuds/Agda | 2404a6ef2688f879bda89860bb22f77664ad813e | [
"MIT"
] | 1 | 2020-03-23T08:39:04.000Z | 2020-05-12T00:32:45.000Z | complexity/complexity-final/submit/Interp-WithLet.agda | benhuds/Agda | 2404a6ef2688f879bda89860bb22f77664ad813e | [
"MIT"
] | null | null | null | {- NEW INTERP WITHOUT RREC -}
open import Preliminaries
open import Preorder
open import Complexity
module Interp-WithLet where
-- interpret complexity types as preorders
[_]t : CTp → PREORDER
[ unit ]t = unit-p
[ nat ]t = Nat , ♭nat-p
[ τ ->c τ₁ ]t = [ τ ]t ->p [ τ₁ ]t
[ τ ×c τ₁ ]t = [ τ ]t ×p [ τ₁ ]t
... | 66.645628 | 172 | 0.510187 |
2377d1eb8d548ba65cd0f1e56248495f0bdf286a | 3,995 | agda | Agda | src/Implicits/Resolution/GenericFinite/Algorithm.agda | metaborg/ts.agda | 7fe638b87de26df47b6437f5ab0a8b955384958d | [
"MIT"
] | 4 | 2019-04-05T17:57:11.000Z | 2021-05-07T04:08:41.000Z | src/Implicits/Resolution/GenericFinite/Algorithm.agda | metaborg/ts.agda | 7fe638b87de26df47b6437f5ab0a8b955384958d | [
"MIT"
] | null | null | null | src/Implicits/Resolution/GenericFinite/Algorithm.agda | metaborg/ts.agda | 7fe638b87de26df47b6437f5ab0a8b955384958d | [
"MIT"
] | null | null | null | open import Prelude renaming (_<_ to _N<_)
module Implicits.Resolution.GenericFinite.Algorithm where
open import Induction.WellFounded
open import Induction.Nat
open import Data.Vec
open import Data.List
open import Data.Fin.Substitution
open import Data.Nat.Base using (_<′_)
open import Data.Maybe
open import Data.N... | 38.786408 | 101 | 0.614268 |
cbfd8af310ac7adbb38daa45aa5038b64fa18b41 | 246 | agda | Agda | Inductive/Examples/Unit.agda | mr-ohman/general-induction | dc157acda597a2c758e82b5637e4fd6717ccec3f | [
"MIT"
] | null | null | null | Inductive/Examples/Unit.agda | mr-ohman/general-induction | dc157acda597a2c758e82b5637e4fd6717ccec3f | [
"MIT"
] | null | null | null | Inductive/Examples/Unit.agda | mr-ohman/general-induction | dc157acda597a2c758e82b5637e4fd6717ccec3f | [
"MIT"
] | null | null | null | module Inductive.Examples.Unit where
open import Inductive
open import Tuple
open import Data.Fin
open import Data.Product
open import Data.List
open import Data.Vec
⊤ : Set
⊤ = Inductive (([] , []) ∷ [])
unit : ⊤
unit = construct zero [] []
| 15.375 | 36 | 0.699187 |
4a1572d181db3826c806c2a2ad2ad68df8aca789 | 444 | agda | Agda | test/Fail/Issue1209-4.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/Issue1209-4.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/Issue1209-4.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | {-# OPTIONS --safe --no-sized-types #-}
open import Agda.Builtin.Size
record Stream (A : Set) (i : Size) : Set where
coinductive
field
head : A
tail : {j : Size< i} → Stream A j
open Stream
destroy-guardedness : ∀ {A i} → Stream A i → Stream A i
destroy-guardedness xs .head = xs .head
destroy-guardednes... | 22.2 | 55 | 0.646396 |
cb42725ccb89e4e1ee0f6e590e1610bcc6f8d9bb | 1,121 | agda | Agda | src/fot/LTC-PCF/Base/Properties.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 11 | 2015-09-03T20:53:42.000Z | 2021-09-12T16:09:54.000Z | src/fot/LTC-PCF/Base/Properties.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 2 | 2016-10-12T17:28:16.000Z | 2017-01-01T14:34:26.000Z | src/fot/LTC-PCF/Base/Properties.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 3 | 2016-09-19T14:18:30.000Z | 2018-03-14T08:50:00.000Z | ------------------------------------------------------------------------------
-- LTC-PCF terms properties
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorphism #-}
{-# ... | 29.5 | 78 | 0.409456 |
1027768d379b3561dbba2677335e95106e5f7b27 | 4,792 | agda | Agda | agda/BBHeap/Insert.agda | bgbianchi/sorting | b8d428bccbdd1b13613e8f6ead6c81a8f9298399 | [
"MIT"
] | 6 | 2015-05-21T12:50:35.000Z | 2021-08-24T22:11:15.000Z | agda/BBHeap/Insert.agda | bgbianchi/sorting | b8d428bccbdd1b13613e8f6ead6c81a8f9298399 | [
"MIT"
] | null | null | null | agda/BBHeap/Insert.agda | bgbianchi/sorting | b8d428bccbdd1b13613e8f6ead6c81a8f9298399 | [
"MIT"
] | null | null | null | open import Relation.Binary.Core
module BBHeap.Insert {A : Set}
(_≤_ : A → A → Set)
(tot≤ : Total _≤_)
(trans≤ : Transitive _≤_) where
open import BBHeap _≤_
open import BBHeap.Properties _≤_
open import BBHeap.Subtyping.Properties _≤_ trans≤
open import Bound.... | 55.72093 | 177 | 0.501461 |
2042b2c14737b7d571ace0e3f5c55332746b30f7 | 1,692 | agda | Agda | archive/agda-3/src/Oscar/Class/Surjidentity.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null | archive/agda-3/src/Oscar/Class/Surjidentity.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | 1 | 2019-04-29T00:35:04.000Z | 2019-05-11T23:33:04.000Z | archive/agda-3/src/Oscar/Class/Surjidentity.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null |
open import Oscar.Prelude
open import Oscar.Class
open import Oscar.Class.Surjection
open import Oscar.Class.Smap
open import Oscar.Class.Reflexivity
open import Oscar.Data.Proposequality
module Oscar.Class.Surjidentity where
module _
{𝔬₁ 𝔯₁ 𝔬₂ 𝔯₂ ℓ₂}
{𝔒₁ : Ø 𝔬₁}
{𝔒₂ : Ø 𝔬₂}
where
module Surjidenti... | 31.333333 | 131 | 0.518913 |
4aad91ece69147364b6845da78b574b39ebf2330 | 947 | agda | Agda | Lists/Concat.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 4 | 2019-08-08T12:44:19.000Z | 2022-01-28T06:04:15.000Z | Lists/Concat.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 14 | 2019-01-06T21:11:59.000Z | 2020-04-11T11:03:39.000Z | Lists/Concat.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 LogicalFormulae
open import Lists.Definition
open import Lists.Length
open import Numbers.Naturals.Semiring
module Lists.Concat where
appendEmptyList : {a : _} → {A : Set a} → (l : List A) → (l ++ [] ≡ l)
appendEmptyList [] = refl
appendEmptyList (x :: l... | 37.88 | 114 | 0.596621 |
39c25590e7a8d0f7797cc77b259e18d825464ec3 | 11,197 | agda | Agda | theorems/homotopy/VanKampen.agda | mikeshulman/HoTT-Agda | e7d663b63d89f380ab772ecb8d51c38c26952dbb | [
"MIT"
] | null | null | null | theorems/homotopy/VanKampen.agda | mikeshulman/HoTT-Agda | e7d663b63d89f380ab772ecb8d51c38c26952dbb | [
"MIT"
] | null | null | null | theorems/homotopy/VanKampen.agda | mikeshulman/HoTT-Agda | e7d663b63d89f380ab772ecb8d51c38c26952dbb | [
"MIT"
] | 1 | 2018-12-26T21:31:57.000Z | 2018-12-26T21:31:57.000Z | {-# OPTIONS --without-K --rewriting #-}
open import HoTT
import homotopy.RelativelyConstantToSetExtendsViaSurjection as SurjExt
module homotopy.VanKampen {i j k l}
(span : Span {i} {j} {k})
{D : Type l} (h : D → Span.C span) (h-is-surj : is-surj h) where
open Span span
open import homotopy.vankampen.CodeAP s... | 51.837963 | 139 | 0.504599 |
18486bc200479d8da5769c7bd1616519d0f1bd7d | 2,946 | agda | Agda | src/Web/Semantic/DL/Category/Properties/Composition/RespectsWiring.agda | agda/agda-web-semantic | 8ddbe83965a616bff6fc7a237191fa261fa78bab | [
"MIT"
] | 9 | 2015-09-13T17:46:41.000Z | 2020-03-14T14:21:08.000Z | src/Web/Semantic/DL/Category/Properties/Composition/RespectsWiring.agda | bblfish/agda-web-semantic | 38fbc3af7062ba5c3d7d289b2b4bcfb995d99057 | [
"MIT"
] | 4 | 2018-11-14T02:32:28.000Z | 2021-01-04T20:57:19.000Z | src/Web/Semantic/DL/Category/Properties/Composition/RespectsWiring.agda | bblfish/agda-web-semantic | 38fbc3af7062ba5c3d7d289b2b4bcfb995d99057 | [
"MIT"
] | 3 | 2017-12-03T14:52:09.000Z | 2022-03-12T11:40:03.000Z | open import Data.Product using ( proj₁ ; proj₂ )
open import Relation.Binary.PropositionalEquality using ( _≡_ ; sym ; cong )
open import Relation.Unary using ( _⊆_ )
open import Web.Semantic.DL.ABox using ( ABox ; ⟨ABox⟩ ; Assertions )
open import Web.Semantic.DL.ABox.Interp using ( ⌊_⌋ ; ind )
open import Web.Semanti... | 43.323529 | 79 | 0.580109 |
2331b6e54529447e807efcc1cd97f23d2cd80ae7 | 3,349 | agda | Agda | Cubical/Experiments/IntegerMatrix.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | 1 | 2021-10-31T17:32:49.000Z | 2021-10-31T17:32:49.000Z | Cubical/Experiments/IntegerMatrix.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | Cubical/Experiments/IntegerMatrix.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | {-
Normalize Integer Matrices
-}
{-# OPTIONS --safe #-}
module Cubical.Experiments.IntegerMatrix where
open import Cubical.Foundations.Prelude
open import Cubical.Data.Nat
open import Cubical.Data.Int
open import Cubical.Data.FinData
open import Cubical.Data.List
open import Cubical.Algebra.CommRing
open import C... | 22.326667 | 73 | 0.681696 |
dff9f50b3ab5808f51b017dda63a1408f284979f | 7,225 | agda | Agda | src/Data/Fin/Subset/Properties/Cardinality.agda | tizmd/agda-finitary | abacd166f63582b7395d9cc10b6323c0f69649e5 | [
"MIT"
] | null | null | null | src/Data/Fin/Subset/Properties/Cardinality.agda | tizmd/agda-finitary | abacd166f63582b7395d9cc10b6323c0f69649e5 | [
"MIT"
] | null | null | null | src/Data/Fin/Subset/Properties/Cardinality.agda | tizmd/agda-finitary | abacd166f63582b7395d9cc10b6323c0f69649e5 | [
"MIT"
] | null | null | null | module Data.Fin.Subset.Properties.Cardinality where
open import Data.Nat as ℕ using (ℕ)
open import Data.Nat.Properties as NP
open import Data.Empty using (⊥-elim)
open import Data.Fin
open import Data.Fin.Subset
open import Data.Fin.Subset.Properties
open import Data.Vec using (_∷_; [])
open import Data.Vec.Any usi... | 41.763006 | 141 | 0.424913 |
10380419b26b51991cebef1380a603d499af5036 | 2,607 | agda | Agda | src/Web/Semantic/Everything.agda | agda/agda-web-semantic | 8ddbe83965a616bff6fc7a237191fa261fa78bab | [
"MIT"
] | 9 | 2015-09-13T17:46:41.000Z | 2020-03-14T14:21:08.000Z | src/Web/Semantic/Everything.agda | bblfish/agda-web-semantic | 38fbc3af7062ba5c3d7d289b2b4bcfb995d99057 | [
"MIT"
] | 4 | 2018-11-14T02:32:28.000Z | 2021-01-04T20:57:19.000Z | src/Web/Semantic/Everything.agda | bblfish/agda-web-semantic | 38fbc3af7062ba5c3d7d289b2b4bcfb995d99057 | [
"MIT"
] | 3 | 2017-12-03T14:52:09.000Z | 2022-03-12T11:40:03.000Z | -- A module which imports every Web.Semantic module.
module Web.Semantic.Everything where
import Web.Semantic.DL.ABox
import Web.Semantic.DL.ABox.Interp
import Web.Semantic.DL.ABox.Interp.Meet
import Web.Semantic.DL.ABox.Interp.Morphism
import Web.Semantic.DL.ABox.Model
import Web.Semantic.DL.ABox.Skolemization
impor... | 42.737705 | 69 | 0.853088 |
20a905348f3d5a6cde748e27c16c25f7e8915734 | 149 | agda | Agda | test/fail/AgdalightTelescopeSyntax.agda | asr/agda-kanso | aa10ae6a29dc79964fe9dec2de07b9df28b61ed5 | [
"MIT"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | test/fail/AgdalightTelescopeSyntax.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | test/fail/AgdalightTelescopeSyntax.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | module AgdalightTelescopeSyntax where
postulate
A : Set
B : A -> Set
g : (x y : A; z : B x) -> A
-- this is Agdalight syntax, should not parse | 21.285714 | 45 | 0.644295 |
d0b56f25578c1af6c0970e5f5660198eb27d2a93 | 911 | agda | Agda | archive/agda-3/src/Test/UnifiesSubstitunction.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null | archive/agda-3/src/Test/UnifiesSubstitunction.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | 1 | 2019-04-29T00:35:04.000Z | 2019-05-11T23:33:04.000Z | archive/agda-3/src/Test/UnifiesSubstitunction.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null |
open import Everything
module Test.UnifiesSubstitunction {𝔭} (𝔓 : Ø 𝔭) where
open Substitunction 𝔓
open Term 𝔓
open Substitist 𝔓
≡-Unifies₀-Term : ∀ {m} → Term m → Term m → Ṗroperty ∅̂ (Arrow Fin Term m)
≡-Unifies₀-Term = ≡-surjcollation
≡-Unifies₀-Term' : ∀ {m} → Term m → Term m → Ṗroperty ∅̂ ... | 37.958333 | 136 | 0.675082 |
180afb6f3a8b171701d088ac389396a55f659ab1 | 14,572 | agda | Agda | Cubical/Categories/Constructions/Slice.agda | maxdore/cubical | ef62b84397396d48135d73ba7400b71c721ddc94 | [
"MIT"
] | null | null | null | Cubical/Categories/Constructions/Slice.agda | maxdore/cubical | ef62b84397396d48135d73ba7400b71c721ddc94 | [
"MIT"
] | null | null | null | Cubical/Categories/Constructions/Slice.agda | maxdore/cubical | ef62b84397396d48135d73ba7400b71c721ddc94 | [
"MIT"
] | 1 | 2021-03-12T20:08:45.000Z | 2021-03-12T20:08:45.000Z | {-# OPTIONS --safe #-}
open import Cubical.Categories.Category
open import Cubical.Categories.Morphism renaming (isIso to isIsoC)
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Isomorphism
open import Cubical.Foundations.Equiv
open Iso
open import Cubical.Foundations.HLevels
open Precategory
o... | 37.947917 | 126 | 0.522372 |
dc3f0d4782fc14c1cd3b9eb176646641c903aee7 | 5,833 | agda | Agda | src/FOmegaInt/Typing/Inversion.agda | Blaisorblade/f-omega-int-agda | ae20dac2a5e0c18dff2afda4c19954e24d73a24f | [
"MIT"
] | 12 | 2017-06-13T16:05:35.000Z | 2021-09-27T05:53:06.000Z | src/FOmegaInt/Typing/Inversion.agda | Blaisorblade/f-omega-int-agda | ae20dac2a5e0c18dff2afda4c19954e24d73a24f | [
"MIT"
] | 1 | 2021-05-14T08:09:40.000Z | 2021-05-14T08:54:39.000Z | src/FOmegaInt/Typing/Inversion.agda | Blaisorblade/f-omega-int-agda | ae20dac2a5e0c18dff2afda4c19954e24d73a24f | [
"MIT"
] | 2 | 2021-05-13T22:29:48.000Z | 2021-05-14T10:25:05.000Z | ------------------------------------------------------------------------
-- Inversion of (sub)typing in Fω with interval kinds
------------------------------------------------------------------------
{-# OPTIONS --safe --without-K #-}
module FOmegaInt.Typing.Inversion where
open import Data.Product using (_,_; proj₁... | 42.268116 | 80 | 0.454655 |
1c500609e4d4316c507da27fe4f65329ee7d750c | 2,638 | agda | Agda | nicolai/pseudotruncations/pointed-O-Sphere.agda | nicolaikraus/HoTT-Agda | 939a2d83e090fcc924f69f7dfa5b65b3b79fe633 | [
"MIT"
] | 1 | 2021-06-30T00:17:55.000Z | 2021-06-30T00:17:55.000Z | nicolai/pseudotruncations/pointed-O-Sphere.agda | nicolaikraus/HoTT-Agda | 939a2d83e090fcc924f69f7dfa5b65b3b79fe633 | [
"MIT"
] | null | null | null | nicolai/pseudotruncations/pointed-O-Sphere.agda | nicolaikraus/HoTT-Agda | 939a2d83e090fcc924f69f7dfa5b65b3b79fe633 | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K #-}
open import lib.Basics
open import lib.NType2
open import lib.PathGroupoid
open import lib.types.Bool
open import lib.types.IteratedSuspension
open import lib.types.Lift
open import lib.types.LoopSpace
open import lib.types.Nat
open import lib.types.Paths
open import lib.types.Pi
open impo... | 31.035294 | 86 | 0.543215 |
dc2e62faae68467252b56000acc7ddcbdcdc801f | 1,297 | agda | Agda | LibraBFT/Impl/Consensus/ChainedBFT/EventProcessor/Properties.agda | haroldcarr/bft-consensus-agda | 34e4627855fb198665d0c98f377403a906ba75d7 | [
"UPL-1.0"
] | null | null | null | LibraBFT/Impl/Consensus/ChainedBFT/EventProcessor/Properties.agda | haroldcarr/bft-consensus-agda | 34e4627855fb198665d0c98f377403a906ba75d7 | [
"UPL-1.0"
] | null | null | null | LibraBFT/Impl/Consensus/ChainedBFT/EventProcessor/Properties.agda | haroldcarr/bft-consensus-agda | 34e4627855fb198665d0c98f377403a906ba75d7 | [
"UPL-1.0"
] | null | null | null | {- 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
-}
-- This module contains properties that are only about the behavior of the ha... | 40.53125 | 111 | 0.737857 |
c5d1d8a5c7048a2269ad44c6867cd7b42563c4eb | 39,444 | agda | Agda | combinations-of-lift-and-list.agda | Saizan/Agda-proofs | add34af6c5c0c106c7aaa2d9612d54e041ab5d3b | [
"MIT"
] | null | null | null | combinations-of-lift-and-list.agda | Saizan/Agda-proofs | add34af6c5c0c106c7aaa2d9612d54e041ab5d3b | [
"MIT"
] | null | null | null | combinations-of-lift-and-list.agda | Saizan/Agda-proofs | add34af6c5c0c106c7aaa2d9612d54e041ab5d3b | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --guarded -W ignore #-}
module combinations-of-lift-and-list where
open import Clocked.Primitives
open import Cubical.Foundations.Prelude
open import Cubical.Data.List as List
open import Cubical.Data.List.Properties
open import Cubical.Data.Sum using (_⊎_; inl; inr)
--**************************... | 59.225225 | 179 | 0.461946 |
dc8845e48846199c7c070ff87390e0316080a65d | 475 | agda | Agda | test/interaction/Issue1523.agda | cagix/agda | cc026a6a97a3e517bb94bafa9d49233b067c7559 | [
"BSD-2-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/interaction/Issue1523.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/interaction/Issue1523.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2015-07-22 Fixed bug in test for empty type of sizes
{-# OPTIONS --copatterns --sized-types #-}
open import Common.Size
record U (i : Size) : Set where
coinductive
field out : (j : Size< i) → U j
open U
fixU : {A : Size → Set} (let C = λ i → A i → U i)
→ ∀ i (f : ∀ i → (∀ (j : Size< i) → C j) → C... | 27.941176 | 77 | 0.583158 |
20be4f0630f18af1ca5786bcecfc58203b373d8f | 545 | agda | Agda | test/Succeed/Issue2329.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 3 | 2015-03-28T14:51:03.000Z | 2015-12-07T20:14:00.000Z | test/Succeed/Issue2329.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 3 | 2018-11-14T15:31:44.000Z | 2019-04-01T19:39:26.000Z | test/Succeed/Issue2329.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1 | 2015-09-15T14:36:15.000Z | 2015-09-15T14:36:15.000Z | -- Andreas, 2017-01-20, issue #2329
-- Neutral sizes cannot be used by the size solver,
-- thus, should be handled by coerceSize.
-- {-# OPTIONS -v tc:10 #-}
-- {-# OPTIONS -v tc.conv.coerce:20 #-}
-- {-# OPTIONS -v tc.size:20 #-}
-- {-# OPTIONS -v tc.size.solve:50 #-}
open import Agda.Builtin.Size
record R (i : Si... | 18.793103 | 51 | 0.565138 |
20c5c2889eb20637c3f055250391b58e4596de46 | 1,556 | agda | Agda | src/Dodo/Binary/Maximal.agda | sourcedennis/agda-dodo | 376f0ccee1e1aa31470890e494bcb534324f598a | [
"BSD-3-Clause"
] | null | null | null | src/Dodo/Binary/Maximal.agda | sourcedennis/agda-dodo | 376f0ccee1e1aa31470890e494bcb534324f598a | [
"BSD-3-Clause"
] | null | null | null | src/Dodo/Binary/Maximal.agda | sourcedennis/agda-dodo | 376f0ccee1e1aa31470890e494bcb534324f598a | [
"BSD-3-Clause"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
module Dodo.Binary.Maximal where
-- Stdlib imports
open import Level using (Level; _⊔_)
open import Function using (_∘_)
open import Data.Product using (_,_; ∃-syntax)
open import Data.Empty using (⊥-elim)
open import Relation.Nullary using (¬_)
open import Relation.Unary ... | 29.358491 | 75 | 0.568123 |
18a60b11fa16fcabeb708d228c01e7a98ed194a1 | 643 | agda | Agda | test/succeed/ListsWithIrrelevantProofs.agda | masondesu/agda | 70c8a575c46f6a568c7518150a1a64fcd03aa437 | [
"MIT"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | test/succeed/ListsWithIrrelevantProofs.agda | masondesu/agda | 70c8a575c46f6a568c7518150a1a64fcd03aa437 | [
"MIT"
] | null | null | null | test/succeed/ListsWithIrrelevantProofs.agda | masondesu/agda | 70c8a575c46f6a568c7518150a1a64fcd03aa437 | [
"MIT"
] | null | null | null | module ListsWithIrrelevantProofs where
data _≡_ {A : Set}(a : A) : A → Set where
refl : a ≡ a
data ℕ : Set where
zero : ℕ
suc : ℕ → ℕ
{-# BUILTIN NATURAL ℕ #-}
postulate
_≤_ : ℕ → ℕ → Set
p1 : 0 ≤ 1
p2 : 0 ≤ 1
-- descending lists indexed by upper bound for largest element
data SList (bound : ℕ) ... | 16.921053 | 78 | 0.570762 |
0e905285b1628b873b394f7585c4df4e70aaaff8 | 6,349 | agda | Agda | Languages/Stream.agda | hbasold/Sandbox | 8fc7a6cd878f37f9595124ee8dea62258da28aa4 | [
"MIT"
] | null | null | null | Languages/Stream.agda | hbasold/Sandbox | 8fc7a6cd878f37f9595124ee8dea62258da28aa4 | [
"MIT"
] | null | null | null | Languages/Stream.agda | hbasold/Sandbox | 8fc7a6cd878f37f9595124ee8dea62258da28aa4 | [
"MIT"
] | null | null | null | {-# OPTIONS --copatterns --sized-types #-}
open import Level as Level using (zero)
open import Size
open import Function
open import Relation.Binary
open import Relation.Binary.PropositionalEquality as P
open ≡-Reasoning
open import Data.List using (List; module List; []; _∷_; _++_; length)
open import Data.Nat using... | 29.668224 | 87 | 0.54607 |
df43bde3501cf4582ae0edb2d98581adf0873da0 | 131 | agda | Agda | test/Fail/Issue216.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/Issue216.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/Issue216.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
-- Should fail with S i != i
module Issue216 where
open import Common.Level
Foo : {i : Level} → Set i
Foo {i} = (R : Set i) → R
| 14.555556 | 28 | 0.610687 |
39115d30831d7d1ea9dba4096d9dd27b3937a031 | 5,296 | agda | Agda | Chapter3/Formalization.agda | CodaFi/HoTT-Exercises | 3411b253b0a49a5f9c3301df175ae8ecdc563b12 | [
"MIT"
] | null | null | null | Chapter3/Formalization.agda | CodaFi/HoTT-Exercises | 3411b253b0a49a5f9c3301df175ae8ecdc563b12 | [
"MIT"
] | null | null | null | Chapter3/Formalization.agda | CodaFi/HoTT-Exercises | 3411b253b0a49a5f9c3301df175ae8ecdc563b12 | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K #-}
module Chapter3.Formalization where
-- Sets and n-types
-- ----------------
open import Data.Unit
open import Data.Empty
open import Data.Nat
open import Data.Sum
open import Relation.Nullary using (¬_)
open import Data.Bool
open import Data.Product
open import Basics
open import Relation... | 31.337278 | 122 | 0.51926 |
c573dbad1d832f5089982df95bc455a8cea47bf9 | 9,110 | agda | Agda | Sets/IterativeSet/Oper/Proofs.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | Sets/IterativeSet/Oper/Proofs.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | Sets/IterativeSet/Oper/Proofs.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | module Sets.IterativeSet.Oper.Proofs where
import Lvl
open import Data
open import Data.Boolean
open import Data.Boolean.Stmt
open import Data.Either as Either using (_‖_)
open import Data.Tuple as Tuple using ()
open import Functional
open import Logic
open import Logic.Propositional
open import Logic.Predicate
... | 64.15493 | 190 | 0.554007 |
399682558c63730eef0bf55acf28a4d523daeb5e | 253 | agda | Agda | test/Succeed/Issue5683.agda | MxmUrw/agda | 6ede01fa854c5472e54f7d1799ca2c08ed316129 | [
"BSD-2-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue5683.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue5683.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
open import Agda.Builtin.Equality
open import Agda.Builtin.Sigma
postulate X : Set
variable x : X
data C : Σ X (λ x → x ≡ x) → Set where
mkC :
let
eq : x ≡ x -- don't generalize over x at eq
eq = refl {x = x}
in
C (x , eq)
| 16.866667 | 50 | 0.56917 |
dcfacdeee67a710d81c1876827ffeac891055452 | 2,582 | agda | Agda | Categories/Support/EqReasoning.agda | p-pavel/categories | e41aef56324a9f1f8cf3cd30b2db2f73e01066f2 | [
"BSD-3-Clause"
] | 1 | 2018-12-29T21:51:57.000Z | 2018-12-29T21:51:57.000Z | Categories/Support/EqReasoning.agda | p-pavel/categories | e41aef56324a9f1f8cf3cd30b2db2f73e01066f2 | [
"BSD-3-Clause"
] | null | null | null | Categories/Support/EqReasoning.agda | p-pavel/categories | e41aef56324a9f1f8cf3cd30b2db2f73e01066f2 | [
"BSD-3-Clause"
] | null | null | null | {-# OPTIONS --universe-polymorphism #-}
module Categories.Support.EqReasoning where
open import Categories.Support.Equivalence using (Setoid; module Setoid)
open import Relation.Binary.PropositionalEquality using () renaming (_≡_ to _≣_; trans to ≣-trans; sym to ≣-sym; refl to ≣-refl)
module SetoidReasoning {s₁ s₂} (... | 30.738095 | 128 | 0.60031 |
4a213ae0825e64637c78b95b88109a1bfb08ea1f | 269 | agda | Agda | archive/agda-1/PredicateName.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null | archive/agda-1/PredicateName.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | 1 | 2019-04-29T00:35:04.000Z | 2019-05-11T23:33:04.000Z | archive/agda-1/PredicateName.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null |
module PredicateName where
open import OscarPrelude
record PredicateName : Set
where
constructor ⟨_⟩
field
name : Nat
open PredicateName public
instance EqPredicateName : Eq PredicateName
Eq._==_ EqPredicateName _ = decEq₁ (cong name) ∘ (_≟_ on name $ _)
| 16.8125 | 66 | 0.747212 |
185e892390ce8b46d5a343286bffdfc5cc843fdf | 1,445 | agda | Agda | agda-stdlib-0.9/src/Data/Conat.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/Conat.agda | qwe2/try-agda | 9d4c43b1609d3f085636376fdca73093481ab882 | [
"Apache-2.0"
] | null | null | null | agda-stdlib-0.9/src/Data/Conat.agda | qwe2/try-agda | 9d4c43b1609d3f085636376fdca73093481ab882 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Coinductive "natural" numbers
------------------------------------------------------------------------
module Data.Conat where
open import Coinduction
open import Data.Nat using (ℕ; zero; suc)
open import Relat... | 22.230769 | 72 | 0.393772 |
d054d023aa191431255484b87b08432dfbccd32f | 5,818 | agda | Agda | Cubical/Reflection/RecordEquiv.agda | L-TChen/cubical | 60226aacd7b386aef95d43a0c29c4eec996348a8 | [
"MIT"
] | null | null | null | Cubical/Reflection/RecordEquiv.agda | L-TChen/cubical | 60226aacd7b386aef95d43a0c29c4eec996348a8 | [
"MIT"
] | null | null | null | Cubical/Reflection/RecordEquiv.agda | L-TChen/cubical | 60226aacd7b386aef95d43a0c29c4eec996348a8 | [
"MIT"
] | null | null | null | {-
Reflection-based tools for converting between iterated record types, particularly between
record types and iterated Σ-types. Currently requires eta equality.
See end of file for examples.
-}
{-# OPTIONS --cubical --no-import-sorts --no-exact-split --safe #-}
module Cubical.Reflection.RecordEquiv where
open... | 29.532995 | 97 | 0.623926 |
231a43654a6cd07684fac0cbc45573f79f9f058d | 1,717 | agda | Agda | src/Algebra.agda | asr/alga | 01f5f9f53ea81f692215300744aa77e26d8bf332 | [
"MIT"
] | null | null | null | src/Algebra.agda | asr/alga | 01f5f9f53ea81f692215300744aa77e26d8bf332 | [
"MIT"
] | null | null | null | src/Algebra.agda | asr/alga | 01f5f9f53ea81f692215300744aa77e26d8bf332 | [
"MIT"
] | null | null | null | module Algebra where
-- Core graph construction primitives
data Graph (A : Set) : Set where
ε : Graph A -- Empty graph
v : A -> Graph A -- Graph comprising a single vertex
_+_ : Graph A -> Graph A -> Graph A -- Overlay two graphs
_*_ : Graph A -> Graph A -> Gr... | 38.155556 | 85 | 0.45661 |
df2673785dc63ce8d945613da1ed98346a036562 | 1,833 | agda | Agda | src/Tactic/Nat/Coprime.agda | jespercockx/agda-prelude | 1984cf0341835b2f7bfe678098bd57cfe16ea11f | [
"MIT"
] | null | null | null | src/Tactic/Nat/Coprime.agda | jespercockx/agda-prelude | 1984cf0341835b2f7bfe678098bd57cfe16ea11f | [
"MIT"
] | null | null | null | src/Tactic/Nat/Coprime.agda | jespercockx/agda-prelude | 1984cf0341835b2f7bfe678098bd57cfe16ea11f | [
"MIT"
] | null | null | null | -- Tactic for proving coprimality.
-- Finds Coprime hypotheses in the context.
module Tactic.Nat.Coprime where
import Agda.Builtin.Nat as Builtin
open import Prelude
open import Control.Monad.Zero
open import Control.Monad.State
open import Container.List
open import Container.Traversable
open import Numeric.Nat
open... | 31.067797 | 87 | 0.624659 |
cb79f55a2d3744378695aa7f2e1e215003fb792a | 8,899 | agda | Agda | LibraBFT/Base/PKCS.agda | lisandrasilva/bft-consensus-agda-1 | b7dd98dd90d98fbb934ef8cb4f3314940986790d | [
"UPL-1.0"
] | null | null | null | LibraBFT/Base/PKCS.agda | lisandrasilva/bft-consensus-agda-1 | b7dd98dd90d98fbb934ef8cb4f3314940986790d | [
"UPL-1.0"
] | null | null | null | LibraBFT/Base/PKCS.agda | lisandrasilva/bft-consensus-agda-1 | b7dd98dd90d98fbb934ef8cb4f3314940986790d | [
"UPL-1.0"
] | null | null | null | {- Byzantine Fault Tolerant Consensus Verification in Agda, version 0.9.
Copyright (c) 2020 Oracle and/or its affiliates.
Licensed under the Universal Permissive License v 1.0 as shown at https://opensource.oracle.com/licenses/upl
-}
open import LibraBFT.Lemmas
open import LibraBFT.Prelude
open import LibraBFT.B... | 40.085586 | 117 | 0.605461 |
20bea768640f454fa95cdebb541ab888f150597e | 4,342 | agda | Agda | Cubical/Algebra/CommAlgebra/Instances/Initial.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | 1 | 2021-10-31T17:32:49.000Z | 2021-10-31T17:32:49.000Z | Cubical/Algebra/CommAlgebra/Instances/Initial.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | Cubical/Algebra/CommAlgebra/Instances/Initial.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | {-# OPTIONS --safe #-}
module Cubical.Algebra.CommAlgebra.Instances.Initial where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Isomorphism
open import Cubical.Data.Unit
open import Cubical.Data.Sigma.Properties using (Σ≡Prop)
open import Cubical.Alge... | 35.300813 | 103 | 0.523722 |
c5c44d871f2af5567964f8225d192ff69831c6c1 | 11,413 | agda | Agda | src/data/lib/prim/Agda/Builtin/Reflection.agda | m-yac/agda | 2ad3956cf0fa043eaf87f6b1f34633995e658a1a | [
"BSD-3-Clause"
] | 1 | 2016-05-20T13:58:52.000Z | 2016-05-20T13:58:52.000Z | src/data/lib/prim/Agda/Builtin/Reflection.agda | m-yac/agda | 2ad3956cf0fa043eaf87f6b1f34633995e658a1a | [
"BSD-3-Clause"
] | 1 | 2015-09-15T15:49:15.000Z | 2015-09-15T15:49:15.000Z | src/data/lib/prim/Agda/Builtin/Reflection.agda | m-yac/agda | 2ad3956cf0fa043eaf87f6b1f34633995e658a1a | [
"BSD-3-Clause"
] | 1 | 2015-09-15T14:36:15.000Z | 2015-09-15T14:36:15.000Z | {-# OPTIONS --without-K --safe --no-sized-types --no-guardedness
--no-subtyping #-}
module Agda.Builtin.Reflection where
open import Agda.Builtin.Unit
open import Agda.Builtin.Bool
open import Agda.Builtin.Nat
open import Agda.Builtin.Word
open import Agda.Builtin.List
open import Agda.Builtin.String
open... | 36.231746 | 130 | 0.560852 |
d08280c309cac23987fa05fca0620c10d1b07452 | 139 | agda | Agda | Cubical/HITs/S2.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | 1 | 2021-10-31T17:32:49.000Z | 2021-10-31T17:32:49.000Z | Cubical/HITs/S2.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | Cubical/HITs/S2.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | {-# OPTIONS --safe #-}
module Cubical.HITs.S2 where
open import Cubical.HITs.S2.Base public
open import Cubical.HITs.S2.Properties public
| 23.166667 | 45 | 0.769784 |
23bf21b22da4fe31e4c13a7107fd068f89cd8b69 | 496 | agda | Agda | agda-stdlib/src/Relation/Unary/Consequences.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 5 | 2020-10-07T12:07:53.000Z | 2020-10-10T21:41:32.000Z | agda-stdlib/src/Relation/Unary/Consequences.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | null | null | null | agda-stdlib/src/Relation/Unary/Consequences.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 1 | 2021-11-04T06:54:45.000Z | 2021-11-04T06:54:45.000Z | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Some properties imply others
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Relation.Unary.Consequences where
open import Relation.Unary
open... | 31 | 86 | 0.504032 |
df20ced28adf78f2f5e4d9e4cf1bc6599b729ed5 | 120 | agda | Agda | examples/AIM6/RegExp/talk/Everything.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | examples/AIM6/RegExp/talk/Everything.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | examples/AIM6/RegExp/talk/Everything.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | module Everything where
import BoolMatcher
import Eq
import Prelude
import RegExps
import Setoids
import SimpleMatcher
| 13.333333 | 23 | 0.866667 |
d088c9bb77a3126ac1f372d3fe26182d0fbb0f04 | 1,970 | agda | Agda | Cubical/DStructures/Structures/Constant.agda | Schippmunk/cubical | c345dc0c49d3950dc57f53ca5f7099bb53a4dc3a | [
"MIT"
] | null | null | null | Cubical/DStructures/Structures/Constant.agda | Schippmunk/cubical | c345dc0c49d3950dc57f53ca5f7099bb53a4dc3a | [
"MIT"
] | null | null | null | Cubical/DStructures/Structures/Constant.agda | Schippmunk/cubical | c345dc0c49d3950dc57f53ca5f7099bb53a4dc3a | [
"MIT"
] | null | null | null | {-
This module contains:
- constant displayed structures of URG structures
- products of URG structures
-}
{-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.DStructures.Structures.Constant where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.HLevels
open import Cubical.Foundati... | 31.269841 | 99 | 0.543655 |
1c8639b49402fe61ef4ce3b723d180ac2a043c7d | 1,927 | agda | Agda | src/Data/FingerTree/Split/Point.agda | oisdk/agda-indexed-fingertree | 39c3d96937384b052b782ffddf4fdec68c5d139f | [
"MIT"
] | 1 | 2019-02-26T07:04:54.000Z | 2019-02-26T07:04:54.000Z | src/Data/FingerTree/Split/Point.agda | oisdk/agda-indexed-fingertree | 39c3d96937384b052b782ffddf4fdec68c5d139f | [
"MIT"
] | null | null | null | src/Data/FingerTree/Split/Point.agda | oisdk/agda-indexed-fingertree | 39c3d96937384b052b782ffddf4fdec68c5d139f | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
open import Algebra
open import Relation.Unary
open import Relation.Binary hiding (Decidable)
module Data.FingerTree.Split.Point
{r m}
(ℳ : Monoid r m)
{s}
{ℙ : Pred (Monoid.Carrier ℳ) s}
(ℙ-resp : ℙ Respects (Monoid._≈_ ℳ))
(ℙ? : Decidable ℙ)
where
open import Relati... | 26.763889 | 85 | 0.531396 |
39b0adc3dba7c771fae863df29f34bb95e7011dd | 7,578 | agda | Agda | agda-stdlib/src/Codata/Musical/Colist/Infinite-merge.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 5 | 2020-10-07T12:07:53.000Z | 2020-10-10T21:41:32.000Z | agda-stdlib/src/Codata/Musical/Colist/Infinite-merge.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | null | null | null | agda-stdlib/src/Codata/Musical/Colist/Infinite-merge.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 1 | 2021-11-04T06:54:45.000Z | 2021-11-04T06:54:45.000Z | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Infinite merge operation for coinductive lists
------------------------------------------------------------------------
{-# OPTIONS --without-K --guardedness #-}
module Codata.Musical.Colist.Infinite-merge wher... | 35.745283 | 94 | 0.482581 |
206c430b6911eb16f4e0be508f40a188ad1c48a5 | 9,140 | agda | Agda | src/Util/PKCS.agda | LaudateCorpus1/bft-consensus-agda | a4674fc473f2457fd3fe5123af48253cfb2404ef | [
"UPL-1.0"
] | null | null | null | src/Util/PKCS.agda | LaudateCorpus1/bft-consensus-agda | a4674fc473f2457fd3fe5123af48253cfb2404ef | [
"UPL-1.0"
] | null | null | null | src/Util/PKCS.agda | LaudateCorpus1/bft-consensus-agda | a4674fc473f2457fd3fe5123af48253cfb2404ef | [
"UPL-1.0"
] | null | null | null | {- 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 Util.ByteString
open import Util.Encode
open import Util.Le... | 39.5671 | 117 | 0.604595 |
c5df4aff60027b9e7aa30689c51999df7b610375 | 18,333 | agda | Agda | Cubical/Foundations/GroupoidLaws.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | Cubical/Foundations/GroupoidLaws.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | Cubical/Foundations/GroupoidLaws.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | 1 | 2021-11-22T02:02:01.000Z | 2021-11-22T02:02:01.000Z | {-
This file proves the higher groupoid structure of types
for homogeneous and heterogeneous paths
-}
{-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Foundations.GroupoidLaws where
open import Cubical.Foundations.Prelude
private
variable
ℓ : Level
A : Type ℓ
x y z w v : A
_⁻¹ : (x ≡... | 38.273486 | 124 | 0.333279 |
23376d6e7c532228ca57275fb3115ab43a1f3508 | 435 | agda | Agda | test/Succeed/Issue2858-Fresh.agda | cagix/agda | cc026a6a97a3e517bb94bafa9d49233b067c7559 | [
"BSD-2-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue2858-Fresh.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue2858-Fresh.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | module Issue2858-Fresh {A : Set} (_#_ : A → A → Set) where
interleaved mutual
data Fresh : Set
data IsFresh (a : A) : Fresh → Set
-- nil is a fresh list
data _ where
[] : Fresh
#[] : IsFresh a []
-- cons is fresh as long as the new value is fresh
data _ where
cons : (x ... | 25.588235 | 73 | 0.54023 |
20d7acbde7557038e8bb6ea8dc641ce98c193eae | 6,809 | agda | Agda | ConfluenceTakahashi.agda | iwilare/church-rosser | 2fa17f7738cc7da967375be928137adc4be38696 | [
"MIT"
] | 5 | 2020-06-02T07:27:54.000Z | 2021-11-22T01:43:09.000Z | ConfluenceTakahashi.agda | iwilare/church-rosser | 2fa17f7738cc7da967375be928137adc4be38696 | [
"MIT"
] | null | null | null | ConfluenceTakahashi.agda | iwilare/church-rosser | 2fa17f7738cc7da967375be928137adc4be38696 | [
"MIT"
] | null | null | null | open import Relation.Binary.PropositionalEquality using (_≡_; refl; sym; cong; cong₂)
open import Data.Nat using (ℕ; zero; suc; _≤_; z≤n; s≤s)
open import Data.Nat.Properties using (≤-total)
open import Data.Fin using (Fin; zero; suc)
open import Data.Product using (∃; ∃-syntax; _×_; _,_)
open import Data.Sum using ([_... | 34.563452 | 126 | 0.422088 |
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.