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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
cb36a6c2da0bed3033d96eb8a7773678bbd78b30 | 11,424 | agda | Agda | test/Succeed/Issue4868.agda | LaloHao/agda | 7de768bb7bc65dbe1efa35c699cfa8b8f9510573 | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue4868.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue4868.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.Bool
open import Agda.Builtin.Equality using (_≡_; refl)
open import Agda.Builtin.Float
renaming ( primFloatEquality to _≡ᵇ_
; primFloatInequality to _≤ᵇ_
; primFloatLess to _<ᵇ_
; primFloatPlus to infixl 6 _+_
; primFl... | 42.786517 | 355 | 0.544468 |
d024c695574f5e2ea911b641290be28fbd69fa29 | 504 | agda | Agda | prototyping/FFI/Data/Either.agda | morgoth990/luau | dbdf91f3cad8ea9e881b8cf99931f654faf65c2e | [
"MIT"
] | 1 | 2022-02-11T21:30:17.000Z | 2022-02-11T21:30:17.000Z | prototyping/FFI/Data/Either.agda | morgoth990/luau | dbdf91f3cad8ea9e881b8cf99931f654faf65c2e | [
"MIT"
] | null | null | null | prototyping/FFI/Data/Either.agda | morgoth990/luau | dbdf91f3cad8ea9e881b8cf99931f654faf65c2e | [
"MIT"
] | null | null | null | module FFI.Data.Either where
{-# FOREIGN GHC import qualified Data.Either #-}
data Either (A B : Set) : Set where
Left : A → Either A B
Right : B → Either A B
{-# COMPILE GHC Either = data Data.Either.Either (Data.Either.Left|Data.Either.Right) #-}
mapLeft : ∀ {A B C} → (A → B) → (Either A C) → (Either B C)
mapL... | 29.647059 | 89 | 0.617063 |
cb2433fa7c841a6b38923c33ba9d084c19017495 | 4,471 | agda | Agda | test/asset/agda-stdlib-1.0/Data/Container/Combinator/Properties.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Data/Container/Combinator/Properties.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Data/Container/Combinator/Properties.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Correctness proofs for container combinators
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Data.Container.Combinator.Properties where
open i... | 36.647541 | 87 | 0.5104 |
390a0f3eb0969b3fe847979fb117510e93911d42 | 7,807 | agda | Agda | Cubical/Categories/NaturalTransformation/Base.agda | Edlyr/cubical | 5de11df25b79ee49d5c084fbbe6dfc66e4147a2e | [
"MIT"
] | null | null | null | Cubical/Categories/NaturalTransformation/Base.agda | Edlyr/cubical | 5de11df25b79ee49d5c084fbbe6dfc66e4147a2e | [
"MIT"
] | null | null | null | Cubical/Categories/NaturalTransformation/Base.agda | Edlyr/cubical | 5de11df25b79ee49d5c084fbbe6dfc66e4147a2e | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Categories.NaturalTransformation.Base where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Univalence
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Isomorphism renaming (iso to iIso)
open import Cubica... | 35.008969 | 111 | 0.500833 |
cb2bed9957160994358c22a6c78b52b44e81085d | 495 | agda | Agda | test/Succeed/Issue3731.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue3731.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue3731.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2019-04-30, issue #3731
-- Compiler backend: Do not look for a main function if not the main module.
open import Agda.Builtin.Nat
module Issue3731 where
module M where
module main where
record R : Set where
field
main : Nat
data Main : Set where
main : Main
module N where
data mai... | 14.558824 | 76 | 0.674747 |
d0e8a986189ef20a91c1f3f72ecf748e56cda47e | 5,381 | agda | Agda | Structure/Category/Functor/Equiv.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | Structure/Category/Functor/Equiv.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | Structure/Category/Functor/Equiv.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | import Lvl
open import Structure.Category
module Structure.Category.Functor.Equiv
{ℓₗₒ ℓᵣₒ ℓₗₘ ℓᵣₘ ℓₗₑ ℓᵣₑ : Lvl.Level}
{catₗ : CategoryObject{ℓₗₒ}{ℓₗₘ}{ℓₗₑ}}
{catᵣ : CategoryObject{ℓᵣₒ}{ℓᵣₘ}{ℓᵣₑ}}
where
open import Functional.Dependent as Fn using (_$_)
import Function.Equals
open Function.E... | 52.754902 | 225 | 0.644118 |
1c3b99907c9998a7665c70ecac7691fcb03fb23b | 558 | agda | Agda | test/Fail/DontPrune.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/DontPrune.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/DontPrune.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2012-05-09
module DontPrune where
open import Common.Equality
open import Common.Product
data Bool : Set where
true false : Bool
test : (A : Set) →
let IF : Bool → A → A → A
IF = _
in (a b : A) →
(IF true a b ≡ a) × (IF false a b ≡ b)
test A a b = refl , refl
-- Expected result: unsol... | 23.25 | 78 | 0.666667 |
18f32581411200f6cec8e488ce637b4a0ec2dda2 | 10,388 | agda | Agda | Cubical/Experiments/Brunerie.agda | xekoukou/cubical | b6fbca9e83e553c5c2e4a16a2df7f9e9039034dc | [
"MIT"
] | null | null | null | Cubical/Experiments/Brunerie.agda | xekoukou/cubical | b6fbca9e83e553c5c2e4a16a2df7f9e9039034dc | [
"MIT"
] | null | null | null | Cubical/Experiments/Brunerie.agda | xekoukou/cubical | b6fbca9e83e553c5c2e4a16a2df7f9e9039034dc | [
"MIT"
] | null | null | null | {-# OPTIONS --safe #-}
module Cubical.Experiments.Brunerie where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Function
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.Pointed
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Univalence
open import... | 27.775401 | 96 | 0.533885 |
dcc3cd44ed240b70fd1b6d3e93def929b31c49d3 | 911 | agda | Agda | src/Categories/GlobularSet.agda | turion/agda-categories | ad0f94b6cf18d8a448b844b021aeda58e833d152 | [
"MIT"
] | 279 | 2019-06-01T14:36:40.000Z | 2022-03-22T00:40:14.000Z | src/Categories/GlobularSet.agda | seanpm2001/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | 236 | 2019-06-01T14:53:54.000Z | 2022-03-28T14:31:43.000Z | src/Categories/GlobularSet.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.GlobularSet where
-- Globular sets are defined in a Categorical context, but
-- should they be inside the Categories hierarchy?
open import Level
open import Data.Unit using (⊤)
open import Relation.Binary.PropositionalEquality using (refl)
open import Categories.... | 25.305556 | 62 | 0.735456 |
4a843eefe7ad4b663c1939b3725cba18567a08fe | 47,288 | agda | Agda | Agda/22-descent.agda | hemangandhi/HoTT-Intro | 09c710bf9c31ba88be144cc950bd7bc19c22a934 | [
"CC-BY-4.0"
] | null | null | null | Agda/22-descent.agda | hemangandhi/HoTT-Intro | 09c710bf9c31ba88be144cc950bd7bc19c22a934 | [
"CC-BY-4.0"
] | null | null | null | Agda/22-descent.agda | hemangandhi/HoTT-Intro | 09c710bf9c31ba88be144cc950bd7bc19c22a934 | [
"CC-BY-4.0"
] | null | null | null | {-# OPTIONS --without-K --allow-unsolved-metas --exact-split #-}
module 22-descent where
import 21-cubical-diagrams
open 21-cubical-diagrams public
-- Section 18.1 Five equivalent characterizations of pushouts
dep-cocone :
{ l1 l2 l3 l4 l5 : Level} {S : UU l1} {A : UU l2} {B : UU l3} {X : UU l4}
( f : S → A) (g... | 38.135484 | 110 | 0.528739 |
10497dbedce13a630521f9e8d3ed2b4ace62cad0 | 2,746 | agda | Agda | BasicIS4/Syntax/HilbertSequential.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | 29 | 2016-07-03T18:51:56.000Z | 2022-01-01T10:29:18.000Z | BasicIS4/Syntax/HilbertSequential.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | 1 | 2018-06-10T09:11:22.000Z | 2018-06-10T09:11:22.000Z | BasicIS4/Syntax/HilbertSequential.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | null | null | null | -- Basic intuitionistic modal logic S4, without ∨, ⊥, or ◇.
-- Hilbert-style formalisation of syntax.
-- Sequences of terms.
module BasicIS4.Syntax.HilbertSequential where
open import BasicIS4.Syntax.Common public
-- Derivations.
infix 3 _⊦⊢_
data _⊦⊢_ (Γ : Cx Ty) : Cx Ty → Set where
nil : Γ ⊦⊢ ∅
var : ∀ {... | 32.690476 | 71 | 0.430444 |
0e7d98bad3c8f34707e803cb02a2986b6eab6bb1 | 48 | agda | Agda | Task/Matrix-transposition/Agda/matrix-transposition-2.agda | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Matrix-transposition/Agda/matrix-transposition-2.agda | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Matrix-transposition/Agda/matrix-transposition-2.agda | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | (1 ∷ 4 ∷ []) ∷ (2 ∷ 5 ∷ []) ∷ (3 ∷ 6 ∷ []) ∷ []
| 24 | 47 | 0.125 |
18bab93b5fde75c87bb04c90c5fafe79e40b25aa | 1,288 | agda | Agda | src/fot/FOTC/Data/List/WF-Relation/LT-Cons/Induction/Acc/WF-I.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 11 | 2015-09-03T20:53:42.000Z | 2021-09-12T16:09:54.000Z | src/fot/FOTC/Data/List/WF-Relation/LT-Cons/Induction/Acc/WF-I.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 2 | 2016-10-12T17:28:16.000Z | 2017-01-01T14:34:26.000Z | src/fot/FOTC/Data/List/WF-Relation/LT-Cons/Induction/Acc/WF-I.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 3 | 2016-09-19T14:18:30.000Z | 2018-03-14T08:50:00.000Z | ------------------------------------------------------------------------------
-- Well-founded induction on the relation LTC
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-pol... | 39.030303 | 79 | 0.552019 |
df2464b9fb4275ed6a0ad252d4255dd40751af90 | 8,154 | agda | Agda | Cubical/Experiments/ZCohomologyOld/KcompPrelims.agda | hyleIndex/cubical | ce5c2820ecb2e0fd8dce74fb0247856cdbf034c4 | [
"MIT"
] | 301 | 2018-10-17T18:00:24.000Z | 2022-03-24T02:10:47.000Z | Cubical/Experiments/ZCohomologyOld/KcompPrelims.agda | hyleIndex/cubical | ce5c2820ecb2e0fd8dce74fb0247856cdbf034c4 | [
"MIT"
] | 584 | 2018-10-15T09:49:02.000Z | 2022-03-30T12:09:17.000Z | Cubical/Experiments/ZCohomologyOld/KcompPrelims.agda | hyleIndex/cubical | ce5c2820ecb2e0fd8dce74fb0247856cdbf034c4 | [
"MIT"
] | 134 | 2018-11-16T06:11:03.000Z | 2022-03-23T16:22:13.000Z | {-# OPTIONS --safe #-}
module Cubical.Experiments.ZCohomologyOld.KcompPrelims where
open import Cubical.ZCohomology.Base
open import Cubical.Homotopy.Connected
open import Cubical.HITs.Hopf
-- open import Cubical.Homotopy.Freudenthal hiding (encode)
open import Cubical.HITs.Sn
open import Cubical.HITs.S1
open import C... | 38.28169 | 116 | 0.607555 |
39670e80ffc78217b40b010adbd152576e1c0eeb | 11,306 | agda | Agda | StructurallyRecursiveDescentParsing/Lib.agda | yurrriq/parser-combinators | b396d35cc2cb7e8aea50b982429ee385f001aa88 | [
"MIT"
] | 7 | 2016-12-13T05:23:14.000Z | 2021-06-22T05:35:31.000Z | StructurallyRecursiveDescentParsing/Lib.agda | yurrriq/parser-combinators | b396d35cc2cb7e8aea50b982429ee385f001aa88 | [
"MIT"
] | 1 | 2018-01-22T22:21:41.000Z | 2018-01-24T16:39:37.000Z | StructurallyRecursiveDescentParsing/Lib.agda | yurrriq/parser-combinators | b396d35cc2cb7e8aea50b982429ee385f001aa88 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- A library of parser combinators
------------------------------------------------------------------------
-- This module also provides examples of parsers for which the indices
-- cannot be inferred.
module StructurallyRecursiveDescentParsing.... | 29.366234 | 72 | 0.520609 |
cb4356a68f1524a6a0f21bba8f508cc61ce09453 | 1,698 | agda | Agda | huffman/huffman-main.agda | rfindler/ial | f3f0261904577e930bd7646934f756679a6cbba6 | [
"MIT"
] | 29 | 2019-02-06T13:09:31.000Z | 2022-03-04T15:05:12.000Z | huffman/huffman-main.agda | rfindler/ial | f3f0261904577e930bd7646934f756679a6cbba6 | [
"MIT"
] | 8 | 2018-07-09T22:53:38.000Z | 2022-03-22T03:43:34.000Z | huffman/huffman-main.agda | rfindler/ial | f3f0261904577e930bd7646934f756679a6cbba6 | [
"MIT"
] | 17 | 2018-12-03T22:38:15.000Z | 2021-11-28T20:13:21.000Z | module huffman-main where
import parse
open import lib
open import huffman-types
import huffman
module parsem = parse huffman.gratr2-nt ptr
open parsem
open parsem.pnoderiv huffman.rrs huffman.huffman-rtn
open import run ptr
open noderiv {- from run.agda -}
process-start : start → string
process-start s = ""
proces... | 39.488372 | 154 | 0.671378 |
d07a0ac8c6c56a18cacd0af990dfbd2e6b05fb86 | 1,005 | agda | Agda | out/Sum/Signature.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 39 | 2021-11-09T20:39:55.000Z | 2022-03-19T17:33:12.000Z | out/Sum/Signature.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 1 | 2021-11-21T12:19:32.000Z | 2021-11-21T12:19:32.000Z | out/Sum/Signature.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 4 | 2021-11-09T20:39:59.000Z | 2022-01-24T12:49:17.000Z | {-
This second-order signature was created from the following second-order syntax description:
syntax Sum | S
type
_⊕_ : 2-ary | l30
term
inl : α -> α ⊕ β
inr : β -> α ⊕ β
case : α ⊕ β α.γ β.γ -> γ
theory
(lβ) a : α f : α.γ g : β.γ |> case (inl(a), x.f[x], y.g[y]) = f[a]
(rβ) b : β f... | 21.382979 | 91 | 0.527363 |
2344862cd0eed24a7ff2328669aa008c40600243 | 346 | agda | Agda | test/Succeed/Issue152.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue152.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue152.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
module Issue152 where
data ℕ : Set where
zero : ℕ
suc : ℕ → ℕ
{-# BUILTIN NATURAL ℕ #-}
f : ℕ → ℕ
f 0 with zero
f 0 | n = n
f 1 with zero
f 1 | n = n
f n = n
g : ℕ → ℕ
g 0 with zero
g zero | n = n
g 1 with zero
g (suc zero) | n = n
g n = n
h : ℕ → ℕ
h zero with zero
h 0 | n = n
h (suc zero) with ... | 11.16129 | 28 | 0.511561 |
395c53ec9815250dd53eae9c732124bbe7ea2400 | 396 | agda | Agda | examples/instance-arguments/05-equality-std2.agda | asr/agda-kanso | aa10ae6a29dc79964fe9dec2de07b9df28b61ed5 | [
"MIT"
] | 1 | 2019-11-27T07:26:06.000Z | 2019-11-27T07:26:06.000Z | examples/instance-arguments/05-equality-std2.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | examples/instance-arguments/05-equality-std2.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | {-# OPTIONS --universe-polymorphism #-}
-- {-# OPTIONS --verbose tc.rec:15 #-}
-- {-# OPTIONS --verbose tc.records.ifs:15 #-}
-- {-# OPTIONS --verbose tc.constr.findInScope:15 #-}
-- {-# OPTIONS --verbose tc.term.args.ifs:15 #-}
module 05-equality-std2 where
open import Relation.Binary
open import Data.Bool hiding (... | 24.75 | 53 | 0.664141 |
d0b05d7a4a3dc47a9ecd01af2f7313dc1cc9dc81 | 1,483 | agda | Agda | Cubical/Algebra/CommRing/Instances/Polynomials/UnivariatePolyFun.agda | thomas-lamiaux/cubical | 58c0b83bb0fed0dc683f3d29b1709effe51c1689 | [
"MIT"
] | null | null | null | Cubical/Algebra/CommRing/Instances/Polynomials/UnivariatePolyFun.agda | thomas-lamiaux/cubical | 58c0b83bb0fed0dc683f3d29b1709effe51c1689 | [
"MIT"
] | null | null | null | Cubical/Algebra/CommRing/Instances/Polynomials/UnivariatePolyFun.agda | thomas-lamiaux/cubical | 58c0b83bb0fed0dc683f3d29b1709effe51c1689 | [
"MIT"
] | null | null | null | {-# OPTIONS --safe --experimental-lossy-unification #-}
module Cubical.Algebra.CommRing.Instances.Polynomials.UnivariatePolyFun where
open import Cubical.Foundations.Prelude
open import Cubical.Data.Empty as ⊥
open import Cubical.Data.Nat hiding (_·_) renaming (_+_ to _+n_)
open import Cubical.Data.Nat.Order
open imp... | 35.309524 | 86 | 0.634525 |
dc639fb4abbc7f08ee0c2cc64d6a6b60c0435dd1 | 10,783 | agda | Agda | src/Categories/NaturalTransformation/NaturalIsomorphism/Monoidal/Braided.agda | o1lo01ol1o/agda-categories | 5fc007768264a270b8ff319570225986773da601 | [
"MIT"
] | null | null | null | src/Categories/NaturalTransformation/NaturalIsomorphism/Monoidal/Braided.agda | o1lo01ol1o/agda-categories | 5fc007768264a270b8ff319570225986773da601 | [
"MIT"
] | null | null | null | src/Categories/NaturalTransformation/NaturalIsomorphism/Monoidal/Braided.agda | o1lo01ol1o/agda-categories | 5fc007768264a270b8ff319570225986773da601 | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
-- Monoidal natural isomorphisms between lax and strong braided
-- monoidal functors.
--
-- NOTE. Braided monoidal natural isomorphisms are really just
-- monoidal natural isomorphisms that happen to go between braided
-- monoidal functors. No additional conditions are necessary.
--... | 32.577039 | 80 | 0.58008 |
c5856fe59e30c160bdfd614aa8657a2145049de3 | 2,656 | agda | Agda | src/SecondOrder/VRelMonMorphism.agda | cilinder/formaltt | 0a9d25e6e3965913d9b49a47c88cdfb94b55ffeb | [
"MIT"
] | 21 | 2021-02-16T14:07:06.000Z | 2021-11-19T15:50:08.000Z | src/SecondOrder/VRelMonMorphism.agda | cilinder/formaltt | 0a9d25e6e3965913d9b49a47c88cdfb94b55ffeb | [
"MIT"
] | 1 | 2021-04-30T14:18:25.000Z | 2021-05-14T16:15:17.000Z | src/SecondOrder/VRelMonMorphism.agda | cilinder/formaltt | 0a9d25e6e3965913d9b49a47c88cdfb94b55ffeb | [
"MIT"
] | 6 | 2021-02-16T13:43:07.000Z | 2021-05-24T02:51:43.000Z | open import Agda.Primitive using (lzero; lsuc; _⊔_)
open import Relation.Binary.PropositionalEquality using (_≡_; refl; sym; trans; cong; cong₂; subst; setoid)
open import Data.Product using (_×_; Σ; _,_; proj₁; proj₂; zip; map; <_,_>; swap)
import Function.Equality
open import Relation.Binary using (Setoid)
import Rel... | 38.492754 | 126 | 0.649849 |
dc05e6fd4b05274954c479ced93162f8b2818054 | 2,262 | agda | Agda | examples/AIM6/Path/Span.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | examples/AIM6/Path/Span.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | examples/AIM6/Path/Span.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
module Span where
open import Prelude
open import Star
open import Modal
data SpanView {A : Set}{R : Rel A}(p : {a b : A} -> R a b -> Bool) :
EdgePred (Star R) where
oneFalse : {a b c d : A}(xs : Star R a b)(pxs : All (\x -> IsTrue (p x)) xs)
(x : R b c)(¬px : IsFalse (p x))(ys : Star R ... | 39 | 78 | 0.486737 |
c5fe48d8d2c76906974f390c40b8e666838025bb | 593 | agda | Agda | test/fail/Issue512.agda | asr/agda-kanso | aa10ae6a29dc79964fe9dec2de07b9df28b61ed5 | [
"MIT"
] | 1 | 2019-11-27T07:26:06.000Z | 2019-11-27T07:26:06.000Z | test/fail/Issue512.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | test/fail/Issue512.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null |
module Issue512 where
postulate
Level : Set
{-# BUILTIN LEVEL Level #-}
data _≡_ {a} {A : Set a} (x : A) : A → Set a where
refl : x ≡ x
{-# BUILTIN EQUALITY _≡_ #-}
{-# BUILTIN REFL refl #-}
data A : Set where
a b : A
proof : a ≡ a
proof = refl
f : A → A → A
f x y rewrite proof = ? -- gave error below (no... | 18.53125 | 93 | 0.607083 |
4ae5066f215b86f79ea967bd0ee01c6a391ebb3d | 8,225 | agda | Agda | complexity-drafts/Preliminaries.agda | benhuds/Agda | 2404a6ef2688f879bda89860bb22f77664ad813e | [
"MIT"
] | 2 | 2016-04-26T20:22:22.000Z | 2019-08-08T12:27:18.000Z | complexity-drafts/Preliminaries.agda | benhuds/Agda | 2404a6ef2688f879bda89860bb22f77664ad813e | [
"MIT"
] | 1 | 2020-03-23T08:39:04.000Z | 2020-05-12T00:32:45.000Z | complexity-drafts/Preliminaries.agda | benhuds/Agda | 2404a6ef2688f879bda89860bb22f77664ad813e | [
"MIT"
] | null | null | null |
module Preliminaries where
open import Agda.Primitive using (Level) renaming (lzero to lZ; lsuc to lS; _⊔_ to lmax)
-- ----------------------------------------------------------------------
-- functions
_o_ : {A B C : Set} → (B → C) → (A → B) → A → C
g o f = \ x → g (f x)
infixr 10 _o_
-- -----------... | 26.446945 | 151 | 0.42079 |
dc864e727832d05fa81fcda58808b3c5350429c8 | 3,313 | agda | Agda | vendor/stdlib/src/Relation/Binary/Consequences.agda | isabella232/Lemmachine | 8ef786b40e4a9ab274c6103dc697dcb658cf3db3 | [
"MIT"
] | 56 | 2015-01-20T02:11:42.000Z | 2021-12-21T17:02:19.000Z | vendor/stdlib/src/Relation/Binary/Consequences.agda | larrytheliquid/Lemmachine | 8ef786b40e4a9ab274c6103dc697dcb658cf3db3 | [
"MIT"
] | 1 | 2022-03-12T12:17:51.000Z | 2022-03-12T12:17:51.000Z | vendor/stdlib/src/Relation/Binary/Consequences.agda | isabella232/Lemmachine | 8ef786b40e4a9ab274c6103dc697dcb658cf3db3 | [
"MIT"
] | 3 | 2015-07-21T16:37:58.000Z | 2022-03-12T11:54:10.000Z | ------------------------------------------------------------------------
-- Some properties imply others
------------------------------------------------------------------------
module Relation.Binary.Consequences where
open import Relation.Binary.Core hiding (refl)
open import Relation.Nullary.Core
open import Relat... | 27.380165 | 72 | 0.520374 |
1c6b9cd31933ad90cfa35ba7259e104213e20d1c | 2,721 | agda | Agda | lemmas-consistency.agda | hazelgrove/hazelnut-agda | a3640d7b0f76cdac193afd382694197729ed6d57 | [
"MIT"
] | null | null | null | lemmas-consistency.agda | hazelgrove/hazelnut-agda | a3640d7b0f76cdac193afd382694197729ed6d57 | [
"MIT"
] | null | null | null | lemmas-consistency.agda | hazelgrove/hazelnut-agda | a3640d7b0f76cdac193afd382694197729ed6d57 | [
"MIT"
] | null | null | null | open import Prelude
open import dynamics-core
module lemmas-consistency where
-- type consistency is symmetric
~sym : {t1 t2 : htyp} → t1 ~ t2 → t2 ~ t1
~sym TCRefl = TCRefl
~sym TCHole1 = TCHole2
~sym TCHole2 = TCHole1
~sym (TCArr p1 p2) = TCArr (~sym p1) (~sym p2)
~sym (TCSum p1 p2) = TCSum (~sym p1) (... | 37.273973 | 76 | 0.519294 |
df81469c4ebaf5ff47d733345f6b7d09f7d03506 | 3,862 | agda | Agda | examples/examplesPaperJFP/BasicIO.agda | agda/ooAgda | 7cc45e0148a4a508d20ed67e791544c30fecd795 | [
"MIT"
] | 23 | 2016-06-19T12:57:55.000Z | 2020-10-12T23:15:25.000Z | examples/examplesPaperJFP/BasicIO.agda | agda/ooAgda | 7cc45e0148a4a508d20ed67e791544c30fecd795 | [
"MIT"
] | null | null | null | examples/examplesPaperJFP/BasicIO.agda | agda/ooAgda | 7cc45e0148a4a508d20ed67e791544c30fecd795 | [
"MIT"
] | 2 | 2018-09-01T15:02:37.000Z | 2022-03-12T11:41:00.000Z | module examplesPaperJFP.BasicIO where
open import Data.Maybe hiding ( _>>=_ )
open import Data.Sum renaming (inj₁ to left; inj₂ to right; [_,_]′ to either)
open import Function
open import examplesPaperJFP.NativeIOSafe
open import examplesPaperJFP.triangleRightOperator
module _ where -- for indentation
record IOI... | 30.171875 | 82 | 0.503884 |
39e3e950bcf0c59bb227ee8f23da272657f64490 | 245 | agda | Agda | test/Fail/Issue5238.agda | cagix/agda | cc026a6a97a3e517bb94bafa9d49233b067c7559 | [
"BSD-2-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/Issue5238.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/Issue5238.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | {-# OPTIONS --rewriting #-}
open import Agda.Builtin.Equality
open import Agda.Builtin.Equality.Rewrite
data ⊥ : Set where
postulate
T : Set
t0 : T
t1 : T
postulate
foo : ⊥ → t0 ≡ t1
{-# REWRITE foo #-}
test : t0 ≡ t1
test = refl
| 12.894737 | 41 | 0.628571 |
203aa9469741fbdf41b86000b9e5e81d000cef59 | 8,436 | agda | Agda | theorems/homotopy/Cogroup.agda | AntoineAllioux/HoTT-Agda | 1037d82edcf29b620677a311dcfd4fc2ade2faa6 | [
"MIT"
] | 294 | 2015-01-09T16:23:23.000Z | 2022-03-20T13:54:45.000Z | theorems/homotopy/Cogroup.agda | AntoineAllioux/HoTT-Agda | 1037d82edcf29b620677a311dcfd4fc2ade2faa6 | [
"MIT"
] | 31 | 2015-03-05T20:09:00.000Z | 2021-10-03T19:15:25.000Z | theorems/homotopy/Cogroup.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 homotopy.CoHSpace
module homotopy.Cogroup where
record CogroupStructure {i} (X : Ptd i) : Type i where
field
co-h-struct : CoHSpaceStructure X
⊙inv : X ⊙→ X
open CoHSpaceStructure co-h-struct public
inv : de⊙ X → de⊙ X
inv = fst ⊙i... | 40.363636 | 116 | 0.411095 |
102791ab74cb8a13c7e30b0781353639f6bb5391 | 31,541 | agda | Agda | Cubical/Homotopy/BlakersMassey.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 1 | 2022-02-05T01:25:02.000Z | 2022-02-05T01:25:02.000Z | Cubical/Homotopy/BlakersMassey.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | null | null | null | Cubical/Homotopy/BlakersMassey.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | null | null | null | {-
A Cubical proof of Blakers-Massey Theorem (KANG Rongji, Oct. 2021)
Based on the previous type-theoretic proof described in
Kuen-Bang Hou (Favonia), Eric Finster, Dan Licata, Peter LeFanu Lumsdaine,
"A Mechanization of the Blakers–Massey Connectivity Theorem in Homotopy Type Theory"
(https://arxiv.org/abs/160... | 38.939506 | 120 | 0.502394 |
4ad3f66ced588ee98c6d0e9aafe26563ffd4df87 | 925 | agda | Agda | theorems/homotopy/PathSetIsInitalCover.agda | mikeshulman/HoTT-Agda | e7d663b63d89f380ab772ecb8d51c38c26952dbb | [
"MIT"
] | null | null | null | theorems/homotopy/PathSetIsInitalCover.agda | mikeshulman/HoTT-Agda | e7d663b63d89f380ab772ecb8d51c38c26952dbb | [
"MIT"
] | null | null | null | theorems/homotopy/PathSetIsInitalCover.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
module homotopy.PathSetIsInitalCover {i} (X : Ptd i)
-- and an arbitrary covering
{k} (⊙cov : ⊙Cover X k) where
open Cover
private
univ-cover = path-set-cover X
module ⊙cov = ⊙Cover ⊙cov
-- Weak initiality by transport.
quotient-cover... | 25.694444 | 66 | 0.60973 |
df9190f8cd5e848276bd51406937d4cdb602de8c | 7,369 | agda | Agda | core/lib/groups/TensorProduct.agda | AntoineAllioux/HoTT-Agda | 1037d82edcf29b620677a311dcfd4fc2ade2faa6 | [
"MIT"
] | 294 | 2015-01-09T16:23:23.000Z | 2022-03-20T13:54:45.000Z | core/lib/groups/TensorProduct.agda | AntoineAllioux/HoTT-Agda | 1037d82edcf29b620677a311dcfd4fc2ade2faa6 | [
"MIT"
] | 31 | 2015-03-05T20:09:00.000Z | 2021-10-03T19:15:25.000Z | core/lib/groups/TensorProduct.agda | AntoineAllioux/HoTT-Agda | 1037d82edcf29b620677a311dcfd4fc2ade2faa6 | [
"MIT"
] | 50 | 2015-01-10T01:48:08.000Z | 2022-02-14T03:03:25.000Z | {-# OPTIONS --without-K --rewriting #-}
open import lib.Basics
open import lib.types.Group
open import lib.types.List
open import lib.types.Pi
open import lib.types.Sigma
open import lib.types.Word
open import lib.groups.Homomorphism
open import lib.groups.GeneratedGroup
open import lib.groups.GeneratedAbelianGroup
op... | 31.224576 | 85 | 0.56032 |
dfb94dd87badab311fd37147053d85fde37ab24c | 384 | agda | Agda | test/Succeed/NonConjectures/Foo.agda | asr/apia | a66c5ddca2ab470539fd68c42c4fbd45f720d682 | [
"MIT"
] | 10 | 2015-09-03T20:54:16.000Z | 2019-12-03T13:44:25.000Z | test/Succeed/NonConjectures/Foo.agda | asr/apia | a66c5ddca2ab470539fd68c42c4fbd45f720d682 | [
"MIT"
] | 121 | 2015-01-25T13:22:12.000Z | 2018-04-22T06:01:44.000Z | test/Succeed/NonConjectures/Foo.agda | asr/apia | a66c5ddca2ab470539fd68c42c4fbd45f720d682 | [
"MIT"
] | 4 | 2016-05-10T23:06:19.000Z | 2016-08-03T03:54:55.000Z | ------------------------------------------------------------------------------
-- Foo module
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorphism #-}
{-# OPTIONS --with... | 29.538462 | 78 | 0.307292 |
dcb120169094163c31b226995e21346bf823fae2 | 12,801 | agda | Agda | src/FOmegaInt/Undecidable/SK.agda | Blaisorblade/f-omega-int-agda | ae20dac2a5e0c18dff2afda4c19954e24d73a24f | [
"MIT"
] | 12 | 2017-06-13T16:05:35.000Z | 2021-09-27T05:53:06.000Z | src/FOmegaInt/Undecidable/SK.agda | Blaisorblade/f-omega-int-agda | ae20dac2a5e0c18dff2afda4c19954e24d73a24f | [
"MIT"
] | 1 | 2021-05-14T08:09:40.000Z | 2021-05-14T08:54:39.000Z | src/FOmegaInt/Undecidable/SK.agda | Blaisorblade/f-omega-int-agda | ae20dac2a5e0c18dff2afda4c19954e24d73a24f | [
"MIT"
] | 2 | 2021-05-13T22:29:48.000Z | 2021-05-14T10:25:05.000Z | ------------------------------------------------------------------------
-- The untyped SKI combinator calculus
------------------------------------------------------------------------
{-# OPTIONS --safe --without-K #-}
module FOmegaInt.Undecidable.SK where
open import Data.Bool
open import Data.Product as Prod usin... | 35.857143 | 81 | 0.470588 |
3995c525e88e6de9e3abb8acffe3a2fba707a220 | 404 | agda | Agda | Cubical/HITs/Truncation/Base.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | Cubical/HITs/Truncation/Base.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | Cubical/HITs/Truncation/Base.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --safe #-}
module Cubical.HITs.Truncation.Base where
open import Cubical.Data.NatMinusOne
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.HLevels
open import Cubical.HITs.Sn
data ∥_∥_ {ℓ} (A : Type ℓ) (n : ℕ₋₁) : Type ℓ where
∣_∣ : A → ∥ A ∥ n
hub : (f : S (1+ n) → ... | 28.857143 | 63 | 0.596535 |
18c46be68d78cbf01303c446f74c94f8832c8148 | 384 | agda | Agda | Cubical/Data/NatMinusTwo/Properties.agda | borsiemir/cubical | cefeb3669ffdaea7b88ae0e9dd258378418819ca | [
"MIT"
] | 1 | 2020-03-23T23:52:11.000Z | 2020-03-23T23:52:11.000Z | Cubical/Data/NatMinusTwo/Properties.agda | borsiemir/cubical | cefeb3669ffdaea7b88ae0e9dd258378418819ca | [
"MIT"
] | null | null | null | Cubical/Data/NatMinusTwo/Properties.agda | borsiemir/cubical | cefeb3669ffdaea7b88ae0e9dd258378418819ca | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --no-exact-split --safe #-}
module Cubical.Data.NatMinusTwo.Properties where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Isomorphism
open import Cubical.Data.Nat
open import Cubical.Data.NatMinusOne using (ℕ₋₁)
open import Cubical.Data.NatMinusTwo.Base
-2+Path : ℕ ≡ ℕ... | 32 | 60 | 0.747396 |
2361a0c96969340cb498a86dbc385c823a478277 | 316 | agda | Agda | src/SizedIO/ConsoleObject.agda | agda/ooAgda | 7cc45e0148a4a508d20ed67e791544c30fecd795 | [
"MIT"
] | 23 | 2016-06-19T12:57:55.000Z | 2020-10-12T23:15:25.000Z | src/SizedIO/ConsoleObject.agda | agda/ooAgda | 7cc45e0148a4a508d20ed67e791544c30fecd795 | [
"MIT"
] | null | null | null | src/SizedIO/ConsoleObject.agda | agda/ooAgda | 7cc45e0148a4a508d20ed67e791544c30fecd795 | [
"MIT"
] | 2 | 2018-09-01T15:02:37.000Z | 2022-03-12T11:41:00.000Z | module SizedIO.ConsoleObject where
open import Size
open import SizedIO.Console
open import SizedIO.Object
open import SizedIO.IOObject
-- A console object is an IO object for the IO interface of console
ConsoleObject : (i : Size) → (iface : Interface) → Set
ConsoleObject i iface = IOObject consoleI iface i
| 22.571429 | 68 | 0.775316 |
cb987957c6a6f310a18aebe2450a5bf498d659cc | 28,991 | agda | Agda | Cubical/Data/Int/Properties.agda | mchristianl/cubical | cc6ad25d5ffbe4f20ea7020474f266d24b97caa0 | [
"MIT"
] | null | null | null | Cubical/Data/Int/Properties.agda | mchristianl/cubical | cc6ad25d5ffbe4f20ea7020474f266d24b97caa0 | [
"MIT"
] | null | null | null | Cubical/Data/Int/Properties.agda | mchristianl/cubical | cc6ad25d5ffbe4f20ea7020474f266d24b97caa0 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --no-import-sorts --safe #-}
{-
This file defines
sucPred : ∀ (i : Int) → sucInt (predInt i) ≡ i
predSuc : ∀ (i : Int) → predInt (sucInt i) ≡ i
discreteInt : discrete Int
isSetInt : isSet Int
addition of Int is defined _+_ : Int → Int → Int
as well as its commutativity and associativity
+-co... | 41.238976 | 196 | 0.522921 |
3914361e87d13bd7aa5e1f021ac1d752e92f4007 | 7,242 | agda | Agda | StructurallyRecursiveDescentParsing/Simplified/Semantics.agda | yurrriq/parser-combinators | b396d35cc2cb7e8aea50b982429ee385f001aa88 | [
"MIT"
] | 7 | 2016-12-13T05:23:14.000Z | 2021-06-22T05:35:31.000Z | StructurallyRecursiveDescentParsing/Simplified/Semantics.agda | yurrriq/parser-combinators | b396d35cc2cb7e8aea50b982429ee385f001aa88 | [
"MIT"
] | 1 | 2018-01-22T22:21:41.000Z | 2018-01-24T16:39:37.000Z | StructurallyRecursiveDescentParsing/Simplified/Semantics.agda | yurrriq/parser-combinators | b396d35cc2cb7e8aea50b982429ee385f001aa88 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- Semantics of the simplified parsers
------------------------------------------------------------------------
module StructurallyRecursiveDescentParsing.Simplified.Semantics where
open import Algebra
open import Coinduction
open import Data.Bo... | 44.158537 | 100 | 0.443386 |
18bcf3edd1216e277401e7a87d224ba333d98f8d | 14,744 | agda | Agda | Cubical/Algebra/CommRing/Ideal.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 1 | 2022-03-05T00:29:41.000Z | 2022-03-05T00:29:41.000Z | Cubical/Algebra/CommRing/Ideal.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | null | null | null | Cubical/Algebra/CommRing/Ideal.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | null | null | null | {-
This is mostly for convenience, when working with ideals
(which are defined for general rings) in a commutative ring.
-}
{-# OPTIONS --safe #-}
module Cubical.Algebra.CommRing.Ideal where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Function
open import Cubical.Foundations.HLevels
ope... | 44.409639 | 100 | 0.46134 |
1c2557630e16713cfd25cafd018df3bd630d35bd | 2,847 | agda | Agda | test/interaction/Highlighting.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1 | 2021-06-14T11:08:59.000Z | 2021-06-14T11:08:59.000Z | test/interaction/Highlighting.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1 | 2020-05-29T19:45:38.000Z | 2020-05-29T19:45:38.000Z | test/interaction/Highlighting.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1 | 2021-06-14T11:07:38.000Z | 2021-06-14T11:07:38.000Z | module Highlighting where
Set-one : Set₂
Set-one = Set₁
record R (A : Set) : Set-one where
constructor con
field X : Set
F : Set → Set → Set
F A B = B
field P : F A X → Set
-- highlighting of non-terminating definition
Q : F A X → Set
Q = Q
postulate P : _
open import Highlighting.M using (ℕ) re... | 20.049296 | 83 | 0.60274 |
182592552899978b9473244fda99c811a34f13de | 800 | agda | Agda | test/Succeed/RewriteExt.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/RewriteExt.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/RewriteExt.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | {-# OPTIONS --rewriting #-}
-- Let us assume that extensionality of functions cannot be proved
-- inside "plain" Agda. In that case the code below shows that the
-- REWRITE functionality is not a conservative extension, even if we
-- only use propositional equality as the rewriting relation, and do
-- not use any post... | 22.222222 | 68 | 0.58 |
dfac09952cde29acbeeda4165ead2fa1142bab6d | 1,746 | agda | Agda | src/Categories/Category/Construction/LT-Models.agda | yourboynico/agda-categories | 6a087c592dbe58fc4bd9d02e1be9b94a9e138aca | [
"MIT"
] | 279 | 2019-06-01T14:36:40.000Z | 2022-03-22T00:40:14.000Z | src/Categories/Category/Construction/LT-Models.agda | seanpm2001/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | 236 | 2019-06-01T14:53:54.000Z | 2022-03-28T14:31:43.000Z | src/Categories/Category/Construction/LT-Models.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.Category.Construction.LT-Models where
-- Given a fixed Lawvere Theory LT and a fixed category C,
-- the Functors [LT , C] form a category.
-- The proof is basically the same as that of Functors.
open import Level
open import Categories.Category.Core using (Catego... | 37.956522 | 113 | 0.67984 |
0ed9f8f71aa031d23e01cf143fe8f6c055fa21d0 | 700 | agda | Agda | test/fail/Test2.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | 1 | 2021-06-30T00:17:55.000Z | 2021-06-30T00:17:55.000Z | test/fail/Test2.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | null | null | null | test/fail/Test2.agda | danbornside/HoTT-Agda | 1695a7f3dc60177457855ae846bbd86fcd96983e | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K #-}
open import lib.Base
module test.fail.Test2 where
module _ where
private
data #I : Type₀ where
#zero : #I
#one : #I
I : Type₀
I = #I
zero : I
zero = #zero
one : I
one = #one
postulate
seg : zero == one
I-elim : ∀ {i} {P : I → Type i} (zero* : P ... | 16.666667 | 65 | 0.518571 |
4ae6881b739baafb17439590a32112ce22cc232e | 439 | agda | Agda | test/asset/agda-stdlib-1.0/Data/Plus.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Data/Plus.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Data/Plus.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Transitive closures
--
-- This module is DEPRECATED. Please use the
-- Relation.Binary.Construct.Closure.Transitive module directly.
------------------------------------------------------------------------
{-# O... | 29.266667 | 72 | 0.505695 |
d0b7c977bc49c33c943f6c86e87586eb5133e9c2 | 1,969 | agda | Agda | src/prototyping/term/examples/Nested.agda | larrytheliquid/agda | 477c8c37f948e6038b773409358fd8f38395f827 | [
"MIT"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | src/prototyping/term/examples/Nested.agda | masondesu/agda | 70c8a575c46f6a568c7518150a1a64fcd03aa437 | [
"MIT"
] | null | null | null | src/prototyping/term/examples/Nested.agda | masondesu/agda | 70c8a575c46f6a568c7518150a1a64fcd03aa437 | [
"MIT"
] | 1 | 2022-03-12T11:35:18.000Z | 2022-03-12T11:35:18.000Z | {-# OPTIONS --type-in-type #-}
module Nested where
open import Prelude
record Sigma1 (A : Set)(B : A -> Set) : Set
record Sigma1 A B where
constructor pair
field
fst : A
snd : B fst
open Sigma1
record Sigma (A : Set)(B : A -> Set) : Set
record Sigma A B where
constructor inn
field
out : Sigma1 A... | 28.955882 | 72 | 0.439309 |
cbbff044d27e518a5bb6861e7bcb56cf776b3706 | 9,294 | agda | Agda | agda/book/Programming_Language_Foundations_in_Agda/x05-747Isomorphism.agda | haroldcarr/learn-haskell-coq-ml-etc | 3dc7abca7ad868316bb08f31c77fbba0d3910225 | [
"Unlicense"
] | 36 | 2015-01-29T14:37:15.000Z | 2021-07-30T06:55:03.000Z | agda/book/Programming_Language_Foundations_in_Agda/x05-747Isomorphism.agda | haroldcarr/learn-haskell-coq-ml-etc | 3dc7abca7ad868316bb08f31c77fbba0d3910225 | [
"Unlicense"
] | null | null | null | agda/book/Programming_Language_Foundations_in_Agda/x05-747Isomorphism.agda | haroldcarr/learn-haskell-coq-ml-etc | 3dc7abca7ad868316bb08f31c77fbba0d3910225 | [
"Unlicense"
] | 8 | 2015-04-13T21:40:15.000Z | 2021-09-21T15:58:10.000Z | module 747Isomorphism where
-- Library
import Relation.Binary.PropositionalEquality as Eq
open Eq using (_≡_; refl; cong; cong-app; sym) -- added last
open Eq.≡-Reasoning
open import Data.Nat using (ℕ; zero; suc; _+_)
open import Data.Nat.Properties using (+-comm; +-suc; +-identityʳ) -- added last
-- Function compos... | 22.891626 | 87 | 0.561222 |
1c3cacb01ebe3bf43f85d17a1489ceae3d9a62b1 | 2,689 | agda | Agda | src/Pf/Ip.agda | mietek/formal-logic | 2dd761bfa96ccda089888e8defa6814776fa2922 | [
"X11"
] | 26 | 2015-08-31T09:49:52.000Z | 2021-11-13T12:37:44.000Z | src/Pf/Ip.agda | mietek/formal-logic | 2dd761bfa96ccda089888e8defa6814776fa2922 | [
"X11"
] | null | null | null | src/Pf/Ip.agda | mietek/formal-logic | 2dd761bfa96ccda089888e8defa6814776fa2922 | [
"X11"
] | null | null | null | -- Intuitionistic propositional logic, PHOAS approach, final encoding
module Pf.Ip where
-- Types
infixl 2 _&&_
infixl 1 _||_
infixr 0 _=>_
data Ty : Set where
UNIT : Ty
_=>_ : Ty -> Ty -> Ty
_&&_ : Ty -> Ty -> Ty
_||_ : Ty -> Ty -> Ty
FALSE : Ty
infixr 0 _<=>_
_<=>_ : Ty -> T... | 23.382609 | 116 | 0.462626 |
2360614957271cf794edfcef3809bcbca96c8e77 | 1,501 | agda | Agda | test/Succeed/FlexibleFunArity.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/FlexibleFunArity.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/FlexibleFunArity.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- {-# OPTIONS -v tc.lhs:40 #-}
module FlexibleFunArity where
open import Common.Equality
open import Common.Prelude
Case : {A : Set} → Maybe A → Set → Set → Set
Case nothing B C = B
Case (just _) B C = C
sample : {A : Set} (m : Maybe A) → Case m Bool (Maybe A → Bool)
sample (just a) (just b) = true
sample (just a)... | 14.861386 | 63 | 0.62958 |
4a7750658ab26edf112dd926f681e5e30ed0f828 | 1,589 | agda | Agda | Setoids/Orders/Partial/Definition.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 4 | 2019-08-08T12:44:19.000Z | 2022-01-28T06:04:15.000Z | Setoids/Orders/Partial/Definition.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 14 | 2019-01-06T21:11:59.000Z | 2020-04-11T11:03:39.000Z | Setoids/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 Sets.EquivalenceRelations
open import LogicalFormulae
open import Orders.Total.Definition
open import Orders.Partial.Definition
open import Setoids.Setoids
open import Functions.Definition
open import Agda.Primitive using (Level; lzero; lsuc; _⊔_)
module... | 49.65625 | 142 | 0.660164 |
20ac5003c7b2da29153235a8dd73c7d08b6f39ca | 44 | agda | Agda | test/Succeed/Imports/A.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Imports/A.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Imports/A.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
module Imports.A where
postulate A : Set
| 7.333333 | 22 | 0.727273 |
1cce8fbcfcd7886656ecbfaeb3542f4d79abdaf8 | 11,560 | agda | Agda | src/Container/List.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | 3 | 2020-05-21T22:58:50.000Z | 2021-09-02T17:18:15.000Z | src/Container/List.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | null | null | null | src/Container/List.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- The list container
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
open import Equality
module Container.List
{c⁺} (eq : ∀ {a p} → Equality-with-J a p c⁺) where
open Derived-defi... | 35.900621 | 135 | 0.455882 |
0e1f9dfb331e8140010a7fa11b30235421adef7b | 1,316 | agda | Agda | src/fot/LTC-PCF/Program/GCD/Partial/GreatestAnyCommonDivisor.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 11 | 2015-09-03T20:53:42.000Z | 2021-09-12T16:09:54.000Z | src/fot/LTC-PCF/Program/GCD/Partial/GreatestAnyCommonDivisor.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 2 | 2016-10-12T17:28:16.000Z | 2017-01-01T14:34:26.000Z | src/fot/LTC-PCF/Program/GCD/Partial/GreatestAnyCommonDivisor.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 3 | 2016-09-19T14:18:30.000Z | 2018-03-14T08:50:00.000Z | ---------------------------------------------------------------------------
-- The gcd is greatest that any common divisor
---------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorp... | 39.878788 | 77 | 0.515198 |
dcc5fcdaec5f5250c89050cb93ae6ea9c3b95453 | 2,225 | agda | Agda | src/Tactic/Reflection/Free.agda | L-TChen/agda-prelude | 158d299b1b365e186f00d8ef5b8c6844235ee267 | [
"MIT"
] | 111 | 2015-01-05T11:28:15.000Z | 2022-02-12T23:29:26.000Z | src/Tactic/Reflection/Free.agda | L-TChen/agda-prelude | 158d299b1b365e186f00d8ef5b8c6844235ee267 | [
"MIT"
] | 59 | 2016-02-09T05:36:44.000Z | 2022-01-14T07:32:36.000Z | src/Tactic/Reflection/Free.agda | L-TChen/agda-prelude | 158d299b1b365e186f00d8ef5b8c6844235ee267 | [
"MIT"
] | 24 | 2015-03-12T18:03:45.000Z | 2021-04-22T06:10:41.000Z |
module Tactic.Reflection.Free where
open import Prelude
open import Prelude.Variables
open import Builtin.Reflection
open import Tactic.Reflection.DeBruijn
VarSet = List Nat -- ordered
private
_∪_ : VarSet → VarSet → VarSet
[] ∪ ys = ys
xs ∪ [] = xs
(x ∷ xs) ∪ (y ∷ ys) =
case-cmp compare x y... | 26.807229 | 69 | 0.603596 |
df3bb1cd5118a062009d37a02c874f119fdd5ae2 | 2,761 | agda | Agda | src/Impure/STLCRef/Eval.agda | metaborg/ts.agda | 7fe638b87de26df47b6437f5ab0a8b955384958d | [
"MIT"
] | null | null | null | src/Impure/STLCRef/Eval.agda | metaborg/ts.agda | 7fe638b87de26df47b6437f5ab0a8b955384958d | [
"MIT"
] | null | null | null | src/Impure/STLCRef/Eval.agda | metaborg/ts.agda | 7fe638b87de26df47b6437f5ab0a8b955384958d | [
"MIT"
] | null | null | null | module Impure.STLCRef.Eval where
open import Prelude
open import Data.Product
open import Data.List
open import Data.List.Reverse
open import Data.Nat
open import Data.Fin hiding (_<_)
open import Extensions.List as L
open import Impure.STLCRef.Syntax
open import Impure.STLCRef.Welltyped
_!!_ : ∀ {n i} → (μ : Store... | 28.463918 | 64 | 0.300254 |
1817b7cfa784dbe71d462476fb3d99089fa681db | 2,115 | agda | Agda | src/Tactic/Reflection/Free.agda | t-more/agda-prelude | da4fca7744d317b8843f2bc80a923972f65548d3 | [
"MIT"
] | null | null | null | src/Tactic/Reflection/Free.agda | t-more/agda-prelude | da4fca7744d317b8843f2bc80a923972f65548d3 | [
"MIT"
] | null | null | null | src/Tactic/Reflection/Free.agda | t-more/agda-prelude | da4fca7744d317b8843f2bc80a923972f65548d3 | [
"MIT"
] | null | null | null |
module Tactic.Reflection.Free where
open import Prelude
open import Prelude.Variables
open import Builtin.Reflection
open import Tactic.Reflection.DeBruijn
VarSet = List Nat -- ordered
private
_∪_ : VarSet → VarSet → VarSet
[] ∪ ys = ys
xs ∪ [] = xs
(x ∷ xs) ∪ (y ∷ ys) =
case-cmp compare x y... | 26.4375 | 69 | 0.609456 |
23e52eace7bc4a5a21fb4859fd5931bdddb59d6f | 4,734 | agda | Agda | Cubical/Relation/Binary/Base.agda | dan-iel-lee/cubical | fd8059ec3eed03f8280b4233753d00ad123ffce8 | [
"MIT"
] | null | null | null | Cubical/Relation/Binary/Base.agda | dan-iel-lee/cubical | fd8059ec3eed03f8280b4233753d00ad123ffce8 | [
"MIT"
] | null | null | null | Cubical/Relation/Binary/Base.agda | dan-iel-lee/cubical | fd8059ec3eed03f8280b4233753d00ad123ffce8 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Relation.Binary.Base where
open import Cubical.Core.Everything
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Isomorphism
open import Cubical.Foundations.Equiv
open import Cubical.Foundat... | 33.814286 | 106 | 0.55112 |
df46b10637ea05aaea3039714179a9a28d7cc912 | 1,084 | agda | Agda | test/Succeed/ImproveInertRHS.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/ImproveInertRHS.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/ImproveInertRHS.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
data Nat : Set where
zero : Nat
suc : Nat → Nat
data Id (A : Set) : Set where
mkId : A → Id A
data Monad (M : Set → Set) : Set where
postulate
return : ∀ {M} {{Mon : Monad M}} {A} → A → M A
_>>=_ : ∀ {M} {{Mon : Monad M}} {A B} → M A → (A → M B) → M B
State : (S A : Set) → Set
instance
MonadSta... | 21.68 | 64 | 0.551661 |
0efc88077473e2e573a86d9ded19a3b0b02297a0 | 321 | agda | Agda | src/data/lib/prim/Agda/Builtin/Cubical/Sub.agda | bennn/agda | f77b563d328513138d6c88bf0a3e350a9b91f8ed | [
"BSD-3-Clause"
] | null | null | null | src/data/lib/prim/Agda/Builtin/Cubical/Sub.agda | bennn/agda | f77b563d328513138d6c88bf0a3e350a9b91f8ed | [
"BSD-3-Clause"
] | null | null | null | src/data/lib/prim/Agda/Builtin/Cubical/Sub.agda | bennn/agda | f77b563d328513138d6c88bf0a3e350a9b91f8ed | [
"BSD-3-Clause"
] | null | null | null | {-# OPTIONS --cubical #-}
module Agda.Builtin.Cubical.Sub where
open import Agda.Primitive.Cubical
{-# BUILTIN SUB Sub #-}
postulate
inc : ∀ {ℓ} {A : Set ℓ} {φ} (x : A) → Sub A φ (λ _ → x)
{-# BUILTIN SUBIN inc #-}
primitive
primSubOut : ∀ {ℓ} {A : Set ℓ} {φ : I} {u : Partial φ A} → Sub _ φ u → A... | 21.4 | 76 | 0.551402 |
18a83aaca243a5165f4043cd961ce5df2ec2e057 | 191 | agda | Agda | test/fail/Issue328.agda | asr/agda-kanso | aa10ae6a29dc79964fe9dec2de07b9df28b61ed5 | [
"MIT"
] | 1 | 2019-11-27T04:41:05.000Z | 2019-11-27T04:41:05.000Z | test/fail/Issue328.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | test/fail/Issue328.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | module Issue328 where
mutual
postulate D : Set
-- An internal error has occurred. Please report this as a bug.
-- Location of the error: src/full/Agda/Syntax/Concrete/Definitions.hs:398
| 21.222222 | 74 | 0.759162 |
10c98468dd70135bd5ff3ec0f98284cf4d934782 | 2,726 | agda | Agda | src/Sessions/Semantics/Expr.agda | laMudri/linear.agda | 461077552d88141ac1bba044aa55b65069c3c6c0 | [
"MIT"
] | 34 | 2019-12-20T13:57:50.000Z | 2021-02-03T15:22:33.000Z | src/Sessions/Semantics/Expr.agda | laMudri/linear.agda | 461077552d88141ac1bba044aa55b65069c3c6c0 | [
"MIT"
] | null | null | null | src/Sessions/Semantics/Expr.agda | laMudri/linear.agda | 461077552d88141ac1bba044aa55b65069c3c6c0 | [
"MIT"
] | 2 | 2020-01-30T14:15:14.000Z | 2020-05-23T00:34:36.000Z | module Sessions.Semantics.Expr where
open import Prelude
open import Data.Fin
open import Relation.Unary.PredicateTransformer hiding (_⊔_)
open import Relation.Ternary.Separation.Morphisms
open import Relation.Ternary.Separation.Monad
open import Relation.Ternary.Separation.Monad.Reader
open import Sessions.Syntax.T... | 26.72549 | 80 | 0.573734 |
10e42b4931be0c9da9c844afe1a70fbdd39e98e3 | 3,060 | agda | Agda | src/Categories/Category/Core.agda | glittershark/agda-categories | 2128fab9e8d341364cbf784bb17c547bf73891de | [
"MIT"
] | null | null | null | src/Categories/Category/Core.agda | glittershark/agda-categories | 2128fab9e8d341364cbf784bb17c547bf73891de | [
"MIT"
] | null | null | null | src/Categories/Category/Core.agda | glittershark/agda-categories | 2128fab9e8d341364cbf784bb17c547bf73891de | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
module Categories.Category.Core where
open import Level
open import Function.Base using (flip)
open import Relation.Binary using (Rel; IsEquivalence; Setoid)
import Relation.Binary.Reasoning.Setoid as SetoidR
-- Basic definition of a |Category| with a Hom setoid.
-- Also comes with... | 31.875 | 91 | 0.493791 |
4a4423f17d49d7de62a12b074cb1ecb7fd1dd595 | 3,582 | agda | Agda | src/Pi/I.agda | mietek/formal-logic | 2dd761bfa96ccda089888e8defa6814776fa2922 | [
"X11"
] | 26 | 2015-08-31T09:49:52.000Z | 2021-11-13T12:37:44.000Z | src/Pi/I.agda | mietek/formal-logic | 2dd761bfa96ccda089888e8defa6814776fa2922 | [
"X11"
] | null | null | null | src/Pi/I.agda | mietek/formal-logic | 2dd761bfa96ccda089888e8defa6814776fa2922 | [
"X11"
] | null | null | null | -- Intuitionistic logic, PHOAS approach, initial encoding
module Pi.I (Indiv : Set) where
-- Types
data Ty : Set
Pred : Set
Pred = Indiv -> Ty
infixl 2 _&&_
infixl 1 _||_
infixr 0 _=>_
data Ty where
UNIT : Ty
_=>_ : Ty -> Ty -> Ty
_&&_ : Ty -> Ty -> Ty
_||_ : Ty -> Ty -> Ty
FALSE : ... | 27.553846 | 114 | 0.434953 |
1c3088415d4db04bb71cccceabd8041240a41015 | 1,214 | agda | Agda | Syntax/List.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | Syntax/List.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | Syntax/List.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | -- Opening this module allows lists to be written using "list notation".
-- Examples:
-- [] = ∅
-- [ a ] = a ⊰ ∅
-- [ a , b ] = a ⊰ b ⊰ ∅
-- [ a , b , c ] = a ⊰ b ⊰ c ⊰ ∅
module Syntax.List where
open import Data.List
{-
infixl 1 [_
infixr 1000 _,_
infixl 100000 _]
pattern [] ... | 37.9375 | 103 | 0.397858 |
1c2f39bd02752ad5115c4e1d41b89aa2bf6c9c0b | 351 | agda | Agda | Categories/Terminal.agda | jmchapman/Relative-Monads | 74707d3538bf494f4bd30263d2f5515a84733865 | [
"MIT"
] | 21 | 2015-07-30T01:25:12.000Z | 2021-02-13T18:02:18.000Z | Categories/Terminal.agda | jmchapman/Relative-Monads | 74707d3538bf494f4bd30263d2f5515a84733865 | [
"MIT"
] | 3 | 2019-01-13T13:12:33.000Z | 2019-05-29T09:50:26.000Z | Categories/Terminal.agda | jmchapman/Relative-Monads | 74707d3538bf494f4bd30263d2f5515a84733865 | [
"MIT"
] | 1 | 2019-11-04T21:33:13.000Z | 2019-11-04T21:33:13.000Z | module Categories.Terminal where
open import Library
open import Categories
open import Categories.Sets
open Cat
record Term {a b} (C : Cat {a}{b})(T : Obj C) : Set (a ⊔ b) where
constructor term
field t : ∀{X} → Hom C X T
law : ∀{X}{f : Hom C X T} → t {X} ≅ f
OneSet : Term Sets ⊤
OneSet = record {t = λ ... | 23.4 | 65 | 0.609687 |
cb260a46db03f960209d8b5747026cbb8a41487f | 10,743 | agda | Agda | Formalization/PredicateLogic/Constructive/SequentCalculus.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | Formalization/PredicateLogic/Constructive/SequentCalculus.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | Formalization/PredicateLogic/Constructive/SequentCalculus.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical #-}
open import Formalization.PredicateLogic.Signature
module Formalization.PredicateLogic.Constructive.SequentCalculus (𝔏 : Signature) where
open Signature(𝔏)
open import Data.Option
open import Data.List
open import Data.List.Functions using (map) renaming (singleton to · ; _++_ to _∪_)
ope... | 48.61086 | 187 | 0.528344 |
1028a561a94590a76c4c79c6a7b0aa39848b5d21 | 337 | agda | Agda | agda/BHeap/Order.agda | bgbianchi/sorting | b8d428bccbdd1b13613e8f6ead6c81a8f9298399 | [
"MIT"
] | 6 | 2015-05-21T12:50:35.000Z | 2021-08-24T22:11:15.000Z | agda/BHeap/Order.agda | bgbianchi/sorting | b8d428bccbdd1b13613e8f6ead6c81a8f9298399 | [
"MIT"
] | null | null | null | agda/BHeap/Order.agda | bgbianchi/sorting | b8d428bccbdd1b13613e8f6ead6c81a8f9298399 | [
"MIT"
] | null | null | null | module BHeap.Order {A : Set}(_≤_ : A → A → Set) where
open import BHeap _≤_
open import Bound.Lower A
open import Bound.Lower.Order _≤_
open import Data.Nat
_≺_ : {b b' : Bound} → BHeap b → BHeap b' → Set
h ≺ h' = # h <′ # h'
data Acc {b' : Bound}(h' : BHeap b') : Set where
acc : (∀ {b} h → (_≺_ {b} {b'} h h') → ... | 24.071429 | 56 | 0.560831 |
d0922624bf2304a946c23bab21f382eab02e79c7 | 512 | agda | Agda | test/Fail/IdiomBracketsImplicit.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/IdiomBracketsImplicit.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/IdiomBracketsImplicit.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
module _ where
open import Agda.Builtin.Nat
postulate
F : Set → Set
pure : ∀ {A} → A → F A
_<*>_ : ∀ {A B} → F (A → B) → F A → F B
data Vec (A : Set) : Nat → Set where
[] : Vec A zero
_∷_ : ∀ {n} → A → Vec A n → Vec A (suc n)
ok : ∀ n → F Nat → F (Vec Nat n) → F (Vec Nat (suc n))
ok n a as = (| a ∷ as |... | 22.26087 | 56 | 0.462891 |
10931b7314d8dc41b12d1f56b7726357c9e8a332 | 168 | agda | Agda | test/Fail/NoTerminationCheck2.agda | pthariensflame/agda | 222c4c64b2ccf8e0fc2498492731c15e8fef32d4 | [
"BSD-3-Clause"
] | 3 | 2015-03-28T14:51:03.000Z | 2015-12-07T20:14:00.000Z | test/Fail/NoTerminationCheck2.agda | Blaisorblade/Agda | 802a28aa8374f15fe9d011ceb80317fdb1ec0949 | [
"BSD-3-Clause"
] | null | null | null | test/Fail/NoTerminationCheck2.agda | Blaisorblade/Agda | 802a28aa8374f15fe9d011ceb80317fdb1ec0949 | [
"BSD-3-Clause"
] | null | null | null | -- 2012-03-08 Andreas
module NoTerminationCheck2 where
{-# NON_TERMINATING #-}
data D : Set where
lam : (D -> D) -> D
-- error: works only for function definitions
| 18.666667 | 45 | 0.684524 |
20bffa998f42584346e9a9aea0a76f580bcac2dc | 6,593 | agda | Agda | test/Succeed/Issue906EtAl.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1 | 2021-06-14T11:08:59.000Z | 2021-06-14T11:08:59.000Z | test/Succeed/Issue906EtAl.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1 | 2015-09-15T15:49:15.000Z | 2015-09-15T15:49:15.000Z | test/Succeed/Issue906EtAl.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1 | 2015-09-15T14:36:15.000Z | 2015-09-15T14:36:15.000Z | -- Andreas, 2020-02-06, issue #906, and #942 #2068 #3136 #3431 #4391 #4418
--
-- Termination checker now tries to reduce calls away
-- using non-recursive clauses.
--
-- This fixes the problem that for dependent copattern definitions
-- the earlier, non-recursive clauses get into non-guarded positions
-- in later claus... | 22.892361 | 101 | 0.559381 |
cba18ad0c2195c0a1b7fa3e0d38c62844e91fa93 | 248 | agda | Agda | cohesion/david_jaz_261/Axiom/C1.agda | glangmead/formalization | 497e720a1ddaa2ec713c060f999f4b3ee2fe5e8a | [
"CC0-1.0"
] | 6 | 2021-10-06T17:39:22.000Z | 2022-02-13T05:51:12.000Z | cohesion/david_jaz_261/Axiom/C1.agda | glangmead/formalization | 497e720a1ddaa2ec713c060f999f4b3ee2fe5e8a | [
"CC0-1.0"
] | null | null | null | cohesion/david_jaz_261/Axiom/C1.agda | glangmead/formalization | 497e720a1ddaa2ec713c060f999f4b3ee2fe5e8a | [
"CC0-1.0"
] | null | null | null | {-# OPTIONS --without-K --rewriting #-}
open import Basics
open import lib.Basics
open import Flat
module Axiom.C1 {@♭ i j : ULevel} (@♭ I : Type i) (@♭ R : I → Type j) where
open import Axiom.C0 I R
postulate C1 : (index : I) → R index
| 22.545455 | 75 | 0.620968 |
0e3e8265200a5b4def54f58a7667f0a8c7078c3d | 7,106 | agda | Agda | src/LinearLogic.agda | wenkokke/msla2014 | b880cf25ed8e81b9a965ea9aad18377008d68a9f | [
"MIT"
] | 5 | 2018-11-17T23:04:39.000Z | 2020-10-29T09:07:45.000Z | src/LinearLogic.agda | wenkokke/msla2014 | b880cf25ed8e81b9a965ea9aad18377008d68a9f | [
"MIT"
] | null | null | null | src/LinearLogic.agda | wenkokke/msla2014 | b880cf25ed8e81b9a965ea9aad18377008d68a9f | [
"MIT"
] | null | null | null | open import Function using (case_of_; _∘_)
open import Data.List using (List; _++_; map) renaming (_∷_ to _,_; _∷ʳ_ to _,′_; [] to ∅)
open import Data.List.Properties using (map-++-commute)
open import Data.Product using () renaming (_×_ to _x'_)
open import Relation.Binary.PropositionalEquality as PropEq using (_≡_; r... | 33.205607 | 93 | 0.40121 |
c5a4983c8a50f4eb6104aab757e103b74f2a6539 | 10,863 | agda | Agda | Cubical/HITs/PropositionalTruncation/Properties.agda | ryanorendorff/cubical | c67854d2e11aafa5677e25a09087e176fafd3e43 | [
"MIT"
] | 1 | 2020-03-23T23:52:11.000Z | 2020-03-23T23:52:11.000Z | Cubical/HITs/PropositionalTruncation/Properties.agda | ryanorendorff/cubical | c67854d2e11aafa5677e25a09087e176fafd3e43 | [
"MIT"
] | null | null | null | Cubical/HITs/PropositionalTruncation/Properties.agda | ryanorendorff/cubical | c67854d2e11aafa5677e25a09087e176fafd3e43 | [
"MIT"
] | null | null | null | {-
This file contains:
- Eliminator for propositional truncation
-}
{-# OPTIONS --cubical --safe #-}
module Cubical.HITs.PropositionalTruncation.Properties where
open import Cubical.Core.Everything
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.Functio... | 31.486957 | 81 | 0.499862 |
2386f724726d26053dad8dcedd8326775b6f25d4 | 659 | agda | Agda | extra/extra/DecidableFixed.agda | krzygorz/plfa.github.io | 10a3203624f2ea937b3892176db5de825d0c46b4 | [
"CC-BY-4.0"
] | 1,003 | 2018-07-05T18:15:14.000Z | 2022-03-27T07:03:28.000Z | extra/extra/DecidableFixed.agda | krzygorz/plfa.github.io | 10a3203624f2ea937b3892176db5de825d0c46b4 | [
"CC-BY-4.0"
] | 323 | 2018-07-05T22:34:34.000Z | 2022-03-30T07:42:57.000Z | extra/extra/DecidableFixed.agda | krzygorz/plfa.github.io | 10a3203624f2ea937b3892176db5de825d0c46b4 | [
"CC-BY-4.0"
] | 304 | 2018-07-16T18:24:59.000Z | 2022-03-28T11:35:02.000Z | import Relation.Binary.PropositionalEquality as Eq
open Eq using (_≡_; refl)
open import Data.Nat using (ℕ; zero; suc)
open import Relation.Nullary using (¬_; Dec; yes; no)
data _≤_ : ℕ → ℕ → Set where
z≤n : ∀ {n : ℕ} → zero ≤ n
s≤s : ∀ {m n : ℕ} → m ≤ n → suc m ≤ suc n
¬s≤z : ∀ {m : ℕ} → ¬ (suc m ≤ zero)
¬s≤z ()... | 22.724138 | 53 | 0.474962 |
23bf6900e23f426a0841a665861d5f2ebfc69779 | 3,345 | agda | Agda | WeakArrows.agda | jmchapman/Relative-Monads | 74707d3538bf494f4bd30263d2f5515a84733865 | [
"MIT"
] | 21 | 2015-07-30T01:25:12.000Z | 2021-02-13T18:02:18.000Z | WeakArrows.agda | jmchapman/Relative-Monads | 74707d3538bf494f4bd30263d2f5515a84733865 | [
"MIT"
] | 3 | 2019-01-13T13:12:33.000Z | 2019-05-29T09:50:26.000Z | WeakArrows.agda | jmchapman/Relative-Monads | 74707d3538bf494f4bd30263d2f5515a84733865 | [
"MIT"
] | 1 | 2019-11-04T21:33:13.000Z | 2019-11-04T21:33:13.000Z | module WeakArrows where
open import Library
open import Categories
record Arrow {l m}(J : Cat {l}{m}) : Set (lsuc (l ⊔ m)) where
constructor arrow
open Cat J
field R : Obj → Obj → Set m
pure : ∀{X Y} -> Hom X Y -> R X Y
_<<<_ : ∀{X Y Z} → R Y Z -> R X Y -> R X Z
alaw1 : ∀{X Y Z}... | 27.875 | 76 | 0.472646 |
18297f0de5b28fb73a771ff60edb13d63a914171 | 10,532 | agda | Agda | Cubical/Algebra/CommRing/Localisation/Base.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | 1 | 2021-10-31T17:32:49.000Z | 2021-10-31T17:32:49.000Z | Cubical/Algebra/CommRing/Localisation/Base.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | Cubical/Algebra/CommRing/Localisation/Base.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | -- We define the localisation of a commutative ring
-- at a multiplicatively closed subset and show that it
-- has a commutative ring structure.
{-# OPTIONS --safe --experimental-lossy-unification #-}
module Cubical.Algebra.CommRing.Localisation.Base where
open import Cubical.Foundations.Prelude
open import Cubical.F... | 36.442907 | 101 | 0.476738 |
180ca8484684ee5226c5f2d92646f50268782a40 | 1,096 | agda | Agda | Cubical/WithK.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | Cubical/WithK.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | 1 | 2022-01-27T02:07:48.000Z | 2022-01-27T02:07:48.000Z | Cubical/WithK.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | 1 | 2021-11-22T02:02:01.000Z | 2021-11-22T02:02:01.000Z | {- Cubical Agda with K
This file demonstrates the incompatibility of the --cubical
and --with-K flags, relying on the well-known incosistency of K with
univalence.
The --safe flag can be used to prevent accidentally mixing such
incompatible flags.
-}
{-# OPTIONS --cubical --no-import-sorts --with-K #-}
module Cubi... | 22.367347 | 68 | 0.691606 |
1c784558a6fe9352bc4444ee45edc81b84b59aca | 312 | agda | Agda | test/js/TestHarness.agda | pthariensflame/agda | 222c4c64b2ccf8e0fc2498492731c15e8fef32d4 | [
"BSD-3-Clause"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | test/js/TestHarness.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | test/js/TestHarness.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | 1 | 2022-03-12T11:35:18.000Z | 2022-03-12T11:35:18.000Z | open import Common.Prelude
module TestHarness where
record ⊤ : Set where
data ⊥ : Set where
T : Bool → Set
T true = ⊤
T false = ⊥
infixr 4 _,_
data Asserts : Set where
ε : Asserts
_,_ : Asserts → Asserts → Asserts
assert : (b : Bool) → {b✓ : T b} → String → Asserts
Tests : Set
Tests = ⊤ → Asserts
| 14.181818 | 53 | 0.628205 |
105c7164becd4b6826627277e8c8f55e33ac35ac | 159 | agda | Agda | test/Fail/Issue2833.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/Issue2833.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/Issue2833.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
open import Agda.Builtin.Nat
record R : Set where
field
r₁ : Nat
r₂ : Nat
open R
h : (n : Nat) → R
r₁ (h zero) = {!!}
r₂ (h zero) = {!!}
h = {!!}
| 11.357143 | 28 | 0.503145 |
0ef76df24f9f99e53508ec9ff8a902fcad67b186 | 1,780 | agda | Agda | agda-stdlib/src/Data/These/Categorical/Right/Base.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 5 | 2020-10-07T12:07:53.000Z | 2020-10-10T21:41:32.000Z | agda-stdlib/src/Data/These/Categorical/Right/Base.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | null | null | null | agda-stdlib/src/Data/These/Categorical/Right/Base.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 1 | 2021-11-04T06:54:45.000Z | 2021-11-04T06:54:45.000Z | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Base definitions for the right-biased universe-sensitive functor and
-- monad instances for These.
--
-- To minimize the universe level of the RawFunctor, we require that
-- elements of B are "lifted" to a copy o... | 28.709677 | 74 | 0.566292 |
cbd8139fa8f8ca34d2bbd498ec148b47f3eae425 | 21,304 | agda | Agda | prototyping/Properties/TypeNormalization.agda | Libertus-Lab/luau | f1b46f4b967f11fabe666da1de0e71b225368260 | [
"MIT"
] | 1 | 2021-11-06T08:03:00.000Z | 2021-11-06T08:03:00.000Z | prototyping/Properties/TypeNormalization.agda | sthagen/Roblox-luau | 39fbd2146a379fb0878369b48764cd7e8772c0fb | [
"MIT"
] | null | null | null | prototyping/Properties/TypeNormalization.agda | sthagen/Roblox-luau | 39fbd2146a379fb0878369b48764cd7e8772c0fb | [
"MIT"
] | null | null | null | {-# OPTIONS --rewriting #-}
module Properties.TypeNormalization where
open import Luau.Type using (Type; Scalar; nil; number; string; boolean; never; unknown; _⇒_; _∪_; _∩_)
open import Luau.Subtyping using (Tree; Language; ¬Language; function; scalar; unknown; left; right; function-ok₁; function-ok₂; function-err; f... | 52.08802 | 443 | 0.505492 |
2056c72923f35045e758c4b46d613608c209cc9e | 410 | agda | Agda | test/Succeed/UnquoteWithArgs.agda | cagix/agda | cc026a6a97a3e517bb94bafa9d49233b067c7559 | [
"BSD-2-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/UnquoteWithArgs.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/UnquoteWithArgs.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
module _ where
open import Common.Prelude
open import Common.Reflection
const : ∀ {a b} {A : Set a} {B : Set b} → A → B → A
const x _ = x
id : ∀ {a} {A : Set a} → A → A
id x = x
first : Tactic
first = give (def (quote const) [])
second : Tactic
second = give (def (quote const) (vArg (def (quote id) []) ∷ []))
nu... | 17.083333 | 65 | 0.619512 |
fb2eeb0535466434b913d3ba7d796f8360cc86bc | 523 | agda | Agda | LibraBFT/Impl/Base/Types.agda | haroldcarr/bft-consensus-agda | 34e4627855fb198665d0c98f377403a906ba75d7 | [
"UPL-1.0"
] | null | null | null | LibraBFT/Impl/Base/Types.agda | haroldcarr/bft-consensus-agda | 34e4627855fb198665d0c98f377403a906ba75d7 | [
"UPL-1.0"
] | null | null | null | LibraBFT/Impl/Base/Types.agda | haroldcarr/bft-consensus-agda | 34e4627855fb198665d0c98f377403a906ba75d7 | [
"UPL-1.0"
] | null | null | null | {- Byzantine Fault Tolerant Consensus Verification in Agda, version 0.9.
Copyright (c) 2021, Oracle and/or its affiliates.
Licensed under the Universal Permissive License v 1.0 as shown at https://opensource.oracle.com/licenses/upl
-}
module LibraBFT.Impl.Base.Types where
open import LibraBFT.Prelude
open i... | 23.772727 | 111 | 0.686424 |
20020918d95cfb5153353a96d255d339ec473410 | 4,617 | agda | Agda | src/Categories/Category/CartesianClosed/Canonical.agda | glittershark/agda-categories | 2128fab9e8d341364cbf784bb17c547bf73891de | [
"MIT"
] | null | null | null | src/Categories/Category/CartesianClosed/Canonical.agda | glittershark/agda-categories | 2128fab9e8d341364cbf784bb17c547bf73891de | [
"MIT"
] | null | null | null | src/Categories/Category/CartesianClosed/Canonical.agda | glittershark/agda-categories | 2128fab9e8d341364cbf784bb17c547bf73891de | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
open import Categories.Category.Core using (Category)
-- A "canonical" presentation of cartesian closed categories.
--
-- This presentation is equivalent to the one in
-- Categories.Category.CartesianClosed but it is easier to work with
-- in some circumstances.
--
-- Here, exponenti... | 28.85625 | 87 | 0.591726 |
dcc3a5f2104d29a2a2174d1569cbdd9d5f17d566 | 222 | agda | Agda | vendor/stdlib/src/Data/Unit1.agda | isabella232/Lemmachine | 8ef786b40e4a9ab274c6103dc697dcb658cf3db3 | [
"MIT"
] | 56 | 2015-01-20T02:11:42.000Z | 2021-12-21T17:02:19.000Z | vendor/stdlib/src/Data/Unit1.agda | larrytheliquid/Lemmachine | 8ef786b40e4a9ab274c6103dc697dcb658cf3db3 | [
"MIT"
] | 1 | 2022-03-12T12:17:51.000Z | 2022-03-12T12:17:51.000Z | vendor/stdlib/src/Data/Unit1.agda | isabella232/Lemmachine | 8ef786b40e4a9ab274c6103dc697dcb658cf3db3 | [
"MIT"
] | 3 | 2015-07-21T16:37:58.000Z | 2022-03-12T11:54:10.000Z | ------------------------------------------------------------------------
-- The unit type (in Set₁)
------------------------------------------------------------------------
module Data.Unit1 where
record ⊤₁ : Set₁ where
| 27.75 | 72 | 0.238739 |
4ad3bef4a1cfdd9fd68ea3cdb4162d1bdc99dfb2 | 169 | agda | Agda | test/Succeed/Issue3361.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue3361.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue3361.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2018-11-03, issue #3361
--
-- Empty variable blocks should trigger warning rather than parse error.
variable
-- Expected warning:
-- Empty variable block.
| 18.777778 | 72 | 0.733728 |
cb04edf53b0fd2baf06b20321ebdbcb40b7a6e98 | 576 | agda | Agda | test/Succeed/Issue679.agda | redfish64/autonomic-agda | c0ae7d20728b15d7da4efff6ffadae6fe4590016 | [
"BSD-3-Clause"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | test/succeed/Issue679.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | test/succeed/Issue679.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | 1 | 2022-03-12T11:35:18.000Z | 2022-03-12T11:35:18.000Z | -- Andreas, 2012-07-31 no eager introduction of hidden abstractions
{-# OPTIONS --show-implicit #-}
-- {-# OPTIONS -v tc.conv.coerce:100 #-}
-- {-# OPTIONS -v tc.with:100 #-}
module Issue679 where
data Unit : Set where
unit : Unit
-- works also now:
test : {u : Unit} → Unit
test = λ {u} → u
T : Unit → Set
T unit =... | 20.571429 | 67 | 0.590278 |
1063e053cfb047cd0ccb797d94ec6486b4afeb4f | 15,868 | agda | Agda | lib/Explore/Old/Sum/sum-properties.agda | crypto-agda/explore | 16bc8333503ff9c00d47d56f4ec6113b9269a43e | [
"BSD-3-Clause"
] | 2 | 2016-06-05T09:25:32.000Z | 2017-06-28T19:19:29.000Z | lib/Explore/Old/Sum/sum-properties.agda | crypto-agda/explore | 16bc8333503ff9c00d47d56f4ec6113b9269a43e | [
"BSD-3-Clause"
] | 1 | 2019-03-16T14:24:04.000Z | 2019-03-16T14:24:04.000Z | lib/Explore/Old/Sum/sum-properties.agda | crypto-agda/explore | 16bc8333503ff9c00d47d56f4ec6113b9269a43e | [
"BSD-3-Clause"
] | null | null | null | {-# OPTIONS --without-K #-}
module sum-properties where
open import Type
import Level as L
open L using (Lift)
open import Data.Zero using (𝟘)
open import Data.Bool.NP
open Data.Bool.NP.Indexed
open import Data.Nat.NP
open import Data.Nat.Properties
open import Data.Product renaming (map to pmap)
open import Data.Sum... | 31.29783 | 120 | 0.509201 |
399b223705ba7d86dea1dcabd99d0ce14e3391d8 | 14,271 | agda | Agda | Cubical/Foundations/Path.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | 1 | 2022-02-05T01:25:02.000Z | 2022-02-05T01:25:02.000Z | Cubical/Foundations/Path.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | null | null | null | Cubical/Foundations/Path.agda | FernandoLarrain/cubical | 9acdecfa6437ec455568be4e5ff04849cc2bc13b | [
"MIT"
] | null | null | null | {-# OPTIONS --safe #-}
module Cubical.Foundations.Path where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Function
open import Cubical.Foundations.GroupoidLaws
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.Isomorphism
open import Cubical.Foundations.Transport
open imp... | 39.31405 | 106 | 0.474879 |
d07511ba5696cc5ba7b2cd5a9ff365c898d073f7 | 8,342 | agda | Agda | src/OPair.agda | shinji-kono/zf-in-agda | 031f1ea3a3037cd51eb022dbfb5c75b037bf8aa0 | [
"MIT"
] | 5 | 2019-10-02T13:46:23.000Z | 2021-01-10T13:27:48.000Z | src/OPair.agda | shinji-kono/zf-in-agda | 031f1ea3a3037cd51eb022dbfb5c75b037bf8aa0 | [
"MIT"
] | null | null | null | src/OPair.agda | shinji-kono/zf-in-agda | 031f1ea3a3037cd51eb022dbfb5c75b037bf8aa0 | [
"MIT"
] | null | null | null | {-# OPTIONS --allow-unsolved-metas #-}
open import Level
open import Ordinals
module OPair {n : Level } (O : Ordinals {n}) where
open import zf
open import logic
import OD
import ODUtil
import OrdUtil
open import Relation.Nullary
open import Relation.Binary
open import Data.Empty
open import Relation.Binary
open ... | 38.981308 | 146 | 0.474706 |
1077065d9c430a8b22e67e5e8c48345f8b2a6239 | 2,414 | agda | Agda | Data/FixedTree/Properties.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | Data/FixedTree/Properties.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | Data/FixedTree/Properties.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | module Data.FixedTree.Properties where
import Lvl
open import Data using (Unit ; <>)
open import Data.Boolean
open import Data.FixedTree
open import Data.Tuple.Raise
import Data.Tuple.Raiseᵣ.Functions as Raise
open import Functional as Fn
open import Logic.Propositional
open import Numeral.Finite
open import... | 54.863636 | 183 | 0.613919 |
dc2928fee3f2c57256a46b24f9eb4fc51a369d01 | 2,055 | agda | Agda | src/Bi/BoxMp.agda | mietek/formal-logic | 2dd761bfa96ccda089888e8defa6814776fa2922 | [
"X11"
] | 26 | 2015-08-31T09:49:52.000Z | 2021-11-13T12:37:44.000Z | src/Bi/BoxMp.agda | mietek/formal-logic | 2dd761bfa96ccda089888e8defa6814776fa2922 | [
"X11"
] | null | null | null | src/Bi/BoxMp.agda | mietek/formal-logic | 2dd761bfa96ccda089888e8defa6814776fa2922 | [
"X11"
] | null | null | null | -- Minimal implicational modal logic, de Bruijn approach, initial encoding
module Bi.BoxMp where
open import Lib using (List; []; _,_; LMem; lzero; lsuc)
-- Types
infixr 0 _=>_
data Ty : Set where
UNIT : Ty
_=>_ : Ty -> Ty -> Ty
BOX : Ty -> Ty
-- Context and truth/validity judgements
Cx... | 21.861702 | 81 | 0.487591 |
d01d8f32909e72df3ea23d1c33933750c88f0926 | 4,507 | agda | Agda | Groups/FirstIsomorphismTheorem.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 4 | 2019-08-08T12:44:19.000Z | 2022-01-28T06:04:15.000Z | Groups/FirstIsomorphismTheorem.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 14 | 2019-01-06T21:11:59.000Z | 2020-04-11T11:03:39.000Z | Groups/FirstIsomorphismTheorem.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 Groups.Definition
open import Setoids.Setoids
open import LogicalFormulae
open import Sets.EquivalenceRelations
open import Groups.Homomorphisms.Definition
open import Groups.Homomorphisms.Lemmas
open import Groups.Isomorphisms.Definition
open import Group... | 86.673077 | 354 | 0.786554 |
dfd228d98359e63e65f85540a38690c6aef9398d | 4,721 | agda | Agda | test/asset/agda-stdlib-1.0/Relation/Binary/Construct/Add/Supremum/Strict.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Relation/Binary/Construct/Add/Supremum/Strict.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Relation/Binary/Construct/Add/Supremum/Strict.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- The Agda standard library
--
-- The lifting of a strict order to incorporate a new supremum
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
-- This module is designed to be used with... | 35.496241 | 75 | 0.481042 |
20312437129636aaf746bd044c7c4e354bbead92 | 1,051 | agda | Agda | src/Categories/Category/Exact.agda | Trebor-Huang/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | 5 | 2019-05-21T17:07:19.000Z | 2019-05-22T03:54:24.000Z | src/Categories/Category/Exact.agda | seanpm2001/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | null | null | null | src/Categories/Category/Exact.agda | seanpm2001/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"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... | 30.028571 | 84 | 0.733587 |
0eeb700e339592853af4c1c387fd6ae464451274 | 222 | agda | Agda | test/Fail/MultipleFrontEnds.agda | AntoineAllioux/agda | 68ec2312961776e415c99d2839e41a92ffe464db | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/MultipleFrontEnds.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/MultipleFrontEnds.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2020-12-15, re PR #5020
-- Test error message "Must not specify multiple frontends"
-- See respective .flags file
-- Expected error:
-- Must not specify multiple frontends (--interaction, --interaction-json)
| 27.75 | 74 | 0.72973 |
df85c29c5187ddd884cb638d816e4787448442fc | 5,325 | agda | Agda | Definition/Conversion/Weakening.agda | Vtec234/logrel-mltt | 4746894adb5b8edbddc8463904ee45c2e9b29b69 | [
"MIT"
] | null | null | null | Definition/Conversion/Weakening.agda | Vtec234/logrel-mltt | 4746894adb5b8edbddc8463904ee45c2e9b29b69 | [
"MIT"
] | null | null | null | Definition/Conversion/Weakening.agda | Vtec234/logrel-mltt | 4746894adb5b8edbddc8463904ee45c2e9b29b69 | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
module Definition.Conversion.Weakening where
open import Definition.Untyped as U hiding (wk)
open import Definition.Untyped.Properties
open import Definition.Typed
open import Definition.Typed.Weakening
open import Definition.Typed.Consequences.Syntactic
open import Definition.Conve... | 44.008264 | 89 | 0.477183 |
3962c9998a7498c086f6f5eb260a88b09f310a3b | 9,707 | agda | Agda | agda-stdlib/src/Data/List/Categorical.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 5 | 2020-10-07T12:07:53.000Z | 2020-10-10T21:41:32.000Z | agda-stdlib/src/Data/List/Categorical.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | null | null | null | agda-stdlib/src/Data/List/Categorical.agda | DreamLinuxer/popl21-artifact | fb380f2e67dcb4a94f353dbaec91624fcb5b8933 | [
"MIT"
] | 1 | 2021-11-04T06:54:45.000Z | 2021-11-04T06:54:45.000Z | ------------------------------------------------------------------------
-- The Agda standard library
--
-- A categorical view of List
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Data.List.Categorical where
open import Category.Functor
open impor... | 35.951852 | 115 | 0.435974 |
18592afb355e366aded400b98ebf16b5bf5e8b24 | 122 | agda | Agda | 04-cubical-type-theory/material/ExerciseSession3.agda | tomdjong/EPIT-2020 | 54b18e4adf890b3533bbefda373912423be7f490 | [
"MIT"
] | null | null | null | 04-cubical-type-theory/material/ExerciseSession3.agda | tomdjong/EPIT-2020 | 54b18e4adf890b3533bbefda373912423be7f490 | [
"MIT"
] | null | null | null | 04-cubical-type-theory/material/ExerciseSession3.agda | tomdjong/EPIT-2020 | 54b18e4adf890b3533bbefda373912423be7f490 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical #-}
module Exercises where
open import Part2
open import Part3
open import Part4
open import Part5
| 15.25 | 25 | 0.770492 |
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.