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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
c5afe5cb5f75f064c0d625fb2fc66b6684a3e147 | 1,778 | agda | Agda | theory/ky-qre.agda | OUPL/Zar | 9243f9d77d0c8af99afa4f536156a3e23b1c40e1 | [
"BSD-3-Clause"
] | null | null | null | theory/ky-qre.agda | OUPL/Zar | 9243f9d77d0c8af99afa4f536156a3e23b1c40e1 | [
"BSD-3-Clause"
] | 5 | 2019-09-13T15:40:08.000Z | 2019-10-06T16:32:25.000Z | theory/ky-qre.agda | OUPL/Zar | 9243f9d77d0c8af99afa4f536156a3e23b1c40e1 | [
"BSD-3-Clause"
] | null | null | null | {-# OPTIONS --guardedness #-}
module ky where
import Relation.Binary.PropositionalEquality as Eq
open Eq using (_≡_; _≢_; refl; cong; cong₂; sym)
open Eq.≡-Reasoning using (begin_; _≡⟨⟩_; _≡⟨_⟩_; _∎)
open import Data.Rational using (ℚ; _+_; _*_; _-_)
open import Data.Bool
open import Data.Bool.Properties
open import... | 23.394737 | 54 | 0.545557 |
2060ef76fba93a2703a258e394967a8f4db09f6d | 2,552 | agda | Agda | src/index.agda | ice1k/Theorems | 7dc0ea4782a5ff960fe31bdcb8718ce478eaddbc | [
"Apache-2.0"
] | 1 | 2020-04-15T15:28:03.000Z | 2020-04-15T15:28:03.000Z | src/index.agda | ice1k/Theorems | 7dc0ea4782a5ff960fe31bdcb8718ce478eaddbc | [
"Apache-2.0"
] | null | null | null | src/index.agda | ice1k/Theorems | 7dc0ea4782a5ff960fe31bdcb8718ce478eaddbc | [
"Apache-2.0"
] | null | null | null | module index where
-- natural numbers
--- additions
import Nats.Add.Assoc
using (nat-add-assoc) -- associative law
import Nats.Add.Comm
using (nat-add-comm) -- commutative law
import Nats.Add.Invert
using (nat-add-invert) -- a + a == b + b implies a == b
using (nat-add-invert-1) -- a + 1 == b + 1 implies a == ... | 26.863158 | 77 | 0.694749 |
4ae837d83d313f179fa4b7fe7e64cc04858a3593 | 673 | agda | Agda | src/Rationals.agda | ice1k/Theorems | 7dc0ea4782a5ff960fe31bdcb8718ce478eaddbc | [
"Apache-2.0"
] | 1 | 2020-04-15T15:28:03.000Z | 2020-04-15T15:28:03.000Z | src/Rationals.agda | ice1k/Theorems | 7dc0ea4782a5ff960fe31bdcb8718ce478eaddbc | [
"Apache-2.0"
] | null | null | null | src/Rationals.agda | ice1k/Theorems | 7dc0ea4782a5ff960fe31bdcb8718ce478eaddbc | [
"Apache-2.0"
] | null | null | null | module Rationals where
open import Nats renaming (_+_ to _:+:_; _*_ to _:*:_)
open import Equality
open import Data.Product
open import Agda.Builtin.TrustMe
infixl 7 _÷_
infixr 5 _→ℕ
infixr 7 _÷_↓_
infixr 7 _÷_↑_
infixl 6 _+_
data ℚ : Set where
_÷_ : (a b : ℕ) → ℚ
_→ℕ : {a : ℕ} → ℚ → ∃ (λ m → m ≡ a)
_→ℕ {a} _ = a... | 19.228571 | 54 | 0.447251 |
4a32d79a7e9b8836c609a5d569220f1e8da39d30 | 3,589 | agda | Agda | test/asset/agda-stdlib-1.0/Relation/Binary/Reflection.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Relation/Binary/Reflection.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Relation/Binary/Reflection.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Helpers intended to ease the development of "tactics" which use
-- proof by reflection
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
open import Dat... | 34.180952 | 77 | 0.578155 |
207bb976f747a3ff504b6a63b04d66bb7d341625 | 1,254 | agda | Agda | Data/List/Iterable.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | Data/List/Iterable.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | Data/List/Iterable.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | module Data.List.Iterable where
open import Data
open import Data.List
import Data.List.Functions as List
open import Logic.Propositional
open import Logic.Predicate
import Lvl
open import Relator.Equals
open import Structure.Container.Iterable
open import Type
private variable ℓ : Lvl.Level
private variabl... | 30.585366 | 72 | 0.694577 |
235b0d2c0ed5cae26b6076ce891b1242f8c1a4b1 | 1,630 | agda | Agda | src/Relation/Binary/Indexed/SetoidReasoning.agda | banacorn/categories | 9f6d933b227aecab338ecaef1d86566a54fdac68 | [
"MIT"
] | 1 | 2018-01-04T23:19:30.000Z | 2018-01-04T23:19:30.000Z | src/Relation/Binary/Indexed/SetoidReasoning.agda | banacorn/categories | 9f6d933b227aecab338ecaef1d86566a54fdac68 | [
"MIT"
] | null | null | null | src/Relation/Binary/Indexed/SetoidReasoning.agda | banacorn/categories | 9f6d933b227aecab338ecaef1d86566a54fdac68 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- Convenient syntax for "equational reasoning" in multiple Indexed Setoids
------------------------------------------------------------------------
-- Example use:
--
-- open import Data.Maybe
-- import Relation.Binary.Indexed.SetoidReasonin... | 30.185185 | 79 | 0.476687 |
d0ea9abfc1308f87ccd3501d40d84affb68f928e | 8,820 | agda | Agda | Cubical/Algebra/CommAlgebra/QuotientAlgebra.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | 1 | 2021-10-31T17:32:49.000Z | 2021-10-31T17:32:49.000Z | Cubical/Algebra/CommAlgebra/QuotientAlgebra.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | Cubical/Algebra/CommAlgebra/QuotientAlgebra.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | {-# OPTIONS --safe #-}
module Cubical.Algebra.CommAlgebra.QuotientAlgebra where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.Isomorphism
open import Cubical.Foundations.Powerset using (_∈_; _⊆_)
open import Cubical.... | 42.608696 | 118 | 0.545238 |
d0afccfbfa6f68adec2b7f43f1dc521223a90b26 | 393 | agda | Agda | archive/agda-3/src/Oscar/Class/Precategory.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null | archive/agda-3/src/Oscar/Class/Precategory.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/Precategory.agda | m0davis/oscar | 52e1cdbdee54d9a8eaee04ee518a0d7f61d25afb | [
"RSA-MD"
] | null | null | null |
open import Oscar.Prelude
open import Oscar.Class.IsPrecategory
open import Oscar.Class.Transitivity
module Oscar.Class.Precategory where
record Precategory 𝔬 𝔯 ℓ : Ø ↑̂ (𝔬 ∙̂ 𝔯 ∙̂ ℓ) where
constructor ∁
infix 4 _∼̇_
field
{𝔒} : Ø 𝔬
_∼_ : 𝔒 → 𝔒 → Ø 𝔯
_∼̇_ : ∀ {x y} → x ∼ y → x ∼ y → Ø ℓ
... | 23.117647 | 51 | 0.618321 |
0e23be3d4c50150d7cad8fab0113df5cf2ae15f3 | 5,337 | agda | Agda | src/hott/level/closure/extra.agda | pcapriotti/agda-base | bbbc3bfb2f80ad08c8e608cccfa14b83ea3d258c | [
"BSD-3-Clause"
] | 20 | 2015-06-12T12:20:17.000Z | 2022-02-01T11:25:54.000Z | src/hott/level/closure/extra.agda | pcapriotti/agda-base | bbbc3bfb2f80ad08c8e608cccfa14b83ea3d258c | [
"BSD-3-Clause"
] | 4 | 2015-02-02T14:32:16.000Z | 2016-10-26T11:57:26.000Z | src/hott/level/closure/extra.agda | pcapriotti/agda-base | bbbc3bfb2f80ad08c8e608cccfa14b83ea3d258c | [
"BSD-3-Clause"
] | 4 | 2015-02-02T12:17:00.000Z | 2019-05-04T19:31:00.000Z | {-# OPTIONS --without-K #-}
module hott.level.closure.extra where
open import level
open import decidable
open import sum
open import level using (lsuc; ↑; lift)
open import equality.core
open import equality.calculus
open import function.core using (_∘_; const)
open import function.extensionality
open import function... | 31.767857 | 78 | 0.468615 |
c52b84974801e4eae67c81248c6d9796c6b28e5d | 1,397 | agda | Agda | Cubical/Algebra/RingSolver/CommRingAsAlmostRing.agda | L-TChen/cubical | 60226aacd7b386aef95d43a0c29c4eec996348a8 | [
"MIT"
] | null | null | null | Cubical/Algebra/RingSolver/CommRingAsAlmostRing.agda | L-TChen/cubical | 60226aacd7b386aef95d43a0c29c4eec996348a8 | [
"MIT"
] | null | null | null | Cubical/Algebra/RingSolver/CommRingAsAlmostRing.agda | L-TChen/cubical | 60226aacd7b386aef95d43a0c29c4eec996348a8 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Algebra.RingSolver.CommRingAsAlmostRing where
open import Cubical.Foundations.Prelude
open import Cubical.Algebra.CommRing.Base
open import Cubical.Algebra.RingSolver.AlmostRing
open import Cubical.Algebra.Semigroup
open import Cubical.Algebra.Monoid
op... | 30.369565 | 87 | 0.615605 |
1823fe1849ca54fb1136021e49e2043aa1c5c188 | 251 | agda | Agda | test/Fail/LevelLiterals.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/LevelLiterals.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/LevelLiterals.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- There are no level literals in the concrete syntax. This file tests
-- if type errors use level literals.
module LevelLiterals where
open import Common.Level
data ⊥ : Set₁ where
DoubleNegated : ∀ {ℓ} → Set ℓ → Set
DoubleNegated A = (A → ⊥) → ⊥
| 20.916667 | 70 | 0.705179 |
cb886a6dc1374a026311ba866745cfbf825dee33 | 2,466 | agda | Agda | test/Fail/Issue1406.agda | favonia/agda | 8d433b967567c08afe15d04a5cb63b6f6d8884ee | [
"BSD-2-Clause"
] | null | null | null | test/Fail/Issue1406.agda | favonia/agda | 8d433b967567c08afe15d04a5cb63b6f6d8884ee | [
"BSD-2-Clause"
] | 6 | 2021-10-18T08:12:24.000Z | 2021-11-24T08:31:10.000Z | test/Fail/Issue1406.agda | antoinevanmuylder/agda | bd59d5b07ffe02a43b28d186d95e1747aac5bc8c | [
"BSD-2-Clause"
] | null | null | null | -- Andreas, 2014-01-16, issue 1406
-- Agda with K again is inconsistent with classical logic
-- {-# OPTIONS --cubical-compatible #-}
open import Common.Level
open import Common.Prelude
open import Common.Equality
cast : {A B : Set} (p : A ≡ B) (a : A) → B
cast refl a = a
data HEq {α} {A : Set α} (a : A) : {B : Set ... | 26.804348 | 80 | 0.603406 |
23385b98dc79a7c64c7623c9cb8519dc1f4dccee | 7,499 | agda | Agda | SOAS/Metatheory/Traversal.agda | k4rtik/agda-soas | b224d31e20cfd010b7c924ce940f3c2f417777e3 | [
"MIT"
] | null | null | null | SOAS/Metatheory/Traversal.agda | k4rtik/agda-soas | b224d31e20cfd010b7c924ce940f3c2f417777e3 | [
"MIT"
] | null | null | null | SOAS/Metatheory/Traversal.agda | k4rtik/agda-soas | b224d31e20cfd010b7c924ce940f3c2f417777e3 | [
"MIT"
] | null | null | null |
open import SOAS.Common
open import SOAS.Families.Core
open import Categories.Object.Initial
open import SOAS.Coalgebraic.Strength
import SOAS.Metatheory.MetaAlgebra
-- Traversals parametrised by a pointed coalgebra
module SOAS.Metatheory.Traversal {T : Set}
(⅀F : Functor 𝔽amiliesₛ 𝔽amiliesₛ) (⅀:Str : Strength ⅀F... | 34.242009 | 80 | 0.47353 |
dc2ceea7337acb7417389bb620c2cbe65b817de2 | 614 | agda | Agda | examples/outdated-and-incorrect/fileIO/Base.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/fileIO/Base.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/fileIO/Base.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
module Base where
postulate String : Set
Char : Set
{-# BUILTIN STRING String #-}
{-# BUILTIN CHAR Char #-}
data Unit : Set where
unit : Unit
{-# COMPILED_DATA Unit () #-}
data Bool : Set where
true : Bool
false : Bool
data False : Set where
record True : Set where
IsTrue : Bool -> Set
Is... | 16.157895 | 37 | 0.581433 |
238c4dc85f56865ecf6568cdb0fde2f3ce93f403 | 224 | agda | Agda | Cubical/Data/Fin.agda | L-TChen/cubical | 60226aacd7b386aef95d43a0c29c4eec996348a8 | [
"MIT"
] | null | null | null | Cubical/Data/Fin.agda | L-TChen/cubical | 60226aacd7b386aef95d43a0c29c4eec996348a8 | [
"MIT"
] | null | null | null | Cubical/Data/Fin.agda | L-TChen/cubical | 60226aacd7b386aef95d43a0c29c4eec996348a8 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Data.Fin where
open import Cubical.Data.Fin.Base public
open import Cubical.Data.Fin.Properties public
open import Cubical.Data.Fin.Literals public
| 28 | 50 | 0.75 |
208af95f451fcfdf17a19b042ccc8e7a336e3a96 | 5,853 | agda | Agda | agda/quad.agda | DSLsofMath/BScProj2021 | 87c0340515b0965454d9ba240ecc6de84b74ee0a | [
"BSD-3-Clause"
] | null | null | null | agda/quad.agda | DSLsofMath/BScProj2021 | 87c0340515b0965454d9ba240ecc6de84b74ee0a | [
"BSD-3-Clause"
] | null | null | null | agda/quad.agda | DSLsofMath/BScProj2021 | 87c0340515b0965454d9ba240ecc6de84b74ee0a | [
"BSD-3-Clause"
] | null | null | null | open import Data.Nat hiding ( _+_; _*_; _⊔_; zero )
open import Algebra hiding (Zero)
open import Level using (Level; _⊔_)
open import Data.Product
module quad { c ℓ } ( ring : Ring c ℓ ) where
open Ring ring
data Nat4 : Set where
One : Nat4
Suc : Nat4 -> Nat4
variable
a b d : Level
A : Set a
B : Se... | 30.643979 | 114 | 0.558175 |
0e80475f9649dd45c31a147074ae9ce54a4131ca | 1,435 | agda | Agda | LibraBFT/Yasm/Types.agda | cwjnkins/bft-consensus-agda | 71aa2168e4875ffdeece9ba7472ee3cee5fa9084 | [
"UPL-1.0"
] | 4 | 2020-12-16T19:43:41.000Z | 2021-12-18T19:24:05.000Z | LibraBFT/Yasm/Types.agda | cwjnkins/bft-consensus-agda | 71aa2168e4875ffdeece9ba7472ee3cee5fa9084 | [
"UPL-1.0"
] | 72 | 2021-02-04T05:04:33.000Z | 2022-03-25T05:36:11.000Z | LibraBFT/Yasm/Types.agda | cwjnkins/bft-consensus-agda | 71aa2168e4875ffdeece9ba7472ee3cee5fa9084 | [
"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.Prelude
-- This module defines types used in the specif... | 41 | 111 | 0.719164 |
4a1e283ee4af22e47551bd091adb988d2e4d5e50 | 13,106 | agda | Agda | src/Suspension.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | 3 | 2020-05-21T22:58:50.000Z | 2021-09-02T17:18:15.000Z | src/Suspension.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | null | null | null | src/Suspension.agda | nad/equality | 402b20615cfe9ca944662380d7b2d69b0f175200 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- Suspensions
------------------------------------------------------------------------
{-# OPTIONS --erased-cubical --safe #-}
-- The beginning of this module follows the HoTT book rather closely.
-- The module is parametrised by a notion of e... | 38.209913 | 148 | 0.439112 |
202e7da9127667a1b6afa1b17c681bbd575da1da | 9,287 | agda | Agda | Groups/FreeGroup/Parity.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 4 | 2019-08-08T12:44:19.000Z | 2022-01-28T06:04:15.000Z | Groups/FreeGroup/Parity.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 14 | 2019-01-06T21:11:59.000Z | 2020-04-11T11:03:39.000Z | Groups/FreeGroup/Parity.agda | Smaug123/agdaproofs | 0f4230011039092f58f673abcad8fb0652e6b562 | [
"MIT"
] | 1 | 2021-11-29T13:23:07.000Z | 2021-11-29T13:23:07.000Z | {-# OPTIONS --safe --warning=error #-}
open import Sets.EquivalenceRelations
open import Setoids.Setoids
open import Groups.FreeGroup.Definition
open import Groups.Homomorphisms.Definition
open import Groups.Definition
open import Decidable.Sets
open import Numbers.Naturals.Order
open import LogicalFormulae
open impor... | 62.75 | 202 | 0.669753 |
d0a310a8728484d30e011797aee29f0d32742061 | 58 | agda | Agda | test/Fail/Polarity-pragma-out-of-scope.agda | pthariensflame/agda | 222c4c64b2ccf8e0fc2498492731c15e8fef32d4 | [
"BSD-3-Clause"
] | 3 | 2015-03-28T14:51:03.000Z | 2015-12-07T20:14:00.000Z | test/Fail/Polarity-pragma-out-of-scope.agda | Blaisorblade/Agda | 802a28aa8374f15fe9d011ceb80317fdb1ec0949 | [
"BSD-3-Clause"
] | null | null | null | test/Fail/Polarity-pragma-out-of-scope.agda | Blaisorblade/Agda | 802a28aa8374f15fe9d011ceb80317fdb1ec0949 | [
"BSD-3-Clause"
] | null | null | null | postulate
A : Set
module _ where
{-# POLARITY A #-}
| 8.285714 | 20 | 0.586207 |
181fdf6f08ad9667f4103a87d30f1aebf89486ae | 7,952 | agda | Agda | BasicT/Syntax/Gentzen.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | 29 | 2016-07-03T18:51:56.000Z | 2022-01-01T10:29:18.000Z | BasicT/Syntax/Gentzen.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | 1 | 2018-06-10T09:11:22.000Z | 2018-06-10T09:11:22.000Z | BasicT/Syntax/Gentzen.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | null | null | null | -- TODO
-- Gentzen-style formalisation of syntax.
-- Simple terms.
module BasicT.Syntax.Gentzen where
open import BasicT.Syntax.Common public
-- Derivations.
infix 3 _⊢_
data _⊢_ (Γ : Cx Ty) : Ty → Set where
var : ∀ {A} → A ∈ Γ → Γ ⊢ A
lam : ∀ {A B} → Γ , A ⊢ B → Γ ⊢ A ▻ B
app : ∀ {A B} → Γ ⊢ A ▻ B →... | 27.901754 | 85 | 0.35337 |
c5bd9ccd980af47bc784043723660fc586eb24a8 | 2,017 | agda | Agda | src/Pi/Cp.agda | mietek/formal-logic | 2dd761bfa96ccda089888e8defa6814776fa2922 | [
"X11"
] | 26 | 2015-08-31T09:49:52.000Z | 2021-11-13T12:37:44.000Z | src/Pi/Cp.agda | mietek/formal-logic | 2dd761bfa96ccda089888e8defa6814776fa2922 | [
"X11"
] | null | null | null | src/Pi/Cp.agda | mietek/formal-logic | 2dd761bfa96ccda089888e8defa6814776fa2922 | [
"X11"
] | null | null | null | -- Classical propositional logic, PHOAS approach, initial encoding
module Pi.Cp 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 -> Ty -... | 28.408451 | 112 | 0.447695 |
dfaeabcbd30d6e166efeb0ec9e09f9374315b9b2 | 157 | agda | Agda | Cubical/Algebra/Group.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | 1 | 2021-10-31T17:32:49.000Z | 2021-10-31T17:32:49.000Z | Cubical/Algebra/Group.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | Cubical/Algebra/Group.agda | guilhermehas/cubical | ce3120d3f8d692847b2744162bcd7a01f0b687eb | [
"MIT"
] | null | null | null | {-# OPTIONS --safe #-}
module Cubical.Algebra.Group where
open import Cubical.Algebra.Group.Base public
open import Cubical.Algebra.Group.Properties public
| 26.166667 | 51 | 0.796178 |
cbdc0a4377dd63906550e7b914280550364c5520 | 3,227 | agda | Agda | src/Web/Semantic/DL/TBox/Minimizable.agda | agda/agda-web-semantic | 8ddbe83965a616bff6fc7a237191fa261fa78bab | [
"MIT"
] | 9 | 2015-09-13T17:46:41.000Z | 2020-03-14T14:21:08.000Z | src/Web/Semantic/DL/TBox/Minimizable.agda | bblfish/agda-web-semantic | 38fbc3af7062ba5c3d7d289b2b4bcfb995d99057 | [
"MIT"
] | 4 | 2018-11-14T02:32:28.000Z | 2021-01-04T20:57:19.000Z | src/Web/Semantic/DL/TBox/Minimizable.agda | bblfish/agda-web-semantic | 38fbc3af7062ba5c3d7d289b2b4bcfb995d99057 | [
"MIT"
] | 3 | 2017-12-03T14:52:09.000Z | 2022-03-12T11:40:03.000Z | open import Data.Bool using ( Bool ; true ; false ; _∧_ )
open import Data.Product using ( _×_ )
open import Relation.Binary.PropositionalEquality using ( _≡_ )
open import Relation.Unary using ( _∈_ )
open import Web.Semantic.DL.Concept using
( Concept ; ⟨_⟩ ; ¬⟨_⟩ ; ⊤ ; ⊥ ; _⊓_ ; _⊔_ ; ∀[_]_ ; ∃⟨_⟩_ ; ≤1 ; >1 )
ope... | 31.028846 | 82 | 0.43167 |
df2ae24da477b13b75b0844882c0c60749e286ff | 950 | agda | Agda | src/Categories/Category/Instance/SingletonSet.agda | jaykru/agda-categories | a4053cf700bcefdf73b857c3352f1eae29382a60 | [
"MIT"
] | 279 | 2019-06-01T14:36:40.000Z | 2022-03-22T00:40:14.000Z | src/Categories/Category/Instance/SingletonSet.agda | seanpm2001/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | 236 | 2019-06-01T14:53:54.000Z | 2022-03-28T14:31:43.000Z | src/Categories/Category/Instance/SingletonSet.agda | seanpm2001/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | 64 | 2019-06-02T16:58:15.000Z | 2022-03-14T02:00:59.000Z | {-# OPTIONS --without-K --safe #-}
open import Level
-- This is really a degenerate version of Categories.Category.Instance.One
-- Here SingletonSet is not given an explicit name, it is an alias for ⊤
module Categories.Category.Instance.SingletonSet where
open import Data.Unit.Polymorphic using (⊤; tt)
open import R... | 30.645161 | 86 | 0.726316 |
cb08e4a6cfc551af9917f5f1776381f484ad9424 | 4,797 | agda | Agda | agda/DsubNoTrans.agda | HuStmpHrrr/popl20-artifact | 48214a55ebb484fd06307df4320813d4a002535b | [
"MIT"
] | 1 | 2021-09-23T08:40:28.000Z | 2021-09-23T08:40:28.000Z | agda/DsubNoTrans.agda | HuStmpHrrr/popl20-artifact | 48214a55ebb484fd06307df4320813d4a002535b | [
"MIT"
] | null | null | null | agda/DsubNoTrans.agda | HuStmpHrrr/popl20-artifact | 48214a55ebb484fd06307df4320813d4a002535b | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
-- This module shows that D<: subtyping without transitivity, or equivalently, without
-- bad bounds, remains undecidable.
module DsubNoTrans where
open import Data.List as List
open import Data.List.All as All
open import Data.Nat as ℕ
open import Data.Maybe as Maybe
open import Da... | 39.644628 | 108 | 0.398374 |
10949891d8a9aa9a3b9d9adf462d740a5f811d7f | 1,870 | agda | Agda | examples/outdated-and-incorrect/univ/help.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/univ/help.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/univ/help.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
module help where
open import univ
open import Base
-- Prelims
infixl 150 _#_
K : {A : S} -> S -> Fam A
K B = fam (\_ -> B) (\_ -> refS)
_#_ : {A : S}{F : Fam A} -> El (pi A F) -> (x : El A) -> El (F ! x)
el < f , _ > # x = f x
pFun : {A : S}{F : Fam A}(f : El (pi A F)){x y : El A}(x=y : x == y) ->
f # x =... | 30.655738 | 80 | 0.392513 |
1838152e6dd79bd5e03b56352025b99f31eb9b63 | 2,033 | agda | Agda | src/API.agda | algebraic-graphs/alga-theory | 0fdb96c0233d9be83eba637f0434d0fd22aefb1d | [
"MIT"
] | 60 | 2017-12-27T14:57:04.000Z | 2022-03-22T23:05:29.000Z | src/API.agda | algebraic-graphs/alga-theory | 0fdb96c0233d9be83eba637f0434d0fd22aefb1d | [
"MIT"
] | 3 | 2018-04-12T16:25:13.000Z | 2018-06-23T13:54:02.000Z | src/API.agda | algebraic-graphs/alga-theory | 0fdb96c0233d9be83eba637f0434d0fd22aefb1d | [
"MIT"
] | 6 | 2017-12-17T20:48:20.000Z | 2019-05-09T23:53:28.000Z | module API where
open import Algebra.Graph
open import Prelude
empty : ∀ {A} -> Graph A
empty = ε
vertex : ∀ {A} -> A -> Graph A
vertex = v
overlay : ∀ {A} -> Graph A -> Graph A -> Graph A
overlay = _+_
connect : ∀ {A} -> Graph A -> Graph A -> Graph A
connect = _*_
edge : ∀ {A} -> A -> A -> Graph... | 27.106667 | 91 | 0.518446 |
239dc5bbf3baa5b63ce97d2fd93605f3d0e67e4e | 373 | agda | Agda | src/FunExt.agda | vituscze/HoTT-lectures | 7730385adfdbdda38ee8b124be3cdeebb7312c65 | [
"BSD-3-Clause"
] | null | null | null | src/FunExt.agda | vituscze/HoTT-lectures | 7730385adfdbdda38ee8b124be3cdeebb7312c65 | [
"BSD-3-Clause"
] | null | null | null | src/FunExt.agda | vituscze/HoTT-lectures | 7730385adfdbdda38ee8b124be3cdeebb7312c65 | [
"BSD-3-Clause"
] | null | null | null | {-# OPTIONS --without-K #-}
module FunExt where
open import HIT.Interval
open import PathOperations
open import PathStructure.Id.Tr
open import Types
funext : ∀ {a b} {A : Set a} {B : A → Set b} {f g : (x : A) → B x} →
(∀ x → f x ≡ g x) → f ≡ g
funext {A = A} {B = B} {f = f} {g = g} p = ap h seg
where
h : I →... | 24.866667 | 68 | 0.52815 |
4ab95ea4ae4ba111765a0cb55f592176ba0ff27c | 8,155 | agda | Agda | Sets.agda | thibautbenjamin/catt-formalization | 3a02010a869697f4833c9bc6047d66ca27b87cf2 | [
"MIT"
] | 2 | 2020-05-01T08:26:53.000Z | 2020-05-20T00:41:09.000Z | Sets.agda | ThiBen/catt-formalization | ed45935b38d6a86fa662f561866140122ee3dcef | [
"MIT"
] | null | null | null | Sets.agda | ThiBen/catt-formalization | ed45935b38d6a86fa662f561866140122ee3dcef | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K #-}
--
-- Implementation of Sets using lists
--
open import Prelude
module Sets {i} (A : Set i) (eqdecA : eqdec A) where
valid : list A → Set i
valid l = ∀ x → has-all-paths (x ∈-list l)
set = Σ (list A) (λ l → valid l)
valid-nil : valid nil
valid-nil _ ()
Ø : set
Ø = nil , v... | 40.775 | 152 | 0.435684 |
23abad321b5409d0ca27ecca42adf06419cfe11f | 97 | agda | Agda | Lang/Irrelevance.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | Lang/Irrelevance.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | Lang/Irrelevance.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | module Lang.Irrelevance where
open import Type
postulate .axiom : ∀{ℓ}{T : Type{ℓ}} -> .T -> T
| 16.166667 | 47 | 0.649485 |
10c436748fc4d1d74dc1054f6176383293140ceb | 1,314 | agda | Agda | test/Succeed/Less-normalisation-in-reflection-machinery.agda | cagix/agda | cc026a6a97a3e517bb94bafa9d49233b067c7559 | [
"BSD-2-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Less-normalisation-in-reflection-machinery.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Less-normalisation-in-reflection-machinery.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.List
open import Agda.Builtin.Nat
open import Agda.Builtin.Reflection
open import Agda.Builtin.Unit
open import Common.Product
{-# TERMINATING #-}
Loop : Set
Loop = Loop
postulate
loop : Loop
data Box (A : Set) : Set where
box : A → Box A
{-# TERMINATING #-}
Boxed-loop : Set
Boxed-loo... | 15.642857 | 70 | 0.582192 |
108c056e4f4b59c43500ba453a541ee6935246fb | 48 | agda | Agda | test/interaction/Issue4307.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/interaction/Issue4307.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/interaction/Issue4307.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | postulate
A : Set
f : {{_ : A}} → A
f = {!!}
| 8 | 17 | 0.375 |
cbe170a896a235ddb2a3d25e20a532f46b977457 | 231 | agda | Agda | test/fail/NoTerminationCheck4.agda | asr/agda-kanso | aa10ae6a29dc79964fe9dec2de07b9df28b61ed5 | [
"MIT"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | test/fail/NoTerminationCheck4.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | test/fail/NoTerminationCheck4.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | 1 | 2022-03-12T11:35:18.000Z | 2022-03-12T11:35:18.000Z | -- 2012-03-08 Andreas
module NoTerminationCheck4 where
data Bool : Set where
true false : Bool
{-# NO_TERMINATION_CHECK #-}
private
f : Bool -> Bool
f true = f true
f false = f false
-- error: must place pragma before f
| 16.5 | 36 | 0.688312 |
2012cf0e7e45ad983bfa330ff85bdd1cad838fe4 | 2,249 | agda | Agda | agda-stdlib-0.9/src/Category/Applicative/Indexed.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/Category/Applicative/Indexed.agda | qwe2/try-agda | 9d4c43b1609d3f085636376fdca73093481ab882 | [
"Apache-2.0"
] | null | null | null | agda-stdlib-0.9/src/Category/Applicative/Indexed.agda | qwe2/try-agda | 9d4c43b1609d3f085636376fdca73093481ab882 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------
-- The Agda standard library
--
-- Indexed applicative functors
------------------------------------------------------------------------
-- Note that currently the applicative functor laws are not included
-- here.
module Category.Applicative.In... | 30.808219 | 74 | 0.470431 |
df2308b02c0dcc0e57a0c7d0b1d8f00833f0228b | 1,496 | agda | Agda | examples/outdated-and-incorrect/iird/Identity.agda | asr/agda-kanso | aa10ae6a29dc79964fe9dec2de07b9df28b61ed5 | [
"MIT"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | examples/outdated-and-incorrect/iird/Identity.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | examples/outdated-and-incorrect/iird/Identity.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | 1 | 2022-03-12T11:35:18.000Z | 2022-03-12T11:35:18.000Z |
module Identity where
data _==_ {A : Set}(x : A) : A -> Set where
refl : x == x
elim== : {A : Set}(x : A)(C : (y : A) -> x == y -> Set) ->
C x refl -> (y : A) -> (p : x == y) -> C y p
elim== x C Cx .x refl = Cx
elim==₁ : {A : Set}(x : A)(C : (y : A) -> x == y -> Set1) ->
C x refl -> (y : A) -> (p : x ... | 31.829787 | 67 | 0.426471 |
10973240effaef2d9b3ff3970769274337854b54 | 3,052 | agda | Agda | examples/Termination/Sized/DeBruijnExSubstSized.agda | larrytheliquid/agda | 477c8c37f948e6038b773409358fd8f38395f827 | [
"MIT"
] | null | null | null | examples/Termination/Sized/DeBruijnExSubstSized.agda | larrytheliquid/agda | 477c8c37f948e6038b773409358fd8f38395f827 | [
"MIT"
] | null | null | null | examples/Termination/Sized/DeBruijnExSubstSized.agda | larrytheliquid/agda | 477c8c37f948e6038b773409358fd8f38395f827 | [
"MIT"
] | 1 | 2022-03-12T11:35:18.000Z | 2022-03-12T11:35:18.000Z | {-# OPTIONS --sized-types #-} -- --no-coverage-check #-}
module DeBruijnExSubstSized where
open import Data.Function -- using (_∘_) -- composition, identity
open import Data.Nat
open import Data.Maybe
open import Relation.Binary.PropositionalEquality
open ≡-Reasoning
open import Size
open import DeBruijn
-- ... | 30.828283 | 73 | 0.539646 |
c5683e68c56b1b8e31015934255ac870f48f10db | 213 | agda | Agda | src/Web/URI/Everything.agda | agda/agda-web-uri | 8ced22124dbe12fa820699bb362247a96d592c03 | [
"MIT"
] | 1 | 2019-12-23T04:56:25.000Z | 2019-12-23T04:56:25.000Z | src/Web/URI/Everything.agda | agda/agda-web-uri | 8ced22124dbe12fa820699bb362247a96d592c03 | [
"MIT"
] | null | null | null | src/Web/URI/Everything.agda | agda/agda-web-uri | 8ced22124dbe12fa820699bb362247a96d592c03 | [
"MIT"
] | 1 | 2022-03-12T11:37:59.000Z | 2022-03-12T11:37:59.000Z | module Web.URI.Everything where
import Web.URI
import Web.URI.Examples.HelloWorld
import Web.URI.Primitive
import Web.URI.Port
import Web.URI.Port.Primitive
import Web.URI.Scheme
import Web.URI.Scheme.Primitive
| 19.363636 | 34 | 0.826291 |
dfb4b5a097619506a081a43efa0942a44795b63e | 735 | agda | Agda | out/CommMonoid/Signature.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 39 | 2021-11-09T20:39:55.000Z | 2022-03-19T17:33:12.000Z | out/CommMonoid/Signature.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 1 | 2021-11-21T12:19:32.000Z | 2021-11-21T12:19:32.000Z | out/CommMonoid/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 CommMonoid | CM
type
* : 0-ary
term
unit : * | ε
add : * * -> * | _⊕_ l20
theory
(εU⊕ᴸ) a |> add (unit, a) = a
(εU⊕ᴿ) a |> add (a, unit) = a
(⊕A) a b c |> add (add(a, b), c) = add (a, add(b, c))
... | 17.5 | 91 | 0.605442 |
cb278711777ab9a701ad37e40b1878d9cc836744 | 1,810 | agda | Agda | test/asset/agda-stdlib-1.0/Codata/Musical/Cofin.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Codata/Musical/Cofin.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | test/asset/agda-stdlib-1.0/Codata/Musical/Cofin.agda | omega12345/agda-mode | 0debb886eb5dbcd38dbeebd04b34cf9d9c5e0e71 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- The Agda standard library
--
-- "Finite" sets indexed on coinductive "natural" numbers
------------------------------------------------------------------------
{-# OPTIONS --without-K --sized-types --guardedness #-}
module Codata.Musical.Cofi... | 30.166667 | 83 | 0.547514 |
dcb57803e14ef537fa3506cb16d058334f9a353e | 3,756 | agda | Agda | nicolai/pseudotruncations/NONRECURSIVE-INDEX.agda | nicolaikraus/HoTT-Agda | 939a2d83e090fcc924f69f7dfa5b65b3b79fe633 | [
"MIT"
] | 1 | 2021-06-30T00:17:55.000Z | 2021-06-30T00:17:55.000Z | nicolai/pseudotruncations/NONRECURSIVE-INDEX.agda | nicolaikraus/HoTT-Agda | 939a2d83e090fcc924f69f7dfa5b65b3b79fe633 | [
"MIT"
] | null | null | null | nicolai/pseudotruncations/NONRECURSIVE-INDEX.agda | nicolaikraus/HoTT-Agda | 939a2d83e090fcc924f69f7dfa5b65b3b79fe633 | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K #-}
{- INDEX: Some constructions with non-recursive HITs,
and related results.
This formalization covers the hardest results of my
paper titled "Constructions with non-recursive HITs".
To be precise: I have formalized the result that all
functions in the sequence of approximati... | 41.274725 | 65 | 0.750799 |
18a849a3c6fcd14c13e5f8300684d6e2e783a1eb | 437 | agda | Agda | test/Succeed/Issue3971.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue3971.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue3971.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | {-# OPTIONS --rewriting --confluence-check -v rewriting:80 #-}
open import Agda.Builtin.Equality
postulate
decorate : ∀{a} (A : Set a) → Set a
rewriteMe : ∀{a b} {A : Set a} {B : A → Set b}
→ decorate ((x : A) → B x) ≡ (decorate A → ∀ x → decorate (B x))
{-# BUILTIN REWRITE _≡_ #-}
{-# R... | 25.705882 | 80 | 0.549199 |
2025ad04931cf9f85ca11af138615d8c51347e8e | 2,932 | agda | Agda | test/Succeed/Issue4066.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue4066.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue4066.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | open import Agda.Builtin.Equality
open import Agda.Primitive
record R a : Set (lsuc a) where
field
P : {A : Set a} → A → A → Set a
r : ∀ ℓ → R ℓ
R.P (r _) = _≡_
postulate
cong : ∀ {a b} {A : Set a} {B : Set b} {x y : A}
(f : A → B) → R.P (r a) x y → R.P (r b) (f x) (f y)
magic : ∀ {a} {A : Set a... | 27.148148 | 67 | 0.482606 |
23f0bf5417b640cc0809fe15968f0279e8acb970 | 424 | agda | Agda | test/succeed/Issue252.agda | larrytheliquid/agda | 477c8c37f948e6038b773409358fd8f38395f827 | [
"MIT"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | test/succeed/Issue252.agda | masondesu/agda | 70c8a575c46f6a568c7518150a1a64fcd03aa437 | [
"MIT"
] | null | null | null | test/succeed/Issue252.agda | masondesu/agda | 70c8a575c46f6a568c7518150a1a64fcd03aa437 | [
"MIT"
] | 1 | 2022-03-12T11:35:18.000Z | 2022-03-12T11:35:18.000Z | module Issue252 where
data I : Set where
zero : I
data D : I → Set where
c : ∀ i → D i → D i
id : I → I
id i = i
index : ∀ i → D i → I
index i _ = i
foo : ∀ i → D i → D zero
foo .i (c i d) with id i
foo ._ (c i d) | zero = d
bar : ∀ i → D i → D zero
bar .i (c i d) with index i d
bar ._ (c i d) | zero = d
-- ... | 16.96 | 69 | 0.54717 |
c5cb0f5c99b1ce5b3749bc3e62b900af239fe7b8 | 313 | agda | Agda | demo/agda/FRP/JS/Demo/HRef.agda | agda/agda-frp-js | c7ccaca624cb1fa1c982d8a8310c313fb9a7fa72 | [
"MIT",
"BSD-3-Clause"
] | 63 | 2015-04-20T21:47:00.000Z | 2022-02-28T09:46:14.000Z | demo/agda/FRP/JS/Demo/HRef.agda | agda/agda-frp-js | c7ccaca624cb1fa1c982d8a8310c313fb9a7fa72 | [
"MIT",
"BSD-3-Clause"
] | null | null | null | demo/agda/FRP/JS/Demo/HRef.agda | agda/agda-frp-js | c7ccaca624cb1fa1c982d8a8310c313fb9a7fa72 | [
"MIT",
"BSD-3-Clause"
] | 7 | 2016-11-07T21:50:58.000Z | 2022-03-12T11:39:38.000Z | open import FRP.JS.Behaviour using ( Beh ; [_] )
open import FRP.JS.DOM using ( DOM ; element ; attr ; text ; _++_ )
open import FRP.JS.RSet using ( ⟦_⟧ )
module FRP.JS.Demo.HRef where
main : ∀ {w} → ⟦ Beh (DOM w) ⟧
main = element ("a")
( attr "href" ["http://bell-labs.com/"] ++
text ["A hyperlink."] )
| 28.454545 | 67 | 0.594249 |
dc120ff8cd1f8e1bccf9512bc63c8805e6465160 | 838 | agda | Agda | test/succeed/FlexRemoval.agda | asr/agda-kanso | aa10ae6a29dc79964fe9dec2de07b9df28b61ed5 | [
"MIT"
] | 1 | 2018-10-10T17:08:44.000Z | 2018-10-10T17:08:44.000Z | test/succeed/FlexRemoval.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | test/succeed/FlexRemoval.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | {-
In order to solve the metavariables in this example
we need to solve a constraint of the form
_1 := unit₂ (_2 y)
With the flex removal feature the occurs check will
spot the bad variable 'y' in the instantiation and
remove it by instantiating
_2 := λ y → _3
for a fresh metavariable _3. The i... | 15.518519 | 61 | 0.650358 |
dc61cbd5d1b0ba1e26c98a37108872d68d7d44e4 | 457 | agda | Agda | test/succeed/Issue148.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | 1 | 2019-11-27T04:41:05.000Z | 2019-11-27T04:41:05.000Z | test/succeed/Issue148.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | test/succeed/Issue148.agda | np/agda-git-experiment | 20596e9dd9867166a64470dd24ea68925ff380ce | [
"MIT"
] | null | null | null | -- {-# OPTIONS -v tc.polarity:15 -v tc.pos:0 #-}
module Issue148 where
data I : Set where
i : I
F : I → Set → Set
F i A = A
data T (p : I) : Set where
t₁ : T p → T p
t₂ : F p (T p) → T p
fold : ((x : T i) → T i) → T i → T i
fold f (t₁ x) = f (fold f x)
fold f (t₂ x) = f (fold f x)
data E : T i → Set wh... | 16.925926 | 48 | 0.477024 |
df376a43837e7816383b824b38d66a05af0e9871 | 3,392 | agda | Agda | Cubical/Foundations/Pointed/Homogeneous.agda | cangiuli/cubical | d103ec455d41cccf9b13a4803e7d3cf462e00067 | [
"MIT"
] | null | null | null | Cubical/Foundations/Pointed/Homogeneous.agda | cangiuli/cubical | d103ec455d41cccf9b13a4803e7d3cf462e00067 | [
"MIT"
] | 1 | 2022-01-27T02:07:48.000Z | 2022-01-27T02:07:48.000Z | Cubical/Foundations/Pointed/Homogeneous.agda | cangiuli/cubical | d103ec455d41cccf9b13a4803e7d3cf462e00067 | [
"MIT"
] | null | null | null | {-
Definition of a homogeneous pointed type, and proofs that pi, product, path, and discrete types are homogeneous
Portions of this file adapted from Nicolai Kraus' code here:
https://bitbucket.org/nicolaikraus/agda/src/e30d70c72c6af8e62b72eefabcc57623dd921f04/trunc-inverse.lagda
-}
{-# OPTIONS --cubical --no-impo... | 40.380952 | 111 | 0.59316 |
cbda07a7a1a1adbea809d63e2973cedcd930af0a | 2,060 | agda | Agda | src/Everything.agda | mietek/coquand-kovacs | bd626509948fbf8503ec2e31c1852e1ac6edcc79 | [
"X11"
] | null | null | null | src/Everything.agda | mietek/coquand-kovacs | bd626509948fbf8503ec2e31c1852e1ac6edcc79 | [
"X11"
] | null | null | null | src/Everything.agda | mietek/coquand-kovacs | bd626509948fbf8503ec2e31c1852e1ac6edcc79 | [
"X11"
] | null | null | null | module Everything where
import Prelude
import Category
--------------------------------------------------------------------------------
-- The syntax of STLC.
import STLC.Syntax
-- A simplification of Coquand 2002,
-- with de Bruijn indices and implicit substitutions.
import STLC.Coquand.Renaming
import STLC.Coqu... | 29.428571 | 80 | 0.679612 |
dc969d4b08d4725b110994833c8e3b282ae214df | 925 | agda | Agda | src/Categories/Category/Instance/LawvereTheories.agda | turion/agda-categories | ad0f94b6cf18d8a448b844b021aeda58e833d152 | [
"MIT"
] | 5 | 2020-10-07T12:07:53.000Z | 2020-10-10T21:41:32.000Z | src/Categories/Category/Instance/LawvereTheories.agda | turion/agda-categories | ad0f94b6cf18d8a448b844b021aeda58e833d152 | [
"MIT"
] | null | null | null | src/Categories/Category/Instance/LawvereTheories.agda | turion/agda-categories | ad0f94b6cf18d8a448b844b021aeda58e833d152 | [
"MIT"
] | 1 | 2021-11-04T06:54:45.000Z | 2021-11-04T06:54:45.000Z | {-# OPTIONS --without-K --safe #-}
module Categories.Category.Instance.LawvereTheories where
-- Category of Lawvere Theories
open import Level
open import Categories.Category
open import Categories.Functor.Cartesian.Properties
open import Categories.NaturalTransformation.NaturalIsomorphism
open import Categories.The... | 31.896552 | 90 | 0.643243 |
d09d3232bc18b670ae836d934afdd717a2a86644 | 765 | agda | Agda | test/Succeed/Issue1411-2.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue1411-2.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue1411-2.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2014-01-24, Issue 1411
-- First split might not succeed in the unifier,
-- so try later splits also.
-- {-# OPTIONS -v tc.lhs:10 #-}
open import Common.Prelude
open import Common.Equality
data Fin : Nat → Set where
fzero : (n : Nat) → Fin (suc n)
fsuc : (n : Nat) → (i : Fin n) → Fin (suc n)
data _≅... | 28.333333 | 75 | 0.581699 |
c5f5a8314747cd2b18659d97b1c596daa117d90d | 6,397 | agda | Agda | OlderBasicILP/Direct/Gentzen.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | 29 | 2016-07-03T18:51:56.000Z | 2022-01-01T10:29:18.000Z | OlderBasicILP/Direct/Gentzen.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | 1 | 2018-06-10T09:11:22.000Z | 2018-06-10T09:11:22.000Z | OlderBasicILP/Direct/Gentzen.agda | mietek/hilbert-gentzen | fcd187db70f0a39b894fe44fad0107f61849405c | [
"X11"
] | null | null | null | module OlderBasicILP.Direct.Gentzen where
open import Common.Context public
-- Propositions of intuitionistic logic of proofs, without ∨, ⊥, or +.
mutual
infixr 10 _⦂_
infixl 9 _∧_
infixr 7 _▻_
data Ty : Set where
α_ : Atom → Ty
_▻_ : Ty → Ty → Ty
_⦂_ : Box → Ty → Ty
_∧_ : Ty → Ty → Ty
... | 26.76569 | 88 | 0.3869 |
df284c46f027130af9e5b8c985fd444d8fdbdfbc | 2,435 | agda | Agda | src/Examples/Sorting/Parallel/MergeSort/Split.agda | jonsterling/agda-calf | e51606f9ca18d8b4cf9a63c2d6caa2efc5516146 | [
"Apache-2.0"
] | 29 | 2021-07-14T03:18:28.000Z | 2022-03-22T20:35:11.000Z | src/Examples/Sorting/Parallel/MergeSort/Split.agda | jonsterling/agda-calf | e51606f9ca18d8b4cf9a63c2d6caa2efc5516146 | [
"Apache-2.0"
] | null | null | null | src/Examples/Sorting/Parallel/MergeSort/Split.agda | jonsterling/agda-calf | e51606f9ca18d8b4cf9a63c2d6caa2efc5516146 | [
"Apache-2.0"
] | 2 | 2021-10-06T10:28:24.000Z | 2022-01-29T08:12:01.000Z | {-# OPTIONS --prop --rewriting #-}
open import Examples.Sorting.Parallel.Comparable
module Examples.Sorting.Parallel.MergeSort.Split (M : Comparable) where
open Comparable M
open import Examples.Sorting.Parallel.Core M
open import Calf costMonoid
open import Calf.ParMetalanguage parCostMonoid
open import Calf.Types... | 43.482143 | 128 | 0.63655 |
1892622cb195bd3a3580feeb13f37a2df7862add | 260 | agda | Agda | test/Fail/IncompletePatternMatching.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/IncompletePatternMatching.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/IncompletePatternMatching.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
module IncompletePatternMatching where
data Nat : Set where
zero : Nat
suc : Nat -> Nat
data True : Set where
tt : True
data False : Set where
_==_ : Nat -> Nat -> Set
zero == zero = True
suc n == suc m = n == m
thm : zero == suc zero
thm = tt
| 13 | 38 | 0.607692 |
c5457a466043c43acc5f8e1389d8905f289cc53d | 297 | agda | Agda | test/Succeed/Issue384.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue384.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue384.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
module Issue384 where
postulate
D : (A : Set) → A → Set
data I : Set where
i : I
D′ : (A : Set) → A → I → Set
D′ A x i = D A x
postulate
Q : (A : Set) → A → Set
q : ∀ j A (x : A) → D′ A x j → Q A x
A : Set
x : A
d : D A x
P : (A : Set) → A → Set
p : P (Q _ _) (q _ _ _ d)
| 12.913043 | 38 | 0.430976 |
dfae9086da771455508f4d00073d0bb8f8af5b6e | 504 | agda | Agda | test/interaction/Issue2028-where.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/interaction/Issue2028-where.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/interaction/Issue2028-where.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Testcase for #2028 by Ulf
record ⊤ : Set where
constructor tt
data Either (A B : Set) : Set where
inl : A → Either A B
inr : B → Either A B
Subset : Set → Set₁
Subset X = X → Set
U : ∀ {X} → Subset X
U _ = {!⊤!}
_⊆_ : ∀ {X} → Subset X → Subset X → Set
A ⊆ B = ∀ {x} → A x → B x
_∪_ : ∀ {X} → Subset X → Su... | 18 | 44 | 0.494048 |
186b012a0fa5ce0f52ea64e0e6c6235e62b3cd53 | 1,123 | agda | Agda | src/Leftovers/Tests.agda | JoeyEremondi/AgdaLeftovers | 01b60b405009feaada181af175f019ceb89e42b2 | [
"BSD-3-Clause"
] | null | null | null | src/Leftovers/Tests.agda | JoeyEremondi/AgdaLeftovers | 01b60b405009feaada181af175f019ceb89e42b2 | [
"BSD-3-Clause"
] | null | null | null | src/Leftovers/Tests.agda | JoeyEremondi/AgdaLeftovers | 01b60b405009feaada181af175f019ceb89e42b2 | [
"BSD-3-Clause"
] | null | null | null | -- Like Leftovers.Examples, but more meant to stress-test the library
-- than to be clear/readable
module Leftovers.Tests where
open import Leftovers.Leftovers
open import Leftovers.ByRefl
open import Level
open import Reflection
open import Data.Nat
open import Relation.Binary.PropositionalEquality
open import Data... | 23.395833 | 78 | 0.649154 |
df2eeae107ecf1ffdd1dd07679c76dd7008d4465 | 1,139 | agda | Agda | test/Succeed/UnquoteExtLam.agda | vlopezj/agda | ff4d89e75970cf27599fb9f572bd43c9455cbb56 | [
"BSD-3-Clause"
] | 3 | 2015-03-28T14:51:03.000Z | 2015-12-07T20:14:00.000Z | test/Succeed/UnquoteExtLam.agda | vikfret/agda | 49ad0b3f0d39c01bc35123478b857e702b29fb9d | [
"BSD-3-Clause"
] | 3 | 2018-11-14T15:31:44.000Z | 2019-04-01T19:39:26.000Z | test/Succeed/UnquoteExtLam.agda | vikfret/agda | 49ad0b3f0d39c01bc35123478b857e702b29fb9d | [
"BSD-3-Clause"
] | 1 | 2015-09-15T14:36:15.000Z | 2015-09-15T14:36:15.000Z |
open import Common.Reflection
open import Common.Prelude
open import Common.Equality
pattern `Nat = def (quote Nat) []
pattern _`→_ a b = pi (vArg a) (abs "_" b)
pattern `Set = sort (lit 0)
pattern `⊥ = def (quote ⊥) []
pattern `zero = con (quote zero) []
pattern `suc n = con (quote suc) (vArg n ∷ [])
pr... | 24.234043 | 75 | 0.528534 |
dfbf46b6edda47a351d1eef6e6cd628569b89e2b | 32,980 | agda | Agda | Cubical/HITs/Sn/Properties.agda | howsiyu/cubical | 1b9c97a2140fe96fe636f4c66beedfd7b8096e8f | [
"MIT"
] | null | null | null | Cubical/HITs/Sn/Properties.agda | howsiyu/cubical | 1b9c97a2140fe96fe636f4c66beedfd7b8096e8f | [
"MIT"
] | null | null | null | Cubical/HITs/Sn/Properties.agda | howsiyu/cubical | 1b9c97a2140fe96fe636f4c66beedfd7b8096e8f | [
"MIT"
] | null | null | null | {-# OPTIONS --safe #-}
module Cubical.HITs.Sn.Properties where
open import Cubical.Foundations.Pointed
open import Cubical.Foundations.Path
open import Cubical.Foundations.Function
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Isomorphism
open import Cubi... | 47.521614 | 138 | 0.457186 |
103a873656a066d756994221ed57155022748f09 | 6,039 | agda | Agda | agda/par-swap/dpg-pot.agda | florence/esterel-calculus | 4340bef3f8df42ab8167735d35a4cf56243a45cd | [
"MIT"
] | 3 | 2020-04-16T10:58:53.000Z | 2020-07-01T03:59:31.000Z | agda/par-swap/dpg-pot.agda | florence/esterel-calculus | 4340bef3f8df42ab8167735d35a4cf56243a45cd | [
"MIT"
] | null | null | null | agda/par-swap/dpg-pot.agda | florence/esterel-calculus | 4340bef3f8df42ab8167735d35a4cf56243a45cd | [
"MIT"
] | 1 | 2020-04-15T20:02:49.000Z | 2020-04-15T20:02:49.000Z | module par-swap.dpg-pot where
open import Data.Empty
open import Data.Product
open import Data.Sum
open import Data.Bool
open import Data.List using ([] ; [_] ; _∷_ ; List ; _++_)
open import Relation.Binary.PropositionalEquality
using (_≡_ ; refl ; sym)
open import Data.Maybe using ()
open import Data.List.Any usin... | 32.820652 | 90 | 0.563669 |
20f6895f8b8e6fa566b3c64e0873f013e74f0763 | 721 | agda | Agda | Prelude/Char.agda | bbarenblat/B | c1fd2daa41aa1b915f74b4c09c6e62c79320e8ec | [
"Apache-2.0"
] | 1 | 2017-06-30T15:59:38.000Z | 2017-06-30T15:59:38.000Z | Prelude/Char.agda | bbarenblat/B | c1fd2daa41aa1b915f74b4c09c6e62c79320e8ec | [
"Apache-2.0"
] | null | null | null | Prelude/Char.agda | bbarenblat/B | c1fd2daa41aa1b915f74b4c09c6e62c79320e8ec | [
"Apache-2.0"
] | null | null | null | {- Copyright © 2015 Benjamin Barenblat
Licensed under the Apache License, Version 2.0 (the ‘License’); you may not use
this file except in compliance with the License. You may obtain a copy of the
License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | 27.730769 | 79 | 0.76699 |
20120e22d3bbd01f762bafa079945177c5b0f576 | 6,100 | agda | Agda | Cubical/Data/List/Properties.agda | L-TChen/cubical | 60226aacd7b386aef95d43a0c29c4eec996348a8 | [
"MIT"
] | null | null | null | Cubical/Data/List/Properties.agda | L-TChen/cubical | 60226aacd7b386aef95d43a0c29c4eec996348a8 | [
"MIT"
] | 1 | 2022-01-27T02:07:48.000Z | 2022-01-27T02:07:48.000Z | Cubical/Data/List/Properties.agda | L-TChen/cubical | 60226aacd7b386aef95d43a0c29c4eec996348a8 | [
"MIT"
] | 1 | 2021-11-22T02:02:01.000Z | 2021-11-22T02:02:01.000Z | {-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Data.List.Properties where
open import Agda.Builtin.List
open import Cubical.Core.Everything
open import Cubical.Foundations.GroupoidLaws
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Prelude
open import Cubical.Data.Empty as ⊥... | 34.463277 | 98 | 0.549672 |
c5c56ceae337d70b405a575d3a6bf46538fab515 | 1,249 | agda | Agda | Cubical/HITs/S1/Properties.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | Cubical/HITs/S1/Properties.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | Cubical/HITs/S1/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.S1.Properties where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.GroupoidLaws
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Isomorphism
open import Cubical.F... | 35.685714 | 102 | 0.60048 |
dc93983dd928ef4f4f9b7e8c87d264ede3505463 | 1,068 | agda | Agda | maybe.agda | logicshan/IAL | 2ad96390a9be5c238e73709a21533c7354cedd0c | [
"MIT"
] | null | null | null | maybe.agda | logicshan/IAL | 2ad96390a9be5c238e73709a21533c7354cedd0c | [
"MIT"
] | null | null | null | maybe.agda | logicshan/IAL | 2ad96390a9be5c238e73709a21533c7354cedd0c | [
"MIT"
] | null | null | null | module maybe where
open import level
open import eq
open import bool
----------------------------------------------------------------------
-- datatypes
----------------------------------------------------------------------
data maybe {ℓ}(A : Set ℓ) : Set ℓ where
just : A → maybe A
nothing : maybe A
-----------... | 27.384615 | 70 | 0.430712 |
c5e85d09da68cfcddf1da4c74fa4e1a6cb60b776 | 164 | agda | Agda | examples/syntax/highlighting/Test2.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | examples/syntax/highlighting/Test2.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | examples/syntax/highlighting/Test2.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | module Test2 where
open import Test
-- Testing the inter-file goto facility.
test : ℕ
test = 12 + 34 + 56
-- Testing qualified names.
Eq = Test.Equiv {Test.ℕ}
| 12.615385 | 40 | 0.689024 |
dccceca4d9339799de95bdc6ae2205c79c57967c | 2,848 | agda | Agda | theorems/homotopy/WedgeCofiber.agda | AntoineAllioux/HoTT-Agda | 1037d82edcf29b620677a311dcfd4fc2ade2faa6 | [
"MIT"
] | 294 | 2015-01-09T16:23:23.000Z | 2022-03-20T13:54:45.000Z | theorems/homotopy/WedgeCofiber.agda | AntoineAllioux/HoTT-Agda | 1037d82edcf29b620677a311dcfd4fc2ade2faa6 | [
"MIT"
] | 31 | 2015-03-05T20:09:00.000Z | 2021-10-03T19:15:25.000Z | theorems/homotopy/WedgeCofiber.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
{- The cofiber space of [winl : X → X ∨ Y] is equivalent to [Y],
- and the cofiber space of [winr : Y → X ∨ Y] is equivalent to [X]. -}
module homotopy.WedgeCofiber {i} (X Y : Ptd i) where
module CofWinl where
module Into = CofiberRec {f = winl} (pt Y... | 32.735632 | 82 | 0.482444 |
10d5d48387efc521554f5d14db1a7fb0539e302d | 169 | agda | Agda | test/Fail/Issue3892.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Fail/Issue3892.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Fail/Issue3892.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | -- Andreas, 2019-07-07, issue #3892
postulate Foo : Set
data Foo where
-- WAS: internal error
-- EXPECTED:
-- Multiple definitions of Foo. Previous definition at ...
| 16.9 | 58 | 0.704142 |
205c9790bc0e58c7e2ea906563a8348ad177b443 | 335 | agda | Agda | test/Hello.agda | googleson78/cornelis | e7f6eaea4be31748929b49a925a3a9365682e9ec | [
"BSD-3-Clause"
] | null | null | null | test/Hello.agda | googleson78/cornelis | e7f6eaea4be31748929b49a925a3a9365682e9ec | [
"BSD-3-Clause"
] | null | null | null | test/Hello.agda | googleson78/cornelis | e7f6eaea4be31748929b49a925a3a9365682e9ec | [
"BSD-3-Clause"
] | null | null | null | module Hello where
data Bool : Set where
true : Bool
false : Bool
data Unit : Set where
one : Unit
unit : Unit
unit = ?
test : Bool → Bool
test x = ?
unicodeTest₁ : Bool → Bool
unicodeTest₁ x = ?
slap : Bool → Bool
slap = λ { x → ? }
module _ where
testIndent : Bool → Bool
testIndent true = ?
testInd... | 12.407407 | 26 | 0.629851 |
d0e2b4a0949415b4f3d399c6f29bda63382029a8 | 4,729 | agda | Agda | src/Partiality-algebra/Monotone.agda | nad/partiality-monad | f69749280969f9093e5e13884c6feb0ad2506eae | [
"MIT"
] | 2 | 2020-05-21T22:59:18.000Z | 2020-07-03T08:56:08.000Z | src/Partiality-algebra/Monotone.agda | nad/partiality-monad | f69749280969f9093e5e13884c6feb0ad2506eae | [
"MIT"
] | null | null | null | src/Partiality-algebra/Monotone.agda | nad/partiality-monad | f69749280969f9093e5e13884c6feb0ad2506eae | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- Monotone functions
------------------------------------------------------------------------
{-# OPTIONS --erased-cubical --safe #-}
module Partiality-algebra.Monotone where
open import Equality.Propositional.Cubical
open import Prelude hidin... | 34.518248 | 110 | 0.506238 |
c5df27b7349587527475155402bc4502b3f177a5 | 548 | agda | Agda | test/Succeed/Issue4893.agda | cagix/agda | cc026a6a97a3e517bb94bafa9d49233b067c7559 | [
"BSD-2-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue4893.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue4893.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z | open import Agda.Primitive
variable
ℓ : Level
A : Set ℓ
P : A → Set ℓ
f : (x : A) → P x
postulate
R : (a : Level) → Set (lsuc a)
r : (a : Level) → R a
Id : (a : Level) (A : Set a) → A → A → Set a
cong₂ : (a b c : Level) (A : Set a) (B : Set b) (C : Set c) (x y : A) (u v : B)
(f : A → B → C)... | 24.909091 | 81 | 0.39781 |
4a9618d71d47c10172dd683ba2354c3cc0a1dc58 | 3,238 | agda | Agda | Structure/Setoid/Proofs.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | Structure/Setoid/Proofs.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | Structure/Setoid/Proofs.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | module Structure.Setoid.Proofs where
import Lvl
open import Functional
open import Logic
open import Logic.Propositional
open import Structure.Setoid
open import Structure.Function
open import Structure.Relator.Equivalence
open import Structure.Relator.Properties
{-
module _ where
private variable ℓ ℓ₁ ℓ₂ ℓ₃ : Le... | 42.051948 | 212 | 0.594812 |
0ed817e2cb24f94e8f1387ea55a06de836088dd3 | 12,023 | agda | Agda | src/container/m/from-nat/coalgebra.agda | pcapriotti/agda-base | bbbc3bfb2f80ad08c8e608cccfa14b83ea3d258c | [
"BSD-3-Clause"
] | 20 | 2015-06-12T12:20:17.000Z | 2022-02-01T11:25:54.000Z | src/container/m/from-nat/coalgebra.agda | pcapriotti/agda-base | bbbc3bfb2f80ad08c8e608cccfa14b83ea3d258c | [
"BSD-3-Clause"
] | 4 | 2015-02-02T14:32:16.000Z | 2016-10-26T11:57:26.000Z | src/container/m/from-nat/coalgebra.agda | pcapriotti/agda-base | bbbc3bfb2f80ad08c8e608cccfa14b83ea3d258c | [
"BSD-3-Clause"
] | 4 | 2015-02-02T12:17:00.000Z | 2019-05-04T19:31:00.000Z | {-# OPTIONS --without-K #-}
module container.m.from-nat.coalgebra where
open import level
open import sum
open import equality
open import function
open import sets.nat.core
open import sets.nat.struct
open import sets.unit
open import container.core
open import container.m.from-nat.core
open import container.m.from-n... | 37.22291 | 95 | 0.408051 |
0efd95bea92bef7aed09b0baee4b2fa311dbc66c | 1,302 | agda | Agda | src/Categories/Diagram/Pushout.agda | Trebor-Huang/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | 5 | 2019-05-21T17:07:19.000Z | 2019-05-22T03:54:24.000Z | src/Categories/Diagram/Pushout.agda | seanpm2001/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | null | null | null | src/Categories/Diagram/Pushout.agda | seanpm2001/agda-categories | d9e4f578b126313058d105c61707d8c8ae987fa8 | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
open import Categories.Category.Core using (Category)
module Categories.Diagram.Pushout {o ℓ e} (C : Category o ℓ e) where
open Category C
open HomReasoning
open Equiv
open import Categories.Morphism.Reasoning C as Square
renaming (glue to glue-square) hiding (id-unique)
open i... | 27.702128 | 78 | 0.476959 |
0e9264be68f7f26e811519ba29cd8eb2fe6877d1 | 601 | agda | Agda | src/TemporalOps/Common/Other.agda | DimaSamoz/temporal-type-systems | 7d993ba55e502d5ef8707ca216519012121a08dd | [
"MIT"
] | 4 | 2018-05-31T20:37:04.000Z | 2022-01-04T09:33:48.000Z | src/TemporalOps/Common/Other.agda | DimaSamoz/temporal-type-systems | 7d993ba55e502d5ef8707ca216519012121a08dd | [
"MIT"
] | null | null | null | src/TemporalOps/Common/Other.agda | DimaSamoz/temporal-type-systems | 7d993ba55e502d5ef8707ca216519012121a08dd | [
"MIT"
] | null | null | null |
{- Other common operations and lemmas. -}
module TemporalOps.Common.Other where
open import Relation.Binary.HeterogeneousEquality as ≅ hiding (inspect)
open import Relation.Binary.PropositionalEquality hiding (inspect)
-- Time indexing (for clarity, synonym of function appliation at any level)
_at_ : ∀ {a b} {A : S... | 28.619048 | 75 | 0.643927 |
23e4ce3007eb989d68cabd25f5f05653d961174a | 3,166 | agda | Agda | out/UTLC/Syntax.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 39 | 2021-11-09T20:39:55.000Z | 2022-03-19T17:33:12.000Z | out/UTLC/Syntax.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 1 | 2021-11-21T12:19:32.000Z | 2021-11-21T12:19:32.000Z | out/UTLC/Syntax.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 4 | 2021-11-09T20:39:59.000Z | 2022-01-24T12:49:17.000Z | {-
This second-order term syntax was created from the following second-order syntax description:
syntax UTLC | Λ
type
* : 0-ary
term
app : * * -> * | _$_ l20
lam : *.* -> * | ƛ_ r10
theory
(ƛβ) b : *.* a : * |> app (lam (x.b[x]), a) = b[a]
(ƛη) f : * |> lam (x.app (f, x)) = f
(lβ) b ... | 24.542636 | 93 | 0.520846 |
df010b3202fe630f912cd06312b3416397d508af | 707 | agda | Agda | formalization/Data/Nat/Literal.agda | brunoczim/Celeste | 9f5129d97ee7b89fb8e43136779a78806b7506ab | [
"MIT"
] | 1 | 2020-09-16T17:31:57.000Z | 2020-09-16T17:31:57.000Z | formalization/Data/Nat/Literal.agda | brunoczim/Celeste | 9f5129d97ee7b89fb8e43136779a78806b7506ab | [
"MIT"
] | null | null | null | formalization/Data/Nat/Literal.agda | brunoczim/Celeste | 9f5129d97ee7b89fb8e43136779a78806b7506ab | [
"MIT"
] | null | null | null | module Data.Nat.Literal where
open import Data.Nat using (ℕ; suc; zero)
open import Data.Fin using (Fin; suc; zero)
open import Data.Unit using (⊤)
open import Data.Empty using (⊥)
open import Agda.Builtin.FromNat using (Number; fromNat) public
_≤_ : ℕ → ℕ → Set
zero ≤ n = ⊤
suc m ≤ zero = ⊥
suc m ≤ suc n = m ≤... | 26.185185 | 63 | 0.606789 |
cbc438889e740731d837f77c353d71de24c90c4d | 219 | agda | Agda | src/data/lib/prim/Agda/Builtin/IO.agda | pthariensflame/agda | 222c4c64b2ccf8e0fc2498492731c15e8fef32d4 | [
"BSD-3-Clause"
] | null | null | null | src/data/lib/prim/Agda/Builtin/IO.agda | pthariensflame/agda | 222c4c64b2ccf8e0fc2498492731c15e8fef32d4 | [
"BSD-3-Clause"
] | null | null | null | src/data/lib/prim/Agda/Builtin/IO.agda | pthariensflame/agda | 222c4c64b2ccf8e0fc2498492731c15e8fef32d4 | [
"BSD-3-Clause"
] | null | null | null | {-# OPTIONS --without-K #-}
module Agda.Builtin.IO where
postulate IO : ∀ {a} → Set a → Set a
{-# BUILTIN IO IO #-}
{-# HASKELL type AgdaIO a b = IO b #-}
{-# COMPILED_TYPE IO MAlonzo.Code.Agda.Builtin.IO.AgdaIO #-}
| 21.9 | 60 | 0.625571 |
cb373bbc3115c87b123d89fd702b30889277fe8f | 761 | agda | Agda | main/Graphs/Properties.agda | awswan/nielsenschreier-hott | 84be713b8a8e41ea6f01f8ccf7251ebbbd73ad5d | [
"MIT"
] | null | null | null | main/Graphs/Properties.agda | awswan/nielsenschreier-hott | 84be713b8a8e41ea6f01f8ccf7251ebbbd73ad5d | [
"MIT"
] | null | null | null | main/Graphs/Properties.agda | awswan/nielsenschreier-hott | 84be713b8a8e41ea6f01f8ccf7251ebbbd73ad5d | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --exact-split --rewriting #-}
open import lib.Basics
open import lib.NConnected
open import Graphs.Definition
open import Coequalizers.Definition
{- We will consider two properties of graphs: if they are trees and if they are connected,
both are defined in terms of the geometric realisatio... | 38.05 | 95 | 0.701708 |
cb5aaea3c61879cf3492b9a1b3ff4e85025c37ed | 587 | agda | Agda | test/Succeed/Issue1207.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue1207.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue1207.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 371 | 2015-01-03T14:04:08.000Z | 2022-03-30T19:00:30.000Z |
open import Common.Level
open import Common.Prelude
open import Common.Reflection
open import Common.Equality
postulate
a b : Level
data Check : Set where
check : (x y : Term) → x ≡ y → Check
pattern _==_ x y = check x y refl
pattern `a = def (quote a) []
pattern `b = def (quote b) []
pattern `suc x = def (quo... | 24.458333 | 57 | 0.614991 |
dffde1ba9182c6750cd086971b51dc3b828c8cdb | 1,080 | agda | Agda | theorems/homotopy/RelativelyConstantToSetExtendsViaSurjection.agda | mikeshulman/HoTT-Agda | e7d663b63d89f380ab772ecb8d51c38c26952dbb | [
"MIT"
] | null | null | null | theorems/homotopy/RelativelyConstantToSetExtendsViaSurjection.agda | mikeshulman/HoTT-Agda | e7d663b63d89f380ab772ecb8d51c38c26952dbb | [
"MIT"
] | null | null | null | theorems/homotopy/RelativelyConstantToSetExtendsViaSurjection.agda | mikeshulman/HoTT-Agda | e7d663b63d89f380ab772ecb8d51c38c26952dbb | [
"MIT"
] | 1 | 2018-12-26T21:31:57.000Z | 2018-12-26T21:31:57.000Z | {-# OPTIONS --without-K --rewriting #-}
open import HoTT
import homotopy.ConstantToSetExtendsToProp as ConstExt
module homotopy.RelativelyConstantToSetExtendsViaSurjection
{i j k} {A : Type i} {B : Type j} {C : B → Type k}
(C-is-set : ∀ b → is-set (C b))
(f : A → B) (f-is-surj : is-surj f)
(g : (a : A) → C (f... | 27.692308 | 71 | 0.489815 |
dfd178210cefdfe56608da8363fa8834c22d34c9 | 5,188 | agda | Agda | test/Instances.agda | mchristianl/synthetic-reals | 10206b5c3eaef99ece5d18bf703c9e8b2371bde4 | [
"MIT"
] | 3 | 2020-07-31T18:15:26.000Z | 2022-02-19T12:15:21.000Z | test/Instances.agda | mchristianl/synthetic-reals | 10206b5c3eaef99ece5d18bf703c9e8b2371bde4 | [
"MIT"
] | null | null | null | test/Instances.agda | mchristianl/synthetic-reals | 10206b5c3eaef99ece5d18bf703c9e8b2371bde4 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --no-import-sorts --prop #-}
module Instances where
open import Cubical.Foundations.Everything renaming (_⁻¹ to _⁻¹ᵖ)
open import Agda.Primitive renaming (_⊔_ to ℓ-max; lsuc to ℓ-suc; lzero to ℓ-zero)
open import Cubical.Relation.Nullary.Base -- ¬_
open import Cubical.Relation.Binary.Base
open i... | 36.27972 | 140 | 0.559753 |
3915a009c16b36f12099e7bdf0b8140d893b6279 | 29,943 | agda | Agda | src/FOmegaInt/Typing.agda | Blaisorblade/f-omega-int-agda | ae20dac2a5e0c18dff2afda4c19954e24d73a24f | [
"MIT"
] | null | null | null | src/FOmegaInt/Typing.agda | Blaisorblade/f-omega-int-agda | ae20dac2a5e0c18dff2afda4c19954e24d73a24f | [
"MIT"
] | null | null | null | src/FOmegaInt/Typing.agda | Blaisorblade/f-omega-int-agda | ae20dac2a5e0c18dff2afda4c19954e24d73a24f | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- Typing and kinding of Fω with interval kinds
------------------------------------------------------------------------
{-# OPTIONS --safe --without-K #-}
module FOmegaInt.Typing where
open import Data.Context.WellFormed
open import Data.Fin u... | 39.977303 | 79 | 0.437765 |
0e22ce71af8b408961e50544a8b0bc9c35d41438 | 161 | agda | Agda | Cubical/Codata/Stream.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | 1 | 2020-03-23T23:52:11.000Z | 2020-03-23T23:52:11.000Z | Cubical/Codata/Stream.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | Cubical/Codata/Stream.agda | limemloh/cubical | df4ef7edffd1c1deb3d4ff342c7178e9901c44f1 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical #-}
module Cubical.Codata.Stream where
open import Cubical.Codata.Stream.Base public
open import Cubical.Codata.Stream.Properties public
| 23 | 51 | 0.795031 |
df5abf9f90815fa57da1b8a9b3e4985afb379440 | 448 | agda | Agda | tests/covered/plantsigma.agda | andrejtokarcik/agda-semantics | dc333ed142584cf52cc885644eed34b356967d8b | [
"MIT"
] | 3 | 2015-08-10T15:33:56.000Z | 2018-12-06T17:24:25.000Z | tests/covered/plantsigma.agda | andrejtokarcik/agda-semantics | dc333ed142584cf52cc885644eed34b356967d8b | [
"MIT"
] | null | null | null | tests/covered/plantsigma.agda | andrejtokarcik/agda-semantics | dc333ed142584cf52cc885644eed34b356967d8b | [
"MIT"
] | null | null | null | module plantsigma where
data Tree : Set where
oak : Tree
pine : Tree
spruce : Tree
data Flower : Set where
rose : Flower
lily : Flower
data PlantGroup : Set where
tree : PlantGroup
flower : PlantGroup
PlantsInGroup : PlantGroup -> Set
PlantsInGroup tree = Tree
PlantsInGroup flower = Flower... | 15.448276 | 54 | 0.674107 |
2350c23187375564eeae15a99e0d83beec363005 | 3,355 | agda | Agda | Cubical/Structures/CommRing.agda | ryanorendorff/cubical | c67854d2e11aafa5677e25a09087e176fafd3e43 | [
"MIT"
] | 1 | 2020-03-23T23:52:11.000Z | 2020-03-23T23:52:11.000Z | Cubical/Structures/CommRing.agda | ryanorendorff/cubical | c67854d2e11aafa5677e25a09087e176fafd3e43 | [
"MIT"
] | null | null | null | Cubical/Structures/CommRing.agda | ryanorendorff/cubical | c67854d2e11aafa5677e25a09087e176fafd3e43 | [
"MIT"
] | null | null | null | {-# OPTIONS --cubical --safe #-}
module Cubical.Structures.CommRing where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.HLevels
open import Cubical.Data.Sigma
open import Cubical.Foundations.SIP renaming (SNS-PathP to SNS)
open import Cubical.Structures... | 30.5 | 107 | 0.658718 |
d03089c2677278dff2a710b2d90124ad2f5ba972 | 7,633 | agda | Agda | Cubical/Algebra/Algebra/Properties.agda | thomas-lamiaux/cubical | 58c0b83bb0fed0dc683f3d29b1709effe51c1689 | [
"MIT"
] | null | null | null | Cubical/Algebra/Algebra/Properties.agda | thomas-lamiaux/cubical | 58c0b83bb0fed0dc683f3d29b1709effe51c1689 | [
"MIT"
] | null | null | null | Cubical/Algebra/Algebra/Properties.agda | thomas-lamiaux/cubical | 58c0b83bb0fed0dc683f3d29b1709effe51c1689 | [
"MIT"
] | null | null | null | {-# OPTIONS --safe #-}
module Cubical.Algebra.Algebra.Properties where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Function
open import Cubical.Foundations.Isomorphism
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.GroupoidLaws
... | 43.867816 | 102 | 0.554435 |
cb3cde5424685522eca6898731540be8c2e47972 | 7,672 | agda | Agda | Cubical/Foundations/Univalence.agda | jonsterling/cubical-1 | 794b550f40562e025b5570badd78fdc2e6597779 | [
"MIT"
] | null | null | null | Cubical/Foundations/Univalence.agda | jonsterling/cubical-1 | 794b550f40562e025b5570badd78fdc2e6597779 | [
"MIT"
] | null | null | null | Cubical/Foundations/Univalence.agda | jonsterling/cubical-1 | 794b550f40562e025b5570badd78fdc2e6597779 | [
"MIT"
] | null | null | null | {-
Proof of the standard formulation of the univalence theorem and
various consequences of univalence
- Re-exports Glue types from Cubical.Core.Glue
- The ua constant and its computation rule (up to a path)
- Proof of univalence using that unglue is an equivalence ([EquivContr])
- Equivalence induction ([EquivJ], [el... | 41.026738 | 101 | 0.55305 |
100eedacc5c506b03d1c982f5b0177e173dbf582 | 175,649 | agda | Agda | Reals.agda | z-murray/AnalysisAgda | 6fbaca08b1d63b5765d184f6284fb0e58c9f5e52 | [
"MIT"
] | null | null | null | Reals.agda | z-murray/AnalysisAgda | 6fbaca08b1d63b5765d184f6284fb0e58c9f5e52 | [
"MIT"
] | null | null | null | Reals.agda | z-murray/AnalysisAgda | 6fbaca08b1d63b5765d184f6284fb0e58c9f5e52 | [
"MIT"
] | null | null | null | {-# OPTIONS --without-K --safe #-}
open import Algebra
open import Data.Bool.Base using (Bool; if_then_else_)
open import Function.Base using (_∘_)
open import Data.Integer.Base as ℤ
using (ℤ; +_; +0; +[1+_]; -[1+_]; +<+; +≤+)
import Data.Integer.Properties as ℤP
open import Data.Integer.DivMod as ℤD
open i... | 47.103513 | 174 | 0.335829 |
d0f092b42373af96a5bf977f9cf9e32986bc6197 | 398 | agda | Agda | test/Succeed/Issue2223c.agda | mdimjasevic/agda | 8fb548356b275c7a1e79b768b64511ae937c738b | [
"BSD-3-Clause"
] | 1,989 | 2015-01-09T23:51:16.000Z | 2022-03-30T18:20:48.000Z | test/Succeed/Issue2223c.agda | Seanpm2001-languages/agda | 9911f73061e21a87fad76c662463257afe02c861 | [
"BSD-2-Clause"
] | 4,066 | 2015-01-10T11:24:51.000Z | 2022-03-31T21:14:49.000Z | test/Succeed/Issue2223c.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.Primitive
module _ (a ℓ ℓ' : Level) where
mutual
X : Level
X = _ -- Agda 2.5.1.1 solves this level meta
hyp : Set₁
hyp with (lsuc ℓ')
... | _ = Set
where
X<=a : Set (X ⊔ a) → Set a
X<=a A = A
test : Set₁
test with (lsuc ℓ)
..... | 15.92 | 49 | 0.462312 |
df8d448e16aa68f9d8460e7ae34349b3d2b6712f | 18,005 | agda | Agda | explore/typecheck/UntypingPairs.agda | TristanCacqueray/disco | bb5b6773584253cfa84adf2111e39c9359506019 | [
"BSD-3-Clause"
] | 138 | 2016-12-10T08:10:03.000Z | 2022-01-22T22:56:45.000Z | explore/typecheck/UntypingPairs.agda | Boarders/disco | 7abce0acde1b0bbc993c76adc18b5b09230bf030 | [
"BSD-3-Clause"
] | 282 | 2016-11-19T18:05:42.000Z | 2022-03-28T21:43:15.000Z | explore/typecheck/UntypingPairs.agda | Boarders/disco | 7abce0acde1b0bbc993c76adc18b5b09230bf030 | [
"BSD-3-Clause"
] | 20 | 2017-02-18T20:36:05.000Z | 2021-07-30T05:37:45.000Z | module UntypingPairs where
open import Relation.Binary.PropositionalEquality
open import Function using (id)
open import Data.Empty
open import Data.Unit
open import Relation.Nullary
open import Data.Nat
open import Data.Fin
open import Data.Vec
open import Data.Sum
open import Data.Product
open import Data.List
open... | 41.107306 | 123 | 0.471036 |
20cb577153a9a9617eea25fc6c19577d9d8f6fee | 4,010 | agda | Agda | src/data/lib/prim/Agda/Builtin/Nat.agda | vlopezj/agda | ff4d89e75970cf27599fb9f572bd43c9455cbb56 | [
"BSD-3-Clause"
] | 2 | 2019-10-29T09:40:30.000Z | 2020-09-20T00:28:57.000Z | src/data/lib/prim/Agda/Builtin/Nat.agda | vikfret/agda | 49ad0b3f0d39c01bc35123478b857e702b29fb9d | [
"BSD-3-Clause"
] | 3 | 2018-11-14T15:31:44.000Z | 2019-04-01T19:39:26.000Z | src/data/lib/prim/Agda/Builtin/Nat.agda | vikfret/agda | 49ad0b3f0d39c01bc35123478b857e702b29fb9d | [
"BSD-3-Clause"
] | 1 | 2021-04-01T18:30:09.000Z | 2021-04-01T18:30:09.000Z | {-# OPTIONS --without-K --safe --no-universe-polymorphism --no-sized-types --no-guardedness #-}
module Agda.Builtin.Nat where
open import Agda.Builtin.Bool
data Nat : Set where
zero : Nat
suc : (n : Nat) → Nat
{-# BUILTIN NATURAL Nat #-}
infix 4 _==_ _<_
infixl 6 _+_ _-_
infixl 7 _*_
_+_ : Nat → Nat → Nat
z... | 29.925373 | 95 | 0.471571 |
df3b2ba8abfb7618fd1ae36a0aa713e382e997a1 | 5,998 | agda | Agda | Cubical/Structures/Relational/Product.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | Cubical/Structures/Relational/Product.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | 1 | 2022-01-27T02:07:48.000Z | 2022-01-27T02:07:48.000Z | Cubical/Structures/Relational/Product.agda | kiana-S/univalent-foundations | 8bdb0766260489f9c89a14f4c0f2ad26e5190dec | [
"MIT"
] | null | null | null | {-
Product of structures S and T: X ↦ S X × T X
-}
{-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Structures.Relational.Product where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.Function
open import Cubical.Foundations.HLevels
open ... | 42.539007 | 103 | 0.624875 |
c56259d3081466dece6b4dca258dda0683d95ef4 | 12,627 | agda | Agda | Examples.agda | luminousfennell/polybta | ef878f7fa5afa51fb7a14cd8f7f75da0af1b9deb | [
"BSD-3-Clause"
] | 1 | 2019-10-15T04:35:29.000Z | 2019-10-15T04:35:29.000Z | Examples.agda | luminousfennell/polybta | ef878f7fa5afa51fb7a14cd8f7f75da0af1b9deb | [
"BSD-3-Clause"
] | null | null | null | Examples.agda | luminousfennell/polybta | ef878f7fa5afa51fb7a14cd8f7f75da0af1b9deb | [
"BSD-3-Clause"
] | 1 | 2019-10-15T09:01:37.000Z | 2019-10-15T09:01:37.000Z | module Examples where
-- The terms of AExp assign a binding time to each subterm. For
-- program specialization, we interpret terms with dynamic binding
-- time as the programs subject to specialization, and their subterms
-- with static binding time as statically known inputs. A partial
-- evaluation function (or spe... | 33.228947 | 118 | 0.548666 |
cb80acc682c4d5b3e2c5659c3042b44f5751e989 | 2,714 | agda | Agda | Type/WellOrdering.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | 6 | 2020-04-07T17:58:13.000Z | 2022-02-05T06:53:22.000Z | Type/WellOrdering.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | Type/WellOrdering.agda | Lolirofle/stuff-in-agda | 70f4fba849f2fd779c5aaa5af122ccb6a5b271ba | [
"MIT"
] | null | null | null | module Type.WellOrdering where
import Lvl
open import Functional
open import Logic
open import Logic.Propositional
open import Logic.Predicate
open import Type
open import Type.Dependent
private variable ℓ ℓ₁ ℓ₂ : Lvl.Level
-- Types with terms that are well-founded trees.
-- Constructs types that are similar to... | 46.793103 | 256 | 0.585851 |
dcb907ecd92c2056250e5f430ae2cee52b44204e | 2,998 | agda | Agda | SOAS/Coalgebraic/Strength.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 39 | 2021-11-09T20:39:55.000Z | 2022-03-19T17:33:12.000Z | SOAS/Coalgebraic/Strength.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 1 | 2021-11-21T12:19:32.000Z | 2021-11-21T12:19:32.000Z | SOAS/Coalgebraic/Strength.agda | JoeyEremondi/agda-soas | ff1a985a6be9b780d3ba2beff68e902394f0a9d8 | [
"MIT"
] | 4 | 2021-11-09T20:39:59.000Z | 2022-01-24T12:49:17.000Z |
-- Coalgebraic strength over an endofunctor
module SOAS.Coalgebraic.Strength {T : Set} where
open import SOAS.Common
open import SOAS.Context
open import SOAS.Variable
open import SOAS.Families.Core {T}
open import SOAS.Abstract.Hom {T}
import SOAS.Abstract.Coalgebra {T} as →□ ; open →□.Sorted
open import SOAS.Coalg... | 35.690476 | 81 | 0.482655 |
df6f1ab752c44427862e0734ff3b82cabaec0830 | 1,715 | agda | Agda | old/Homotopy/Wedge.agda | AntoineAllioux/HoTT-Agda | 1037d82edcf29b620677a311dcfd4fc2ade2faa6 | [
"MIT"
] | 294 | 2015-01-09T16:23:23.000Z | 2022-03-20T13:54:45.000Z | old/Homotopy/Wedge.agda | AntoineAllioux/HoTT-Agda | 1037d82edcf29b620677a311dcfd4fc2ade2faa6 | [
"MIT"
] | 31 | 2015-03-05T20:09:00.000Z | 2021-10-03T19:15:25.000Z | old/Homotopy/Wedge.agda | AntoineAllioux/HoTT-Agda | 1037d82edcf29b620677a311dcfd4fc2ade2faa6 | [
"MIT"
] | 50 | 2015-01-10T01:48:08.000Z | 2022-02-14T03:03:25.000Z | {-# OPTIONS --without-K #-}
open import Base
open import Homotopy.Connected
{-
Wedge is a pushout.
-}
module Homotopy.Wedge
where
import Homotopy.Pushout as P
record wedge-diag i : Set (suc i) where
constructor diag_,_,_,_
field
A : Set i
B : Set i
a : A
b : B
f : uni... | 24.855072 | 103 | 0.528863 |
c56dfb936920b21f666733b2eb8dee04b800bd83 | 4,916 | agda | Agda | src/Data/Context.agda | Blaisorblade/f-omega-int-agda | ae20dac2a5e0c18dff2afda4c19954e24d73a24f | [
"MIT"
] | null | null | null | src/Data/Context.agda | Blaisorblade/f-omega-int-agda | ae20dac2a5e0c18dff2afda4c19954e24d73a24f | [
"MIT"
] | null | null | null | src/Data/Context.agda | Blaisorblade/f-omega-int-agda | ae20dac2a5e0c18dff2afda4c19954e24d73a24f | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------
-- Abstract typing contexts
------------------------------------------------------------------------
{-# OPTIONS --safe --without-K #-}
module Data.Context where
open import Data.Fin using (Fin)
open import Data.Fin.Substitution
open import Dat... | 33.671233 | 79 | 0.584011 |
106b204f6c9ad658a6b7b7b16272a8553bf07330 | 799 | agda | Agda | src/fot/FOTC/Program/ABP/PropertiesI.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 11 | 2015-09-03T20:53:42.000Z | 2021-09-12T16:09:54.000Z | src/fot/FOTC/Program/ABP/PropertiesI.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 2 | 2016-10-12T17:28:16.000Z | 2017-01-01T14:34:26.000Z | src/fot/FOTC/Program/ABP/PropertiesI.agda | asr/fotc | 2fc9f2b81052a2e0822669f02036c5750371b72d | [
"MIT"
] | 3 | 2016-09-19T14:18:30.000Z | 2018-03-14T08:50:00.000Z | ------------------------------------------------------------------------------
-- Common properties for the alternating bit protocol
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-univ... | 33.291667 | 78 | 0.444305 |
10381222abae558cfd1a3d3a5e6bf9cd74634bd7 | 1,065 | agda | Agda | src/17-promotion/Vector.agda | janat08/wiwinwlh | f7bce666068d5e08c5d1361c20ebc20e3a6dd25a | [
"BSD-Source-Code"
] | 2,479 | 2015-01-01T14:39:03.000Z | 2022-03-29T15:34:03.000Z | src/17-promotion/Vector.agda | janat08/wiwinwlh | f7bce666068d5e08c5d1361c20ebc20e3a6dd25a | [
"BSD-Source-Code"
] | 151 | 2015-01-16T07:43:41.000Z | 2021-06-29T15:20:06.000Z | src/17-promotion/Vector.agda | janat08/wiwinwlh | f7bce666068d5e08c5d1361c20ebc20e3a6dd25a | [
"BSD-Source-Code"
] | 339 | 2015-01-01T19:23:43.000Z | 2022-03-26T17:55:39.000Z | module Vector where
infixr 10 _∷_
data ℕ : Set where
zero : ℕ
suc : ℕ → ℕ
{-# BUILTIN NATURAL ℕ #-}
{-# BUILTIN ZERO zero #-}
{-# BUILTIN SUC suc #-}
infixl 6 _+_
_+_ : ℕ → ℕ → ℕ
0 + n = n
suc m + n = suc (m + n)
data Vec (A : Set) : ℕ → Set where
[] : Vec A 0
_∷_ : ∀ {n} → A → Vec A n → Vec ... | 20.480769 | 80 | 0.478873 |
20c1da83edb91e6d905063a3f1da61df67ecc6a4 | 51,529 | agda | Agda | src/FOmegaInt/Syntax.agda | sstucki/f-omega-int-agda | ae648c9520895a8428a7ad80f47bb55ecf4d50ea | [
"MIT"
] | 12 | 2017-06-13T16:05:35.000Z | 2021-09-27T05:53:06.000Z | src/FOmegaInt/Syntax.agda | sstucki/f-omega-int-agda | ae648c9520895a8428a7ad80f47bb55ecf4d50ea | [
"MIT"
] | 1 | 2021-05-14T08:09:40.000Z | 2021-05-14T08:54:39.000Z | src/FOmegaInt/Syntax.agda | sstucki/f-omega-int-agda | ae648c9520895a8428a7ad80f47bb55ecf4d50ea | [
"MIT"
] | 2 | 2021-05-13T22:29:48.000Z | 2021-05-14T10:25:05.000Z | ------------------------------------------------------------------------
-- Syntax of Fω with interval kinds
------------------------------------------------------------------------
{-# OPTIONS --safe --without-K #-}
module FOmegaInt.Syntax where
open import Algebra using (Monoid)
import Data.Context as Context
open... | 36.288028 | 80 | 0.51113 |
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.