Search is not available for this dataset
text string | meta dict |
|---|---|
{-# OPTIONS --with-K --safe --no-sized-types --no-guardedness
--no-subtyping #-}
module Agda.Builtin.Equality.Erase where
open import Agda.Builtin.Equality
primitive primEraseEquality : ∀ {a} {A : Set a} {x y : A} → x ≡ y → x ≡ y
| {
"alphanum_fraction": 0.6326530612,
"avg_line_length": 27.2222222222,
"ext": "agda",
"hexsha": "07faadc05bc2366ea29518570900a72dbff738fa",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-04-18T13:34:07.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-04-18T... |
------------------------------------------------------------------------
-- "Reasoning" combinators
------------------------------------------------------------------------
open import Atom
module Reasoning (atoms : χ-atoms) where
open import Equality.Propositional
open import Chi atoms
open import Values atoms
... | {
"alphanum_fraction": 0.4489913545,
"avg_line_length": 27.9838709677,
"ext": "agda",
"hexsha": "905b0feb0af406c60287d584ce1d5d1b04c5e34c",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
test = Prop
| {
"alphanum_fraction": 0.6153846154,
"avg_line_length": 4.3333333333,
"ext": "agda",
"hexsha": "3a5e6afa9bcd95f1bdfe42c95b65f7682476720c",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-03... |
------------------------------------------------------------------------
-- The Agda standard library
--
-- Decorated star-lists
------------------------------------------------------------------------
module Data.Star.Decoration where
open import Data.Star
open import Relation.Binary
open import Function
open import... | {
"alphanum_fraction": 0.5003265839,
"avg_line_length": 33.2826086957,
"ext": "agda",
"hexsha": "0e954ccfad75428640cd94d3664ec3b4d36314c5",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module Issue1701.ModParamsToLose where
module Param (A : Set) where
module R (B : Set) (G : A → B) where
F = G
private
module Tmp (B : Set) (G : A → B) where
module r = R B G
open Tmp public
module Works (A : Set) where
module ParamA = Param A
open ParamA
works : (A → A) → A → A
works G ... | {
"alphanum_fraction": 0.5860215054,
"avg_line_length": 16.1739130435,
"ext": "agda",
"hexsha": "10c75a554c1efe786a6d1ad13c0734bb7a497375",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
{- Basic definitions using Σ-types
Σ-types are defined in Core/Primitives as they are needed for Glue types.
The file contains:
- Non-dependent pair types: A × B
- Mere existence: ∃[x ∈ A] B
- Unique existence: ∃![x ∈ A] B
-}
{-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Data.Sigma.Base where
o... | {
"alphanum_fraction": 0.5753176044,
"avg_line_length": 20.7924528302,
"ext": "agda",
"hexsha": "13c9745ad8708f1171dd5014975461a78ebec59e",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-11-22T02:02:01.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-11-22T... |
{-# OPTIONS --without-K --safe #-}
module Categories.Category.Dagger.Instance.Rels where
open import Data.Product
open import Function
open import Relation.Binary.PropositionalEquality
open import Level
open import Categories.Category.Dagger
open import Categories.Category.Instance.Rels
RelsHasDagger : ∀ {o ℓ} → Has... | {
"alphanum_fraction": 0.6671348315,
"avg_line_length": 27.3846153846,
"ext": "agda",
"hexsha": "3f35a16c326deb12bf2db3188e8b48ad53792985",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module Categories.Fam where
open import Level
open import Relation.Binary using (Rel)
import Relation.Binary.HeterogeneousEquality as Het
open Het using (_≅_) renaming (refl to ≣-refl)
open import Categories.Support.PropositionalEquality
open import Categories.Category
module Fam {a b : Level} where
record Fam : ... | {
"alphanum_fraction": 0.4443418014,
"avg_line_length": 31.8382352941,
"ext": "agda",
"hexsha": "a02f75789e3792ecf17a8368e8d47a451524d0bf",
"lang": "Agda",
"max_forks_count": 23,
"max_forks_repo_forks_event_max_datetime": "2021-11-11T13:50:56.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-02-05... |
record R (A : Set) : Set where
constructor c₂
field
f : A → A
g : A → A
g x = f (f x)
open R public
_ : (@0 A : Set) → R A → A → A
_ = λ A → g {A = A}
| {
"alphanum_fraction": 0.4518072289,
"avg_line_length": 12.7692307692,
"ext": "agda",
"hexsha": "c7c5ec08fd2f0126c22189082b069731c493cc8d",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
{-# OPTIONS --without-K #-}
module SetoidEquiv where
open import Level using (Level; _⊔_)
open import Function.Equality using (_∘_; _⟶_; _⟨$⟩_)
open import Relation.Binary using (Setoid; module Setoid)
open import Relation.Binary.PropositionalEquality as P using (setoid)
open Setoid
infix 4 _≃S_
----... | {
"alphanum_fraction": 0.513029316,
"avg_line_length": 32.7466666667,
"ext": "agda",
"hexsha": "544972810f8d84e7f1834f170c9d59352d13d202",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2019-09-10T09:47:13.000Z",
"max_forks_repo_forks_event_min_datetime": "2016-05-29T0... |
{- Byzantine Fault Tolerant Consensus Verification in Agda, version 0.9.
Copyright (c) 2021, Oracle and/or its affiliates.
Licensed under the Universal Permissive License v 1.0 as shown at https://opensource.oracle.com/licenses/upl
-}
open import LibraBFT.Base.Types
import LibraBFT.Impl.Consensus.Consensus... | {
"alphanum_fraction": 0.6985975126,
"avg_line_length": 46.0853658537,
"ext": "agda",
"hexsha": "1c817c0dc3a0bb035e5e2e233ba2dfd44361ef09",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
-- Andreas, 2013-10-21 fixed this issue
-- by refactoring Internal to spine syntax.
module Issue901 where
open import Common.Level
record Ls : Set where
constructor _,_
field
fst : Level
snd : Level
open Ls
record R (ls : Ls) : Set (lsuc (fst ls ⊔ snd ls)) where
field
A : Set (fst ls)
B : Set (... | {
"alphanum_fraction": 0.6740331492,
"avg_line_length": 19.6739130435,
"ext": "agda",
"hexsha": "5a1a257f2e157346e4aabdbc0eb382d80a6167e8",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
module halt where
open import Level renaming ( zero to Zero ; suc to Suc )
open import Data.Nat
open import Data.Maybe
open import Data.List hiding ([_])
open import Data.Nat.Properties
open import Relation.Nullary
open import Data.Empty
open import Data.Unit
open import Relation.Binary.Core hiding (_⇔_)
open import ... | {
"alphanum_fraction": 0.5300255043,
"avg_line_length": 36.8632478632,
"ext": "agda",
"hexsha": "cd8a8f386d7cb6cc2d5ead9af22d84f08d35ae34",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
------------------------------------------------------------------------------
-- Properties of the inequalities
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorphism #-... | {
"alphanum_fraction": 0.4436590087,
"avg_line_length": 38.4563106796,
"ext": "agda",
"hexsha": "79ed1662475f0bd444bce096f2ecdea54a9ab4e8",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2018-03-14T08:50:00.000Z",
"max_forks_repo_forks_event_min_datetime": "2016-09-19T... |
open import MLib.Prelude.FromStdlib
open import Relation.Binary using (Rel; _Respects₂_; IsStrictTotalOrder)
open FE using (Π)
module MLib.Prelude.DFS.ViaInjection
{v v′ e}
(V-setoid : Setoid v v′)
(E : Rel (Setoid.Carrier V-setoid) e)
(E-subst : E Respects₂ (Setoid._≈_ V-setoid))
{i p} {I : Set i}
{_<_ : ... | {
"alphanum_fraction": 0.6762589928,
"avg_line_length": 41.265625,
"ext": "agda",
"hexsha": "ac515a216f2dda4c97f3843a830c7c0b46f0e901",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hexsha... |
open import FRP.JS.Behaviour using ( Beh ; map )
open import FRP.JS.DOM using ( DOM ; text ; element )
open import FRP.JS.RSet using ( ⟦_⟧ )
open import FRP.JS.Time using ( toUTCString ; every )
open import FRP.JS.Delay using ( _sec )
module FRP.JS.Demo.Clock where
main : ∀ {w} → ⟦ Beh (DOM w) ⟧
main = text (map toUT... | {
"alphanum_fraction": 0.6802325581,
"avg_line_length": 34.4,
"ext": "agda",
"hexsha": "4fb30f8ca4c0d2898cc17718a14aaa4f57b5edb5",
"lang": "Agda",
"max_forks_count": 7,
"max_forks_repo_forks_event_max_datetime": "2022-03-12T11:39:38.000Z",
"max_forks_repo_forks_event_min_datetime": "2016-11-07T21:50:58.... |
open import Type
module Graph.Walk {ℓ₁ ℓ₂} {V : Type{ℓ₁}} where
import Lvl
open import Graph{ℓ₁}{ℓ₂}(V)
import Structure.Relator.Names as Names
module _ (_⟶_ : Graph) where
-- A path is matching directed edges connected to each other in a finite sequence.
-- This is essentially a list of edges where th... | {
"alphanum_fraction": 0.6885026738,
"avg_line_length": 41.5555555556,
"ext": "agda",
"hexsha": "2ecbe5323a80add6bb68aeff5884e41ba7dee25d",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
open import Prelude
module Implicits.Substitutions where
import Implicits.Substitutions.Context as CtxSubst
open import Implicits.Substitutions.Term
module TypeSubst where
open import Implicits.Substitutions.Type public
open import Implicits.Substitutions.MetaType public
open TypeSubst public using (_∙_; stp-wea... | {
"alphanum_fraction": 0.7599486521,
"avg_line_length": 37.0952380952,
"ext": "agda",
"hexsha": "ff534db2074bfd3f03dc4066b826187f9f2a1882",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module v01-02-induction where
import Relation.Binary.PropositionalEquality as Eq
open Eq using (_≡_; refl; sym)
open Eq.≡-Reasoning using (begin_; _≡⟨⟩_; _∎)
open import v01-01-basics
plus-n-O : ∀ (n : nat) → n ≡ n + 0
plus-n-O O = refl
plus-n-O (S n) rewrite sym (plus-n-O n) = refl
minus-n-n : ∀ (n ... | {
"alphanum_fraction": 0.4877893396,
"avg_line_length": 36.0842911877,
"ext": "agda",
"hexsha": "de2a383728d1740efb56e71e03fc6bff19fcf818",
"lang": "Agda",
"max_forks_count": 8,
"max_forks_repo_forks_event_max_datetime": "2021-09-21T15:58:10.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-04-13T... |
{-# OPTIONS --exact-split #-}
open import Agda.Builtin.Nat
data IsZero : Nat → Set where
isZero : IsZero 0
test : (n m : Nat) → IsZero n → IsZero m → Nat
test zero zero _ _ = zero
test (suc _) _ () _
test _ (suc _) _ ()
| {
"alphanum_fraction": 0.6177777778,
"avg_line_length": 18.75,
"ext": "agda",
"hexsha": "11113ee846883c17648137c2fd932f5c6276ca6a",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-03T14:04:... |
------------------------------------------------------------------------
-- The Agda standard library
--
-- Bag and set equality
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Data.List.Relation.Binary.BagAndSetEquality where
open import Algebra usi... | {
"alphanum_fraction": 0.447029148,
"avg_line_length": 38.0248667851,
"ext": "agda",
"hexsha": "a2046d7d6ffca246f36d71f90bfced23fdb3f442",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hex... |
open import Nat
open import Prelude
open import contexts
module core where
-- types
data htyp : Set where
num : htyp
⦇-⦈ : htyp
_==>_ : htyp → htyp → htyp
_⊕_ : htyp → htyp → htyp
_⊠_ : htyp → htyp → htyp
-- type constructors bind very tightly
infixr 25 _==>_
infixr 25 _⊕_
... | {
"alphanum_fraction": 0.384262683,
"avg_line_length": 30.8721461187,
"ext": "agda",
"hexsha": "93fb98b42ac5224a3ae3d6affc36cf9da0ebc507",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hex... |
module Function.PointwiseStructure where
open import Functional using (_∘_) renaming (const to const₁)
open import Function.Equals
open import Function.Multi.Functions
open import Logic.Predicate
open import Logic.Propositional
import Lvl
open import Structure.Function
open import Structure.Function.Multi
open im... | {
"alphanum_fraction": 0.7407265285,
"avg_line_length": 69.185840708,
"ext": "agda",
"hexsha": "75106987b6863745498d691eb74526279f831342",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hex... |
open import Oscar.Prelude
open import Oscar.Class
module Oscar.Class.Leftstar where
module Leftstar
{𝔞 𝔟 𝔣 𝔞̇ 𝔟̇}
{𝔄 : Ø 𝔞}
{𝔅 : Ø 𝔟}
{𝔉 : Ø 𝔣}
(𝔄̇ : 𝔄 → Ø 𝔞̇)
(𝔅̇ : 𝔅 → Ø 𝔟̇)
(_◂_ : 𝔉 → 𝔄 → 𝔅)
= ℭLASS (_◂_ , 𝔅̇) (∀ {x} f → 𝔄̇ x → 𝔅̇ (f ◂ x))
module _
{𝔞 𝔟 𝔣 𝔞̇ 𝔟̇}
{�... | {
"alphanum_fraction": 0.5385422129,
"avg_line_length": 27.2428571429,
"ext": "agda",
"hexsha": "2592c6f4ea03128ee54f1713a8ee04f0de993074",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module _ where
data _==_ {A : Set} (a : A) : A → Set where
refl : a == a
data ⊥ : Set where
data ℕ : Set where
zero : ℕ
suc : ℕ → ℕ
it : ∀ {a} {A : Set a} ⦃ x : A ⦄ → A
it ⦃ x ⦄ = x
f : (n : ℕ) ⦃ p : ⦃ _ : n == zero ⦄ → ⊥ ⦄ → ℕ
f n = n
g : (n : ℕ) ⦃ q : ⦃ _ : n == zero ⦄ → ⊥ ⦄ → ℕ
g n ⦃ q ⦄ = f n
h : (n :... | {
"alphanum_fraction": 0.3595800525,
"avg_line_length": 15.875,
"ext": "agda",
"hexsha": "a0b38ffa553981b6d9a156b6cf5ebebea9722de3",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-03T14:04... |
------------------------------------------------------------------------------
-- Distributive laws on a binary operation: Task B
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-univers... | {
"alphanum_fraction": 0.3692083939,
"avg_line_length": 36.1879699248,
"ext": "agda",
"hexsha": "86a652c853ce303458969b9d34dfa5dd838a3db2",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2018-03-14T08:50:00.000Z",
"max_forks_repo_forks_event_min_datetime": "2016-09-19T... |
-- Properties of quicksort
{-# OPTIONS --without-K --safe #-}
open import Relation.Binary
module Algorithms.List.Sort.Quick.Properties
{c l₁ l₂} (DTO : DecTotalOrder c l₁ l₂)
where
-- agda-stdlib
open import Level
open import Data.List
import Data.List.Properties as Listₚ
import Data.List.Relation.Binary.E... | {
"alphanum_fraction": 0.6576846307,
"avg_line_length": 32.3225806452,
"ext": "agda",
"hexsha": "6a3873baf9f25ba76c85e9dafe1336e972487c33",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --without-K --safe #-}
-- In this module, we define the usual definition of D<: -- the one having typing and
-- subtyping mutually defined.
module DsubFull 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 Data.Produc... | {
"alphanum_fraction": 0.3984261148,
"avg_line_length": 32.3679245283,
"ext": "agda",
"hexsha": "f99af2e2833cf7d1e419e4f04d234571d1bdc7db",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module Numeric.Nat where
open import Numeric.Nat.BinarySearch public
open import Numeric.Nat.Divide.Properties public
open import Numeric.Nat.Divide public
open import Numeric.Nat.DivMod public
open import Numeric.Nat.GCD.Extended public
open import Numeric.Nat.GCD.Properties public... | {
"alphanum_fraction": 0.7047244094,
"avg_line_length": 40.1052631579,
"ext": "agda",
"hexsha": "be4d7de02ace244e53ab2f14190ca463f6c0533b",
"lang": "Agda",
"max_forks_count": 24,
"max_forks_repo_forks_event_max_datetime": "2021-04-22T06:10:41.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-03-12... |
postulate
A : Set
data B : Set where
x : A → B
f : A → A
f = {!!} -- C-c C-c yields 'f x = ?', which fails to type check
| {
"alphanum_fraction": 0.515625,
"avg_line_length": 12.8,
"ext": "agda",
"hexsha": "91d78e3bd6bc3baaa73cbf2f40378da3dd6d4864",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-03T14:04:08.00... |
------------------------------------------------------------------------
-- The Agda standard library
--
-- Data.Vec.Any.Membership instantiated with propositional equality,
-- along with some additional definitions.
------------------------------------------------------------------------
{-# OPTIONS --without-K --saf... | {
"alphanum_fraction": 0.515060241,
"avg_line_length": 35.5714285714,
"ext": "agda",
"hexsha": "ae706d4f9f03fe13f7f18a492b460dba37437ec9",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hex... |
module hello where
open import IO
main = run (putStrLn "Hello, World!") | {
"alphanum_fraction": 0.7260273973,
"avg_line_length": 14.6,
"ext": "agda",
"hexsha": "71bb0120f12ff40c6c90a131fc53ad95f0bb5f80",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hexsha": "2... |
{-# OPTIONS --without-K --rewriting #-}
open import HoTT
module stash.modalities.PushoutProduct {i j k l}
{A : Type i} {B : Type j}
{A' : Type k} {B' : Type l}
where
□-span : (f : A → B) (g : A' → B') → Span
□-span f g = span (B × A') (A × B') (A × A')
(λ { (a , a') → f a , a'})
(λ { (a , a') → a , g a' })... | {
"alphanum_fraction": 0.3656030287,
"avg_line_length": 29.8225806452,
"ext": "agda",
"hexsha": "298bf8bb9386e6c32b50edfa4f53c4bed2cea165",
"lang": "Agda",
"max_forks_count": 50,
"max_forks_repo_forks_event_max_datetime": "2022-02-14T03:03:25.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-10... |
module DivMod where
open import IO
open import Data.Nat
open import Data.Nat.DivMod
open import Coinduction
open import Data.String
open import Data.Fin
g : ℕ
g = 7 div 5
k : ℕ
k = toℕ (7 mod 5)
showNat : ℕ → String
showNat zero = "Z"
showNat (suc x) = "S (" ++ showNat x ++ ")"
main = run (♯ (putStrLn (showNat g))... | {
"alphanum_fraction": 0.66,
"avg_line_length": 16.6666666667,
"ext": "agda",
"hexsha": "30693668f6ff0ac8a22ff5df17643f35f3d862b0",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2019-03-05T20:02:38.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-03-05T20:02:38... |
{-# OPTIONS --prop #-}
True : Prop
True = {P : Prop} → P → P
-- Current error (incomprehensible):
-- Set₁ != Set
-- when checking that the expression {P : Prop} → P → P has type Prop
| {
"alphanum_fraction": 0.6054054054,
"avg_line_length": 20.5555555556,
"ext": "agda",
"hexsha": "f56cf3e5610875fe2c29b5b107d528074a87a533",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-04-01T18:30:09.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-04-01T... |
module README where
------------------------------------------------------------------------
-- The Agda standard library, version 0.9
--
-- Author: Nils Anders Danielsson, with contributions from Andreas
-- Abel, Stevan Andjelkovic, Jean-Philippe Bernardy, Peter Berry,
-- Joachim Breitner, Samuel Bronson, Daniel Brow... | {
"alphanum_fraction": 0.6302994944,
"avg_line_length": 34.0529801325,
"ext": "agda",
"hexsha": "400220cd1e40fb9157e24120ffb12b40b22baecc",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
------------------------------------------------------------------------
-- The Agda standard library
--
-- Example use case for a fresh list: sorted list
------------------------------------------------------------------------
module README.Data.List.Fresh where
open import Data.Nat
open import Data.List.Base
open i... | {
"alphanum_fraction": 0.6563968668,
"avg_line_length": 33.0172413793,
"ext": "agda",
"hexsha": "ef569440613f6381ea4596e06a29021a541ed4f8",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-11-04T06:54:45.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-11-04T... |
module IID-Proof where
import Logic.ChainReasoning as Chain
open import LF
open import Identity
open import IID
open import IIDr
open import IID-Proof-Setup
open import DefinitionalEquality
Ug : {I : Set} -> OPg I -> I -> Set
Ug γ i = Ur (ε γ) i
introg : {I : Set}(γ : OPg I)(a : Args γ (Ug γ)) -> Ug γ (index γ (Ug... | {
"alphanum_fraction": 0.5387153115,
"avg_line_length": 37.6131386861,
"ext": "agda",
"hexsha": "a3fbb6687c87a199d942d927736c299f7a03d15a",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
module CTL.Proof.AG where
open import CTL.Modalities.AG
open import FStream.Core
open import FStream.FVec
open import Library
-- TODO Maybe beautify syntax here and elsewhere
data proofAG' {ℓ₁ ℓ₂} {C : Container ℓ₁} : {n : ℕ} →
(props : FVec' C (Set ℓ₂) n) → Set (ℓ₁ ⊔ ℓ₂) where
[]AG' : proofAG' FNil'
_▻AG'_... | {
"alphanum_fraction": 0.5387437945,
"avg_line_length": 37.9754098361,
"ext": "agda",
"hexsha": "a4f211dd8cb2a03ae9200d36aba58163dd0150ce",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2019-12-13T15:56:38.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-12-13T... |
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorphism #-}
{-# OPTIONS --without-K #-}
module LogicalFramework.Equality where
module LF where
postulate
D : Set
_≡_ : D → D → Set
refl : ∀ {x} → x ≡ x
subst : (... | {
"alphanum_fraction": 0.5310492505,
"avg_line_length": 27.4705882353,
"ext": "agda",
"hexsha": "f896e4ada0c89f08d4e34c498c6359afe26f6e98",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2018-03-14T08:50:00.000Z",
"max_forks_repo_forks_event_min_datetime": "2016-09-19T... |
------------------------------------------------------------------------------
-- Properties for the relation LTC
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorphism #... | {
"alphanum_fraction": 0.478054567,
"avg_line_length": 36.652173913,
"ext": "agda",
"hexsha": "8219f63584a8b80d76ee3f27bd46b5d936d63360",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2018-03-14T08:50:00.000Z",
"max_forks_repo_forks_event_min_datetime": "2016-09-19T14... |
------------------------------------------------------------------------
-- The Agda standard library
--
-- This module is DEPRECATED. Please use
-- Data.List.Relation.Binary.Subset.Setoid.Properties directly.
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
... | {
"alphanum_fraction": 0.5911330049,
"avg_line_length": 33.8333333333,
"ext": "agda",
"hexsha": "d0ef874b65a37ec73bb7395508fbed4762b9c004",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-11-04T06:54:45.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-11-04T... |
module _ where
module M₁ (_ : Set) where
postulate
A : Set
record R : Set₁ where
field
A : Set
module M₂ (r : R) where
open M₁ (R.A r) public
module Unused (A : Set) (_ : Set) where
open M₁ A public
postulate
r : R
open M₂ r
postulate
P : A → Set
data D : Set where
c : D
F : D → Set
F ... | {
"alphanum_fraction": 0.5592286501,
"avg_line_length": 10.0833333333,
"ext": "agda",
"hexsha": "c7b55ecd6bacf1fb6d27a0ad1291b4dc1337b30c",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
{-# OPTIONS --without-K #-}
module PropsAsTypes where
data Σ {I : Set} (X : I → Set) : Set where
_,_ : (i : I) → X i → Σ X
drec-Σ : {I : Set} {X : I → Set} {A : Σ X → Set} →
((i : I) → (x : X i) → A (i , x)) →
(u : Σ X) → A u
drec-Σ f (i , x) = f i x
π₁ : {I : Set} {X : I → Set} → Σ X → I
π₁ ... | {
"alphanum_fraction": 0.4320603908,
"avg_line_length": 21.2452830189,
"ext": "agda",
"hexsha": "398b9c03e763fb5106959d89355d8d2e9ea0b5ad",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module RecordUpdateSyntax where
data ⊤ : Set where
tt : ⊤
record R : Set where
field
a b : ⊤
test : R
test = record {!!} { a = tt }
| {
"alphanum_fraction": 0.5804195804,
"avg_line_length": 11.9166666667,
"ext": "agda",
"hexsha": "e1fb82794f4fc06470a0453168ad426419e8bd73",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
------------------------------------------------------------------------------
-- Distributive laws on a binary operation: Lemma 4
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-univer... | {
"alphanum_fraction": 0.3696551724,
"avg_line_length": 34.5238095238,
"ext": "agda",
"hexsha": "bc76ae2784ba92d56c07ec3db90378153af7d5c9",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2018-03-14T08:50:00.000Z",
"max_forks_repo_forks_event_min_datetime": "2016-09-19T... |
module Container.Bag where
open import Prelude
Bag : Set → Set
Bag A = List (Nat × A)
FunctorBag : Functor Bag
fmap {{FunctorBag}} f b = map (second f) b
union : {A : Set} {{OrdA : Ord A}} → Bag A → Bag A → Bag A
union a [] = a
union [] b = b
union ((i , x) ∷ a) ((j , y) ∷ b) with compare x y
... | less _ = (i ... | {
"alphanum_fraction": 0.5124716553,
"avg_line_length": 23.2105263158,
"ext": "agda",
"hexsha": "d9a3616c8a9e0719be7a4ab31c6edcc0cd23475c",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --rewriting #-}
data _==_ {A : Set} (a : A) : A → Set where
idp : a == a
{-# BUILTIN REWRITE _==_ #-}
ap : {A B : Set} (f : A → B) {x y : A} →
x == y → f x == f y
ap f idp = idp
{- Circle -}
postulate
Circle : Set
base : Circle
loop : base == base
module _ (P : Set) (base* : P) (loop* : base* ... | {
"alphanum_fraction": 0.5400313972,
"avg_line_length": 19.303030303,
"ext": "agda",
"hexsha": "87be87163d732e23464c8847e20309b0e61c1020",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2019-03-05T20:02:38.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-03-05T2... |
-- Alternating addition (Also called the Calkin-Wilf tree representation of the rationals).
-- One bijective representation of ℚ. That is, every rational number is appearing exactly once in this representation (TODO: Some proof would be nice).
module Numeral.Rational.AlterAdd where
import Lvl
open import Data
ope... | {
"alphanum_fraction": 0.5493790656,
"avg_line_length": 30.4684684685,
"ext": "agda",
"hexsha": "90dab902a07403a241f20aae53e1e21b38239592",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
------------------------------------------------------------------------
-- The values that are used by the NBE algorithm
------------------------------------------------------------------------
import Level
open import Data.Universe
module README.DependentlyTyped.NBE.Value
(Uni₀ : Universe Level.zero Level.zero)
... | {
"alphanum_fraction": 0.4542335157,
"avg_line_length": 38.2375886525,
"ext": "agda",
"hexsha": "9348711e4ce4de8e8ebf8cbc51a61d71bd4b07a3",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Bags of integers, for Nehemiah plugin.
--
-- This module imports postulates about bags of integers
-- with negative multiplicities as a group under additive union.
---------------------------------------------------... | {
"alphanum_fraction": 0.6456256921,
"avg_line_length": 38.8387096774,
"ext": "agda",
"hexsha": "0ba86bf0e345499cf3caf1883fb0485859edbb68",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2016-02-18T12:26:44.000Z",
"max_forks_repo_forks_event_min_datetime": "2016-02-18T... |
{-# OPTIONS --without-K --safe #-}
open import Categories.Category
module Categories.Category.Construction.Properties.Presheaves.Cartesian {o ℓ e} (C : Category o ℓ e) where
open import Level
open import Data.Unit
open import Data.Product using (_,_)
open import Data.Product.Relation.Binary.Pointwise.NonDependent
op... | {
"alphanum_fraction": 0.5177816464,
"avg_line_length": 33.7899159664,
"ext": "agda",
"hexsha": "cc2c1f2d72e0b55b045dd01ef6e614329dfa3f05",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
------------------------------------------------------------------------
-- The Agda standard library
--
-- Definitions of algebraic structures like monoids and rings
-- (packed in records together with sets, operations, etc.)
------------------------------------------------------------------------
-- The contents of ... | {
"alphanum_fraction": 0.5687403599,
"avg_line_length": 26.1424731183,
"ext": "agda",
"hexsha": "13d39f625c0363b77aff940dcc8bcc8ef6a468f0",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-11-04T06:54:45.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-11-04T... |
{-# OPTIONS --safe --warning=error --without-K #-}
open import LogicalFormulae
open import Groups.Abelian.Definition
open import Groups.Homomorphisms.Definition
open import Setoids.Setoids
open import Sets.EquivalenceRelations
open import Rings.Definition
open import Lists.Lists
open import Rings.Homomorphisms.Definit... | {
"alphanum_fraction": 0.7514231499,
"avg_line_length": 42.7297297297,
"ext": "agda",
"hexsha": "468bf5331bbe275e2fff218275debea9cd3f405a",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-11-29T13:23:07.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-11-29T... |
{-# OPTIONS --safe #-}
module Cubical.HITs.FreeGroupoid where
open import Cubical.HITs.FreeGroupoid.Base public
open import Cubical.HITs.FreeGroupoid.GroupoidActions public
open import Cubical.HITs.FreeGroupoid.Properties public
| {
"alphanum_fraction": 0.8268398268,
"avg_line_length": 28.875,
"ext": "agda",
"hexsha": "e0318c8d04f1668f5f5c4df02cfec1b1b14db8da",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hexsha": ... |
{-# OPTIONS --cubical #-}
module _ where
open import Agda.Primitive.Cubical renaming (primINeg to ~_; primIMax to _∨_; primIMin to _∧_)
open import Agda.Builtin.Cubical.Path
open import Agda.Builtin.Cubical.Sub
open import Agda.Builtin.Cubical.Sub using () renaming (Sub to _[_↦_]; primSubOut to ouc)
open import Agda.Pr... | {
"alphanum_fraction": 0.4687579054,
"avg_line_length": 43.4395604396,
"ext": "agda",
"hexsha": "9e265f7df66723521e48e4b48991e55e9983298e",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module #2 where
open import Data.Product
open import Data.Sum
open import Relation.Binary.PropositionalEquality
{-
Exercise 1.2. Derive the recursion principle for products recA×B using only the projections, and
verify that the definitional equalities are valid. Do the same for Σ-types.
-}
module Products { a b c }{... | {
"alphanum_fraction": 0.5905292479,
"avg_line_length": 26.5925925926,
"ext": "agda",
"hexsha": "04468b9c261cb5747e68831bdee00ed4ad1dc9fc",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module kiss where
open import string
open import list
open import bool
open import relations
open import product
open import unit
data formula : Set where
$ : string → formula
True : formula
Implies : formula → formula → formula
And : formula → formula → formula
ctxt : Set
ctxt = 𝕃 formula
data _⊢_ : ctxt ... | {
"alphanum_fraction": 0.5185048794,
"avg_line_length": 27.9948453608,
"ext": "agda",
"hexsha": "ef49006e24df309f999cea2dde6bde4c77eea278",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --without-K #-}
module Main where
open import Data.List
open import Midi
open import Note
open import Frog
open import Piston
main : IO Unit
main =
let channel = 0
ticksPerBeat = 4 -- 16th notes
file = "/tmp/test.mid"
-- counterpoint
song = cfcpTracks1
-- s... | {
"alphanum_fraction": 0.6172566372,
"avg_line_length": 18.8333333333,
"ext": "agda",
"hexsha": "1afd70eb3edd3dc8f8106a2004bd13a0ea23f3f7",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2020-11-10T04:04:40.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-01-12T... |
module x1-Base where
data List (X : Set) : Set where
[] : List X
_∷_ : X → List X → List X
infixr 5 _∷_
foldr : ∀ {A} {B : Set} → (A → B → B) → B → List A → B
foldr f b [] = b
foldr f b (a ∷ as) = f a (foldr f b as)
data Either (A : Set) (B : Set) : Set where
left : A → Either A B
right ... | {
"alphanum_fraction": 0.4936440678,
"avg_line_length": 24.8421052632,
"ext": "agda",
"hexsha": "5d0bd29ff54962c7131835407ac63a686ec39745",
"lang": "Agda",
"max_forks_count": 8,
"max_forks_repo_forks_event_max_datetime": "2021-09-21T15:58:10.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-04-13T... |
import Lvl
open import Structure.Operator.Vector
open import Structure.Setoid
open import Type
module Structure.Operator.Vector.Subspaces.Span
{ℓᵥ ℓₛ ℓᵥₑ ℓₛₑ}
{V : Type{ℓᵥ}} ⦃ equiv-V : Equiv{ℓᵥₑ}(V) ⦄
{S : Type{ℓₛ}} ⦃ equiv-S : Equiv{ℓₛₑ}(S) ⦄
{_+ᵥ_ : V → V → V}
{_⋅ₛᵥ_ : S → V → V}
{_+ₛ_ _⋅ₛ_ : S → S... | {
"alphanum_fraction": 0.66849745,
"avg_line_length": 49.0192307692,
"ext": "agda",
"hexsha": "3afecab506b438071d63829fd855a184b1d385e4",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hexs... |
module Examples.Effects where
open import Prelude
open import Effects.Denotational
open import Effects.WellTyped EC _ec≟_
open import Effects.Substitutions EC _ec≟_
open import Implicits.Calculus.Types
-- value abstraction
module ex₁ where
f : Term 0 0 0
f = λ' unit (does io)
-- a lazy print is pure, but has... | {
"alphanum_fraction": 0.5441657579,
"avg_line_length": 23.2151898734,
"ext": "agda",
"hexsha": "90c2b4107b3dc44ef02e83cb8c6e68fb105535f9",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --allow-unsolved-metas #-}
open import Agda.Builtin.Size
mutual
data Nat (i : Size) : Set where
zero : Nat i
suc : Nat′ i → Nat i
data Nat′ (i : Size) : Set where
[_] : {j : Size< i} → Nat j → Nat′ i
size : ∀ {i} → Nat′ i → Size
size ([_] {j} _) = {!j!}
unbox : ∀ {i} (n : Nat′ i) → Nat... | {
"alphanum_fraction": 0.5172413793,
"avg_line_length": 17.9523809524,
"ext": "agda",
"hexsha": "93d9170cc805bb21d9a6b3a7d92cc47d332ccd76",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2015-09-15T14:36:15.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-09-15T... |
{-# OPTIONS --universe-polymorphism #-}
module InstanceArguments.09-higherOrderClasses where
open import Effect.Applicative
open import Effect.Monad
open import Effect.Monad.Indexed
open import Function
lift : ∀ {a b c} {A : Set a} {C : Set c} {B : A → Set b} →
({{x : A}} → B x) → (f : C → A) → {{x : C}} → B ... | {
"alphanum_fraction": 0.6028985507,
"avg_line_length": 34.5,
"ext": "agda",
"hexsha": "433d951b5d1f4a0abedd0f7804fa38a6d10d1436",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hexsha": "9... |
module Data.Dyck.Sized where
open import Prelude
open import Data.Nat using (_+_)
open import Data.Vec.Iterated using (Vec; _∷_; []; foldlN; head; foldl′)
open import Cubical.Foundations.Prelude using (substRefl)
open import Cubical.Data.Sigma.Properties using (Σ≡Prop)
open import Data.Nat.Properties using (isSetℕ)
... | {
"alphanum_fraction": 0.4319498825,
"avg_line_length": 34.7010869565,
"ext": "agda",
"hexsha": "644a513ea4fd417e70e63e5120e26071575c6100",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-11-11T12:30:21.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-11-11T... |
module HelpDefs where
-- open import Relation.Binary.PropositionalEquality
open import StdLibStuff
open import Syntax
open import FSC
open import STT
open import DerivedProps
m-weak-h : ∀ {n} Γ₁ Γ₂ {t} → {Γ₃ : Ctx n} → Form (Γ₃ ++ Γ₁) t → Form (Γ₃ ++ (Γ₂ r++ Γ₁)) t
m-weak-h {n} Γ₁ ε = λ f → f
m-weak-h {n} Γ₁ (t' ∷... | {
"alphanum_fraction": 0.4545291587,
"avg_line_length": 76.7706422018,
"ext": "agda",
"hexsha": "08ba8d1c37ffef5ff908314ac7c7b41c9caaa6fd",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2022-01-15T11:51:19.000Z",
"max_forks_repo_forks_event_min_datetime": "2016-05-17T... |
module Bool where
data Bool : Set where
true : Bool
false : Bool
if_then_else_ : {A : Set} -> Bool -> A -> A -> A
if true then x else y = x
if false then x else y = y
| {
"alphanum_fraction": 0.6079545455,
"avg_line_length": 16,
"ext": "agda",
"hexsha": "b30044698e04efcdaf162bdaf7047d5e3e31d306",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-03T14:04:08.... |
{-# OPTIONS --cubical --safe #-}
module Cubical.HITs.Rational.Base where
open import Cubical.Relation.Nullary
open import Cubical.Core.Everything
open import Cubical.Foundations.Prelude
open import Cubical.HITs.Ints.QuoInt
open import Cubical.Data.Nat
open import Cubical.Data.Empty
open import Cubical.Data.Unit
data ... | {
"alphanum_fraction": 0.6691871456,
"avg_line_length": 27.8421052632,
"ext": "agda",
"hexsha": "a2275e2d28fa25c341a896f350cbd6666ee54b60",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --without-K --rewriting #-}
open import lib.Basics
module lib.types.Paths where
{- ! is an equivalence and works on ≠ -}
module _ {i} {A : Type i} {x y : A} where
!-equiv : (x == y) ≃ (y == x)
!-equiv = equiv ! ! !-! !-!
≠-inv : (x ≠ y) → (y ≠ x)
≠-inv x≠y y=x = x≠y (! y=x)
{- Pre- and post- c... | {
"alphanum_fraction": 0.3336931985,
"avg_line_length": 37.4595588235,
"ext": "agda",
"hexsha": "12e994adc9b111fdb1c589955d26f81c357e2ce0",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
-- {-# OPTIONS -v impossible:100 #-}
-- 2013-06-15 Andreas, reported by evancavallo
module Issue870 where
{- The following fails with
An internal error has occurred. Please report this as a bug.
Location of the error: src/full/Agda/TypeChecking/Rules/Term.hs:421
in Agda 2.3.3 on Ubuntu. Works fine using Set inst... | {
"alphanum_fraction": 0.6938202247,
"avg_line_length": 24.5517241379,
"ext": "agda",
"hexsha": "122db3c30618378f18fefc77af3cea668f05528c",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
module _ where
open import utility
open import sn-calculus
using (all-ready ; bound-ready)
open import Data.Product using (∃ ; Σ ; _,_ ; _×_ ; _,′_ ; proj₁ ; proj₂)
open import Relation.Binary.PropositionalEquality using (sym ; inspect ; Reveal_·_is_ ; trans)
open import Data.Empty
open import Data.Sum using (_⊎_ ;... | {
"alphanum_fraction": 0.6086067186,
"avg_line_length": 49.4591439689,
"ext": "agda",
"hexsha": "c14dfc5ecbf12ca9a33a5bd8ec0e20c30163804b",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2020-04-15T20:02:49.000Z",
"max_forks_repo_forks_event_min_datetime": "2020-04-15T... |
module Properties.Functions where
infixr 5 _∘_
_∘_ : ∀ {A B C : Set} → (B → C) → (A → B) → (A → C)
(f ∘ g) x = f (g x)
| {
"alphanum_fraction": 0.4876033058,
"avg_line_length": 17.2857142857,
"ext": "agda",
"hexsha": "313b0ff2f91a8d2b56ed9d4907615576452f1165",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module Numeral.Natural.Relation.Divisibility where
import Lvl
open import Functional
open import Logic
open import Logic.Propositional
open import Numeral.Natural
open import Numeral.Natural.Oper
open import Type
-- Divisibility relation of natural numbers.
-- `(y ∣ x)` means that `y` is divisible by `x`.
-- In ... | {
"alphanum_fraction": 0.6119402985,
"avg_line_length": 41.54,
"ext": "agda",
"hexsha": "b819a653bc6981dc3d9d6fdb243ddedfcb158cfa",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hexsha": "... |
-- 2010-10-01 Issue 342
module NonDependentConstructorType where
data Wrap : Set1 where
wrap : Set -> Wrap
bla : Set
bla = wrap
-- 2010-10-01 error is printed as (_ : Set) -> Wrap !=< Set
-- error should be printed as Set -> Wrap !=< Set | {
"alphanum_fraction": 0.6721991701,
"avg_line_length": 24.1,
"ext": "agda",
"hexsha": "f9c5cd541f42a159bde9ae00f5ea5f1e47f79a81",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hexsha": "7... |
{-# OPTIONS --without-K #-}
open import library.Basics hiding (Type ; Σ)
open import library.types.Sigma
open import library.types.Bool
open import Sec2preliminaries
open import Sec4hasConstToSplit
module Sec6hasConstToDecEq where
-- Lemma 6.1
hasConst-family-dec : {X : Type} → (x₁ x₂ : X) → ((x : X) → hasConst ((... | {
"alphanum_fraction": 0.5375586854,
"avg_line_length": 31.3235294118,
"ext": "agda",
"hexsha": "52bfdc76e510bce52b4b9de76a2ace6664fe90f7",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Data.Empty where
open import Cubical.Data.Empty.Base public
open import Cubical.Data.Empty.Properties public
| {
"alphanum_fraction": 0.7683615819,
"avg_line_length": 25.2857142857,
"ext": "agda",
"hexsha": "1c80c98041b06a97e16c185b641aa51e2ebd7854",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-11-22T02:02:01.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-11-22T... |
data D : Set where
c_c_ : D → D
test : D → D
test c x c_ = x
| {
"alphanum_fraction": 0.53125,
"avg_line_length": 10.6666666667,
"ext": "agda",
"hexsha": "dd7a51cce077dbb1741d55e3ec274d4f503b1fd1",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-03T14:... |
-- Andreas, 2017-07-28, issue #657 is fixed
-- WAS: display form problem
postulate
A : Set
x : A
record R (A : Set) : Set₁ where
field
P : A → Set
module M (r : ∀ A → R A) where
open module R′ {A} = R (r A) public
postulate
r : ∀ A → R A
open M r
p : P x
p = {!!}
-- WAS: goal displayed as R.P (r ... | {
"alphanum_fraction": 0.5510204082,
"avg_line_length": 12.7037037037,
"ext": "agda",
"hexsha": "e075b34b1d4b89f0d7b8633001aaabc0bf760637",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
module UselessPrivateImport where
private
open import Common.Prelude
| {
"alphanum_fraction": 0.8472222222,
"avg_line_length": 14.4,
"ext": "agda",
"hexsha": "6bfa7aad48df252fc31a4a3e0c0b642e5d225a90",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2022-03-12T11:35:18.000Z",
"max_forks_repo_forks_event_min_datetime": "2022-03-12T11:35:18.... |
module Oscar.Data.Substitunction {𝔣} (FunctionName : Set 𝔣) where
open import Oscar.Data.Equality
open import Oscar.Data.Equality.properties
open import Oscar.Data.Fin
open import Oscar.Data.Nat
open import Oscar.Data.Term FunctionName
open import Oscar.Data.Vec
open import Oscar.Function
open import Oscar.Level
op... | {
"alphanum_fraction": 0.3949132256,
"avg_line_length": 48.5755813953,
"ext": "agda",
"hexsha": "55f872d62910d30691f3e087e9c477377066a8eb",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --no-auto-inline #-}
module Haskell.Prelude where
open import Agda.Builtin.Unit public
open import Agda.Builtin.Nat as Nat public hiding (_==_; _<_; _+_; _*_; _-_)
open import Agda.Builtin.List public
open import Agda.Builtin.Bool public
open import Agda.Builtin.Char publi... | {
"alphanum_fraction": 0.6212992545,
"avg_line_length": 35.3007518797,
"ext": "agda",
"hexsha": "e160ea6b3aaab76d847451ee54846f32b2dfdae5",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module Session where
open import Data.Bool
open import Data.Fin
open import Data.Empty
open import Data.List
open import Data.List.All
open import Data.Maybe
open import Data.Nat
open import Data.Product
open import Data.Sum
open import Data.Unit
open import Function using (_$_)
open import Relation.Nullary
open impor... | {
"alphanum_fraction": 0.6464880171,
"avg_line_length": 63.2270742358,
"ext": "agda",
"hexsha": "e67a8b15a25a2f62fbfd9c794b5d5aa87bcec794",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
{-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Displayed.Base where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Isomorphism
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.Transport
open import Cubical.Functio... | {
"alphanum_fraction": 0.5463510848,
"avg_line_length": 29.8235294118,
"ext": "agda",
"hexsha": "83904b825c6956f13a10ec31eb03096a2c2a7372",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module Numeric.Nat.Prime.FundamentalTheorem where
open import Prelude
open import Control.WellFounded
open import Container.List
open import Container.List.Permutation
open import Container.List.Properties
open import Numeric.Nat
open import Tactic.Nat
--- Some lemmas ----------
private
primeProd=1-is-empty : ∀ p... | {
"alphanum_fraction": 0.5923202614,
"avg_line_length": 37.4693877551,
"ext": "agda",
"hexsha": "81935861a328c8408e810d0a20e3220077b0fb44",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
open import Agda.Primitive using (_⊔_)
import Categories.Category as Category
import Categories.Category.Cartesian as Cartesian
import MultiSorted.Interpretation as Interpretation
open import MultiSorted.AlgebraicTheory
open import MultiSorted.Substitution
import MultiSorted.Product as Product
module MultiSorted.Mod... | {
"alphanum_fraction": 0.5795856493,
"avg_line_length": 34.7192982456,
"ext": "agda",
"hexsha": "7cc22a641c625709108355f373b9b191b82d1d25",
"lang": "Agda",
"max_forks_count": 6,
"max_forks_repo_forks_event_max_datetime": "2021-05-24T02:51:43.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-02-16T... |
-- 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 → ⊥) → ⊥
| {
"alphanum_fraction": 0.7051792829,
"avg_line_length": 20.9166666667,
"ext": "agda",
"hexsha": "1823fe1849ca54fb1136021e49e2043aa1c5c188",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
{- Agda can check termination of Stream transducer operations.
(Created: Andreas Abel, 2008-12-01
at Agda Intensive Meeting 9 in Sendai, Japan.
I acknowledge the support by AIST and JST.)
Stream transducers have been described in:
N. Ghani, P. Hancock, and D. Pattinson,
Continuous functions on final co... | {
"alphanum_fraction": 0.6261545941,
"avg_line_length": 29.3857142857,
"ext": "agda",
"hexsha": "4208fafc924538d75c079476fa8839cf19c76d59",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2019-03-05T20:02:38.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-03-05T... |
{-# OPTIONS --cubical --safe #-}
module HLevels where
open import Path
open import Cubical.Foundations.Everything
using (isProp
;isSet
;isContr
;isPropIsContr
;isProp→isSet
;isOfHLevel→isOfHLevelDep
;hProp
;isSetHProp
;isPropIsProp
)
public
... | {
"alphanum_fraction": 0.6144578313,
"avg_line_length": 17.2916666667,
"ext": "agda",
"hexsha": "4ab5a541e6bb8825a3cea85a9398212a5a02346b",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
open import Agda.Builtin.Size
data D : Size → Set where
postulate
f : (i : Size) → D i
data P : (i : Size) → D i → Set where
c : (i j : Size) → P (i ⊔ˢ j) (f _)
| {
"alphanum_fraction": 0.5443786982,
"avg_line_length": 15.3636363636,
"ext": "agda",
"hexsha": "7c4e3757ac82559d89f27c474a3e70eff1f1cb30",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2021-04-01T18:30:09.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-04-01T... |
open import Functional using (id)
import Structure.Logic.Classical.NaturalDeduction
module Structure.Logic.Classical.SetTheory {ℓₗ} {Formula} {ℓₘₗ} {Proof} {ℓₒ} {Domain} ⦃ classicLogic : _ ⦄ (_∈_ : Domain → Domain → Formula) where
open Structure.Logic.Classical.NaturalDeduction.ClassicalLogic {ℓₗ} {Formula} {ℓₘₗ}... | {
"alphanum_fraction": 0.4531613654,
"avg_line_length": 30.418879056,
"ext": "agda",
"hexsha": "5cdb581e21749853c42f6d884d3c490494b4e6c3",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hex... |
{- Byzantine Fault Tolerant Consensus Verification in Agda, version 0.9.
Copyright (c) 2020, 2021 Oracle and/or its affiliates.
Licensed under the Universal Permissive License v 1.0 as shown at https://opensource.oracle.com/licenses/upl
-}
module Dijkstra.All where
open import Dijkstra.Syntax public
open impor... | {
"alphanum_fraction": 0.806,
"avg_line_length": 31.25,
"ext": "agda",
"hexsha": "afdd55e1bd8e35ef81d5a7bc48cc8b0fba186021",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hexsha": "a4674fc... |
{-# OPTIONS --without-K --safe #-}
module Categories.Functor.Monoidal where
open import Level
open import Data.Product using (Σ; _,_)
open import Categories.Category
open import Categories.Category.Product
open import Categories.Category.Monoidal
open import Categories.Functor hiding (id)
open import Categories.Nat... | {
"alphanum_fraction": 0.4297451022,
"avg_line_length": 35.162962963,
"ext": "agda",
"hexsha": "43287dfbbdcb28bf67cfc363d73923732b48aae3",
"lang": "Agda",
"max_forks_count": 64,
"max_forks_repo_forks_event_max_datetime": "2022-03-14T02:00:59.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-06-02T... |
module Issue2880 where
app : {A : Set} → (A → A) → (A → A)
app f x = f x
{-# COMPILE GHC app = \ A f x -> f (app A f x) #-}
mutual
id : {A : Set} → A → A
id x = x
{-# COMPILE GHC id = id' #-}
id' : {A : Set} → A → A
id' x = x
{-# COMPILE GHC id' = id #-}
| {
"alphanum_fraction": 0.4343065693,
"avg_line_length": 14.4210526316,
"ext": "agda",
"hexsha": "33dccc36fb890006b342b2c9d2388644b05c4348",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
------------------------------------------------------------------------------
----- -----
----- Relevant.Abstraction -----
----- -----
----... | {
"alphanum_fraction": 0.4493267186,
"avg_line_length": 36.1794871795,
"ext": "agda",
"hexsha": "a5117c6fddeec5cdc9cb4547e637017a4323e952",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2022-01-06T19:34:26.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-11-13T... |
module ProofRep where
import Prelude
import Logic.Relations
import Logic.Identity
import Data.Nat
import Data.Nat.Properties
open Prelude
open Data.Nat hiding (_==_; _≡_)
open Data.Nat.Properties
open Logic.Relations
module Foo (Var : Set) where
data _==_ : (x y : Var) -> Set where
cRefl : {x : Var} -> x ==... | {
"alphanum_fraction": 0.5040453074,
"avg_line_length": 28.7441860465,
"ext": "agda",
"hexsha": "0134533d1c66a85c7d83018379938f886406f801",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-0... |
------------------------------------------------------------------------------
-- The ABP using the Agda standard library
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymo... | {
"alphanum_fraction": 0.547,
"avg_line_length": 31.5789473684,
"ext": "agda",
"hexsha": "2d7c03b1f6b292d13ffc4298f22280110547a6fb",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2018-03-14T08:50:00.000Z",
"max_forks_repo_forks_event_min_datetime": "2016-09-19T14:18:3... |
{- 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.ImplShared.Consensus.Types
open import Optics.All
open i... | {
"alphanum_fraction": 0.6879032258,
"avg_line_length": 37.5757575758,
"ext": "agda",
"hexsha": "78946f317d3e1a9d2794908e68a2eb3c106f57fa",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_he... |
module JMEq where
data _==_ {A : Set}(x : A) : {B : Set}(y : B) -> Set where
refl : x == x
subst : {A : Set}{x y : A}(P : A -> Set) -> x == y -> P x -> P y
subst {A} P refl px = px
| {
"alphanum_fraction": 0.4545454545,
"avg_line_length": 18.7,
"ext": "agda",
"hexsha": "b0bc4a33696f485ec99ecc8507b5dc575d7e0634",
"lang": "Agda",
"max_forks_count": 371,
"max_forks_repo_forks_event_max_datetime": "2022-03-30T19:00:30.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-01-03T14:04:0... |
-- {-# OPTIONS --without-K #-}
module Paths where
open import Agda.Prim
open import Data.Unit
open import Data.Bool
open import Data.Nat hiding (_⊔_)
open import Data.Sum
open import Data.Product
open import Function
open import Relation.Binary.PropositionalEquality
open import PointedTypes
--infix 2 _∎ -- ... | {
"alphanum_fraction": 0.4637303852,
"avg_line_length": 38.9986091794,
"ext": "agda",
"hexsha": "00a304048ad64bfbd33f4e06b13c55e2911e9419",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2019-09-10T09:47:13.000Z",
"max_forks_repo_forks_event_min_datetime": "2016-05-29T... |
module STLC.Coquand.Substitution where
open import STLC.Coquand.Renaming public
open import Category
--------------------------------------------------------------------------------
-- Substitutions
infix 3 _⊢⋆_
data _⊢⋆_ : 𝒞 → 𝒞 → Set
where
∅ : ∀ {Γ} → Γ ⊢⋆ ∅
_,_ : ∀ {Γ Ξ A} → (σ : Γ ⊢⋆ Ξ) (M : Γ ⊢... | {
"alphanum_fraction": 0.277955489,
"avg_line_length": 31.5300429185,
"ext": "agda",
"hexsha": "374cba69cd7865a07d8118f9a2294b09084d61ab",
"lang": "Agda",
"max_forks_count": null,
"max_forks_repo_forks_event_max_datetime": null,
"max_forks_repo_forks_event_min_datetime": null,
"max_forks_repo_head_hex... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.