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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
df500824729e0f7fae70202e096bfe9f5807fc5c | 12,612 | agda | Agda | Cubical/Relation/ZigZag/Applications/MultiSet.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 301 | 2018-10-17T18:00:24.000Z | 2022-03-24T02:10:47.000Z | Cubical/Relation/ZigZag/Applications/MultiSet.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 584 | 2018-10-15T09:49:02.000Z | 2022-03-30T12:09:17.000Z | Cubical/Relation/ZigZag/Applications/MultiSet.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 134 | 2018-11-16T06:11:03.000Z | 2022-03-23T16:22:13.000Z | -- We apply the theory of quasi equivalence relations (QERs) to finite multisets and association lists.
{-# OPTIONS --safe #-}
module Cubical.Relation.ZigZag.Applications.MultiSet where
open import Cubical.Core.Everything
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Function
open import Cubi... | 35.130919 | 107 | 0.595544 |
4af0d01466e4690c5ba23edd5e399a3acca3ad93 | 2,219 | agda | Agda | Cubical/HITs/MappingCones/Properties.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | Cubical/HITs/MappingCones/Properties.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | 1 | 2022-01-27T02:07:48.000Z | 2022-01-27T02:07:48.000Z | Cubical/HITs/MappingCones/Properties.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | 1 | 2021-11-22T02:02:01.000Z | 2021-11-22T02:02:01.000Z | {-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.HITs.MappingCones.Properties where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Function
open import Cubical.Foundations.Isomorphism
open import Cubical.Data.Unit
open import Cubical.Data.Sum
open import Cubical.HITs.Pushout... | 42.673077 | 104 | 0.66201 |
2092b58c42b91594f67ac8e3a9f7e71470503791 | 455 | agda | Agda | test/interaction/Issue800.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/interaction/Issue800.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/interaction/Issue800.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2013-02-18 problem with 'with'-display, see also issue 295
-- {-# OPTIONS -v tc.with:50 #-}
module Issue800 where
data ⊤ : Set where
tt : ⊤
data I⊤ : ⊤ → Set where
itt : ∀ r → I⊤ r
bug : ∀ l → ∀ k → I⊤ l → ⊤
bug .l k (itt l) with itt k
... | foo = {! foo!}
{-
Current rewriting:
bug .... | 18.2 | 70 | 0.523077 |
cbc9ee1ecbd03c8506efee2aae3688d958616273 | 2,521 | agda | Agda | LibraBFT/Impl/Consensus/Liveness/ProposalGenerator.agda | oracle/bft-consensus-agda | 49f8b1b70823be805d84ffc3157c3b880edb1e92 | [
"UPL-1.0"
] | 4 | 2020-12-16T19:43:41.000Z | 2021-12-18T19:24:05.000Z | LibraBFT/Impl/Consensus/Liveness/ProposalGenerator.agda | oracle/bft-consensus-agda | 49f8b1b70823be805d84ffc3157c3b880edb1e92 | [
"UPL-1.0"
] | 72 | 2021-02-04T05:04:33.000Z | 2022-03-25T05:36:11.000Z | LibraBFT/Impl/Consensus/Liveness/ProposalGenerator.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) 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.Encode as Encode
open i... | 44.22807 | 117 | 0.685839 |
c5644280fc3efdfb808b740e50126e163a61a726 | 1,022 | agda | Agda | Common/ContextPair.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | 29 | 2016-07-03T18:51:56.000Z | 2022-01-01T10:29:18.000Z | Common/ContextPair.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | 1 | 2018-06-10T09:11:22.000Z | 2018-06-10T09:11:22.000Z | Common/ContextPair.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | null | null | null | module Common.ContextPair where
open import Common.Context public
-- Context pairs.
infix 4 _⁏_
record Cx² (U V : Set) : Set where
constructor _⁏_
field
int : Cx U
mod : Cx V
open Cx² public
∅² : ∀ {U V} → Cx² U V
∅² = ∅ ⁏ ∅
-- Context inclusion.
module _ {U V : Set} where
infix 3 _⊆²_
_⊆²_ : C... | 18.581818 | 55 | 0.473581 |
1076cdbc1ee33d0a77e7aabb5c9721d2df620273 | 791 | agda | Agda | archive/agda-2/Oscar/Class/Equivalence.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null | archive/agda-2/Oscar/Class/Equivalence.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | 1 | 2019-04-29T00:35:04.000Z | 2019-05-11T23:33:04.000Z | archive/agda-2/Oscar/Class/Equivalence.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null |
module Oscar.Class.Equivalence where
open import Oscar.Class.Reflexivity
open import Oscar.Class.Symmetry
open import Oscar.Class.Transitivity
open import Oscar.Function
open import Oscar.Level
record Equivalence {a} {A : Set a} {ℓ} (_≋_ : A → A → Set ℓ) : Set (a ⊔ ℓ) where
field
⦃ ′reflexivity ⦄ : Reflexivity... | 27.275862 | 80 | 0.668774 |
183342e4e44018aea301f8552001d389ba2ee53e | 662 | agda | Agda | test/Fail/ImplicitRecordFields.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/ImplicitRecordFields.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/ImplicitRecordFields.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- This file tests that implicit record fields are not printed out (by
-- default).
-- Andreas, 2016-07-20 Repaired this long disfunctional test case.
module ImplicitRecordFields where
record R : Set₁ where
field
{A} : Set
f : A → A
{B C} D {E} : Set
g : B → C → E
postu... | 18.388889 | 70 | 0.521148 |
3925e485ffa3e9fbecbca0328ff56c819f75532d | 417 | agda | Agda | test/Succeed/Issue376Loop.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue376Loop.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue376Loop.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- 2014-01-01 Andreas, test case constructed by Christian Sattler
{-# OPTIONS --allow-unsolved-metas #-}
-- unguarded recursive record
record R : Set where
eta-equality
inductive
constructor cons
field
r : R
postulate F : (R → Set) → Set
q : (∀ P → F P) → (∀ P → F P)
q h P = h (λ {(cons x) → {!!}})
--... | 19.857143 | 70 | 0.63789 |
0e0aec86c63521d6419d820930d962a56bfb94ca | 733 | agda | Agda | Graph.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | Graph.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | Graph.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | open import Type
module Graph {ℓ₁ ℓ₂} (V : Type{ℓ₁}) where
-- A graph is represented by a binary relation which states whether there is an edge from one vertex to another.
-- In other words, a graph is here defined by only its adjacency relation.
-- This is by default (without any assumptions) a directed multigraph w... | 43.117647 | 150 | 0.713506 |
fb8fa29be8724704d44f828758163bdb91a475e3 | 362 | agda | Agda | test/interaction/Issue2537.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/interaction/Issue2537.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/interaction/Issue2537.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2017-04-10, issue #2537 reported by xekoukou
-- Preserve named args when splitting in a where clause.
-- {-# OPTIONS -v reify:100 #-}
data Bool : Set where
true false : Bool
fun : {a b c d e f g : Bool} → Bool → Bool
fun {g = g} x with x
... | r = {!g!} -- C-c C-c g
-- Expected result:
-- fun {g = tru... | 22.625 | 56 | 0.569061 |
23da4995c2722f0f2a5c0c20748d5189313caa10 | 5,614 | agda | Agda | Cubical/Data/Maybe/Properties.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 301 | 2018-10-17T18:00:24.000Z | 2022-03-24T02:10:47.000Z | Cubical/Data/Maybe/Properties.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 584 | 2018-10-15T09:49:02.000Z | 2022-03-30T12:09:17.000Z | Cubical/Data/Maybe/Properties.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 134 | 2018-11-16T06:11:03.000Z | 2022-03-23T16:22:13.000Z | {-# OPTIONS --safe #-}
module Cubical.Data.Maybe.Properties where
open import Cubical.Core.Everything
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.Function
open import Cubical.Foundations.Isomorphism
open import Cu... | 35.308176 | 133 | 0.654792 |
18669f7511e4e7a85d6021c69a312010bdae1f1a | 30,021 | agda | Agda | complexity/Complexity.agda | benhuds/Agda | 2404a6ef2688f879bda89860bb22f77664ad813e | [
"MIT"
] | 2 | 2016-04-26T20:22:22.000Z | 2019-08-08T12:27:18.000Z | complexity/Complexity.agda | benhuds/Agda | 2404a6ef2688f879bda89860bb22f77664ad813e | [
"MIT"
] | 1 | 2020-03-23T08:39:04.000Z | 2020-05-12T00:32:45.000Z | complexity/Complexity.agda | benhuds/Agda | 2404a6ef2688f879bda89860bb22f77664ad813e | [
"MIT"
] | null | null | null | {- COMPLEXITY LANGUAGE -}
open import Preliminaries
open import Preorder-Max
module Complexity where
data CTp : Set where
unit : CTp
nat : CTp
_->c_ : CTp → CTp → CTp
_×c_ : CTp → CTp → CTp
list : CTp → CTp
bool : CTp
C : CTp
-- represent a context as a list of types
Ctx = List CTp... | 48.342995 | 179 | 0.461111 |
2368e995ee5c5449d9308baeccda21314a82a308 | 316 | agda | Agda | test/Succeed/Issue2686.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue2686.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue2686.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2017-08-13, issue #2686
-- Overloaded constructor where only one alternative is not abstract.
-- Not ambiguous, since abstract constructors are not in scope!
-- {-# OPTIONS -v tc.check.term:40 #-}
abstract
data A : Set where
c : A
data D : Set where
c : D
test = c
match : D → D
match c = c
| 17.555556 | 69 | 0.661392 |
df48ebfb6513c4a6460af1fa21e9e1c7eacff68b | 3,724 | agda | Agda | Example-03.agda | ashinkarov/agda-extractor | c8954c8acd8089ced82af9e05084fbbc7fedb36c | [
"0BSD"
] | 1 | 2021-01-11T14:52:59.000Z | 2021-01-11T14:52:59.000Z | Example-03.agda | ashinkarov/agda-extractor | c8954c8acd8089ced82af9e05084fbbc7fedb36c | [
"0BSD"
] | null | null | null | Example-03.agda | ashinkarov/agda-extractor | c8954c8acd8089ced82af9e05084fbbc7fedb36c | [
"0BSD"
] | null | null | null | open import ExtractSac as ES using ()
open import Extract (ES.kompile-fun)
open import Data.Nat as N using (ℕ; zero; suc; _≤_; _≥_; _<_; s≤s; z≤n)
import Data.Nat.DivMod as N
open import Data.Nat.Properties as N
open import Data.List as L using (List; []; _∷_)
open import Data.Vec as V using (Vec; []; _∷_)
import... | 27.382353 | 114 | 0.523899 |
cb00f04e827e78a43534a84b9f16a48412cbf8fa | 734 | agda | Agda | agda/PLRTree/Complete/Correctness/Base.agda | bgbianchi/sorting | b8d428bccbdd1b13613e8f6ead6c81a8f9298399 | [
"MIT"
] | 6 | 2015-05-21T12:50:35.000Z | 2021-08-24T22:11:15.000Z | agda/PLRTree/Complete/Correctness/Base.agda | bgbianchi/sorting | b8d428bccbdd1b13613e8f6ead6c81a8f9298399 | [
"MIT"
] | null | null | null | agda/PLRTree/Complete/Correctness/Base.agda | bgbianchi/sorting | b8d428bccbdd1b13613e8f6ead6c81a8f9298399 | [
"MIT"
] | null | null | null | module PLRTree.Complete.Correctness.Base {A : Set} where
open import BTree.Complete.Base {A}
open import BTree.Complete.Alternative.Correctness {A} renaming (lemma-complete'-complete to lemma-complete''-complete)
open import Function using (_∘_)
open import PLRTree {A}
open import PLRTree.Complete {A} renaming (Compl... | 52.428571 | 122 | 0.731608 |
106bbf45d16dfafa4673b19f5eb8aefff1ec2dbd | 3,491 | agda | Agda | Numeral/Natural/Oper/Proofs/Multiplication.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | Numeral/Natural/Oper/Proofs/Multiplication.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | Numeral/Natural/Oper/Proofs/Multiplication.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | module Numeral.Natural.Oper.Proofs.Multiplication where
open import Logic.Propositional
open import Numeral.Natural
open import Numeral.Natural.Oper
open import Numeral.Natural.Oper.Proofs
open import Numeral.Natural.Oper.Proofs.Order
open import Numeral.Natural.Relation
open import Numeral.Natural.Relation.Order
open... | 54.546875 | 159 | 0.49069 |
dc9c96efe7a8b5d3a16232c6a5a6c8b0594dbf83 | 7,109 | agda | Agda | src/Categories/Diagram/Pullback.agda | MirceaS/agda-categories | 58e5ec015781be5413bdf968f7ec4fdae0ab4b21 | [
"MIT"
] | null | null | null | src/Categories/Diagram/Pullback.agda | MirceaS/agda-categories | 58e5ec015781be5413bdf968f7ec4fdae0ab4b21 | [
"MIT"
] | null | null | null | src/Categories/Diagram/Pullback.agda | MirceaS/agda-categories | 58e5ec015781be5413bdf968f7ec4fdae0ab4b21 | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
open import Categories.Category
module Categories.Diagram.Pullback {o ℓ e} (C : Category o ℓ e) where
open Category C
open HomReasoning
open import Level
open import Data.Product using (_,_; ∃)
open import Function using (flip; _$_) renaming (_∘_ to _●_)
open import Categories.Morp... | 36.086294 | 87 | 0.478548 |
392ccdff6016bc66ec0028558d639ef55de62c9d | 1,223 | agda | Agda | agda/hott/types/coproduct.agda | piyush-kurur/hott | 876ecdcfddca1abf499e8f00db321c6dc3d5b2bc | [
"BSD-3-Clause"
] | null | null | null | agda/hott/types/coproduct.agda | piyush-kurur/hott | 876ecdcfddca1abf499e8f00db321c6dc3d5b2bc | [
"BSD-3-Clause"
] | null | null | null | agda/hott/types/coproduct.agda | piyush-kurur/hott | 876ecdcfddca1abf499e8f00db321c6dc3d5b2bc | [
"BSD-3-Clause"
] | null | null | null | {-# OPTIONS --without-K #-}
module hott.types.coproduct where
open import hott.core.universe
data _∐_ {ℓ₀ ℓ₁ : Level}
(A : Type ℓ₀)
(B : Type ℓ₁) : Type (ℓ₀ ⊔ ℓ₁) where
inl : (a : A) → A ∐ B -- left introduction
inr : (b : B) → A ∐ B -- right introduction
-- A more suggestive way of b... | 23.075472 | 70 | 0.51758 |
18039b6fcd49e856c4f7bc31dd2a9e8fb2dfe67e | 319 | agda | Agda | test/LibSucceed/InstanceArguments/08-higherOrder.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/LibSucceed/InstanceArguments/08-higherOrder.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/LibSucceed/InstanceArguments/08-higherOrder.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | module InstanceArguments.08-higherOrder where
explicitize : ∀ {A : Set} {B : A → Set} → ({{x : A}} → B x) → (x : A) → B x
explicitize f x = f {{x}}
implicitize : ∀ {A : Set} {B : A → Set} → ((x : A) → B x) → {{x : A}} → B x
implicitize f {{x}} = f x
data T : Set where
tt : T
test = explicitize (λ {{t : T}} → t)
| 24.538462 | 75 | 0.507837 |
0ef0fe6c942d9307706017cf7f178fb23a5e9581 | 2,373 | agda | Agda | agda/List/Permutation/Base/Bag.agda | bgbianchi/sorting | b8d428bccbdd1b13613e8f6ead6c81a8f9298399 | [
"MIT"
] | 6 | 2015-05-21T12:50:35.000Z | 2021-08-24T22:11:15.000Z | agda/List/Permutation/Base/Bag.agda | bgbianchi/sorting | b8d428bccbdd1b13613e8f6ead6c81a8f9298399 | [
"MIT"
] | null | null | null | agda/List/Permutation/Base/Bag.agda | bgbianchi/sorting | b8d428bccbdd1b13613e8f6ead6c81a8f9298399 | [
"MIT"
] | null | null | null | module List.Permutation.Base.Bag (A : Set) where
open import Data.List
open import Data.List.Any as Any
open import Data.List.Any.BagAndSetEquality
open import Data.List.Any.Properties
open import Data.Sum renaming (_⊎_ to _∨_)
open import Function
open import Function.Inverse hiding (sym ; _∘_ ; id)
open import Funct... | 30.818182 | 78 | 0.51791 |
fb1f0a56381527397ac671970ed167d14590e804 | 30,984 | agda | Agda | Definitional.agda | kztk-m/sparcl-agda | e2fb3a669e733a9020a51b24244d89abd8fcf725 | [
"BSD-3-Clause"
] | null | null | null | Definitional.agda | kztk-m/sparcl-agda | e2fb3a669e733a9020a51b24244d89abd8fcf725 | [
"BSD-3-Clause"
] | null | null | null | Definitional.agda | kztk-m/sparcl-agda | e2fb3a669e733a9020a51b24244d89abd8fcf725 | [
"BSD-3-Clause"
] | null | null | null | {-# OPTIONS --without-K #-}
-- Approx. 15-20 min are required to typecheck this file (for Agda 2.6.1) on
-- my MacBook 13-inch 2017 with 3.5 GHz Core i7 CPU and 16 GB memory.
--
-- Since most of the time was spent for termination analysis, please
-- uncomment {-# TERMINATING #-} before evalR and eval to remove the
-... | 42.677686 | 157 | 0.481991 |
cbac082a07b0ea51feba646378d293b3ccd40d59 | 2,295 | agda | Agda | vendor/stdlib/src/Data/Fin/Subset/Props.agda | isabella232/Lemmachine | 8ef786b40e4a9ab274c6103dc697dcb658cf3db3 | [
"MIT"
] | 56 | 2015-01-20T02:11:42.000Z | 2021-12-21T17:02:19.000Z | vendor/stdlib/src/Data/Fin/Subset/Props.agda | larrytheliquid/Lemmachine | 8ef786b40e4a9ab274c6103dc697dcb658cf3db3 | [
"MIT"
] | 1 | 2022-03-12T12:17:51.000Z | 2022-03-12T12:17:51.000Z | vendor/stdlib/src/Data/Fin/Subset/Props.agda | isabella232/Lemmachine | 8ef786b40e4a9ab274c6103dc697dcb658cf3db3 | [
"MIT"
] | 3 | 2015-07-21T16:37:58.000Z | 2022-03-12T11:54:10.000Z | ------------------------------------------------------------------------
-- Some properties about subsets
------------------------------------------------------------------------
module Data.Fin.Subset.Props where
open import Data.Nat
open import Data.Vec hiding (_∈_)
open import Data.Empty
open import Data.Function
... | 37.016129 | 72 | 0.44793 |
fb7e84152b2edac030360c7a2f2abdca512ed45b | 708 | agda | Agda | src/Ints.agda | ice1k/Theorems | 7dc0ea4782a5ff960fe31bdcb8718ce478eaddbc | [
"Apache-2.0"
] | 1 | 2020-04-15T15:28:03.000Z | 2020-04-15T15:28:03.000Z | src/Ints.agda | ice1k/Theorems | 7dc0ea4782a5ff960fe31bdcb8718ce478eaddbc | [
"Apache-2.0"
] | null | null | null | src/Ints.agda | ice1k/Theorems | 7dc0ea4782a5ff960fe31bdcb8718ce478eaddbc | [
"Apache-2.0"
] | null | null | null | module Ints where
open import Nats public
using (ℕ; zero; _∸_)
renaming (suc to nsuc; _+_ to _:+:_; _*_ to _:*:_)
open import Agda.Builtin.Int public
renaming (Int to ℤ; negsuc to -[1+_]; pos to +_)
infix 8 -_
-- infixl 7 _*_ _⊓_
infixl 6 _+_ _-_ _⊖_
∣_∣ : ℤ → ℕ
∣ + n ∣ = n
∣ -[1+ n ] ∣ = nsuc n
-_ : ℤ ... | 18.153846 | 52 | 0.418079 |
1052f7cceed60f3f4a0ae7baab8301b05d632a3d | 586 | agda | Agda | test/Succeed/Issue1944-UnappliedOverloadedProjection.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue1944-UnappliedOverloadedProjection.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue1944-UnappliedOverloadedProjection.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, Bentfest 2016-04-28 Marsstrand
-- Issue 1944: also resolve overloaded projections in checking position
module _ (A : Set) (a : A) where
record R (B : Set) : Set where
field f : B
open R
record S (B : Set) : Set where
field f : B
open S
test : R A → A
test = f
test1 : ∀{A} → R A → A
test1 = f
test2... | 15.421053 | 71 | 0.559727 |
1c0974f1d7a7fa7fd5eeb236a9de6a99743f92d5 | 7,916 | agda | Agda | src/SyntaxMap.agda | andrejbauer/dependent-type-theory-syntax | 9b634d284a0ec5108c68489575194cd573f38908 | [
"MIT"
] | 7 | 2021-05-25T11:14:42.000Z | 2021-10-14T01:48:00.000Z | src/SyntaxMap.agda | andrejbauer/dependent-type-theory-syntax | 9b634d284a0ec5108c68489575194cd573f38908 | [
"MIT"
] | null | null | null | src/SyntaxMap.agda | andrejbauer/dependent-type-theory-syntax | 9b634d284a0ec5108c68489575194cd573f38908 | [
"MIT"
] | null | null | null | open import Level
import Categories.Category
open import Relation.Binary.PropositionalEquality using (_≡_; refl; sym; trans; subst; cong)
open import Syntax
open import Renaming
open import Substitution
open import Instantiation
module SyntaxMap where
open Signature
open Expression
open Equality
infix 5 _→ᵐ... | 33.685106 | 114 | 0.41334 |
d0b74f91299c53bfac300cabd6fc521a21172e82 | 112 | agda | Agda | papers/unraveling-recursion/code/src/Type.agda | imikushin/plutus | 2c5bda20fb94b0f3737ba1a236ef5d7a7fd9f631 | [
"Apache-2.0"
] | 1,299 | 2018-10-02T13:41:39.000Z | 2022-03-28T01:10:02.000Z | papers/unraveling-recursion/code/src/Type.agda | imikushin/plutus | 2c5bda20fb94b0f3737ba1a236ef5d7a7fd9f631 | [
"Apache-2.0"
] | 2,493 | 2018-09-28T19:28:17.000Z | 2022-03-31T15:31:31.000Z | papers/unraveling-recursion/code/src/Type.agda | imikushin/plutus | 2c5bda20fb94b0f3737ba1a236ef5d7a7fd9f631 | [
"Apache-2.0"
] | 399 | 2018-10-05T09:36:10.000Z | 2022-03-31T11:18:25.000Z | module Type where
open import Type.Core public
open import Type.NbE public
open import Type.Lemmas public
| 18.666667 | 30 | 0.785714 |
0e8c5cd932f5bfaa7d51e7e2351899e93bffb61c | 1,228 | agda | Agda | Cubical/Data/Prod/Base.agda | ryanorendorff/cubical | c67854d2e11aafa5677e25a09087e176fafd3e43 | [
"MIT"
] | 1 | 2020-03-23T23:52:11.000Z | 2020-03-23T23:52:11.000Z | Cubical/Data/Prod/Base.agda | ryanorendorff/cubical | c67854d2e11aafa5677e25a09087e176fafd3e43 | [
"MIT"
] | null | null | null | Cubical/Data/Prod/Base.agda | ryanorendorff/cubical | c67854d2e11aafa5677e25a09087e176fafd3e43 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --safe #-}
module Cubical.Data.Prod.Base where
open import Cubical.Core.Everything
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Function
-- Here we define an inductive version of the product type, see below
-- for its uses.
-- See `Cubical.Data.Sigma` for `_×_` defin... | 25.583333 | 72 | 0.612378 |
0eb14ac353548178662986188b4124fbfa3bd01e | 484 | agda | Agda | OutsideIn/TopLevel.agda | liamoc/outside-in | fc1fc1bba2af95806d9075296f9ed1074afa4c24 | [
"BSD-3-Clause"
] | 2 | 2015-09-14T05:22:15.000Z | 2020-11-19T14:30:07.000Z | OutsideIn/TopLevel.agda | liamoc/outside-in | fc1fc1bba2af95806d9075296f9ed1074afa4c24 | [
"BSD-3-Clause"
] | null | null | null | OutsideIn/TopLevel.agda | liamoc/outside-in | fc1fc1bba2af95806d9075296f9ed1074afa4c24 | [
"BSD-3-Clause"
] | null | null | null | open import OutsideIn.Prelude
open import OutsideIn.X
module OutsideIn.TopLevel(x : X) where
import OutsideIn.Expressions as E
open E(x)
open X(x)
data Program (ev : Set)(tv : Set) : Set where
end : Program ev tv
bind₁_,_ : ∀ {s} → Expression ev tv s → Program (Ⓢ ev) tv → Program ev tv
bind₂_·_∷_⇒... | 34.571429 | 77 | 0.572314 |
4a7b5dfce4c7b1560fd21ec55ad7b002c11bde29 | 3,284 | agda | Agda | src/Const.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | 3 | 2020-05-21T22:58:50.000Z | 2021-09-02T17:18:15.000Z | src/Const.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | null | null | null | src/Const.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- Some properties related to the const function
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
open import Equality
module Const
{reflexive} (eq : ∀ {a p} → Equality-with-J a p ref... | 33.85567 | 136 | 0.53715 |
5001f7fd3970ecd535630486444afe464e9bdad7 | 628 | agda | Agda | notes/papers/implicit/examples/Loop.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | notes/papers/implicit/examples/Loop.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | notes/papers/implicit/examples/Loop.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
module Loop where
{-
data _=>_ (A, B : Set) : Set where
lam : (A -> B) -> A => B
app : {A, B : Set} -> (A => B) -> A -> B
app (lam f) = f
delta = lam (\x -> app x x)
loop = app delta delta
-}
lam : (A, B : Set) -> (A -> B) -> A -> B
lam A B f = f
app : (A, B : Set) -> (A -> B) -> A -> B
app A B f = f
postulat... | 16.526316 | 59 | 0.461783 |
4aed98737d2fd903b59c1c48c0f76673612034b3 | 19,149 | agda | Agda | LibraBFT/Yasm/System.agda | haroldcarr/bft-consensus-agda | 34e4627855fb198665d0c98f377403a906ba75d7 | [
"UPL-1.0"
] | null | null | null | LibraBFT/Yasm/System.agda | haroldcarr/bft-consensus-agda | 34e4627855fb198665d0c98f377403a906ba75d7 | [
"UPL-1.0"
] | null | null | null | LibraBFT/Yasm/System.agda | haroldcarr/bft-consensus-agda | 34e4627855fb198665d0c98f377403a906ba75d7 | [
"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 LibraBFT.Prelude
open import LibraBFT.Base.Types
import ... | 44.636364 | 123 | 0.610998 |
fb84c22338e401385d3103d963258c82d7975884 | 5,594 | agda | Agda | src/fot/FOTC/Program/GCD/Partial/DivisibleATP.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 11 | 2015-09-03T20:53:42.000Z | 2021-09-12T16:09:54.000Z | src/fot/FOTC/Program/GCD/Partial/DivisibleATP.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 2 | 2016-10-12T17:28:16.000Z | 2017-01-01T14:34:26.000Z | src/fot/FOTC/Program/GCD/Partial/DivisibleATP.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 3 | 2016-09-19T14:18:30.000Z | 2018-03-14T08:50:00.000Z | ------------------------------------------------------------------------------
-- The gcd is divisible by any common divisor
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-pol... | 39.673759 | 83 | 0.510011 |
df867fde78127db5d16213cab2089c4430147030 | 3,498 | agda | Agda | 04-cubical-type-theory/material/SolutionsSession2.agda | williamdemeo/EPIT-2020 | 19d72759e18e05d2c509f62d23a998573270140c | [
"MIT"
] | null | null | null | 04-cubical-type-theory/material/SolutionsSession2.agda | williamdemeo/EPIT-2020 | 19d72759e18e05d2c509f62d23a998573270140c | [
"MIT"
] | null | null | null | 04-cubical-type-theory/material/SolutionsSession2.agda | williamdemeo/EPIT-2020 | 19d72759e18e05d2c509f62d23a998573270140c | [
"MIT"
] | 1 | 2021-08-02T16:16:34.000Z | 2021-08-02T16:16:34.000Z | -- Solutions to ExerciseSession2
{-# OPTIONS --cubical #-}
module SolutionsSession2 where
open import Part1
open import Part2
open import ExerciseSession1
-- Exercise 1
JEq : {x : A} (P : (z : A) → x ≡ z → Type ℓ'')
(d : P x refl) → J P d refl ≡ d
JEq P p d = transportRefl p d
-- Exercise 2
isContr→isProp : i... | 27.761905 | 81 | 0.598914 |
1c2e7a2ff9cba91efdaf88898ea32932c8d41a2b | 15,406 | agda | Agda | Cubical/Algebra/CommRing/FGIdeal.agda | howsiyu/cubical | 1b9c97a2140fe96fe636f4c66beedfd7b8096e8f | [
"MIT"
] | null | null | null | Cubical/Algebra/CommRing/FGIdeal.agda | howsiyu/cubical | 1b9c97a2140fe96fe636f4c66beedfd7b8096e8f | [
"MIT"
] | null | null | null | Cubical/Algebra/CommRing/FGIdeal.agda | howsiyu/cubical | 1b9c97a2140fe96fe636f4c66beedfd7b8096e8f | [
"MIT"
] | null | null | null | {-
Define finitely generated ideals of commutative rings and
show that they are an ideal.
Parts of this should be reusable for explicit constructions
of free modules over a finite set.
-}
{-# OPTIONS --safe #-}
module Cubical.Algebra.CommRing.FGIdeal where
open import Cubical.Foundations.Prelude
open import Cu... | 44.655072 | 102 | 0.503245 |
1c84edb3a211005e4955daa25f33bf49ba622384 | 8,302 | agda | Agda | test/Fail/Issue1560.agda | alex-mckenna/agda | 78b62cd24bbd570271a7153e44ad280e52ef3e29 | [
"BSD-3-Clause"
] | 1 | 2016-03-17T01:45:59.000Z | 2016-03-17T01:45:59.000Z | test/Fail/Issue1560.agda | andersk/agda | 56928ff709dcb931cb9a48c4790e5ed3739e3032 | [
"BSD-3-Clause"
] | null | null | null | test/Fail/Issue1560.agda | andersk/agda | 56928ff709dcb931cb9a48c4790e5ed3739e3032 | [
"BSD-3-Clause"
] | 1 | 2019-03-05T20:02:38.000Z | 2019-03-05T20:02:38.000Z | -- Andreas, 2015-06-11, issue #1560 reported by Peter Thiemann
-- Ulf, 2015-09-23:
-- This test was still taking 12s, which is annoyingly much.
-- I commented out a few of the constructors to bring it down
-- to 2s. With agda-2.4.2 it checks in 18s, which should be long
-- enough to notice.
open import Common.... | 70.957265 | 213 | 0.538545 |
dc5fe645668fab5976352aab372cdf553e27d977 | 1,282 | agda | Agda | LibraBFT/Yasm/Yasm.agda | cwjnkins/bft-consensus-agda | 71aa2168e4875ffdeece9ba7472ee3cee5fa9084 | [
"UPL-1.0"
] | null | null | null | LibraBFT/Yasm/Yasm.agda | cwjnkins/bft-consensus-agda | 71aa2168e4875ffdeece9ba7472ee3cee5fa9084 | [
"UPL-1.0"
] | null | null | null | LibraBFT/Yasm/Yasm.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
-}
open import LibraBFT.Prelude
open import LibraBFT.Base.PKCS
open import LibraBF... | 49.307692 | 111 | 0.670047 |
18608b8e57adf4b5a29c02ab9f26ebdea686e5b1 | 2,852 | agda | Agda | src/Magma/Bundles.agda | Akshobhya1234/agda-NonAssociativeAlgebra | 443e831e536b756acbd1afd0d6bae7bc0d288048 | [
"MIT"
] | 2 | 2021-08-15T06:16:13.000Z | 2021-08-17T09:14:03.000Z | src/Magma/Bundles.agda | Akshobhya1234/agda-NonAssociativeAlgebra | 443e831e536b756acbd1afd0d6bae7bc0d288048 | [
"MIT"
] | 2 | 2021-10-04T05:30:30.000Z | 2021-10-09T08:24:56.000Z | src/Magma/Bundles.agda | Akshobhya1234/agda-NonAssociativeAlgebra | 443e831e536b756acbd1afd0d6bae7bc0d288048 | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
module Magma.Bundles where
open import Algebra.Bundles
open import Algebra.Core
open import Magma.Structures
open import Relation.Binary
open import Level
record IdempotentMagma c ℓ : Set (suc (c ⊔ ℓ)) where
infixl 7 _∙_
infix 4 _≈_
field
Carrier : Set c
_≈_ : ... | 21.443609 | 54 | 0.652525 |
dfc774397ad32f666efc78bb596a2fe7320fbd8f | 1,583 | agda | Agda | agda-stdlib-0.9/src/Function/Injection.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/Function/Injection.agda | qwe2/try-agda | 9d4c43b1609d3f085636376fdca73093481ab882 | [
"Apache-2.0"
] | null | null | null | agda-stdlib-0.9/src/Function/Injection.agda | qwe2/try-agda | 9d4c43b1609d3f085636376fdca73093481ab882 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Injections
------------------------------------------------------------------------
module Function.Injection where
open import Function as Fun using () renaming (_∘_ to _⟨∘⟩_)
open import Level
open import Rel... | 28.781818 | 72 | 0.534428 |
1057a1d82f92305b828b67318535e11bf656b564 | 50 | agda | Agda | test/interaction/Imports/Issue5357-D.agda | cagix/agda | cc026a6a97a3e517bb94bafa9d49233b067c7559 | [
"BSD-2-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/interaction/Imports/Issue5357-D.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/interaction/Imports/Issue5357-D.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | module Imports.Issue5357-D where
A : Set₁
A = Set
| 12.5 | 32 | 0.74 |
202ba845295e52dce13a39588e81f56a3cdfcb15 | 436 | agda | Agda | Cubical/HITs/SetQuotients/Base.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | Cubical/HITs/SetQuotients/Base.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | 1 | 2022-01-27T02:07:48.000Z | 2022-01-27T02:07:48.000Z | Cubical/HITs/SetQuotients/Base.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | 1 | 2021-11-22T02:02:01.000Z | 2021-11-22T02:02:01.000Z | {-
This file contains:
- Definition of set quotients
-}
{-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.HITs.SetQuotients.Base where
open import Cubical.Core.Primitives
-- Set quotients as a higher inductive type:
data _/_ {ℓ ℓ'} (A : Type ℓ) (R : A → A → Type ℓ') : Type (ℓ-max ℓ ℓ') where
[_] ... | 24.222222 | 76 | 0.557339 |
fb44fa0b638b6549c4403a61b8f1d5778d0cc2d6 | 5,532 | agda | Agda | test/asset/agda-stdlib-1.0/Relation/Binary/Construct/NonStrictToStrict.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Relation/Binary/Construct/NonStrictToStrict.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Relation/Binary/Construct/NonStrictToStrict.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Conversion of _≤_ to _<_
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
open import Relation.Binary
module Relation.Binary.Construct.NonStrictToStri... | 35.922078 | 72 | 0.58966 |
23d1fa57d3b4ef354ab711e7c61f3553d59addb0 | 38,058 | agda | Agda | agda/Esterel/Lang/Binding.agda | florence/esterel-calculus | 4340bef3f8df42ab8167735d35a4cf56243a45cd | [
"MIT"
] | 3 | 2020-04-16T10:58:53.000Z | 2020-07-01T03:59:31.000Z | agda/Esterel/Lang/Binding.agda | florence/esterel-calculus | 4340bef3f8df42ab8167735d35a4cf56243a45cd | [
"MIT"
] | null | null | null | agda/Esterel/Lang/Binding.agda | florence/esterel-calculus | 4340bef3f8df42ab8167735d35a4cf56243a45cd | [
"MIT"
] | 1 | 2020-04-15T20:02:49.000Z | 2020-04-15T20:02:49.000Z | module Esterel.Lang.Binding where
open import utility
open import Data.List
open import Data.Empty
using (⊥ ; ⊥-elim)
open import Data.Bool
using (Bool ; true ; false ; if_then_else_)
open import Esterel.Lang
open import Esterel.Environment as Env
using (Env ; VarList ; Dom ; Θ ; _←_)
open import Esterel.Context... | 47.043263 | 154 | 0.575043 |
dfe66f556d425d1efaebc85a51135359670aff0c | 4,965 | agda | Agda | braun-tree.agda | rfindler/ial | f3f0261904577e930bd7646934f756679a6cbba6 | [
"MIT"
] | 29 | 2019-02-06T13:09:31.000Z | 2022-03-04T15:05:12.000Z | braun-tree.agda | rfindler/ial | f3f0261904577e930bd7646934f756679a6cbba6 | [
"MIT"
] | 8 | 2018-07-09T22:53:38.000Z | 2022-03-22T03:43:34.000Z | braun-tree.agda | rfindler/ial | f3f0261904577e930bd7646934f756679a6cbba6 | [
"MIT"
] | 17 | 2018-12-03T22:38:15.000Z | 2021-11-28T20:13:21.000Z | open import bool
module braun-tree{ℓ} (A : Set ℓ) (_<A_ : A → A → 𝔹) where
open import bool-thms
open import eq
open import list
open import nat
open import nat-thms
open import product
open import sum
-- the index n is the size of the tree (number of elements of type A)
data braun-tree : (n : ℕ) → Set ℓ where
bt... | 48.676471 | 120 | 0.536354 |
cb43bef5b1b2ed07e5c6f3a7649d243ad431013b | 7,522 | agda | Agda | Categories/Yoneda.agda | rei1024/agda-categories | 89d163f72caa7deeac9413f27bc1b4ed7f9e025b | [
"MIT"
] | null | null | null | Categories/Yoneda.agda | rei1024/agda-categories | 89d163f72caa7deeac9413f27bc1b4ed7f9e025b | [
"MIT"
] | null | null | null | Categories/Yoneda.agda | rei1024/agda-categories | 89d163f72caa7deeac9413f27bc1b4ed7f9e025b | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
module Categories.Yoneda where
-- Yoneda Lemma. In total, provides:
-- * the Yoneda Embedding (called embed here) from any Category C into Presheaves C
-- Worth noticing that there is no 'locally small' condition here; however, if one looks at
-- the levels involved, there is in... | 43.732558 | 110 | 0.541345 |
1ca4300ec7654b51b3cfd2bfc2c904178e5facc8 | 2,146 | agda | Agda | src/FLA/Algebra/Properties/Field.agda | iblech/functional-linear-algebra | 0ba4d1d145575f1d23806a7c0e57bc8800554c16 | [
"BSD-3-Clause"
] | 21 | 2020-09-22T20:49:34.000Z | 2022-01-07T05:28:00.000Z | src/FLA/Algebra/Properties/Field.agda | iblech/functional-linear-algebra | 0ba4d1d145575f1d23806a7c0e57bc8800554c16 | [
"BSD-3-Clause"
] | 6 | 2020-09-01T01:42:12.000Z | 2022-01-07T05:27:53.000Z | src/FLA/Algebra/Properties/Field.agda | iblech/functional-linear-algebra | 0ba4d1d145575f1d23806a7c0e57bc8800554c16 | [
"BSD-3-Clause"
] | 3 | 2021-04-12T20:34:17.000Z | 2021-09-07T19:55:59.000Z | {-# OPTIONS --without-K --safe #-}
open import Level using (Level)
open import FLA.Algebra.Structures
open import Relation.Binary.PropositionalEquality
open ≡-Reasoning
module FLA.Algebra.Properties.Field {ℓ : Level } {A : Set ℓ} ⦃ F : Field A ⦄ where
open Field F
0ᶠ+0ᶠ≡0ᶠ : 0ᶠ + 0ᶠ ≡ 0ᶠ
0ᶠ+0ᶠ≡0ᶠ = +0ᶠ 0ᶠ
0ᶠ+ : (a... | 35.180328 | 82 | 0.345294 |
d0da2b5459e2a7ad28aec724e69b113e1ad50379 | 8,505 | agda | Agda | Cubical/Foundations/Prelude.agda | oisdk/cubical | a01973ef7264f9454a40697313a2073c51a6b77a | [
"MIT"
] | null | null | null | Cubical/Foundations/Prelude.agda | oisdk/cubical | a01973ef7264f9454a40697313a2073c51a6b77a | [
"MIT"
] | null | null | null | Cubical/Foundations/Prelude.agda | oisdk/cubical | a01973ef7264f9454a40697313a2073c51a6b77a | [
"MIT"
] | null | null | null | {-
This file proves a variety of basic results about paths:
- refl, sym, cong and composition of paths. This is used to set up
equational reasoning.
- Transport, subst and functional extensionality
- J and its computation rule (up to a path)
- Σ-types and contractibility of singletons
- Converting PathP to and ... | 30.703971 | 115 | 0.483363 |
cb4ace3702e716f4ae3a0ff907f09dad7f8b415b | 445 | agda | Agda | prototyping/FFI/Data/HaskellString.agda | JohnnyMorganz/luau | f2191b9e4da6a4bb2d9d344ebd7941ec2f00844b | [
"MIT"
] | 1 | 2021-12-05T21:53:03.000Z | 2021-12-05T21:53:03.000Z | prototyping/FFI/Data/HaskellString.agda | JohnnyMorganz/luau | f2191b9e4da6a4bb2d9d344ebd7941ec2f00844b | [
"MIT"
] | null | null | null | prototyping/FFI/Data/HaskellString.agda | JohnnyMorganz/luau | f2191b9e4da6a4bb2d9d344ebd7941ec2f00844b | [
"MIT"
] | null | null | null | module FFI.Data.HaskellString where
open import Agda.Builtin.String using (String)
{-# FOREIGN GHC import qualified Data.String #-}
{-# FOREIGN GHC import qualified Data.Text #-}
postulate HaskellString : Set
{-# COMPILE GHC HaskellString = type Data.String.String #-}
postulate pack : HaskellString → String
{-# COM... | 26.176471 | 59 | 0.734831 |
d0d38d0f4a6938430aeacc047283871f70e2a763 | 739 | agda | Agda | test/Fail/Issue964.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/Issue964.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/Issue964.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2016-08-04, issue #964
-- Allow open metas and interaction points in imported files
-- {-# OPTIONS -v import:100 #-}
-- {-# OPTIONS -v meta.postulate:20 #-}
-- {-# OPTIONS -v tc.conv.level:50 #-}
open import Common.Level
open import Common.Equality
postulate something : Set₁
open import Common.Issue964.... | 25.482759 | 66 | 0.700947 |
cbf319525e2f26e06bb9cf5ef4e579110ce06579 | 1,267 | agda | Agda | test/Succeed/Issue1648.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue1648.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue1648.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2015-09-18 Andreas, issue reported by Gillaume Brunerie
{- Problem WAS
The following code doesn’t typecheck but it should. I have no idea what’s going on.
Replacing the definition of PathOver-rewr by a question mark and
asking for full normalisation of the goal (C-u C-u C-c C-t), I obtain
HetEq idp u v =... | 31.675 | 83 | 0.552486 |
234a6affb8e5961024afba6d03f3eee8693eabf4 | 35,702 | agda | Agda | src/DualLMRefined.agda | kcaliban/dual-session | cd41919582013e75463308c32750e2712cf2de86 | [
"BSD-2-Clause"
] | null | null | null | src/DualLMRefined.agda | kcaliban/dual-session | cd41919582013e75463308c32750e2712cf2de86 | [
"BSD-2-Clause"
] | null | null | null | src/DualLMRefined.agda | kcaliban/dual-session | cd41919582013e75463308c32750e2712cf2de86 | [
"BSD-2-Clause"
] | null | null | null | {-# OPTIONS --rewriting #-}
module DualLMRefined where
open import Data.Bool
open import Data.Nat hiding (compare)
open import Data.Nat.Properties
open import Data.Fin hiding (_+_)
open import Data.Product
open import Function
open import Relation.Binary.PropositionalEquality hiding (Extensionality)
open import Agda.B... | 40.024664 | 244 | 0.58148 |
fbdcd20fac85aba0071856a6d5a9e1f5c2df0c69 | 2,015 | agda | Agda | Cubical/HITs/DunceCap/Properties.agda | borsiemir/cubical | cefeb3669ffdaea7b88ae0e9dd258378418819ca | [
"MIT"
] | 1 | 2020-03-23T23:52:11.000Z | 2020-03-23T23:52:11.000Z | Cubical/HITs/DunceCap/Properties.agda | borsiemir/cubical | cefeb3669ffdaea7b88ae0e9dd258378418819ca | [
"MIT"
] | null | null | null | Cubical/HITs/DunceCap/Properties.agda | borsiemir/cubical | cefeb3669ffdaea7b88ae0e9dd258378418819ca | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --safe #-}
module Cubical.HITs.DunceCap.Properties where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Function
open import Cubical.Foundations.GroupoidLaws
open import Cubical.Foundations.Isomorphism
open import Cubical.Foundations.Equiv
open import Cubical.Foundations... | 31 | 92 | 0.602481 |
1cd2503d54812e846cd707042cfba5a9e4a48222 | 652 | agda | Agda | lib/types/Cospan.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | 1 | 2021-06-30T00:17:55.000Z | 2021-06-30T00:17:55.000Z | lib/types/Cospan.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | null | null | null | lib/types/Cospan.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K #-}
open import lib.Basics
open import lib.types.Pi
open import lib.types.Pointed
module lib.types.Cospan where
record Cospan {i j k : ULevel} : Type (lsucc (lmax (lmax i j) k)) where
constructor cospan
field
A : Type i
B : Type j
C : Type k
f : A → C
g : B → C
record... | 21.733333 | 72 | 0.562883 |
df9a6ac3b98ac945cd8128e939097f8259faee41 | 9,572 | agda | Agda | Cubical/Experiments/ZariskiLatticeBasicOpens.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | 1 | 2021-10-31T17:32:49.000Z | 2021-10-31T17:32:49.000Z | Cubical/Experiments/ZariskiLatticeBasicOpens.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | Cubical/Experiments/ZariskiLatticeBasicOpens.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | {-# OPTIONS --safe --experimental-lossy-unification #-}
module Cubical.Experiments.ZariskiLatticeBasicOpens where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Function
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.Isomorphism
open import Cubical.Foundations.Univalenc... | 38.288 | 100 | 0.534371 |
dc9357a0442bc451696b329cf5b305d548de8188 | 16,018 | agda | Agda | Cubical/Functions/Embedding.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | 1 | 2021-10-31T17:32:49.000Z | 2021-10-31T17:32:49.000Z | Cubical/Functions/Embedding.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | Cubical/Functions/Embedding.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | {-# OPTIONS --safe #-}
module Cubical.Functions.Embedding where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Function
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.Equiv.Properties
open import Cubical.Foundations.Equiv.HalfAdjoint
open import Cubical.Foundations.HLeve... | 37.425234 | 109 | 0.614996 |
d07ea617123bd7b81b2d32c51e25699ab862e857 | 836 | agda | Agda | test/asset/agda-stdlib-1.0/Data/Nat.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Data/Nat.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Data/Nat.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Natural numbers
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Data.Nat where
---------------------------------------------------------------... | 24.588235 | 72 | 0.348086 |
cb98285a253a67858a4ae45d600913ea1957c80c | 3,624 | agda | Agda | src/Categories/Diagram/Pullback/Properties.agda | glittershark/agda-categories | 2128fab9e8d341364cbf784bb17c547bf73891de | [
"MIT"
] | null | null | null | src/Categories/Diagram/Pullback/Properties.agda | glittershark/agda-categories | 2128fab9e8d341364cbf784bb17c547bf73891de | [
"MIT"
] | null | null | null | src/Categories/Diagram/Pullback/Properties.agda | glittershark/agda-categories | 2128fab9e8d341364cbf784bb17c547bf73891de | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
open import Categories.Category
module Categories.Diagram.Pullback.Properties {o ℓ e} (C : Category o ℓ e) where
open import Function using (_$_)
open import Categories.Category.Cartesian C
open import Categories.Diagram.Pullback C
open import Categories.Diagram.Equalizer C
open i... | 34.188679 | 82 | 0.458057 |
4a5e17dcc95c39c065f9d631dc705d5b3b412cfc | 171 | agda | Agda | Cubical/HITs/Rational.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | 1 | 2020-03-23T23:52:11.000Z | 2020-03-23T23:52:11.000Z | Cubical/HITs/Rational.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | Cubical/HITs/Rational.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --safe #-}
module Cubical.HITs.Rational where
open import Cubical.HITs.Rational.Base public
-- open import Cubical.HITs.Rational.Properties public
| 24.428571 | 54 | 0.77193 |
0e2e033592b1c31e03db63387d8afc9bbc9c08d3 | 1,086 | agda | Agda | archive/agda-2/Oscar/Definition.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null | archive/agda-2/Oscar/Definition.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | 1 | 2019-04-29T00:35:04.000Z | 2019-05-11T23:33:04.000Z | archive/agda-2/Oscar/Definition.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null |
module Oscar.Definition where
{-
unpack : AList m n → Fin m → Term n -- sub
substitute : (Fin m → Term n) → Term m → Term n -- _◃_
substitutes : ∀ N → (Fin m → Term n) → Terms N m → Terms N n -- _◃s_
stepify : (Term m → Term n) → Step m → Step n -- fmapS
collapse : (List ∘ Step) n → Term n → Term n -- _⊹_
Substitis... | 21.72 | 94 | 0.6814 |
10769a9406a3e37ba406b3a0d6cc0ad658115bb3 | 25,705 | agda | Agda | Cubical/ZCohomology/Properties.agda | ByteBucket123/cubical | aeaa15fb846a3e8bda73635dc7462ae3813b4b1b | [
"MIT"
] | null | null | null | Cubical/ZCohomology/Properties.agda | ByteBucket123/cubical | aeaa15fb846a3e8bda73635dc7462ae3813b4b1b | [
"MIT"
] | null | null | null | Cubical/ZCohomology/Properties.agda | ByteBucket123/cubical | aeaa15fb846a3e8bda73635dc7462ae3813b4b1b | [
"MIT"
] | null | null | null | {-# OPTIONS --safe --experimental-lossy-unification #-}
module Cubical.ZCohomology.Properties where
{-
This module contains:
1. direct proofs of connectedness of Kn and ΩKn
2. Induction principles for cohomology groups of pointed types
3. Equivalence between cohomology of A and reduced cohomology of (A + 1)
4. Equival... | 49.243295 | 132 | 0.514725 |
502e4f0f48d5e5cf1c204b6d3977fa1c334a830b | 135 | agda | Agda | test/interaction/Imports/ImportedDisplayForms.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/interaction/Imports/ImportedDisplayForms.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/interaction/Imports/ImportedDisplayForms.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
module Imports.ImportedDisplayForms where
open import Agda.Builtin.Nat
postulate
_plus_ : Set
{-# DISPLAY _+_ a b = a plus b #-}
| 13.5 | 41 | 0.718519 |
cb312041da770ba57b394cb6de036f232cbc4b7b | 3,788 | agda | Agda | Operational-semantics-using-the-partiality-monad.agda | nad/codata | 1b90445566df0d3b4ba6e31bd0bac417b4c0eb0e | [
"MIT"
] | 1 | 2021-02-13T14:48:45.000Z | 2021-02-13T14:48:45.000Z | Operational-semantics-using-the-partiality-monad.agda | nad/codata | 1b90445566df0d3b4ba6e31bd0bac417b4c0eb0e | [
"MIT"
] | null | null | null | Operational-semantics-using-the-partiality-monad.agda | nad/codata | 1b90445566df0d3b4ba6e31bd0bac417b4c0eb0e | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- Code related to the paper
-- "Operational Semantics Using the Partiality Monad"
--
-- Nils Anders Danielsson
------------------------------------------------------------------------
-- Several definitions and proofs in this code are closely re... | 27.057143 | 72 | 0.631468 |
fb92dc3d7356f043997b28ce0697485d9d6dd972 | 20,614 | agda | Agda | LibraBFT/Prelude.agda | oracle/bft-consensus-agda | 49f8b1b70823be805d84ffc3157c3b880edb1e92 | [
"UPL-1.0"
] | 4 | 2020-12-16T19:43:41.000Z | 2021-12-18T19:24:05.000Z | LibraBFT/Prelude.agda | oracle/bft-consensus-agda | 49f8b1b70823be805d84ffc3157c3b880edb1e92 | [
"UPL-1.0"
] | 72 | 2021-02-04T05:04:33.000Z | 2022-03-25T05:36:11.000Z | LibraBFT/Prelude.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
-}
-- This is a selection of useful functions and definitions
-- from the s... | 31.328267 | 164 | 0.529106 |
d054cc161102706e3919dbaaa5c21387048044a2 | 1,119 | agda | Agda | theorems/homotopy/TruncationLoopLadder.agda | AntoineAllioux/HoTT-Agda | 1037d82edcf29b620677a311dcfd4fc2ade2faa6 | [
"MIT"
] | 294 | 2015-01-09T16:23:23.000Z | 2022-03-20T13:54:45.000Z | theorems/homotopy/TruncationLoopLadder.agda | AntoineAllioux/HoTT-Agda | 1037d82edcf29b620677a311dcfd4fc2ade2faa6 | [
"MIT"
] | 31 | 2015-03-05T20:09:00.000Z | 2021-10-03T19:15:25.000Z | theorems/homotopy/TruncationLoopLadder.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
module homotopy.TruncationLoopLadder where
⊙Ω-Trunc : ∀ {i} {n : ℕ₋₂} (X : Ptd i)
→ ⊙Ω (⊙Trunc (S n) X) ⊙≃ ⊙Trunc n (⊙Ω X)
⊙Ω-Trunc X = ≃-to-⊙≃ (=ₜ-equiv [ pt X ] [ pt X ]) idp
step : ∀ {i j} n {X : Ptd i} {Y : Ptd j} (f : X ⊙→ Y)
→ ⊙CommSquareE... | 32.911765 | 78 | 0.459339 |
39541ece4dae39bad09ca49ec5be6def7516529e | 461 | agda | Agda | test/interaction/Issue1298.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/interaction/Issue1298.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/interaction/Issue1298.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- {-# OPTIONS -v tc.cover:40 #-}
-- Andreas, 2014-10-09
-- Reported by ohmanjoakim
infixr 8 _⇒_
data Ty : Set where
_⇒_ : Ty → Ty → Ty
⟦_⟧ : Ty → Set
⟦ A ⇒ B ⟧ = ⟦ A ⟧ → ⟦ B ⟧
data Term : Ty → Set where
K : (A B : Ty) → Term (A ⇒ B ⇒ A)
test : (A : Ty) (a : Term A) → ⟦ A ⟧
test A a = {!a!}
-- When doing a c... | 18.44 | 65 | 0.496746 |
500cf338e0a86cd85390fd32274db1d8d435a34b | 14,808 | agda | Agda | agda/Esterel/Lang/CanFunction/MergePotentialRuleCan.agda | florence/esterel-calculus | 4340bef3f8df42ab8167735d35a4cf56243a45cd | [
"MIT"
] | 3 | 2020-04-16T10:58:53.000Z | 2020-07-01T03:59:31.000Z | agda/Esterel/Lang/CanFunction/MergePotentialRuleCan.agda | florence/esterel-calculus | 4340bef3f8df42ab8167735d35a4cf56243a45cd | [
"MIT"
] | null | null | null | agda/Esterel/Lang/CanFunction/MergePotentialRuleCan.agda | florence/esterel-calculus | 4340bef3f8df42ab8167735d35a4cf56243a45cd | [
"MIT"
] | 1 | 2020-04-15T20:02:49.000Z | 2020-04-15T20:02:49.000Z | {-
The equivalent "goodness" of can w.r.t. the rmerge reduction.
The lemma proved in this file is
can-irr : ∀ {BV} {FV} θ₁ θ₂ q →
CorrectBinding q BV FV →
(distinct' (proj₁ FV) (proj₁ (Dom θ₂))) →
Can q θ₁ ≡ Can q (θ₁ ← θ₂)
That is, the result of the Can function will not change
provided that t... | 46.566038 | 128 | 0.568679 |
dca2d116ddcc62d64ecaeb6f0a96ea9ea3f8cf25 | 2,766 | agda | Agda | examples/outdated-and-incorrect/tait/Prelude.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/tait/Prelude.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/tait/Prelude.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
module Prelude where
infix 20 _≡_ _≤_ _∈_
infixl 60 _,_ _++_ _+_ _◄_ _◄²_
_∘_ : {A B : Set}{C : B -> Set}(f : (x : B) -> C x)(g : A -> B)(x : A) -> C (g x)
(f ∘ g) x = f (g x)
data _≡_ {A : Set}(x : A) : {B : Set} -> B -> Set where
refl : x ≡ x
cong : {A : Set}{B : A -> Set}(f : (z : A) -> B z){x y : A} ->
... | 26.342857 | 81 | 0.435286 |
0e5c5c77e66b3e256aa745eb27d76e9c4057952e | 1,180 | agda | Agda | agda/proof-nat.agda | anqurvanillapy/fpl | 9576d5b76e6a868992dbe52930712ac67697bed2 | [
"MIT"
] | 1 | 2019-08-24T22:47:47.000Z | 2019-08-24T22:47:47.000Z | agda/proof-nat.agda | anqurvanillapy/fpl | 9576d5b76e6a868992dbe52930712ac67697bed2 | [
"MIT"
] | null | null | null | agda/proof-nat.agda | anqurvanillapy/fpl | 9576d5b76e6a868992dbe52930712ac67697bed2 | [
"MIT"
] | null | null | null | import Relation.Binary.PropositionalEquality as Eq
open Eq using (_≡_; refl)
open Eq.≡-Reasoning using (begin_; _≡⟨⟩_; _∎)
data ℕ : Set where
zero : ℕ
suc : ℕ → ℕ
{-# BUILTIN NATURAL ℕ #-}
{- Addition -}
_+_ : ℕ → ℕ → ℕ
zero + n = n
(suc m) + n = suc (m + n)
_ : 3 + 4 ≡ 7
_ =
begin
3 + 4
≡⟨⟩
... | 11.132075 | 50 | 0.35678 |
1cac0d8654e2781d5d447a370e5ef7a186d7bdc6 | 1,030 | agda | Agda | lib/types/Groupoid.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | 1 | 2021-06-30T00:17:55.000Z | 2021-06-30T00:17:55.000Z | lib/types/Groupoid.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | null | null | null | lib/types/Groupoid.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K #-}
open import lib.Basics
open import lib.NType2
open import lib.types.TLevel
open import lib.types.Sigma
open import lib.types.Pi
module lib.types.Groupoid where
record GroupoidStructure {i j} {El : Type i} (Arr : El → El → Type j)
(_ : ∀ x y → has-level ⟨0⟩ (Arr x y)) : Type (lmax i j) w... | 33.225806 | 69 | 0.538835 |
4a0ea43afec71e24f6d20cb96cf547d2cce05282 | 9,169 | agda | Agda | src/scratch/FinDecEq1.agda | zampino/ggt | e2d6b5f9bea15dd67817bf67e273f6b9a14335af | [
"MIT"
] | 2 | 2020-04-17T11:10:00.000Z | 2020-11-28T05:48:39.000Z | src/scratch/FinDecEq1.agda | zampino/ggt | e2d6b5f9bea15dd67817bf67e273f6b9a14335af | [
"MIT"
] | null | null | null | src/scratch/FinDecEq1.agda | zampino/ggt | e2d6b5f9bea15dd67817bf67e273f6b9a14335af | [
"MIT"
] | null | null | null | module Scratch.FinDecEq1 where
open import Data.Bool.Base hiding (_≤_)
open import Data.Product
open import Data.Sum
open import Level renaming (suc to lsuc; _⊔_ to _⊔ℓ_; zero to lzero)
open import Relation.Nullary
open import Relation.Nullary.Decidable
open import Relation.Unary using (Decidable)
open import Relati... | 33.221014 | 100 | 0.476279 |
cb0d762e677bfa0cfe498ef56662e6731ed1a133 | 233 | agda | Agda | test/Succeed/Issue2155.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 3 | 2015-03-28T14:51:03.000Z | 2015-12-07T20:14:00.000Z | test/Succeed/Issue2155.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 3 | 2018-11-14T15:31:44.000Z | 2019-04-01T19:39:26.000Z | test/Succeed/Issue2155.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1 | 2015-09-15T14:36:15.000Z | 2015-09-15T14:36:15.000Z |
open import Agda.Builtin.Bool
open import Agda.Builtin.Equality
open import Agda.Builtin.Float
NaN : Float
NaN = primFloatDiv 0.0 0.0
defNaN : NaN ≡ NaN
defNaN = refl
primEqNaN : primFloatEquality NaN NaN ≡ true
primEqNaN = refl
| 16.642857 | 44 | 0.763948 |
d0af3abea33c0dad136dfae6da85ddee873edff9 | 1,051 | agda | Agda | test/Succeed/QuoteAbsurdClause.agda | cagix/agda | cc026a6a97a3e517bb94bafa9d49233b067c7559 | [
"BSD-2-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/QuoteAbsurdClause.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/QuoteAbsurdClause.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.Unit
open import Agda.Builtin.Nat
open import Agda.Builtin.Equality
open import Agda.Builtin.List
open import Agda.Builtin.Sigma
open import Agda.Builtin.Reflection renaming (bindTC to _>>=_)
data ⊥ : Set where
[_] : {A : Set} → A → List A
[ x ] = x ∷ []
vArg : {A : Set} → A → Arg A
vArg x ... | 25.02381 | 88 | 0.617507 |
fb93ae84543a6186d71cd30fbc7433a6b6bbdb32 | 598 | agda | Agda | Agda/ProcessAlgebra.agda | Brethland/LEARNING-STUFF | eb2cef0556efb9a4ce11783f8516789ea48cc344 | [
"MIT"
] | 2 | 2020-02-03T05:05:52.000Z | 2020-03-11T10:35:42.000Z | Agda/ProcessAlgebra.agda | Brethland/LEARNING-STUFF | eb2cef0556efb9a4ce11783f8516789ea48cc344 | [
"MIT"
] | null | null | null | Agda/ProcessAlgebra.agda | Brethland/LEARNING-STUFF | eb2cef0556efb9a4ce11783f8516789ea48cc344 | [
"MIT"
] | 1 | 2019-12-13T04:50:46.000Z | 2019-12-13T04:50:46.000Z | module ProcessAlgebra where
open import Data.Nat
open import Data.Nat.Properties
open import Data.List
data Channel : Set where
ℂ_ : ℕ → Channel
data ℙ : Set₁ where
ν_[_] : List Channel → (Channel → ℙ) → ℙ
B_,_ : Channel → ℙ → ℙ
Send_[_],_ : ∀ {A : Set} → Channel → A → ℙ → ℙ
Recv_,_ : ∀ {A : Set} → Channel... | 19.290323 | 48 | 0.605351 |
4a696337d00519e048501af3c107c0f237dc46cb | 734 | agda | Agda | agda/Everything.agda | bgbianchi/sorting | b8d428bccbdd1b13613e8f6ead6c81a8f9298399 | [
"MIT"
] | 6 | 2015-05-21T12:50:35.000Z | 2021-08-24T22:11:15.000Z | agda/Everything.agda | bgbianchi/sorting | b8d428bccbdd1b13613e8f6ead6c81a8f9298399 | [
"MIT"
] | null | null | null | agda/Everything.agda | bgbianchi/sorting | b8d428bccbdd1b13613e8f6ead6c81a8f9298399 | [
"MIT"
] | null | null | null | module Everything where
open import Relation.Binary.Core
postulate A : Set
postulate _≤_ : A → A → Set
postulate tot≤ : Total _≤_
postulate trans≤ : Transitive _≤_
open import BBHeap.Everything _≤_ tot≤ trans≤
open import BHeap.Everything _≤_ tot≤
open import BTree.Complete.Alternative.Correctness {A}
open import... | 22.242424 | 54 | 0.775204 |
cbda517d996a5dbbbc07f074c0f2b393025bab0b | 382 | agda | Agda | Base.agda | DDOtten/M-types | 5b70f4b3dc3e50365ad7a3a80b0cd14efbfa4369 | [
"MIT"
] | null | null | null | Base.agda | DDOtten/M-types | 5b70f4b3dc3e50365ad7a3a80b0cd14efbfa4369 | [
"MIT"
] | null | null | null | Base.agda | DDOtten/M-types | 5b70f4b3dc3e50365ad7a3a80b0cd14efbfa4369 | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K #-}
module M-types.Base where
open import M-types.Base.Core public
open import M-types.Base.Sum public
open import M-types.Base.Prod public
open import M-types.Base.Eq public
open import M-types.Base.Equi public
open import M-types.Base.Rel public
open import M-type... | 29.384615 | 41 | 0.717277 |
396fbc021c94087d58e9df16ebe89fc61ce42245 | 666 | agda | Agda | test/Succeed/Issue2386BuiltinEqualitySet.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue2386BuiltinEqualitySet.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue2386BuiltinEqualitySet.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2017-01-12, issue #2386
-- Relaxing the constraints of BUILTIN EQUALITY
postulate
A : Set
a b : A
P : A → Set
-- Level-polymorphic equality
module P where
data _≡_ {a} {A : Set a} (x : A) : A → Set a where
instance refl : x ≡ x
-- Set-polymorphic equality
data _≡_ {A : Set} (x : A) : A → Se... | 20.181818 | 71 | 0.605105 |
20a8c9d333d994ba3823a79d6ee73d5674f75132 | 15,775 | agda | Agda | src/data/lib/prim/Agda/Builtin/Reflection.agda | isovector/agda | 9a29f3a1f5e24c818bdabbf2c17d0f79887aa8b4 | [
"BSD-2-Clause"
] | null | null | null | src/data/lib/prim/Agda/Builtin/Reflection.agda | isovector/agda | 9a29f3a1f5e24c818bdabbf2c17d0f79887aa8b4 | [
"BSD-2-Clause"
] | null | null | null | src/data/lib/prim/Agda/Builtin/Reflection.agda | isovector/agda | 9a29f3a1f5e24c818bdabbf2c17d0f79887aa8b4 | [
"BSD-2-Clause"
] | null | null | null | {-# OPTIONS --without-K --safe --no-sized-types --no-guardedness #-}
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 import Agda.Builtin.Char
o... | 40.038071 | 130 | 0.553344 |
3922e9174791507a64f86c766a954b7adaa1fce3 | 311 | agda | Agda | test/Fail/Errors/Issue84.agda | asr/apia | a66c5ddca2ab470539fd68c42c4fbd45f720d682 | [
"MIT"
] | 10 | 2015-09-03T20:54:16.000Z | 2019-12-03T13:44:25.000Z | test/Fail/Errors/Issue84.agda | asr/apia | a66c5ddca2ab470539fd68c42c4fbd45f720d682 | [
"MIT"
] | 121 | 2015-01-25T13:22:12.000Z | 2018-04-22T06:01:44.000Z | test/Fail/Errors/Issue84.agda | asr/apia | a66c5ddca2ab470539fd68c42c4fbd45f720d682 | [
"MIT"
] | 4 | 2016-05-10T23:06:19.000Z | 2016-08-03T03:54:55.000Z | {-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorphism #-}
{-# OPTIONS --without-K #-}
postulate
D : Set
_≡_ : D → D → Set
a b : D
postulate p : a ≡ b
{-# ATP axiom p #-}
postulate foo : a ≡ b
{-# ATP prove foo #-}
| 19.4375 | 42 | 0.4791 |
1cebd6cc93e3c27beb7afe0a18de1e58ec7c96f2 | 1,291 | agda | Agda | archive/agda-3/src/Oscar/Class/Transrightidentity.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null | archive/agda-3/src/Oscar/Class/Transrightidentity.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/Transrightidentity.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null |
open import Oscar.Prelude
open import Oscar.Class
open import Oscar.Class.Leftunit
open import Oscar.Class.Reflexivity
open import Oscar.Class.Transitivity
module Oscar.Class.Transrightidentity where
module Transrightidentity
{𝔬} {𝔒 : Ø 𝔬}
{𝔯} (_∼_ : 𝔒 → 𝔒 → Ø 𝔯)
{ℓ} (_∼̇_ : ∀ {x y} → x ∼ y → x ∼ y → Ø ... | 32.275 | 104 | 0.597986 |
dcc396fd7702724c7d5dbb61bc3ecf950d6f3ead | 10,654 | agda | Agda | agda/sn-calculus-confluence/rec.agda | florence/esterel-calculus | 4340bef3f8df42ab8167735d35a4cf56243a45cd | [
"MIT"
] | 3 | 2020-04-16T10:58:53.000Z | 2020-07-01T03:59:31.000Z | agda/sn-calculus-confluence/rec.agda | florence/esterel-calculus | 4340bef3f8df42ab8167735d35a4cf56243a45cd | [
"MIT"
] | null | null | null | agda/sn-calculus-confluence/rec.agda | florence/esterel-calculus | 4340bef3f8df42ab8167735d35a4cf56243a45cd | [
"MIT"
] | 1 | 2020-04-15T20:02:49.000Z | 2020-04-15T20:02:49.000Z | module sn-calculus-confluence.rec where
open import Data.Nat using (_+_)
open import Function using (_∋_ ; _∘_)
open import Data.Nat.Properties.Simple using ( +-comm ; +-assoc )
open import utility
open import Esterel.Lang
open import Esterel.Lang.Properties
open import Esterel.Environment as Env
open import Esterel.C... | 81.953846 | 305 | 0.585508 |
dfa461a09e63b5206e6570e6dba7a29c563b7f4d | 1,431 | agda | Agda | Numeral/Natural/Relation/Order/Existence.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | Numeral/Natural/Relation/Order/Existence.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | Numeral/Natural/Relation/Order/Existence.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | module Numeral.Natural.Relation.Order.Existence where
import Lvl
open import Logic
open import Logic.Propositional
open import Logic.Predicate
open import Numeral.Natural
open import Numeral.Natural.Oper
open import Numeral.Natural.Oper.Proofs
import Numeral.Natural.Relation.Order as [≤def]
open import Relat... | 31.108696 | 107 | 0.533194 |
dfcaccd5598d823b0d791e0d97b48c4215907e6e | 5,551 | agda | Agda | Cubical/Categories/DistLatticeSheaf.agda | mzeuner/cubical | 63c770b381039c0132c17d7913f4566b35984701 | [
"MIT"
] | null | null | null | Cubical/Categories/DistLatticeSheaf.agda | mzeuner/cubical | 63c770b381039c0132c17d7913f4566b35984701 | [
"MIT"
] | null | null | null | Cubical/Categories/DistLatticeSheaf.agda | mzeuner/cubical | 63c770b381039c0132c17d7913f4566b35984701 | [
"MIT"
] | null | null | null | {-# OPTIONS --safe #-}
module Cubical.Categories.DistLatticeSheaf where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Structure
open import Cubical.Foundations.Powerset
open import Cubical.Data.Sigma
open import Cubical.Relation.Binary.Poset
open import Cubical.Algebra.Ring
open import Cubi... | 32.846154 | 161 | 0.591245 |
fb25a0efc94f509358c6efd39405f2877f938d5c | 658 | agda | Agda | src/fot/FOTC/Program/Iter0/PropertiesATP.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 11 | 2015-09-03T20:53:42.000Z | 2021-09-12T16:09:54.000Z | src/fot/FOTC/Program/Iter0/PropertiesATP.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 2 | 2016-10-12T17:28:16.000Z | 2017-01-01T14:34:26.000Z | src/fot/FOTC/Program/Iter0/PropertiesATP.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 3 | 2016-09-19T14:18:30.000Z | 2018-03-14T08:50:00.000Z | ------------------------------------------------------------------------------
-- Some properties of the function iter₀
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorp... | 31.333333 | 78 | 0.399696 |
4a52f6dbb766b93c52da45e147f606debea3cbde | 1,116 | agda | Agda | src/Types/Tail1.agda | peterthiemann/dual-session | 7a8bc1f6b2f808bd2a22c592bd482dbcc271979c | [
"BSD-2-Clause"
] | 1 | 2022-02-13T05:43:25.000Z | 2022-02-13T05:43:25.000Z | src/Types/Tail1.agda | peterthiemann/dual-session | 7a8bc1f6b2f808bd2a22c592bd482dbcc271979c | [
"BSD-2-Clause"
] | null | null | null | src/Types/Tail1.agda | peterthiemann/dual-session | 7a8bc1f6b2f808bd2a22c592bd482dbcc271979c | [
"BSD-2-Clause"
] | 1 | 2019-12-07T16:12:50.000Z | 2019-12-07T16:12:50.000Z | module Types.Tail1 where
open import Data.Fin
open import Data.Nat
open import Function using (_∘_)
open import Types.Direction
import Types.IND1 as IND
private
variable
n : ℕ
-- session types restricted to tail recursion
-- can be recognized by type of TChan constructor
data Type : Set
data SType (n : ℕ) : ... | 22.77551 | 63 | 0.65233 |
df4dda904ef694b748768bafe3b684924ff195df | 1,278 | agda | Agda | skylighting-core/test/cases/abc.agda | jgm/highlighting-kate2 | df6ac5844729a564cf2e7ae956dd820209c6afd2 | [
"MIT",
"BSD-3-Clause"
] | 139 | 2016-12-14T19:36:22.000Z | 2022-03-31T05:41:52.000Z | skylighting-core/test/cases/abc.agda | jgm/highlighting-kate2 | df6ac5844729a564cf2e7ae956dd820209c6afd2 | [
"MIT",
"BSD-3-Clause"
] | 133 | 2017-01-19T10:19:36.000Z | 2022-03-13T21:07:07.000Z | skylighting-core/test/cases/abc.agda | jgm/highlighting-kate2 | df6ac5844729a564cf2e7ae956dd820209c6afd2 | [
"MIT",
"BSD-3-Clause"
] | 66 | 2017-01-21T21:36:16.000Z | 2022-01-18T10:12:38.000Z | module Reals where
-- (a set with properties of) the reals
data ℝ : Set where
r0 : ℝ
r1 : ℝ
_+_ : ℝ → ℝ → ℝ
-- equality
data _==_ : ℝ → ℝ → Set where
AXrefl== : ∀ {r} → r == r
AXsymm== : ∀ {r s} → r == s → s == r
AXtrans== : ∀ {r s t} → r == s → s == t → r == t
AX+0 : ∀ {r} → (r + ... | 31.170732 | 104 | 0.365415 |
1ca2d748f7611afc3358a7ba240b2928a8e156d3 | 16,764 | agda | Agda | Cubical/Data/BinNat/BinNat.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | Cubical/Data/BinNat/BinNat.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | Cubical/Data/BinNat/BinNat.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | 1 | 2021-11-22T02:02:01.000Z | 2021-11-22T02:02:01.000Z | {- Binary natural numbers (Anders Mörtberg, Jan. 2019)
This file defines two representations of binary numbers. We prove that
they are equivalent to unary numbers and univalence is then used to
transport both programs and properties between the representations.
This is an example of how having computational univalence... | 34.004057 | 104 | 0.645848 |
209ab067d8c79a74ad96f20fb29c66396b086f43 | 810 | agda | Agda | test/Succeed/fol-theorems/DuplicateAgdaDefinitions1.agda | asr/apia | a66c5ddca2ab470539fd68c42c4fbd45f720d682 | [
"MIT"
] | 10 | 2015-09-03T20:54:16.000Z | 2019-12-03T13:44:25.000Z | test/Succeed/fol-theorems/DuplicateAgdaDefinitions1.agda | asr/apia | a66c5ddca2ab470539fd68c42c4fbd45f720d682 | [
"MIT"
] | 121 | 2015-01-25T13:22:12.000Z | 2018-04-22T06:01:44.000Z | test/Succeed/fol-theorems/DuplicateAgdaDefinitions1.agda | asr/apia | a66c5ddca2ab470539fd68c42c4fbd45f720d682 | [
"MIT"
] | 4 | 2016-05-10T23:06:19.000Z | 2016-08-03T03:54:55.000Z | ------------------------------------------------------------------------------
-- Testing the erasing of the duplicate definitions required by a conjecture
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-... | 28.928571 | 78 | 0.402469 |
103095dfae9f042528124d206e87cccb3ee21f2a | 1,076 | agda | Agda | src/Dijkstra/EitherLike.agda | LaudateCorpus1/bft-consensus-agda | a4674fc473f2457fd3fe5123af48253cfb2404ef | [
"UPL-1.0"
] | null | null | null | src/Dijkstra/EitherLike.agda | LaudateCorpus1/bft-consensus-agda | a4674fc473f2457fd3fe5123af48253cfb2404ef | [
"UPL-1.0"
] | null | null | null | src/Dijkstra/EitherLike.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
-}
module Dijkstra.EitherLike where
open import Haskell.Prelude
open imp... | 31.647059 | 111 | 0.671004 |
1016ec3d6ec0ecd030fa6650055c9e276ce319bc | 4,401 | agda | Agda | code-examples/agda/poly0.agda | mstone/poly | 425de958985aacbd3284d3057fe21fd682e315ea | [
"MIT"
] | 53 | 2021-02-18T16:31:04.000Z | 2022-03-22T23:08:27.000Z | code-examples/agda/poly0.agda | mstone/poly | 425de958985aacbd3284d3057fe21fd682e315ea | [
"MIT"
] | 2 | 2021-09-02T02:29:39.000Z | 2022-01-12T10:06:32.000Z | code-examples/agda/poly0.agda | mstone/poly | 425de958985aacbd3284d3057fe21fd682e315ea | [
"MIT"
] | 4 | 2021-07-10T17:19:37.000Z | 2022-01-30T11:45:57.000Z | {-# OPTIONS --type-in-type #-}
module poly0 where
open import prelude
open import functors
open import poly.core public
variable
A B C X Y : ∫
I A⁺ B⁺ C⁺ X⁺ Y⁺ : Set
A⁻ : A⁺ → Set
B⁻ : B⁺ → Set
C⁻ : C⁺ → Set
X⁻ : X⁺ → Set
Y⁻ : Y⁺ → Set
∃⊤ ∃⊥ ⊤∫ ∫∫ : Set → ∫
∃⊤ a = a , λ _ → ⊤
∃⊥ a = a , λ _ → ⊥
⊤∫ a ... | 30.5625 | 85 | 0.33606 |
20f152bdfa894d785a75ecb2c120ec8a5cfde202 | 794 | agda | Agda | src/Data/Lens/Proofs/LensLaws.agda | JonathanBrouwer/research-project | 4959a3c9cd8563a1726e0e968e6a179008cd4d9f | [
"Unlicense"
] | 1 | 2021-05-25T09:10:20.000Z | 2021-05-25T09:10:20.000Z | src/Data/Lens/Proofs/LensLaws.agda | JonathanBrouwer/research-project | 4959a3c9cd8563a1726e0e968e6a179008cd4d9f | [
"Unlicense"
] | null | null | null | src/Data/Lens/Proofs/LensLaws.agda | JonathanBrouwer/research-project | 4959a3c9cd8563a1726e0e968e6a179008cd4d9f | [
"Unlicense"
] | null | null | null | module Data.Lens.Proofs.LensLaws where
open import Haskell.Prelude renaming (zero to Z; suc to S)
open import Data.Lens.Lens
open import Data.Logic
open import Agda.Primitive
-- First, define the lens laws
ViewSet : {a b : Set} -> (l : Lens a b) -> Set
ViewSet {a} {b} l = (v : b) (s : a) -> view l (set l v s) ≡ v
... | 29.407407 | 84 | 0.602015 |
dfbfeedf8ddb3960fc84919200d92566ec07541a | 1,474 | agda | Agda | SOAS/ContextMaps/Properties.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 39 | 2021-11-09T20:39:55.000Z | 2022-03-19T17:33:12.000Z | SOAS/ContextMaps/Properties.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 1 | 2021-11-21T12:19:32.000Z | 2021-11-21T12:19:32.000Z | SOAS/ContextMaps/Properties.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 4 | 2021-11-09T20:39:59.000Z | 2022-01-24T12:49:17.000Z |
import SOAS.Families.Core
-- Various properties of context map operations
module SOAS.ContextMaps.Properties {T : Set}
(open SOAS.Families.Core {T}) (𝒳 : Familyₛ) where
open import SOAS.Common
open import SOAS.Context
open import SOAS.Variable
open import SOAS.ContextMaps.CategoryOfRenamings {T}
open import SOAS.... | 32.755556 | 84 | 0.625509 |
dc10e2cc4797d9f635b1730e42080cfcc64d46e4 | 1,207 | agda | Agda | agda/Data/List/Filter.agda | oisdk/combinatorics-paper | 3c176d4690566d81611080e9378f5a178b39b851 | [
"MIT"
] | null | null | null | agda/Data/List/Filter.agda | oisdk/combinatorics-paper | 3c176d4690566d81611080e9378f5a178b39b851 | [
"MIT"
] | null | null | null | agda/Data/List/Filter.agda | oisdk/combinatorics-paper | 3c176d4690566d81611080e9378f5a178b39b851 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --safe #-}
module Data.List.Filter where
open import Prelude
open import Data.List
open import Data.List.Membership
open import Data.Sigma.Properties
open import Data.Bool.Properties
open import Data.Fin
module _ {p} {P : A → Type p} where
filter : (P? : ∀ x → Dec (P x)) → List A → List (∃ P)... | 38.935484 | 136 | 0.525269 |
fbf7fbecf565bdab48c2e5cc9cd1ac6e323439c0 | 90 | agda | Agda | agda/Data/Fin.agda | oisdk/combinatorics-paper | 3c176d4690566d81611080e9378f5a178b39b851 | [
"MIT"
] | 6 | 2020-09-11T17:45:41.000Z | 2021-11-16T08:11:34.000Z | agda/Data/Fin.agda | oisdk/combinatorics-paper | 3c176d4690566d81611080e9378f5a178b39b851 | [
"MIT"
] | null | null | null | agda/Data/Fin.agda | oisdk/combinatorics-paper | 3c176d4690566d81611080e9378f5a178b39b851 | [
"MIT"
] | 1 | 2021-11-11T12:30:21.000Z | 2021-11-11T12:30:21.000Z | {-# OPTIONS --cubical --safe #-}
module Data.Fin where
open import Data.Fin.Base public
| 15 | 32 | 0.7 |
3915693ceb51f001de8ce12b4ac883debedc76a5 | 3,613 | agda | Agda | HoTT/Basic_Types.agda | andyfreeyy/agda_and_math | 76b9ef64626b6d3bbb7ace4f1a16aeb447c54328 | [
"MIT"
] | 2 | 2020-03-23T09:01:42.000Z | 2020-05-24T10:56:36.000Z | HoTT/Basic_Types.agda | andyfreeyy/agda_and_math | 76b9ef64626b6d3bbb7ace4f1a16aeb447c54328 | [
"MIT"
] | null | null | null | HoTT/Basic_Types.agda | andyfreeyy/agda_and_math | 76b9ef64626b6d3bbb7ace4f1a16aeb447c54328 | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --exact-split --safe #-}
module Basic_Types where
-- Already in the builtin's of agda, there are Π types, which is ∀, and lambda
-- abstraction, which is λ{ } and function types, which is →.
-- ------------------------------------
-- Some operations for function types
-- The curly brackts ∀{... | 27.165414 | 78 | 0.443952 |
0e03e0a0b8e1f38f380d61fc2c5d20885d97859e | 4,722 | agda | Agda | Cubical/DStructures/Structures/Higher.agda | Schippmunk/cubical | c345dc0c49d3950dc57f53ca5f7099bb53a4dc3a | [
"MIT"
] | null | null | null | Cubical/DStructures/Structures/Higher.agda | Schippmunk/cubical | c345dc0c49d3950dc57f53ca5f7099bb53a4dc3a | [
"MIT"
] | null | null | null | Cubical/DStructures/Structures/Higher.agda | Schippmunk/cubical | c345dc0c49d3950dc57f53ca5f7099bb53a4dc3a | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.DStructures.Structures.Higher where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Isomorphism
open import Cubical.Foundations.Function
open import Cu... | 37.776 | 113 | 0.532402 |
10691735209a294f0ff0ea081f6a8f2d2029a562 | 4,003 | agda | Agda | internal/lob--2015-06-14--III.agda | JasonGross/lob | 716129208eaf4fe3b5f629f95dde4254805942b3 | [
"MIT"
] | 19 | 2015-07-17T17:53:30.000Z | 2021-03-17T14:04:53.000Z | internal/lob--2015-06-14--III.agda | JasonGross/lob | 716129208eaf4fe3b5f629f95dde4254805942b3 | [
"MIT"
] | 1 | 2015-07-17T20:20:43.000Z | 2015-07-17T20:20:43.000Z | internal/lob--2015-06-14--III.agda | JasonGross/lob | 716129208eaf4fe3b5f629f95dde4254805942b3 | [
"MIT"
] | 1 | 2015-07-17T18:53:37.000Z | 2015-07-17T18:53:37.000Z | module lob--2015-06-14--III where
data ℕ : Set where
zero : ℕ
suc : ℕ → ℕ
{-# BUILTIN NATURAL ℕ #-}
record Σ {X : Set} (F : X → Set) : Set where
constructor _,_
field fst : X
snd : F fst
data ⊤ : Set where
unit : ⊤
data Tree (X : Set) : Set where
br : Tree X → Tree X → Tree X
leaf : X →... | 19.816832 | 98 | 0.501374 |
23cd34507e044066419c62b0e5c6ec740f6e9421 | 1,126 | agda | Agda | src/Categories/Category/Exact.agda | Akshobhya1234/agda-categories | c202a616d4f376b11e8320e641c98db2ddc9d233 | [
"MIT"
] | null | null | null | src/Categories/Category/Exact.agda | Akshobhya1234/agda-categories | c202a616d4f376b11e8320e641c98db2ddc9d233 | [
"MIT"
] | null | null | null | src/Categories/Category/Exact.agda | Akshobhya1234/agda-categories | c202a616d4f376b11e8320e641c98db2ddc9d233 | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
-- Exact category (https://ncatlab.org/nlab/show/exact+category)
-- is a regular category
-- in which every internal equivalence is a kernel pair
module Categories.Category.Exact where
open import Level
open import Categories.Category.Core
open import Categories.Diagram.Pullback
o... | 31.277778 | 84 | 0.742451 |
23621f6e4d1a6eed7aa690d0c0084c8e1992797a | 1,593 | agda | Agda | src/deriveUtil.agda | shinji-kono/automaton-in-agda | eba0538f088f3d0c0fedb19c47c081954fbc69cb | [
"MIT"
] | null | null | null | src/deriveUtil.agda | shinji-kono/automaton-in-agda | eba0538f088f3d0c0fedb19c47c081954fbc69cb | [
"MIT"
] | null | null | null | src/deriveUtil.agda | shinji-kono/automaton-in-agda | eba0538f088f3d0c0fedb19c47c081954fbc69cb | [
"MIT"
] | null | null | null | module deriveUtil where
open import Level renaming ( suc to succ ; zero to Zero )
open import Data.Nat
open import Data.Fin
open import Data.List
open import regex
open import automaton
open import nfa
open import logic
open NAutomaton
open Automaton
open import Relation.Binary.PropositionalEquality hiding ( [_] )
o... | 22.757143 | 91 | 0.578782 |
d0bd3e744881b231af1ecfcdb32b6e8f3cb932f8 | 203 | agda | Agda | test/Succeed/Issue2243.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue2243.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue2243.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2016-10-08, issue #2243
-- {-# OPTIONS -v tc.cover.cover:100 #-}
open import Agda.Builtin.Char
f : Char → Char
f 'x' = 'x'
f 'x' = 'y' -- should be marked as unreachable clause
f _ = 's'
| 18.454545 | 54 | 0.605911 |
dcf4e68d4b2f3eb99fba732a19a1cadf54fb742d | 17,140 | agda | Agda | Cubical/HITs/Truncation/Properties.agda | knrafto/cubical | f6771617374bfe65a7043d00731fed5a673aa729 | [
"MIT"
] | null | null | null | Cubical/HITs/Truncation/Properties.agda | knrafto/cubical | f6771617374bfe65a7043d00731fed5a673aa729 | [
"MIT"
] | null | null | null | Cubical/HITs/Truncation/Properties.agda | knrafto/cubical | f6771617374bfe65a7043d00731fed5a673aa729 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.HITs.Truncation.Properties where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Function
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.Isomorphism
open import Cubical.Foundations.HLevels
open import Cubic... | 43.173804 | 131 | 0.578705 |
39569708c11c34c18312220c15c5ec3c51dceaa6 | 1,531 | agda | Agda | theorems/cw/Degree.agda | cmknapp/HoTT-Agda | bc849346a17b33e2679a5b3f2b8efbe7835dc4b6 | [
"MIT"
] | null | null | null | theorems/cw/Degree.agda | cmknapp/HoTT-Agda | bc849346a17b33e2679a5b3f2b8efbe7835dc4b6 | [
"MIT"
] | null | null | null | theorems/cw/Degree.agda | cmknapp/HoTT-Agda | bc849346a17b33e2679a5b3f2b8efbe7835dc4b6 | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K #-}
open import HoTT
open import cw.CW
open import homotopy.PinSn
module cw.Degree
{i} {n : ℕ} (skel : Skeleton {i} (S (S n)))
(skel-has-dec-cells : has-dec-cells skel)
(skel-is-aligned : is-aligned skel)
-- the cells at the upper and lower dimensions
(upper : cells-last skel)
(low... | 31.244898 | 93 | 0.650555 |
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.