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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
4d7f114e68131c13a4cb1a17e92d1704deb5cf0d | 349 | agda | Agda | Chapter1/#9.agda | CodaFi/HoTT-Exercises | 3411b253b0a49a5f9c3301df175ae8ecdc563b12 | [
"MIT"
] | null | null | null | Chapter1/#9.agda | CodaFi/HoTT-Exercises | 3411b253b0a49a5f9c3301df175ae8ecdc563b12 | [
"MIT"
] | null | null | null | Chapter1/#9.agda | CodaFi/HoTT-Exercises | 3411b253b0a49a5f9c3301df175ae8ecdc563b12 | [
"MIT"
] | null | null | null | module #9 where
{-
Define the type family Fin : N → U mentioned at the end of §1.3, and the dependent
function fmax : ∏(n:N) Fin(n + 1) mentioned in §1.4.
-}
open import Data.Nat
data Fin : ℕ → Set where
FZ : {n : ℕ} → Fin (suc n)
FS : {n : ℕ} → Fin n → Fin (suc n)
fmax : (n : ℕ) → Fin (n + 1)
fmax zero = F... | 20.529412 | 84 | 0.570201 |
fbc43fc9f2459bfecfdfeb5430f78d9033bc69d6 | 1,664 | agda | Agda | src/Subset.agda | acallesalda/setform | 4ab3c1a8bfd679cb3ced25500aa8103cb6c4b1f4 | [
"MIT"
] | 3 | 2019-08-02T23:13:13.000Z | 2022-01-06T20:04:13.000Z | src/Subset.agda | acallesalda/setform | 4ab3c1a8bfd679cb3ced25500aa8103cb6c4b1f4 | [
"MIT"
] | null | null | null | src/Subset.agda | acallesalda/setform | 4ab3c1a8bfd679cb3ced25500aa8103cb6c4b1f4 | [
"MIT"
] | null | null | null | -- Properties involving susbets and membership
-- between sets.
module Subset where
open import Logic
open import ZAxioms
memberEq : (x y z : 𝓢) → x ∈ y ∧ y ≡ z → x ∈ z
memberEq x y z (x₁ , x₂) = subs _ x₂ x₁
-- Theorem 1, p. 21 (Suppes 1960)
notInEmpty : ∀ x → x ∉ ∅
notInEmpty x h = (proj₂ _ empt) x h
prop-∅ : ... | 24.835821 | 78 | 0.545673 |
1d0db41ef171ee0a6250ca7dff9a47d2d8348a1a | 12,948 | agda | Agda | LibraBFT/Impl/Handle/Properties.agda | cwjnkins/bft-consensus-agda | 71aa2168e4875ffdeece9ba7472ee3cee5fa9084 | [
"UPL-1.0"
] | null | null | null | LibraBFT/Impl/Handle/Properties.agda | cwjnkins/bft-consensus-agda | 71aa2168e4875ffdeece9ba7472ee3cee5fa9084 | [
"UPL-1.0"
] | null | null | null | LibraBFT/Impl/Handle/Properties.agda | cwjnkins/bft-consensus-agda | 71aa2168e4875ffdeece9ba7472ee3cee5fa9084 | [
"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
-}
{-# OPTIONS --allow-unsolved-metas #-}
-- This module provides some scaffoldi... | 52 | 147 | 0.60658 |
105f8c2c9617253bab2eb82db3d3e97aa504b00b | 579 | agda | Agda | lib/types/FundamentalGroupoid.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | 1 | 2021-06-30T00:17:55.000Z | 2021-06-30T00:17:55.000Z | lib/types/FundamentalGroupoid.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | null | null | null | lib/types/FundamentalGroupoid.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K #-}
open import lib.Basics
open import lib.types.Truncation
open import lib.types.Groupoid
open import lib.types.PathSet
module lib.types.FundamentalGroupoid {i} (A : Type i) where
fundamental-groupoid : Groupoid
fundamental-groupoid = record
{ El = A
; Arr = _=₀_ {A = A}
; Ar... | 22.269231 | 59 | 0.569948 |
50c5caa452df11c3c6670e8b51749163b3876b38 | 112 | agda | Agda | Cubical/HITs/Ints/IsoInt.agda | maxdore/cubical | ef62b84397396d48135d73ba7400b71c721ddc94 | [
"MIT"
] | null | null | null | Cubical/HITs/Ints/IsoInt.agda | maxdore/cubical | ef62b84397396d48135d73ba7400b71c721ddc94 | [
"MIT"
] | null | null | null | Cubical/HITs/Ints/IsoInt.agda | maxdore/cubical | ef62b84397396d48135d73ba7400b71c721ddc94 | [
"MIT"
] | 1 | 2021-03-12T20:08:45.000Z | 2021-03-12T20:08:45.000Z | {-# OPTIONS --safe #-}
module Cubical.HITs.Ints.IsoInt where
open import Cubical.HITs.Ints.IsoInt.Base public
| 18.666667 | 48 | 0.75 |
0e3686e5f8340df0a230d8c0eb3c39bf966149e9 | 18,467 | agda | Agda | Cubical/Foundations/GroupoidLaws.agda | knrafto/cubical | f6771617374bfe65a7043d00731fed5a673aa729 | [
"MIT"
] | null | null | null | Cubical/Foundations/GroupoidLaws.agda | knrafto/cubical | f6771617374bfe65a7043d00731fed5a673aa729 | [
"MIT"
] | null | null | null | Cubical/Foundations/GroupoidLaws.agda | knrafto/cubical | f6771617374bfe65a7043d00731fed5a673aa729 | [
"MIT"
] | null | null | null | {-
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.553236 | 139 | 0.332756 |
1c48e9d8a81ff42ddb14d3da4ccb6ca351f7ca1b | 5,777 | agda | Agda | Type/Size/Proofs.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | Type/Size/Proofs.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | Type/Size/Proofs.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | module Type.Size.Proofs where
import Lvl
open import Data
open import Data.Proofs
open import Functional
open import Function.Equals
open import Function.Inverseᵣ
open import Function.Inverse
open import Function.Proofs
open import Logic
open import Logic.IntroInstances
open import Logic.Propositional
open import... | 36.10625 | 188 | 0.564134 |
0e03ede06225d7057f62b521f788d825b823b2d5 | 430 | agda | Agda | test/Common/MAlonzo.agda | Blaisorblade/Agda | 802a28aa8374f15fe9d011ceb80317fdb1ec0949 | [
"BSD-3-Clause"
] | 3 | 2015-03-28T14:51:03.000Z | 2015-12-07T20:14:00.000Z | test/Common/MAlonzo.agda | Blaisorblade/Agda | 802a28aa8374f15fe9d011ceb80317fdb1ec0949 | [
"BSD-3-Clause"
] | null | null | null | test/Common/MAlonzo.agda | Blaisorblade/Agda | 802a28aa8374f15fe9d011ceb80317fdb1ec0949 | [
"BSD-3-Clause"
] | null | null | null |
module Common.MAlonzo where
open import Common.Prelude hiding (putStrLn)
open import Common.Coinduction
{-# FOREIGN GHC import qualified Data.Text.IO #-}
postulate
putStrLn : ∞ String → IO Unit
{-# COMPILE GHC putStrLn = Data.Text.IO.putStrLn #-}
main = putStrLn (♯ "This is a dummy main routine.")
mainPrint : ... | 20.47619 | 52 | 0.713953 |
120227048b7f3309dcacc92c994095b4006b6ce9 | 319 | agda | Agda | notes/thesis/report/CombiningProofs/CommDisjunction.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 11 | 2015-09-03T20:53:42.000Z | 2021-09-12T16:09:54.000Z | notes/thesis/report/CombiningProofs/CommDisjunction.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 2 | 2016-10-12T17:28:16.000Z | 2017-01-01T14:34:26.000Z | notes/thesis/report/CombiningProofs/CommDisjunction.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 3 | 2016-09-19T14:18:30.000Z | 2018-03-14T08:50:00.000Z | {-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorphism #-}
{-# OPTIONS --without-K #-}
module CombiningProofs.CommDisjunction where
open import Common.FOL.FOL
postulate
A B : Set
∨-comm : A ∨ B → B ∨ A
{-# ATP prove ∨-comm #-}
| 22.785714 | 44 | 0.554859 |
50929eca1d6b85e2437e0e55941884f581f6690c | 368 | agda | Agda | test/succeed/SizeSucMonotone.agda | larrytheliquid/agda | 477c8c37f948e6038b773409358fd8f38395f827 | [
"MIT"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | test/succeed/SizeSucMonotone.agda | masondesu/agda | 70c8a575c46f6a568c7518150a1a64fcd03aa437 | [
"MIT"
] | null | null | null | test/succeed/SizeSucMonotone.agda | masondesu/agda | 70c8a575c46f6a568c7518150a1a64fcd03aa437 | [
"MIT"
] | 1 | 2022-03-12T11:35:18.000Z | 2022-03-12T11:35:18.000Z | -- Andreas, 2012-09-24 Ensure that size successor is monotone
{-# OPTIONS --sized-types #-}
module SizeSucMonotone where
open import Common.Size
data Bool : Set where
true false : Bool
-- T should be monotone in its second arg
T : Bool → Size → Set
T true i = Size< i
T false i = Size< (↑ i)
test : {x : Bool}{i :... | 20.444444 | 61 | 0.646739 |
39c2a0f1de8bc4c184a47475c0076a4870c4ad89 | 912 | agda | Agda | test/Succeed/Issue292-17.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue292-17.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue292-17.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- 2011-09-15 by Nisse
-- {-# OPTIONS -v tc.lhs.unify:15 #-}
module Issue292-17 where
data _≡_ {A : Set} (x : A) : A → Set where
refl : x ≡ x
record Σ (A : Set) (B : A → Set) : Set where
constructor _,_
field
proj₁ : A
proj₂ : B proj₁
open Σ
postulate
I : Set
U : I → Set
El : ∀ {i} → U i → Set... | 17.538462 | 58 | 0.509868 |
a1198d33ac792382ab9ff29c87e0478dc6b035d9 | 8,177 | agda | Agda | Cubical/Algebra/Ring/Base.agda | jespercockx/cubical | 94b474af2909727d04706d562d949928c19faf7b | [
"MIT"
] | null | null | null | Cubical/Algebra/Ring/Base.agda | jespercockx/cubical | 94b474af2909727d04706d562d949928c19faf7b | [
"MIT"
] | null | null | null | Cubical/Algebra/Ring/Base.agda | jespercockx/cubical | 94b474af2909727d04706d562d949928c19faf7b | [
"MIT"
] | null | null | null | {-# OPTIONS --safe #-}
module Cubical.Algebra.Ring.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 Cubical.Foundations.Isomorphism
open... | 32.839357 | 101 | 0.517305 |
c5945ede4389948ed9282c37f21a1d5c65c68528 | 1,563 | agda | Agda | Univalence/Obsolete/PiLevel1Alternative.agda | JacquesCarette/pi-dual | 003835484facfde0b770bc2b3d781b42b76184c1 | [
"BSD-2-Clause"
] | 14 | 2015-08-18T21:40:15.000Z | 2021-05-05T01:07:57.000Z | Univalence/Obsolete/PiLevel1Alternative.agda | JacquesCarette/pi-dual | 003835484facfde0b770bc2b3d781b42b76184c1 | [
"BSD-2-Clause"
] | 4 | 2018-06-07T16:27:41.000Z | 2021-10-29T20:41:23.000Z | Univalence/Obsolete/PiLevel1Alternative.agda | JacquesCarette/pi-dual | 003835484facfde0b770bc2b3d781b42b76184c1 | [
"BSD-2-Clause"
] | 3 | 2016-05-29T01:56:33.000Z | 2019-09-10T09:47:13.000Z | {-# OPTIONS --without-K #-}
module PiLevel1Alternative where
open import Relation.Binary.PropositionalEquality
open import Data.Nat
open import Data.Vec
open import FinVec
open F
open import ConcretePermutation
------------------------------------------------------------------------------
-- Equivalences between p... | 28.418182 | 88 | 0.537428 |
2f4d8611d38cf2c388a2b0a08339dec3e55c45e2 | 137 | agda | Agda | tests/beyond/evenodd.agda | andrejtokarcik/agda-semantics | dc333ed142584cf52cc885644eed34b356967d8b | [
"MIT"
] | 3 | 2015-08-10T15:33:56.000Z | 2018-12-06T17:24:25.000Z | tests/beyond/evenodd.agda | andrejtokarcik/agda-semantics | dc333ed142584cf52cc885644eed34b356967d8b | [
"MIT"
] | null | null | null | tests/beyond/evenodd.agda | andrejtokarcik/agda-semantics | dc333ed142584cf52cc885644eed34b356967d8b | [
"MIT"
] | null | null | null | module evenodd where
mutual
data Even : Set where
Z : Even
S : Odd -> Even
data Odd : Set where
S' : Even -> Odd
| 12.454545 | 23 | 0.554745 |
a13d289d0f5e798882535afc7d1ee0079ba26988 | 8,226 | agda | Agda | Groups/Actions/OrbitStabiliser.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 4 | 2019-08-08T12:44:19.000Z | 2022-01-28T06:04:15.000Z | Groups/Actions/OrbitStabiliser.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 14 | 2019-01-06T21:11:59.000Z | 2020-04-11T11:03:39.000Z | Groups/Actions/OrbitStabiliser.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 Setoids.Setoids
open import Functions
open import Agda.Primitive using (Level; lzero; lsuc; _⊔_)
open import Numbers.Naturals.Naturals
open import Sets.FinSet
open import Groups.Definition
open import Groups.Lemmas
open import G... | 70.307692 | 364 | 0.671043 |
0e231e5071df3b7b561665d616316d3e6d9bbd24 | 934 | agda | Agda | agda/Data/Nat/Base.agda | oisdk/combinatorics-paper | 3c176d4690566d81611080e9378f5a178b39b851 | [
"MIT"
] | 4 | 2021-01-05T14:07:44.000Z | 2021-01-05T15:32:14.000Z | agda/Data/Nat/Base.agda | oisdk/combinatorics-paper | 3c176d4690566d81611080e9378f5a178b39b851 | [
"MIT"
] | null | null | null | agda/Data/Nat/Base.agda | oisdk/combinatorics-paper | 3c176d4690566d81611080e9378f5a178b39b851 | [
"MIT"
] | 1 | 2021-01-05T14:05:30.000Z | 2021-01-05T14:05:30.000Z | {-# OPTIONS --cubical --safe #-}
module Data.Nat.Base where
open import Agda.Builtin.Nat public
using (_+_; _*_; zero; suc)
renaming (Nat to ℕ; _-_ to _∸_)
import Agda.Builtin.Nat as Nat
open import Level
open import Data.Bool
data Ordering : ℕ → ℕ → Type₀ where
less : ∀ m k → Ordering m (suc (m + k))
eq... | 25.944444 | 45 | 0.583512 |
121568bb204132ab3fa7bc08e0f216b2da6e095e | 16,246 | agda | Agda | src/Colimit/Sequential.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | 3 | 2020-05-21T22:58:50.000Z | 2021-09-02T17:18:15.000Z | src/Colimit/Sequential.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | null | null | null | src/Colimit/Sequential.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- Sequential colimits
------------------------------------------------------------------------
{-# OPTIONS --erased-cubical --safe #-}
-- The definition of sequential colimits and the statement of the
-- non-dependent universal property are bas... | 37.51963 | 128 | 0.363351 |
2f871417d2c65c970799fb154750787dae3bf5f2 | 262 | agda | Agda | Algebra/Group.agda | esoeylemez/agda-simple | d9245e5a8b2e902781736de09bd17e81022f6f13 | [
"BSD-3-Clause"
] | 1 | 2019-10-07T17:36:42.000Z | 2019-10-07T17:36:42.000Z | Algebra/Group.agda | esoeylemez/agda-simple | d9245e5a8b2e902781736de09bd17e81022f6f13 | [
"BSD-3-Clause"
] | null | null | null | Algebra/Group.agda | esoeylemez/agda-simple | d9245e5a8b2e902781736de09bd17e81022f6f13 | [
"BSD-3-Clause"
] | null | null | null | -- Copyright: (c) 2016 Ertugrul Söylemez
-- License: BSD3
-- Maintainer: Ertugrul Söylemez <esz@posteo.de>
module Algebra.Group where
open import Algebra.Group.Group public
open import Algebra.Group.Monoid public
open import Algebra.Group.Semigroup public
| 26.2 | 48 | 0.782443 |
c5e04b557d286db9b83119f96cf1a2cb4ace1bef | 1,778 | agda | Agda | probability/Listy.agda | oisdk/prob-presentation | 880217ca51ab62f6feee58ccacdb39bfade43101 | [
"MIT"
] | null | null | null | probability/Listy.agda | oisdk/prob-presentation | 880217ca51ab62f6feee58ccacdb39bfade43101 | [
"MIT"
] | null | null | null | probability/Listy.agda | oisdk/prob-presentation | 880217ca51ab62f6feee58ccacdb39bfade43101 | [
"MIT"
] | null | null | null | module Listy where
open import Measure
open import Data.List as List using (List; []; _∷_)
open import Data.Product using (_,_; _×_; proj₁; proj₂)
open import Data.Nat as ℕ using (ℕ; suc; zero)
open import Function
record Prob (A : Set) : Set where
constructor weighted
field
runProb : List (A × ℙ)
open Prob... | 24.027027 | 86 | 0.624297 |
31527d4fb3b4e104e35d07233140df9a6ea2ea06 | 14,808 | agda | Agda | BTA3_polybta-review.agda | luminousfennell/polybta | ef878f7fa5afa51fb7a14cd8f7f75da0af1b9deb | [
"BSD-3-Clause"
] | 1 | 2019-10-15T04:35:29.000Z | 2019-10-15T04:35:29.000Z | BTA3_polybta-review.agda | luminousfennell/polybta | ef878f7fa5afa51fb7a14cd8f7f75da0af1b9deb | [
"BSD-3-Clause"
] | null | null | null | BTA3_polybta-review.agda | luminousfennell/polybta | ef878f7fa5afa51fb7a14cd8f7f75da0af1b9deb | [
"BSD-3-Clause"
] | 1 | 2019-10-15T09:01:37.000Z | 2019-10-15T09:01:37.000Z | module BTA3 where
open import Data.Nat
open import Data.Bool
open import Data.List
-- Binding times
data BT : Set where
S : BT
D : BT
-- defining a data type [BT],where two members are
-- [S] standing for "static" and [D] standing for dynamic.
-- ``subsumption'' binding times; static can be treated as dynamic,
... | 34.842353 | 276 | 0.595286 |
4ded3fd061f5569bbdbf29406a245efb5d3eb371 | 711 | agda | Agda | test/Succeed/HITs.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/HITs.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/HITs.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | {-# OPTIONS --cubical #-}
open import Agda.Builtin.Cubical.Path
data PushOut {A B C : Set} (f : C → A) (g : C → B) : Set where
inl : A → PushOut f g
inr : B → PushOut f g
push : ∀ c → inl (f c) ≡ inr (g c)
squash : ∀ a b → a ≡ b
data ∥_∥₀ (A : Set) : Set where
∣_∣ : A → ∥ A ∥₀
squash : ∀ (x y : ∥ A ∥₀)... | 27.346154 | 77 | 0.481013 |
395e53f50b32727b1c14f996cd245d0aa596b17c | 1,041 | agda | Agda | examples/outdated-and-incorrect/clowns/Clowns.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/clowns/Clowns.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/clowns/Clowns.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | {-# OPTIONS --no-positivity-check #-}
module Clowns where
import Equality
import Isomorphism
import Derivative
import ChainRule
open import Sets
open import Functor
open import Zipper
open import Dissect
open Functor.Recursive
open Functor.Semantics
-- Natural numbers
NatF : U
NatF = K [1] + Id
Nat : Set
Nat = μ N... | 15.537313 | 43 | 0.577329 |
0e11ca6abdd9f2076214feeb5e3c88ae1064f8a9 | 3,155 | agda | Agda | examples/outdated-and-incorrect/iird/IID.agda | asr/agda-kanso | aa10ae6a29dc79964fe9dec2de07b9df28b61ed5 | [
"MIT"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | examples/outdated-and-incorrect/iird/IID.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | examples/outdated-and-incorrect/iird/IID.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | 1 | 2022-03-12T11:35:18.000Z | 2022-03-12T11:35:18.000Z |
-- The simpler case of index inductive definitions. (no induction-recursion)
module IID where
open import LF
-- A code for an IID
-- I - index set
-- E = I for general IIDs
-- E = One for restricted IIDs
data OP (I : Set)(E : Set) : Set1 where
ι : E -> OP I E
σ : (A : Set)(γ : A -> OP I E) -> OP I E
δ : (A : S... | 34.67033 | 79 | 0.532488 |
1d0ec9e540ec12cb1679035cdcd9d6ba9b5a46d4 | 4,868 | agda | Agda | prototyping/Luau/Type.agda | JohnnyMorganz/luau | f2191b9e4da6a4bb2d9d344ebd7941ec2f00844b | [
"MIT"
] | 1 | 2021-11-06T08:03:00.000Z | 2021-11-06T08:03:00.000Z | prototyping/Luau/Type.agda | JohnnyMorganz/luau | f2191b9e4da6a4bb2d9d344ebd7941ec2f00844b | [
"MIT"
] | null | null | null | prototyping/Luau/Type.agda | JohnnyMorganz/luau | f2191b9e4da6a4bb2d9d344ebd7941ec2f00844b | [
"MIT"
] | null | null | null | module Luau.Type where
open import FFI.Data.Maybe using (Maybe; just; nothing; just-inv)
open import Agda.Builtin.Equality using (_≡_; refl)
open import Properties.Dec using (Dec; yes; no)
open import Properties.Equality using (cong)
open import FFI.Data.Maybe using (Maybe; just; nothing)
data Type : Set where
nil ... | 29.50303 | 72 | 0.511915 |
0bdc025f0aa6908f5f01889326d8f81365e1b1ee | 282 | agda | Agda | Chunk.agda | righ1113/Agda | 9117b6bec9880d8c0a5d6ee4399fd841c3544d84 | [
"MIT"
] | null | null | null | Chunk.agda | righ1113/Agda | 9117b6bec9880d8c0a5d6ee4399fd841c3544d84 | [
"MIT"
] | null | null | null | Chunk.agda | righ1113/Agda | 9117b6bec9880d8c0a5d6ee4399fd841c3544d84 | [
"MIT"
] | null | null | null | module Chunk where
open import Codata.Stream using (chunksOf; iterate; take)
open import Data.Nat using (ℕ; suc)
open import Data.Vec using (Vec; []; _∷_)
-- mylist 3 = [[1,2,3],[4,5,6],[7,8,9]]
myVec : (n : ℕ) → Vec (Vec ℕ n) n
myVec n = take n (chunksOf n (iterate suc 1))
| 18.8 | 57 | 0.631206 |
1273b3c086e308284d8da8fe3ca6a537611c67f0 | 313 | agda | Agda | test/fail/CoinductiveConstructorsAndLet.agda | asr/agda-kanso | aa10ae6a29dc79964fe9dec2de07b9df28b61ed5 | [
"MIT"
] | 1 | 2019-11-27T04:41:05.000Z | 2019-11-27T04:41:05.000Z | test/fail/CoinductiveConstructorsAndLet.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | test/fail/CoinductiveConstructorsAndLet.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | module CoinductiveConstructorsAndLet where
open import Imports.Coinduction
data D : Set where
foo : D → ∞ D
foo x = let y = x in ♯ y
-- CoinductiveConstructorsAndLet.agda:9,24-25
-- Panic: thing out of context ([CtxId 1] is not a sub context of
-- [CtxId 3])
-- when checking that the expression y has type D
| 22.357143 | 65 | 0.722045 |
505c6632e632e2513f305b8cb99f782a6bbf17ac | 30,430 | agda | Agda | Agda/06-equivalences.agda | tadejpetric/HoTT-Intro | f4228d6ecfc6cdb119c6e8b0e711fea05b98b2d5 | [
"CC-BY-4.0"
] | null | null | null | Agda/06-equivalences.agda | tadejpetric/HoTT-Intro | f4228d6ecfc6cdb119c6e8b0e711fea05b98b2d5 | [
"CC-BY-4.0"
] | null | null | null | Agda/06-equivalences.agda | tadejpetric/HoTT-Intro | f4228d6ecfc6cdb119c6e8b0e711fea05b98b2d5 | [
"CC-BY-4.0"
] | null | null | null | {-# OPTIONS --without-K --exact-split #-}
module 06-equivalences where
import 06-universes
open 06-universes public
-- Section 6.1 Homotopies
_~_ :
{i j : Level} {A : UU i} {B : A → UU j} (f g : (x : A) → B x) → UU (i ⊔ j)
f ~ g = (x : _) → Id (f x) (g x)
htpy-refl :
{i j : Level} {A : UU i} {B : A → UU j} {f ... | 31.56639 | 80 | 0.508939 |
3185bc2787be2ef0f43ad002925d8dbdfba414cc | 5,408 | agda | Agda | Cubical/Structures/Relational/Maybe.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | 1 | 2021-10-31T17:32:49.000Z | 2021-10-31T17:32:49.000Z | Cubical/Structures/Relational/Maybe.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | Cubical/Structures/Relational/Maybe.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | {-
Maybe structure: X ↦ Maybe (S X)
-}
{-# OPTIONS --no-exact-split --safe #-}
module Cubical.Structures.Relational.Maybe where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Function
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.HLevels
open import Cubical.Foundation... | 42.25 | 93 | 0.664386 |
0bf1638b20ea29811aaac2c81688919d45921705 | 208 | agda | Agda | test/Succeed/Issue4006.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue4006.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue4006.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
data I : Set where
i : I
variable
x : I
abstract
data D : I → Set where
d : D i
accepted : {x : I} → D x → Set₁
accepted {x = i} d = Set
rejected : D x → Set₁
rejected {x = i} d = Set
| 11.555556 | 33 | 0.519231 |
06edca09ccb86e4c1781107c3498239b51163964 | 10,452 | agda | Agda | test/asset/agda-stdlib-1.0/Data/Sum/Relation/Binary/LeftOrder.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Data/Sum/Relation/Binary/LeftOrder.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Data/Sum/Relation/Binary/LeftOrder.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Sums of binary relations
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Data.Sum.Relation.Binary.LeftOrder where
open import Data.Sum as Sum
... | 42.315789 | 101 | 0.534443 |
234a220077aeb28ce83826a09c6b768281c6fea8 | 3,624 | agda | Agda | theorems/cohomology/ChainComplex.agda | AntoineAllioux/HoTT-Agda | 1037d82edcf29b620677a311dcfd4fc2ade2faa6 | [
"MIT"
] | 294 | 2015-01-09T16:23:23.000Z | 2022-03-20T13:54:45.000Z | theorems/cohomology/ChainComplex.agda | AntoineAllioux/HoTT-Agda | 1037d82edcf29b620677a311dcfd4fc2ade2faa6 | [
"MIT"
] | 31 | 2015-03-05T20:09:00.000Z | 2021-10-03T19:15:25.000Z | theorems/cohomology/ChainComplex.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 HoTT
open import groups.KernelImage
open import groups.KernelImageEmap
module cohomology.ChainComplex where
record ChainComplex i : Type (lsucc i) where
field
head : AbGroup i
chain : ℕ → AbGroup i
augment : AbGroup.grp (chain 0) →ᴳ AbGroup.... | 43.142857 | 107 | 0.634382 |
109c648d922e007db8b82e530fcc154a68dd0486 | 3,498 | agda | Agda | Cubical/Foundations/Embedding.agda | jonsterling/cubical-1 | 794b550f40562e025b5570badd78fdc2e6597779 | [
"MIT"
] | null | null | null | Cubical/Foundations/Embedding.agda | jonsterling/cubical-1 | 794b550f40562e025b5570badd78fdc2e6597779 | [
"MIT"
] | null | null | null | Cubical/Foundations/Embedding.agda | jonsterling/cubical-1 | 794b550f40562e025b5570badd78fdc2e6597779 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --safe #-}
module Cubical.Foundations.Embedding where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Function
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Transport
open import Cubical.Foundations.Isomorphi... | 27.984 | 81 | 0.592338 |
df304e1d5f8786c271161f4f8117c2dc807d6937 | 976 | agda | Agda | agda-stdlib/src/Data/Fin/Subset/Induction.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 5 | 2020-10-07T12:07:53.000Z | 2020-10-10T21:41:32.000Z | agda-stdlib/src/Data/Fin/Subset/Induction.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | null | null | null | agda-stdlib/src/Data/Fin/Subset/Induction.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 1 | 2021-11-04T06:54:45.000Z | 2021-11-04T06:54:45.000Z | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Induction over Subset
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Data.Fin.Subset.Induction where
open import Data.Nat.Base using (ℕ)
open... | 31.483871 | 100 | 0.498975 |
2f657fd873efee8d1aa5e836d8beb1fd3755a41a | 667 | agda | Agda | Fields/Orders/Partial/Definition.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 4 | 2019-08-08T12:44:19.000Z | 2022-01-28T06:04:15.000Z | Fields/Orders/Partial/Definition.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 14 | 2019-01-06T21:11:59.000Z | 2020-04-11T11:03:39.000Z | Fields/Orders/Partial/Definition.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 Rings.Definition
open import Rings.Orders.Partial.Definition
open import Setoids.Setoids
open import Setoids.Orders.Partial.Definition
open import Functions.Definition
open import Fields.Fields
open import Agda.Primitive using (Level; lzero; lsuc; _⊔_)
m... | 35.105263 | 161 | 0.692654 |
1d7f2cfb5c99a798a37ee2d65aa63298db1d097d | 765 | agda | Agda | src/fot/GroupTheory/Base/Consistency/Axioms.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 11 | 2015-09-03T20:53:42.000Z | 2021-09-12T16:09:54.000Z | src/fot/GroupTheory/Base/Consistency/Axioms.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 2 | 2016-10-12T17:28:16.000Z | 2017-01-01T14:34:26.000Z | src/fot/GroupTheory/Base/Consistency/Axioms.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 3 | 2016-09-19T14:18:30.000Z | 2018-03-14T08:50:00.000Z | ------------------------------------------------------------------------------
-- Test the consistency of GroupTheory.Base
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polym... | 34.772727 | 78 | 0.452288 |
3963edfcfe73bf98c6e1f0906f68473485cbe9c5 | 11,110 | agda | Agda | BLAS.agda | ashinkarov/agda-array | 584fedb30552f820c0668cedae53ec3d926860b5 | [
"0BSD"
] | 6 | 2020-05-09T13:53:46.000Z | 2021-06-15T14:21:32.000Z | BLAS.agda | ashinkarov/agda-array | 584fedb30552f820c0668cedae53ec3d926860b5 | [
"0BSD"
] | null | null | null | BLAS.agda | ashinkarov/agda-array | 584fedb30552f820c0668cedae53ec3d926860b5 | [
"0BSD"
] | 1 | 2020-10-12T07:19:48.000Z | 2020-10-12T07:19:48.000Z | {-# OPTIONS --rewriting #-}
open import Array
open import Array.APL using (reduce-1d)
open import Data.Nat as N
open import Data.Nat.Properties
open import Data.Vec as V hiding (_>>=_; _++_)
open import Data.Fin using (Fin; zero; suc; raise; inject+; #_)
open import Relation.Binary.PropositionalEquality
open import ... | 35.608974 | 155 | 0.488569 |
2f3d8f69983ebbbfdb77b9f330f74d67ccb09bd3 | 4,344 | agda | Agda | Ex3Lec.agda | clarkdm/CS410 | 523a8749f49c914bcd28402116dcbe79a78dbbf4 | [
"CC0-1.0"
] | null | null | null | Ex3Lec.agda | clarkdm/CS410 | 523a8749f49c914bcd28402116dcbe79a78dbbf4 | [
"CC0-1.0"
] | null | null | null | Ex3Lec.agda | clarkdm/CS410 | 523a8749f49c914bcd28402116dcbe79a78dbbf4 | [
"CC0-1.0"
] | null | null | null | module Ex3Lec where
----------------------------------------------------------------------------
-- EXERCISE 3 -- MONADS FOR HUTTON'S RAZOR
--
-- VALUE: 15%
-- DEADLINE: 5pm, Friday 20 November (week 9)
--
-- DON'T SUBMIT, COMMIT!
--
-- The purpose of this exercise is to introduce you to some useful
-- mathematic... | 33.674419 | 77 | 0.494015 |
31b185c8a2eb857236d9c0a567722d1f15470a0c | 11,864 | agda | Agda | Cubical/Algebra/Group/MorphismProperties.agda | mchristianl/cubical | cc6ad25d5ffbe4f20ea7020474f266d24b97caa0 | [
"MIT"
] | null | null | null | Cubical/Algebra/Group/MorphismProperties.agda | mchristianl/cubical | cc6ad25d5ffbe4f20ea7020474f266d24b97caa0 | [
"MIT"
] | null | null | null | Cubical/Algebra/Group/MorphismProperties.agda | mchristianl/cubical | cc6ad25d5ffbe4f20ea7020474f266d24b97caa0 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Algebra.Group.MorphismProperties where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Isomorphism
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.Equiv.HalfAdjoint
open import Cubical.Foundations.HLevels
op... | 42.070922 | 149 | 0.600135 |
d0af7257e32b10848d04ecb3f0fdadf348b9f207 | 404 | agda | Agda | stdlib-exts/Data/Vec/Exts.agda | WhatisRT/meta-cedille | 62fa6f36e4555360d94041113749bbb6d291691c | [
"MIT"
] | 35 | 2019-06-13T07:44:50.000Z | 2021-10-12T22:59:10.000Z | stdlib-exts/Data/Vec/Exts.agda | WhatisRT/meta-cedille | 62fa6f36e4555360d94041113749bbb6d291691c | [
"MIT"
] | 10 | 2019-06-13T17:44:43.000Z | 2020-04-25T15:29:17.000Z | stdlib-exts/Data/Vec/Exts.agda | WhatisRT/meta-cedille | 62fa6f36e4555360d94041113749bbb6d291691c | [
"MIT"
] | 2 | 2019-06-27T23:12:48.000Z | 2021-10-20T10:46:20.000Z | module Data.Vec.Exts where
open import Data.Fin
open import Data.Maybe
open import Data.Nat
open import Data.Vec using (Vec; []; _∷_)
open import Relation.Nullary
open import Relation.Unary
open import Data.Vec.Relation.Unary.Any
findIndex : {n : ℕ} {A : Set} {P : A -> Set} -> Decidable P -> Vec A n -> Maybe (Fin n)
... | 26.933333 | 87 | 0.680693 |
12dfbaef6f703c7485e9f11ff3aa1d8d49e7b16d | 1,080 | agda | Agda | agda-stdlib/src/Codata/Conat/Properties.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 5 | 2020-10-07T12:07:53.000Z | 2020-10-10T21:41:32.000Z | agda-stdlib/src/Codata/Conat/Properties.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | null | null | null | agda-stdlib/src/Codata/Conat/Properties.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 1 | 2021-11-04T06:54:45.000Z | 2021-11-04T06:54:45.000Z | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Properties for Conats
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe --sized-types #-}
module Codata.Conat.Properties where
open import Size
open import... | 25.116279 | 72 | 0.548148 |
4a3e1bbe23385d1d1181721ce5116d801f9123df | 4,656 | agda | Agda | ch8.agda | asajeffrey/tapl | de2ae6c24d001b85a5032c9e06cc731557dbc5e5 | [
"CC0-1.0"
] | 3 | 2021-03-12T22:44:19.000Z | 2021-03-15T12:09:59.000Z | ch8.agda | asajeffrey/tapl | de2ae6c24d001b85a5032c9e06cc731557dbc5e5 | [
"CC0-1.0"
] | null | null | null | ch8.agda | asajeffrey/tapl | de2ae6c24d001b85a5032c9e06cc731557dbc5e5 | [
"CC0-1.0"
] | null | null | null | open import prelude
-- Copied pretty much verbatim
data Term : Set where
true : Term
false : Term
if_then_else_end : Term → Term → Term → Term
zero : Term
succ : Term → Term
iszero : Term → Term
data NValue : Term → Set where
zero : NValue zero
succ : ∀ {t} → NValue(t) → NValue(succ t)
data Valu... | 21.163636 | 96 | 0.512027 |
a13a7276b51490574be95051b83fdaba23d70c9e | 83 | agda | Agda | test/Succeed/Issue3439.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue3439.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue3439.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | {-# OPTIONS --type-in-type #-}
open import Agda.Primitive
test : Set
test = Setω
| 11.857143 | 30 | 0.662651 |
fb91aca8fa584f55c1fab9aba88e246b328db318 | 746 | agda | Agda | test/Succeed/Issue2484-9.agda | cagix/agda | cc026a6a97a3e517bb94bafa9d49233b067c7559 | [
"BSD-2-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue2484-9.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue2484-9.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | {-# OPTIONS --sized-types #-}
module _ (_ : Set) where
open import Agda.Builtin.Size
postulate
I : Set
record ∃ (B : I → Set) : Set where
constructor _,_
field
proj₁ : I
proj₂ : B proj₁
module M (_ : Set₁) where
mutual
data P (i : Size) (x y : I) : Set where
⟨_⟩ : ∃ (Q i x) → P i x y
... | 18.195122 | 60 | 0.458445 |
1ce9ee734008c3190da53b165acb57e914051470 | 1,411 | agda | Agda | agda-stdlib/src/Data/Fin/Substitution/List.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 5 | 2020-10-07T12:07:53.000Z | 2020-10-10T21:41:32.000Z | agda-stdlib/src/Data/Fin/Substitution/List.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | null | null | null | agda-stdlib/src/Data/Fin/Substitution/List.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 1 | 2021-11-04T06:54:45.000Z | 2021-11-04T06:54:45.000Z | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Application of substitutions to lists, along with various lemmas
------------------------------------------------------------------------
-- This module illustrates how Data.Fin.Substitution.Lemmas.AppLemmas
-- ... | 29.395833 | 81 | 0.54713 |
1db0bdc8478cdb2e2fe60699328d63ca48c729be | 1,389 | agda | Agda | Mockingbird/Forest/Base.agda | splintah/combinatory-logic | df8bf877e60b3059532c54a247a36a3d83cd55b0 | [
"MIT"
] | 1 | 2022-02-28T23:44:42.000Z | 2022-02-28T23:44:42.000Z | Mockingbird/Forest/Base.agda | splintah/combinatory-logic | df8bf877e60b3059532c54a247a36a3d83cd55b0 | [
"MIT"
] | null | null | null | Mockingbird/Forest/Base.agda | splintah/combinatory-logic | df8bf877e60b3059532c54a247a36a3d83cd55b0 | [
"MIT"
] | null | null | null | module Mockingbird.Forest.Base where
open import Algebra using (Op₂; Congruent₂; LeftCongruent; RightCongruent)
open import Level using (_⊔_) renaming (suc to lsuc)
open import Relation.Binary using (Rel; IsEquivalence; Setoid)
open import Relation.Nullary using (¬_)
record IsForest {b ℓ} (Bird : Set b) (_≈_ : Rel Bi... | 26.207547 | 92 | 0.634269 |
4df67933ac16d89064b44ba83ae4c5b647b1f0c2 | 568 | agda | Agda | slides/agda/half.agda | JLimperg/msc-thesis | a6b4cf13104112c76a07d17a9dd18f3d3589d449 | [
"MIT"
] | 1 | 2019-12-14T01:30:46.000Z | 2019-12-14T01:30:46.000Z | slides/agda/half.agda | JLimperg/msc-thesis | a6b4cf13104112c76a07d17a9dd18f3d3589d449 | [
"MIT"
] | null | null | null | slides/agda/half.agda | JLimperg/msc-thesis | a6b4cf13104112c76a07d17a9dd18f3d3589d449 | [
"MIT"
] | null | null | null | module half where
open import Relation.Binary.PropositionalEquality using (_≡_ ; refl)
open import Size
data ℕ : Set where
zero : ℕ
suc : ℕ → ℕ
{-# BUILTIN NATURAL ℕ #-}
half : ℕ → ℕ
half zero = zero
half (suc zero) = zero
half (suc (suc i)) = suc (half i)
_ : half 5 ≡ 2
_ = refl
data ℕₛ (n : Size) : Set wher... | 16.228571 | 68 | 0.573944 |
4acdfbf4bdb7fa829ed701d6eb8ad00e06224b59 | 32 | agda | Agda | test/interaction/Issue2728-2.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/interaction/Issue2728-2.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/interaction/Issue2728-2.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | F : {_ : Set₁} → Set₁
F {A} = A
| 10.666667 | 21 | 0.40625 |
0e13f9904479df9fdcfede37bdf4beb17f711efc | 3,121 | agda | Agda | test/Succeed/Issue1795.agda | cagix/agda | cc026a6a97a3e517bb94bafa9d49233b067c7559 | [
"BSD-2-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue1795.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue1795.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2016-01-22
-- special size checking j : Size< i |- j : Size< ↑ j
-- was missing from checkInternal
-- {-# OPTIONS -v tc.polarity:10 #-}
-- {-# OPTIONS -v tc.with.type:50 #-}
-- {-# OPTIONS -v tc.check.internal:30 -v tc.infer.internal:30 #-}
{-# OPTIONS --sized-types #-}
open import Common.Unit
open impor... | 28.117117 | 107 | 0.575457 |
1ce8a992e827c3307cf980c7fff3cc5d25fda75c | 689 | agda | Agda | test/Succeed/Issue4016.agda | vlopezj/agda | ff4d89e75970cf27599fb9f572bd43c9455cbb56 | [
"BSD-3-Clause"
] | 2 | 2019-10-29T09:40:30.000Z | 2020-09-20T00:28:57.000Z | test/Succeed/Issue4016.agda | vikfret/agda | 49ad0b3f0d39c01bc35123478b857e702b29fb9d | [
"BSD-3-Clause"
] | 3 | 2018-11-14T15:31:44.000Z | 2019-04-01T19:39:26.000Z | test/Succeed/Issue4016.agda | vikfret/agda | 49ad0b3f0d39c01bc35123478b857e702b29fb9d | [
"BSD-3-Clause"
] | 1 | 2015-09-15T14:36:15.000Z | 2015-09-15T14:36:15.000Z |
-- Andreas, 2019-08-20, issue #4016
-- Debug printing should not crash Agda even if there are
-- __IMPOSSIBLE__s buried inside values that get printed.
{-# OPTIONS -v scope.decl.trace:80 #-} -- KEEP!
-- The following is some random code (see issue #4010)
-- that happened to trigger an internal error with verbosity... | 23.758621 | 64 | 0.683599 |
39715b7dc66fea0d5c2af1fc96e7b58c7e16ca2c | 1,989 | agda | Agda | Categories/Object/Products/Properties.agda | copumpkin/categories | 36f4181d751e2ecb54db219911d8c69afe8ba892 | [
"BSD-3-Clause"
] | 98 | 2015-04-15T14:57:33.000Z | 2022-03-08T05:20:36.000Z | Categories/Object/Products/Properties.agda | p-pavel/categories | e41aef56324a9f1f8cf3cd30b2db2f73e01066f2 | [
"BSD-3-Clause"
] | 19 | 2015-05-23T06:47:10.000Z | 2019-08-09T16:31:40.000Z | Categories/Object/Products/Properties.agda | p-pavel/categories | e41aef56324a9f1f8cf3cd30b2db2f73e01066f2 | [
"BSD-3-Clause"
] | 23 | 2015-02-05T13:03:09.000Z | 2021-11-11T13:50:56.000Z | {-# OPTIONS --universe-polymorphism #-}
open import Categories.Category
module Categories.Object.Products.Properties {o ℓ e}
(C : Category o ℓ e) where
open Category C
open import Level
import Categories.Object.Terminal
open Categories.Object.Terminal C
import Categories.Object.BinaryProducts
open Categories.O... | 21.387097 | 87 | 0.441428 |
df2d19e5b9551849f6f131bada2e62bad3a605ed | 311 | agda | Agda | test/Common/Bool.agda | alex-mckenna/agda | 78b62cd24bbd570271a7153e44ad280e52ef3e29 | [
"BSD-3-Clause"
] | 7 | 2018-11-05T22:13:36.000Z | 2018-11-06T16:38:43.000Z | test/Common/Bool.agda | andersk/agda | 56928ff709dcb931cb9a48c4790e5ed3739e3032 | [
"BSD-3-Clause"
] | 16 | 2018-10-08T00:32:04.000Z | 2019-09-08T13:47:04.000Z | test/Common/Bool.agda | xekoukou/agda-ocaml | 026a8f8473ab91f99c3f6545728e71fa847d2720 | [
"BSD-3-Clause"
] | 1 | 2019-03-05T20:02:38.000Z | 2019-03-05T20:02:38.000Z | module Common.Bool where
open import Agda.Builtin.Bool public
not : Bool -> Bool
not true = false
not false = true
notnot : Bool -> Bool
notnot true = not (not true)
notnot false = not (not false)
if_then_else_ : ∀ {a} {A : Set a} → Bool → A → A → A
if true then t else f = t
if false then t else f = f
| 18.294118 | 52 | 0.655949 |
4d9d1b83fdfebe0c2bcc6f881c5b3103d75b4819 | 2,538 | agda | Agda | HoTT/Identity/Identity.agda | michaelforney/hott | ef4d9fbb9cc0352657f1a6d0d3534d4c8a6fd508 | [
"0BSD"
] | null | null | null | HoTT/Identity/Identity.agda | michaelforney/hott | ef4d9fbb9cc0352657f1a6d0d3534d4c8a6fd508 | [
"0BSD"
] | null | null | null | HoTT/Identity/Identity.agda | michaelforney/hott | ef4d9fbb9cc0352657f1a6d0d3534d4c8a6fd508 | [
"0BSD"
] | null | null | null | {-# OPTIONS --without-K #-}
open import HoTT.Base
open import HoTT.Identity
open import HoTT.Equivalence
open import HoTT.Homotopy
module HoTT.Identity.Identity where
ap⁻¹ : ∀ {i j} {A : 𝒰 i} {B : 𝒰 j} ((f , _) : A ≃ B) {a a' : A} →
f a == f a' → a == a'
ap⁻¹ e {a} {a'} p = η a ⁻¹ ∙ ap g p ∙ η a'
where ope... | 40.285714 | 88 | 0.384161 |
069b71991e55c1635416a9fd452e9fee82bd9c43 | 18 | agda | Agda | test/Fail/Issue3257.tex.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/Issue3257.tex.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/Issue3257.tex.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | postulate A : Set
| 9 | 17 | 0.722222 |
0e6476d713e1243440cc9f72bb425596232443c5 | 872 | agda | Agda | test/Succeed/Issue2223b.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue2223b.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue2223b.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | {-# OPTIONS --allow-unsolved-metas #-}
module _ where
open import Agda.Primitive
postulate Applicative : ∀ {a b} (F : Set a → Set b) → Set (lsuc a ⊔ b)
record Traversable {a} (T : Set a) : Set (lsuc a) where
constructor mkTrav
field traverse : ∀ {F} {{AppF : Applicative F}} → T → F T
-- unsolved metas in typ... | 28.129032 | 83 | 0.651376 |
2f659f9f7b704ecc8f29f829849db43816d8dd60 | 2,105 | agda | Agda | agda-stdlib/src/Data/List/Membership/Setoid.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 5 | 2020-10-07T12:07:53.000Z | 2020-10-10T21:41:32.000Z | agda-stdlib/src/Data/List/Membership/Setoid.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | null | null | null | agda-stdlib/src/Data/List/Membership/Setoid.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 1 | 2021-11-04T06:54:45.000Z | 2021-11-04T06:54:45.000Z | ------------------------------------------------------------------------
-- The Agda standard library
--
-- List membership and some related definitions
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
open import Relation.Binary
module Data.List.Membership.... | 30.071429 | 72 | 0.47886 |
1ddd0d61d0e0cbda35f7aed838ce4f4cdb4759a9 | 1,033 | agda | Agda | src/fot/FOTC/Data/Nat/Divisibility/NotBy0.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 11 | 2015-09-03T20:53:42.000Z | 2021-09-12T16:09:54.000Z | src/fot/FOTC/Data/Nat/Divisibility/NotBy0.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 2 | 2016-10-12T17:28:16.000Z | 2017-01-01T14:34:26.000Z | src/fot/FOTC/Data/Nat/Divisibility/NotBy0.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 3 | 2016-09-19T14:18:30.000Z | 2018-03-14T08:50:00.000Z | ------------------------------------------------------------------------------
-- The relation of divisibility on partial natural numbers
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no... | 34.433333 | 78 | 0.483059 |
12ce1bff91403f44c554e62ec6e5c7ac557d4a46 | 19,888 | agda | Agda | Cubical/Algebra/CommAlgebra/Instances/FreeCommAlgebra.agda | mzeuner/cubical | 63c770b381039c0132c17d7913f4566b35984701 | [
"MIT"
] | null | null | null | Cubical/Algebra/CommAlgebra/Instances/FreeCommAlgebra.agda | mzeuner/cubical | 63c770b381039c0132c17d7913f4566b35984701 | [
"MIT"
] | null | null | null | Cubical/Algebra/CommAlgebra/Instances/FreeCommAlgebra.agda | mzeuner/cubical | 63c770b381039c0132c17d7913f4566b35984701 | [
"MIT"
] | null | null | null | {-# OPTIONS --safe #-}
module Cubical.Algebra.CommAlgebra.Instances.FreeCommAlgebra where
{-
The free commutative algebra over a commutative ring,
or in other words the ring of polynomials with coefficients in a given ring.
Note that this is a constructive definition, which entails that polynomials
cannot be r... | 43.614035 | 102 | 0.467971 |
5055488a510cda76c23416681e539a520e766b96 | 236 | agda | Agda | test/Fail/Issue373.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/Issue373.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/Issue373.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | module Issue373 where
data Nat : Set where
zero : Nat
suc : (n : Nat) → Nat
{-# BUILTIN NATURAL Nat #-}
{-# FOREIGN GHC data Nat = Zero | Suc Nat #-}
{-# COMPILE GHC Nat = data Nat (Zero | Suc) #-} -- should fail when compiling
| 21.454545 | 77 | 0.614407 |
0b457a4a9dccd9bd48a1fdd509ed44d43555aeed | 736 | agda | Agda | test/succeed/Issue1136.agda | larrytheliquid/agda | 477c8c37f948e6038b773409358fd8f38395f827 | [
"MIT"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | test/succeed/Issue1136.agda | masondesu/agda | 70c8a575c46f6a568c7518150a1a64fcd03aa437 | [
"MIT"
] | null | null | null | test/succeed/Issue1136.agda | masondesu/agda | 70c8a575c46f6a568c7518150a1a64fcd03aa437 | [
"MIT"
] | 1 | 2022-03-12T11:35:18.000Z | 2022-03-12T11:35:18.000Z | -- Andreas, 2014-05-20 Triggered by Andrea Vezzosi & NAD
{-# OPTIONS --copatterns #-}
-- {-# OPTIONS -v tc.conv.coerce:10 #-}
open import Common.Size
Size≤ : Size → Set
Size≤ i = Size< ↑ i
postulate
Dom : Size → Set
mapDom : ∀ i (j : Size≤ i) → Dom i → Dom j
record ∞Dom i : Set where
field
force : ∀ (j... | 24.533333 | 58 | 0.580163 |
fbaf3bb592fa76b0d48c2901503c515b4aaae46d | 5,495 | agda | Agda | src/Prelude.agda | mietek/nbe-correctness | 54e9a83a8db4e33a33bf5dae5b2d651ad38aa3d5 | [
"X11"
] | 3 | 2017-03-23T06:25:23.000Z | 2017-03-23T18:51:34.000Z | src/Prelude.agda | mietek/nbe-correctness | 54e9a83a8db4e33a33bf5dae5b2d651ad38aa3d5 | [
"X11"
] | null | null | null | src/Prelude.agda | mietek/nbe-correctness | 54e9a83a8db4e33a33bf5dae5b2d651ad38aa3d5 | [
"X11"
] | null | null | null | module Prelude where
open import Agda.Primitive public
using (_⊔_)
renaming (lsuc to ↑_)
-- Built-in implication.
id : ∀ {ℓ} {X : Set ℓ} → X → X
id x = x
const : ∀ {ℓ ℓ′} {X : Set ℓ} {Y : Set ℓ′} → X → Y → X
const x y = x
flip : ∀ {ℓ ℓ′ ℓ″} {X : Set ℓ} {Y : Set ℓ′} {Z : Set ℓ″} →
(X → Y → Z) → Y → X → ... | 21.29845 | 79 | 0.44859 |
063fc54551fc842bfb86123ee862607ad8fa9b10 | 1,147 | agda | Agda | test/Succeed/Issue5075.agda | sseefried/agda | 6b13364d36eeb60d8ec15eaf8effe23c73401900 | [
"BSD-2-Clause"
] | 1 | 2022-02-05T01:20:23.000Z | 2022-02-05T01:20:23.000Z | test/Succeed/Issue5075.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 6 | 2021-10-18T08:12:24.000Z | 2021-11-24T08:31:10.000Z | test/Succeed/Issue5075.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | null | null | null | open import Agda.Builtin.Reflection renaming (bindTC to _>>=_)
open import Agda.Builtin.Sigma
open import Agda.Builtin.List
open import Agda.Builtin.Unit
open import Agda.Builtin.Nat
map : {A B : Set} → (A → B) → List A → List B
map f [] = []
map f (x ∷ xs) = f x ∷ map f xs
reverseAcc : {A : Set} → List A → List A → ... | 30.184211 | 116 | 0.584133 |
0bb1c5b6a558342774c31c950dbb259ef587b759 | 131 | agda | Agda | propositional-equality.agda | guilhermehas/Equality | e1104012d85d2072318656f6c6d31acff75c9460 | [
"MIT"
] | 1 | 2021-10-01T06:04:21.000Z | 2021-10-01T06:04:21.000Z | propositional-equality.agda | guilhermehas/Equality | e1104012d85d2072318656f6c6d31acff75c9460 | [
"MIT"
] | null | null | null | propositional-equality.agda | guilhermehas/Equality | e1104012d85d2072318656f6c6d31acff75c9460 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical #-}
module propositional-equality where
open import Cubical.Foundations.Prelude
open import Agda.Primitive
| 18.714286 | 39 | 0.793893 |
a14c0d99017f4aaf667b7d87a8858f1d05699085 | 1,798 | agda | Agda | Types.agda | danelahman/higher-order-aeff-agda | b41df71f4456666aab4bd14e13d285c31af80ff6 | [
"MIT"
] | 2 | 2021-08-17T15:00:34.000Z | 2022-02-05T18:50:26.000Z | Types.agda | danelahman/modal-aeff-agda | b41df71f4456666aab4bd14e13d285c31af80ff6 | [
"MIT"
] | null | null | null | Types.agda | danelahman/modal-aeff-agda | b41df71f4456666aab4bd14e13d285c31af80ff6 | [
"MIT"
] | null | null | null | open import Data.Empty
open import Data.Product
open import Data.Unit
open import Relation.Binary.PropositionalEquality hiding ([_] ; Extensionality)
open import Relation.Nullary
open import Relation.Nullary.Negation
open import EffectAnnotations
module Types where
-- BASE TYPES
postulate BType : Set
-- VALUE AN... | 18.536082 | 79 | 0.497219 |
df1a2e05e4d48050ab3a43b8003bdbfa4df8a10b | 1,525 | agda | Agda | lib/Explore/Two.agda | crypto-agda/explore | 16bc8333503ff9c00d47d56f4ec6113b9269a43e | [
"BSD-3-Clause"
] | 2 | 2016-06-05T09:25:32.000Z | 2017-06-28T19:19:29.000Z | lib/Explore/Two.agda | crypto-agda/explore | 16bc8333503ff9c00d47d56f4ec6113b9269a43e | [
"BSD-3-Clause"
] | 1 | 2019-03-16T14:24:04.000Z | 2019-03-16T14:24:04.000Z | lib/Explore/Two.agda | crypto-agda/explore | 16bc8333503ff9c00d47d56f4ec6113b9269a43e | [
"BSD-3-Clause"
] | null | null | null | {-# OPTIONS --without-K #-}
open import Type
open import Type.Identities
open import Level.NP
open import Data.Two
open import Function
open import Function.Extensionality
open import Data.Product
open import Data.Sum
open import Data.Fin
open import Relation.Binary.PropositionalEquality.NP using (_≡_; refl; !_; _∙_)
o... | 22.101449 | 79 | 0.592787 |
10309dc1d6ce8c224a45e22f9ef04076d939fc21 | 3,163 | agda | Agda | old/Metalogic/Metalogic/Classical/Propositional/TruthSemanticsModel.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | old/Metalogic/Metalogic/Classical/Propositional/TruthSemanticsModel.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | old/Metalogic/Metalogic/Classical/Propositional/TruthSemanticsModel.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | module Metalogic.Classical.Propositional.TruthSemanticsModel {ℓ} (Proposition : Set(ℓ)) where
import Lvl
open import Data.Boolean
open import Data
open import Data.Tuple as Tuple using (_⨯_ ; _,_)
open import Functional
open import Metalogic.Classical.Propositional.Syntax{ℓ} (Proposition)
renaming (
⊤ to ... | 38.108434 | 128 | 0.595005 |
1c8b9dd2f9fcfbbcf4fa77093b1ac839bd473a35 | 878 | agda | Agda | test/Succeed/Issue392.agda | pthariensflame/agda | 222c4c64b2ccf8e0fc2498492731c15e8fef32d4 | [
"BSD-3-Clause"
] | 3 | 2015-03-28T14:51:03.000Z | 2015-12-07T20:14:00.000Z | test/Succeed/Issue392.agda | Blaisorblade/Agda | 802a28aa8374f15fe9d011ceb80317fdb1ec0949 | [
"BSD-3-Clause"
] | null | null | null | test/Succeed/Issue392.agda | Blaisorblade/Agda | 802a28aa8374f15fe9d011ceb80317fdb1ec0949 | [
"BSD-3-Clause"
] | 1 | 2019-03-05T20:02:38.000Z | 2019-03-05T20:02:38.000Z | -- Andreas, 2011-09-11
module Issue392 where
import Common.Irrelevance
-- Create an irrelevant record R1 (all fields irrelevant).
record R1 : Set1 where
field
.f1 : Set
{- module R1 .(r : R1) where
.f1 : Set -- = R1.f1 r
-}
-- Create an irrelevant instance f2 of R1.
record R2 : Set2 where
field
.f2... | 20.904762 | 58 | 0.593394 |
0e7c880b2195c173b2dd94e89882c8a0904aaa73 | 1,195 | agda | Agda | src/data/lib/prim/Agda/Builtin/Nat.agda | redfish64/autonomic-agda | c0ae7d20728b15d7da4efff6ffadae6fe4590016 | [
"BSD-3-Clause"
] | null | null | null | src/data/lib/prim/Agda/Builtin/Nat.agda | redfish64/autonomic-agda | c0ae7d20728b15d7da4efff6ffadae6fe4590016 | [
"BSD-3-Clause"
] | null | null | null | src/data/lib/prim/Agda/Builtin/Nat.agda | redfish64/autonomic-agda | c0ae7d20728b15d7da4efff6ffadae6fe4590016 | [
"BSD-3-Clause"
] | null | null | null |
module Agda.Builtin.Nat where
open import Agda.Builtin.Bool
data Nat : Set where
zero : Nat
suc : (n : Nat) → Nat
{-# BUILTIN NATURAL Nat #-}
infix 4 _==_ _<_
infixl 6 _+_ _-_
infixl 7 _*_
_+_ : Nat → Nat → Nat
zero + m = m
suc n + m = suc (n + m)
{-# BUILTIN NATPLUS _+_ #-}
_-_ : Nat → Nat → Nat
n -... | 19.274194 | 57 | 0.555649 |
397ad41ce2041452a91be7be93f037d82355eaac | 6,070 | agda | Agda | src/Categories/Diagram/Coend/Properties.agda | jaykru/agda-categories | a4053cf700bcefdf73b857c3352f1eae29382a60 | [
"MIT"
] | 279 | 2019-06-01T14:36:40.000Z | 2022-03-22T00:40:14.000Z | src/Categories/Diagram/Coend/Properties.agda | seanpm2001/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | 236 | 2019-06-01T14:53:54.000Z | 2022-03-28T14:31:43.000Z | src/Categories/Diagram/Coend/Properties.agda | seanpm2001/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | 64 | 2019-06-02T16:58:15.000Z | 2022-03-14T02:00:59.000Z | {-# OPTIONS --without-K --safe #-}
module Categories.Diagram.Coend.Properties where
open import Categories.Category.Core using (Category)
open import Categories.Category.Product
import Categories.Category.Construction.Cowedges as Cowedges
open import Categories.Category.Construction.Functors
open import Categories.Ca... | 38.176101 | 123 | 0.592092 |
3117120599021e1e8a249c22b785f6f122f102b7 | 2,409 | agda | Agda | container/m/extensionality.agda | HoTT/M-types | beebe176981953ab48f37de5eb74557cfc5402f4 | [
"BSD-3-Clause"
] | 27 | 2015-04-14T15:47:03.000Z | 2022-01-09T07:26:57.000Z | src/container/m/extensionality.agda | pcapriotti/agda-base | bbbc3bfb2f80ad08c8e608cccfa14b83ea3d258c | [
"BSD-3-Clause"
] | 4 | 2015-02-02T14:32:16.000Z | 2016-10-26T11:57:26.000Z | src/container/m/extensionality.agda | pcapriotti/agda-base | bbbc3bfb2f80ad08c8e608cccfa14b83ea3d258c | [
"BSD-3-Clause"
] | 4 | 2015-02-02T12:17:00.000Z | 2019-05-04T19:31:00.000Z | module container.m.extensionality where
open import sum
open import equality
open import container.core
open import container.fixpoint
open import container.equality
open import container.m.core
module Extensionality {li la lb}(c : Container li la lb) where
private
module C where
open Definition c public
... | 25.62766 | 69 | 0.499792 |
1c3fd1a8ceed5b3964db37a029e0905358c9373a | 16,114 | agda | Agda | src/Delay-monad/Sized/Bisimilarity.agda | nad/delay-monad | 495f9996673d0f1f34ce202902daaa6c39f8925e | [
"MIT"
] | null | null | null | src/Delay-monad/Sized/Bisimilarity.agda | nad/delay-monad | 495f9996673d0f1f34ce202902daaa6c39f8925e | [
"MIT"
] | null | null | null | src/Delay-monad/Sized/Bisimilarity.agda | nad/delay-monad | 495f9996673d0f1f34ce202902daaa6c39f8925e | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- A combined definition of strong and weak bisimilarity and
-- expansion, along with various properties
------------------------------------------------------------------------
{-# OPTIONS --sized-types #-}
module Delay-monad.Sized.Bisimilarity... | 32.885714 | 121 | 0.464503 |
1cdb93a454c94804223ccc66ec278e301323c23c | 402 | agda | Agda | test/Fail/Issue1976.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/Issue1976.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/Issue1976.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2016-12-31, issue #1976 raised by nad
-- Check for correct parameters in projection pattern
-- {-# OPTIONS -v tc.lhs.split:40 #-}
postulate
A B : Set
module M (_ : Set) where
record R : Set₂ where
field
F : Set₁
open R public
open M A
wrong : M.R B
F wrong = Set
-- Expected error:
--... | 16.08 | 61 | 0.639303 |
a1af26bf6d0878b4a3a2c8eb5ed5e8e7acade38e | 520 | agda | Agda | src/data/lib/prim/Agda/Builtin/List.agda | zliu41/agda | 73405f70bced057d24dd4bf122d53f9548544aba | [
"BSD-3-Clause"
] | 1 | 2020-04-26T09:35:17.000Z | 2020-04-26T09:35:17.000Z | src/data/lib/prim/Agda/Builtin/List.agda | zliu41/agda | 73405f70bced057d24dd4bf122d53f9548544aba | [
"BSD-3-Clause"
] | null | null | null | src/data/lib/prim/Agda/Builtin/List.agda | zliu41/agda | 73405f70bced057d24dd4bf122d53f9548544aba | [
"BSD-3-Clause"
] | 1 | 2021-04-18T13:34:07.000Z | 2021-04-18T13:34:07.000Z | {-# OPTIONS --without-K --safe --no-sized-types --no-guardedness
--no-subtyping #-}
module Agda.Builtin.List where
infixr 5 _∷_
data List {a} (A : Set a) : Set a where
[] : List A
_∷_ : (x : A) (xs : List A) → List A
{-# BUILTIN LIST List #-}
{-# COMPILE JS List = function(x,v) {
if (x.length < ... | 28.888889 | 92 | 0.536538 |
3191cde2fb31aeca4020c9c90388c0db212df6fb | 970 | agda | Agda | Cubical/Relation/Binary/Raw/Construct/Always.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | Cubical/Relation/Binary/Raw/Construct/Always.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | Cubical/Relation/Binary/Raw/Construct/Always.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Relation.Binary.Raw.Construct.Always where
open import Cubical.Core.Everything
open import Cubical.Relation.Binary.Raw
open import Cubical.Relation.Binary.Raw.Construct.Constant using (Const)
open import Cubical.Data.Unit.Polymorphic
-----------------... | 26.216216 | 72 | 0.582474 |
fba9200511ce140fbf8d41d782724efc1a30857f | 615 | agda | Agda | test/succeed/RewriteAndWhere.agda | asr/agda-kanso | aa10ae6a29dc79964fe9dec2de07b9df28b61ed5 | [
"MIT"
] | 1 | 2019-11-27T07:26:06.000Z | 2019-11-27T07:26:06.000Z | test/succeed/RewriteAndWhere.agda | dagit/agda | 4383a3d20328a6c43689161496cee8eb479aca08 | [
"MIT"
] | null | null | null | test/succeed/RewriteAndWhere.agda | dagit/agda | 4383a3d20328a6c43689161496cee8eb479aca08 | [
"MIT"
] | null | null | null | module RewriteAndWhere where
open import Common.Equality
sym : {A : Set}{a b : A} → a ≡ b → b ≡ a
sym refl = refl
data ℕ : Set where
zero : ℕ
good : (a b : ℕ) → a ≡ b → b ≡ a
good a b eq with a | eq
... | .b | refl = foo
where
foo : b ≡ b
foo = refl
mutual
aux : (a b : ℕ)(w : ℕ) → w ≡ b → b ≡ w
aux... | 16.621622 | 40 | 0.479675 |
3159287729235ebbe5a1dc33490e5fdd2c8f6d80 | 554 | agda | Agda | examples/outdated-and-incorrect/clowns/Derivative.agda | asr/agda-kanso | aa10ae6a29dc79964fe9dec2de07b9df28b61ed5 | [
"MIT"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | examples/outdated-and-incorrect/clowns/Derivative.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | examples/outdated-and-incorrect/clowns/Derivative.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | 1 | 2022-03-12T11:35:18.000Z | 2022-03-12T11:35:18.000Z |
module Derivative where
open import Sets
open import Functor
import Isomorphism
∂ : U -> U
∂ (K A) = K [0]
∂ Id = K [1]
∂ (F + G) = ∂ F + ∂ G
∂ (F × G) = ∂ F × G + F × ∂ G
open Semantics
-- Plugging a hole
plug-∂ : {X : Set}(F : U) -> ⟦ ∂ F ⟧ X -> X -> ⟦ F ⟧ X
plug-∂ (K _) () x
pl... | 22.16 | 57 | 0.409747 |
dc4e0198522b7723157fe9303e35c9d38eb6263a | 1,705 | agda | Agda | test/Succeed/Issue1944-Stream.agda | alex-mckenna/agda | 78b62cd24bbd570271a7153e44ad280e52ef3e29 | [
"BSD-3-Clause"
] | 3 | 2015-03-28T14:51:03.000Z | 2015-12-07T20:14:00.000Z | test/Succeed/Issue1944-Stream.agda | andersk/agda | 56928ff709dcb931cb9a48c4790e5ed3739e3032 | [
"BSD-3-Clause"
] | null | null | null | test/Succeed/Issue1944-Stream.agda | andersk/agda | 56928ff709dcb931cb9a48c4790e5ed3739e3032 | [
"BSD-3-Clause"
] | 1 | 2019-03-05T20:02:38.000Z | 2019-03-05T20:02:38.000Z | -- AIM XXIII, Andreas, 2016-04-24
-- Overloaded projections and projection patterns
-- {-# OPTIONS -v tc.proj.amb:30 #-}
-- {-# OPTIONS -v tc.lhs.split:20 #-}
module _ where
import Common.Level
open import Common.Prelude hiding (map)
open import Common.Equality
module M (A : Set) where
record Stream : Set where
... | 25.073529 | 58 | 0.615836 |
0bde5648dec6b172e5436317f52e91bdef90d587 | 130 | agda | Agda | test/interaction/Issue4954-2.agda | AntoineAllioux/agda | 68ec2312961776e415c99d2839e41a92ffe464db | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/interaction/Issue4954-2.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/interaction/Issue4954-2.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | {-# OPTIONS --cubical #-}
F : Set → Set
F A = A
record R : Set₁ where
field
A : Set
r : Set → R
r A = λ where
.R.A → A
| 10 | 25 | 0.5 |
1dc933b43e2ab6d8fcd7f4f35c22045a194272d9 | 4,060 | agda | Agda | GSeTT/Rules.agda | thibautbenjamin/catt-formalization | 3a02010a869697f4833c9bc6047d66ca27b87cf2 | [
"MIT"
] | null | null | null | GSeTT/Rules.agda | thibautbenjamin/catt-formalization | 3a02010a869697f4833c9bc6047d66ca27b87cf2 | [
"MIT"
] | null | null | null | GSeTT/Rules.agda | thibautbenjamin/catt-formalization | 3a02010a869697f4833c9bc6047d66ca27b87cf2 | [
"MIT"
] | null | null | null | {-# OPTIONS --rewriting --without-K #-}
open import Agda.Primitive
open import Prelude
open import GSeTT.Syntax
{- Typing Rules and basic syntactic properties for the type theory for globular sets -}
module GSeTT.Rules where
{- Well-formedness statements ≡ inference rules -}
data _⊢C : Pre-Ctx → Set₁
data _⊢T_ ... | 37.247706 | 136 | 0.422906 |
a10908419d42e3f3f77ce9b9b38af6f675337ab6 | 196 | agda | Agda | test/Succeed/AbsurdPattern.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/AbsurdPattern.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/AbsurdPattern.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
-- Pattern matching on a (decidably) empty type allows you to omit the
-- right-hand side.
module AbsurdPattern where
data Empty : Set where
elim-Empty : {A : Set} -> Empty -> A
elim-Empty ()
| 17.818182 | 70 | 0.693878 |
200d8f3f53894bac975413cd00b6cd1bc44a706a | 1,194 | agda | Agda | Categories/Fibration.agda | copumpkin/categories | 36f4181d751e2ecb54db219911d8c69afe8ba892 | [
"BSD-3-Clause"
] | 98 | 2015-04-15T14:57:33.000Z | 2022-03-08T05:20:36.000Z | Categories/Fibration.agda | p-pavel/categories | e41aef56324a9f1f8cf3cd30b2db2f73e01066f2 | [
"BSD-3-Clause"
] | 19 | 2015-05-23T06:47:10.000Z | 2019-08-09T16:31:40.000Z | Categories/Fibration.agda | p-pavel/categories | e41aef56324a9f1f8cf3cd30b2db2f73e01066f2 | [
"BSD-3-Clause"
] | 23 | 2015-02-05T13:03:09.000Z | 2021-11-11T13:50:56.000Z | {-# OPTIONS --universe-polymorphism #-}
module Categories.Fibration where
open import Level hiding (lift)
open import Data.Product
open import Categories.Category
open import Categories.Functor hiding (_∘_; _≡_)
open import Categories.Morphism.Cartesian
import Categories.Morphisms as Morphisms
record CartesianLiftin... | 27.767442 | 128 | 0.622278 |
0ed03b0e3c0b242114cdef79a211fa8589861966 | 2,074 | agda | Agda | TD6/List.agda | erwinkn/program-eq-proof | 9a0d4a3f97103550a67e5e9ecbc8322bf0a8be23 | [
"MIT"
] | null | null | null | TD6/List.agda | erwinkn/program-eq-proof | 9a0d4a3f97103550a67e5e9ecbc8322bf0a8be23 | [
"MIT"
] | null | null | null | TD6/List.agda | erwinkn/program-eq-proof | 9a0d4a3f97103550a67e5e9ecbc8322bf0a8be23 | [
"MIT"
] | null | null | null | {- --- 4. Lists --- -}
data List (A : Set) : Set where
[] : List A
_∷_ : A → List A → List A
infixr 5 _∷_
open import Data.Nat
open import Relation.Binary.PropositionalEquality
{- 4.1 Length -}
length : {A : Set} → List A → ℕ
length [] = 0
length (x ∷ l) = 1 + (length l)
{- 4.2 List reversal -}
concat : {A ... | 26.935065 | 91 | 0.559788 |
066c62821371906dbe8851610c0af2eddfe23c29 | 26,447 | agda | Agda | src/Equivalence/Path-split.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | 3 | 2020-05-21T22:58:50.000Z | 2021-09-02T17:18:15.000Z | src/Equivalence/Path-split.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | null | null | null | src/Equivalence/Path-split.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- Some alternative definitions of the concept of being an equivalence
------------------------------------------------------------------------
-- Partly based on the blog post "Universal properties without
-- function extensionality" by Mike Shu... | 39.414307 | 135 | 0.479449 |
06f71e99950b70a4f45a9fb8ca5b93982607fe9c | 2,900 | agda | Agda | src/index.agda | JLimperg/msc-thesis-code | 104cddc6b65386c7e121c13db417aebfd4b7a863 | [
"MIT"
] | 5 | 2021-04-13T21:31:17.000Z | 2021-06-26T06:37:31.000Z | src/index.agda | JLimperg/msc-thesis-code | 104cddc6b65386c7e121c13db417aebfd4b7a863 | [
"MIT"
] | null | null | null | src/index.agda | JLimperg/msc-thesis-code | 104cddc6b65386c7e121c13db417aebfd4b7a863 | [
"MIT"
] | null | null | null | -- # A Reflexive Graph Model of Sized Types
-- This is the formalisation of my M.Sc. thesis, available at
-- https://limperg.de/paper/msc-thesis/
-- I define λST, a simply typed lambda calculus extended with sized types. I
-- then give a reflexive graph model of λST which incorporates a notion of size
-- irrelevan... | 24.576271 | 79 | 0.788276 |
fb5a7b23dce6c8349960d76ddfb4d12f26541821 | 743 | agda | Agda | test/Fail/Issue295.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/Issue295.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/Issue295.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- {-# OPTIONS -v tc.with:50 #-}
module Issue295 where
data ⊥ : Set where
data Arr : Set where
_⟶_ : ⊥ → ⊥ → Arr
_﹔_ : Arr → Arr → Arr
(a ⟶ b)﹔(c ⟶ d) with b
... | ()
data Fun : Arr → Set where
∙ : ∀ a b c d → Fun (a ⟶ b) → Fun (c ⟶ d) → Fun ((a ⟶ b)﹔(c ⟶ d))
f : ∀ a b c d e f → Fun (a ⟶ b) → Fun (c ⟶ d) → Fun... | 25.62069 | 70 | 0.508748 |
c5699424064ae764646e525fe6ffe22214328478 | 1,950 | agda | Agda | theorems/cw/cohomology/HigherCohomologyGroupsOnDiag.agda | mikeshulman/HoTT-Agda | e7d663b63d89f380ab772ecb8d51c38c26952dbb | [
"MIT"
] | null | null | null | theorems/cw/cohomology/HigherCohomologyGroupsOnDiag.agda | mikeshulman/HoTT-Agda | e7d663b63d89f380ab772ecb8d51c38c26952dbb | [
"MIT"
] | null | null | null | theorems/cw/cohomology/HigherCohomologyGroupsOnDiag.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
open import cohomology.Theory
open import groups.ExactSequence
open import groups.Exactness
open import groups.HomSequence
open import groups.KernelImageUniqueFactorization
import cw.cohomology.GridPtdMap as GPM
open import cw.CW
module cw.cohomology.HigherCoh... | 29.545455 | 88 | 0.651282 |
20a7871deb90eb4ecbe4247aaee222e84e9a3c82 | 1,237 | agda | Agda | src/Tactic/Reflection/Telescope.agda | lclem/agda-prelude | 75016b4151ed601e28f4462cd7b6b1aaf5d0d1a6 | [
"MIT"
] | null | null | null | src/Tactic/Reflection/Telescope.agda | lclem/agda-prelude | 75016b4151ed601e28f4462cd7b6b1aaf5d0d1a6 | [
"MIT"
] | null | null | null | src/Tactic/Reflection/Telescope.agda | lclem/agda-prelude | 75016b4151ed601e28f4462cd7b6b1aaf5d0d1a6 | [
"MIT"
] | null | null | null |
module Tactic.Reflection.Telescope where
open import Prelude hiding (abs)
open import Builtin.Reflection
open import Tactic.Reflection.DeBruijn
Telescope = List (Arg Type)
telView : Type → Telescope × Type
telView (pi a (abs _ b)) = first (_∷_ a) (telView b)
telView a = [] , a
visibleArity : Type → ... | 23.788462 | 61 | 0.641876 |
4d04760abadabadf249cb8c67524c9d5fbfc5028 | 221 | agda | Agda | test/Common/Nat.agda | favonia/agda | 8d433b967567c08afe15d04a5cb63b6f6d8884ee | [
"BSD-2-Clause"
] | null | null | null | test/Common/Nat.agda | favonia/agda | 8d433b967567c08afe15d04a5cb63b6f6d8884ee | [
"BSD-2-Clause"
] | 6 | 2021-10-18T08:12:24.000Z | 2021-11-24T08:31:10.000Z | test/Common/Nat.agda | antoinevanmuylder/agda | bd59d5b07ffe02a43b28d186d95e1747aac5bc8c | [
"BSD-2-Clause"
] | null | null | null | {-# OPTIONS --cubical-compatible #-}
module Common.Nat where
open import Agda.Builtin.Nat public
using ( Nat; zero; suc; _+_; _*_ )
renaming ( _-_ to _∸_ )
pred : Nat → Nat
pred zero = zero
pred (suc n) = n
| 17 | 39 | 0.624434 |
1dbaa30924a3c02e202f4a3b6d7c83b8c0334272 | 1,616 | agda | Agda | src/Web/Semantic/DL/Category/Properties/Tensor/RespectsEquiv.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/Tensor/RespectsEquiv.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/Tensor/RespectsEquiv.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 ( _,_ )
open import Data.Sum using ( inj₁ ; inj₂ )
open import Web.Semantic.DL.ABox.Interp using ( _*_ )
open import Web.Semantic.DL.ABox.Model using ( *-resp-⟨ABox⟩ )
open import Web.Semantic.DL.Category.Object using ( Object ; iface )
open import Web.Semantic.DL.Category.Morphism using ... | 43.675676 | 77 | 0.598391 |
317e0fb8ac6aac5c63c2bfe2e2394b6605b1fad5 | 2,968 | agda | Agda | Cubical/Categories/Monoidal/Base.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | 1 | 2021-10-31T17:32:49.000Z | 2021-10-31T17:32:49.000Z | Cubical/Categories/Monoidal/Base.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | Cubical/Categories/Monoidal/Base.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | -- Monoidal categories
{-# OPTIONS --safe #-}
module Cubical.Categories.Monoidal.Base where
open import Cubical.Categories.Category.Base
open import Cubical.Categories.Constructions.BinProduct
open import Cubical.Categories.Functor.Base
open import Cubical.Categories.Functor.BinProduct
open import Cubical.Categories.... | 24.528926 | 76 | 0.502358 |
0634e9170bbde22552080142c2de5f54104a8f16 | 1,475 | agda | Agda | src/LibraBFT/Impl/Consensus/Properties/MetricsSafetyRules.agda | LaudateCorpus1/bft-consensus-agda | a4674fc473f2457fd3fe5123af48253cfb2404ef | [
"UPL-1.0"
] | null | null | null | src/LibraBFT/Impl/Consensus/Properties/MetricsSafetyRules.agda | LaudateCorpus1/bft-consensus-agda | a4674fc473f2457fd3fe5123af48253cfb2404ef | [
"UPL-1.0"
] | null | null | null | src/LibraBFT/Impl/Consensus/Properties/MetricsSafetyRules.agda | LaudateCorpus1/bft-consensus-agda | a4674fc473f2457fd3fe5123af48253cfb2404ef | [
"UPL-1.0"
] | null | null | null | open import LibraBFT.Impl.Consensus.MetricsSafetyRules
open import LibraBFT.Impl.OBM.Logging.Logging
open import LibraBFT.Impl.Properties.Util
open import LibraBFT.ImplShared.Consensus.Types
open import LibraBFT.ImplShared.Consensus.Types.EpochIndep
open import LibraBFT.ImplShared.Util.Dijkstra.All
open import Optics.A... | 36.875 | 98 | 0.757966 |
12c9f0f81952b1e529e328547dcc99c2dfa69f3d | 1,180 | agda | Agda | theorems/cohomology/Sphere.agda | mikeshulman/HoTT-Agda | e7d663b63d89f380ab772ecb8d51c38c26952dbb | [
"MIT"
] | null | null | null | theorems/cohomology/Sphere.agda | mikeshulman/HoTT-Agda | e7d663b63d89f380ab772ecb8d51c38c26952dbb | [
"MIT"
] | null | null | null | theorems/cohomology/Sphere.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
open import cohomology.Theory
module cohomology.Sphere {i} (OT : OrdinaryTheory i) where
open OrdinaryTheory OT
C-Sphere-≠-is-trivial : (n : ℤ) (m : ℕ) → (n ≠ ℕ-to-ℤ m)
→ is-trivialᴳ (C n (⊙Lift (⊙Sphere m)))
C-Sphere-≠-is-trivial n O n≠0 = C-dimension n≠0
... | 33.714286 | 82 | 0.551695 |
1865bbbe83213ebca933c206674009ecd0e4fa35 | 2,449 | agda | Agda | src/VL.agda | shinji-kono/zf-in-agda | 031f1ea3a3037cd51eb022dbfb5c75b037bf8aa0 | [
"MIT"
] | 5 | 2019-10-02T13:46:23.000Z | 2021-01-10T13:27:48.000Z | src/VL.agda | shinji-kono/zf-in-agda | 031f1ea3a3037cd51eb022dbfb5c75b037bf8aa0 | [
"MIT"
] | null | null | null | src/VL.agda | shinji-kono/zf-in-agda | 031f1ea3a3037cd51eb022dbfb5c75b037bf8aa0 | [
"MIT"
] | null | null | null | open import Level
open import Ordinals
module VL {n : Level } (O : Ordinals {n}) where
open import zf
open import logic
import OD
open import Relation.Nullary
open import Relation.Binary
open import Data.Empty
open import Relation.Binary
open import Relation.Binary.Core
open import Relation.Binary.PropositionalEqu... | 28.149425 | 138 | 0.561862 |
c5e69fcd18d870b66c4ac5b9826aa86745db1b5f | 452 | agda | Agda | test/Succeed/Issue1791.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue1791.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue1791.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2016-01-21, issue 1791
-- With-clause stripping for copatterns with "polymorphic" field.
-- {-# OPTIONS -v tc.with.strip:60 #-}
postulate anything : ∀{A : Set} → A
record Wrap (A : Set) : Set where
field unwrap : A
record Pointed (M : Set → Set) : Set₁ where
field point : ∀{A} → M A -- field type s... | 23.789474 | 72 | 0.665929 |
4da4acae750527734c63676a9279a39a11989513 | 197 | agda | Agda | Cubical/Codata/M/AsLimit/M.agda | ryanorendorff/cubical | c67854d2e11aafa5677e25a09087e176fafd3e43 | [
"MIT"
] | 1 | 2020-03-23T23:52:11.000Z | 2020-03-23T23:52:11.000Z | Cubical/Codata/M/AsLimit/M.agda | ryanorendorff/cubical | c67854d2e11aafa5677e25a09087e176fafd3e43 | [
"MIT"
] | null | null | null | Cubical/Codata/M/AsLimit/M.agda | ryanorendorff/cubical | c67854d2e11aafa5677e25a09087e176fafd3e43 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --guardedness --safe #-}
module Cubical.Codata.M.AsLimit.M where
open import Cubical.Codata.M.AsLimit.M.Base public
open import Cubical.Codata.M.AsLimit.M.Properties public
| 28.142857 | 56 | 0.771574 |
c59c6b555d4a5193022caf272e767e5f3d03a924 | 2,884 | agda | Agda | Equivalence.agda | NAMEhzj/Divide-and-Conquer-in-Agda | 99bd3a5e772563153d78f61c1bbca48d7809ff48 | [
"MIT"
] | null | null | null | Equivalence.agda | NAMEhzj/Divide-and-Conquer-in-Agda | 99bd3a5e772563153d78f61c1bbca48d7809ff48 | [
"MIT"
] | null | null | null | Equivalence.agda | NAMEhzj/Divide-and-Conquer-in-Agda | 99bd3a5e772563153d78f61c1bbca48d7809ff48 | [
"MIT"
] | null | null | null | {-# OPTIONS --no-universe-polymorphism #-}
open import Relation.Binary.Core
open import Function
module Equivalence where
infixr 5 _⇔_
record _⇔_ (A B : Set) : Set where
field to : A → B
from : B → A
infixr 3 _↔_
record _↔_ (A B : Set) : Set where
field to : A → B
from : B → A
... | 28.554455 | 117 | 0.34258 |
fbd7e480fc6820cc5cb8583e06706e481d86c9d4 | 373 | agda | Agda | test/Fail/Issue1266a.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/Issue1266a.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/Issue1266a.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2014-09-02
-- Up to today, there was no implementation of shadowing local variables
-- (e.g., λ-bound variables) by local imports.
-- {-# OPTIONS -v scope.locals:10 #-}
module _ where
module M where
A = Set1
test : (A : Set) → let open M in A
test A = Set
-- The A exported by M is in competition wit... | 20.722222 | 72 | 0.678284 |
12e994adc9b111fdb1c589955d26f81c357e2ce0 | 10,189 | agda | Agda | core/lib/types/Paths.agda | timjb/HoTT-Agda | 66f800adef943afdf08c17b8ecfba67340fead5e | [
"MIT"
] | null | null | null | core/lib/types/Paths.agda | timjb/HoTT-Agda | 66f800adef943afdf08c17b8ecfba67340fead5e | [
"MIT"
] | null | null | null | core/lib/types/Paths.agda | timjb/HoTT-Agda | 66f800adef943afdf08c17b8ecfba67340fead5e | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --rewriting #-}
open import lib.Basics
module lib.types.Paths where
{- ! is an equivalence and works on ≠ -}
module _ {i} {A : Type i} {x y : A} where
!-equiv : (x == y) ≃ (y == x)
!-equiv = equiv ! ! !-! !-!
≠-inv : (x ≠ y) → (y ≠ x)
≠-inv x≠y y=x = x≠y (! y=x)
{- Pre- and post- c... | 37.459559 | 147 | 0.333693 |
1d04ed093bcafae099408ffeb6c0dee3a873086e | 1,694 | agda | Agda | Fields/Orders/Total/Lemmas.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 4 | 2019-08-08T12:44:19.000Z | 2022-01-28T06:04:15.000Z | Fields/Orders/Total/Lemmas.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 14 | 2019-01-06T21:11:59.000Z | 2020-04-11T11:03:39.000Z | Fields/Orders/Total/Lemmas.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 Rings.Definition
open import Rings.Orders.Partial.Definition
open import Rings.Orders.Total.Definition
open import Setoids.Setoids
open import Setoids.Orders.Partial.Definition
open import Setoids.Orders.Total.Definition
open import Functions.Definition
op... | 36.826087 | 290 | 0.75915 |
590f3bf8c87c2595d9fe2789b13273163ad79795 | 3,970 | agda | Agda | Categories/Category/Monoidal/Braided/Properties.agda | rei1024/agda-categories | 89d163f72caa7deeac9413f27bc1b4ed7f9e025b | [
"MIT"
] | null | null | null | Categories/Category/Monoidal/Braided/Properties.agda | rei1024/agda-categories | 89d163f72caa7deeac9413f27bc1b4ed7f9e025b | [
"MIT"
] | null | null | null | Categories/Category/Monoidal/Braided/Properties.agda | rei1024/agda-categories | 89d163f72caa7deeac9413f27bc1b4ed7f9e025b | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
open import Categories.Category using (Category)
open import Categories.Category.Monoidal
open import Categories.Category.Monoidal.Braided using (Braided)
module Categories.Category.Monoidal.Braided.Properties
{o ℓ e} {C : Category o ℓ e} {M : Monoidal C} (BM : Braided M) where
o... | 42.688172 | 124 | 0.559698 |
c57ff3179387b73111589c536d3e7ac5da346a83 | 6,903 | agda | Agda | completeness.agda | hazelgrove/hazelnat-myth | a8f9299090d95f4ef1a6c2f15954c2981c0ee25c | [
"MIT"
] | 1 | 2019-12-19T23:42:31.000Z | 2019-12-19T23:42:31.000Z | completeness.agda | hazelgrove/hazelnat-myth | a8f9299090d95f4ef1a6c2f15954c2981c0ee25c | [
"MIT"
] | null | null | null | completeness.agda | hazelgrove/hazelnat-myth | a8f9299090d95f4ef1a6c2f15954c2981c0ee25c | [
"MIT"
] | null | null | null | open import Nat
open import Prelude
open import List
open import contexts
open import core
module completeness where
-- any hole is new to a complete expression
e-complete-hnn : ∀{e u} → e ecomplete → hole-name-new e u
e-complete-hnn (ECFix cmp) = HNNFix (e-complete-hnn cmp)
e-complete-hnn ECVar = HNNVar
e-... | 58.008403 | 152 | 0.60423 |
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.