Search is not available for this dataset
text string | meta dict |
|---|---|
-- Minimal implicational modal logic, vector-based de Bruijn approach, initial encoding
module Vi.BoxMp where
open import Lib using (Nat; suc; _+_; Fin; fin; Vec; []; _,_; proj; VMem; mem)
-- Types
infixr 0 _=>_
data Ty : Set where
UNIT : Ty
_=>_ : Ty -> Ty -> Ty
BOX : Ty -> Ty
-- Contex... | {
"alphanum_fraction": 0.4853598015,
"avg_line_length": 24.5731707317,
"ext": "agda",
"hexsha": "d61c068ef2080c711cab80de0fc8f2f76d60ed14",
"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
--
-- This module is DEPRECATED. Please use the
-- Relation.Binary.Construct.Closure.ReflexiveTransitive module directly
------------------------------------------------------------------------
{-# OPTIONS --without-K... | {
"alphanum_fraction": 0.5793226381,
"avg_line_length": 31.1666666667,
"ext": "agda",
"hexsha": "758a4970c8facec793922e902c31203aee18c78a",
"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... |
------------------------------------------------------------------------
-- The Agda standard library
--
-- This module is DEPRECATED. Please use
-- Data.List.Relation.Binary.Lex.Core directly.
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Data.List... | {
"alphanum_fraction": 0.5387523629,
"avg_line_length": 29.3888888889,
"ext": "agda",
"hexsha": "d965533c3f73da0dd40821ffb3f47df3a153c596",
"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 Issue2487-1 where
postulate get-out-of-jail : {A : Set} -> A
| {
"alphanum_fraction": 0.6811594203,
"avg_line_length": 17.25,
"ext": "agda",
"hexsha": "76c5ef4dd787eb05f479f2d5dc0e1c260c352b70",
"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:... |
{-# OPTIONS --without-K #-}
module overloading.level where
open import sum
open import equality.core
open import overloading.bundle
open import function.isomorphism
open import hott.level.core
open import sets.unit
open Bundle
bundle-structure-iso : ∀ {i j}{Base : Set i}
(Struct : Base → Set ... | {
"alphanum_fraction": 0.5276630884,
"avg_line_length": 28.8333333333,
"ext": "agda",
"hexsha": "4e8c8ccd60689a760b08caa6f5488900176ec756",
"lang": "Agda",
"max_forks_count": 4,
"max_forks_repo_forks_event_max_datetime": "2019-02-26T06:17:38.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-04-11T... |
module Data.Fin.Subset.Properties.Cardinality where
open import Data.Nat as ℕ using (ℕ)
open import Data.Nat.Properties as NP
open import Data.Empty using (⊥-elim)
open import Data.Fin
open import Data.Fin.Subset
open import Data.Fin.Subset.Properties
open import Data.Vec using (_∷_; [])
open import Data.Vec.Any usi... | {
"alphanum_fraction": 0.4249134948,
"avg_line_length": 41.7630057803,
"ext": "agda",
"hexsha": "dff9f50b3ab5808f51b017dda63a1408f284979f",
"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
open import Agda.Builtin.Nat
open import Imports.ImportedDisplayForms
postulate
T : Nat → Set
foo : (a : Nat) → T (a + a)
foo a = {!!}
| {
"alphanum_fraction": 0.6602564103,
"avg_line_length": 13,
"ext": "agda",
"hexsha": "ad8b49778bd94ee29220b037c06ce9e394928a80",
"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.... |
open import Oscar.Prelude
open import Oscar.Class.HasEquivalence
open import Oscar.Class.Smap
open import Oscar.Class.Surjextensionality
open import Oscar.Class.Symmetry
open import Oscar.Class.Symmetrical
open import Oscar.Class.Transitivity
open import Oscar.Data.ProductIndexEquivalence
open import Oscar.Data.Surjex... | {
"alphanum_fraction": 0.6739659367,
"avg_line_length": 34.25,
"ext": "agda",
"hexsha": "a33bc2f472e1541988777dd52314e2e1156255c0",
"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 --no-import-sorts --safe #-}
module Cubical.Algebra.AbGroup.Base where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.Equiv.HalfAdjoint
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Isomorphism
open import Cu... | {
"alphanum_fraction": 0.6391903426,
"avg_line_length": 37.4474885845,
"ext": "agda",
"hexsha": "ee80c20d9bd42baa0cb70b84942cede1cc034792",
"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 #-}
module Type.Cubical.Path.Category{ℓ} where
open import Data.Tuple as Tuple using (_,_)
open import Data
open import Functional
open import Function.Axioms
open import Logic.Propositional
open import Structure.Category
open import Structure.Categorical.Properties
open import Structure.Operato... | {
"alphanum_fraction": 0.8009650181,
"avg_line_length": 42.5128205128,
"ext": "agda",
"hexsha": "d725a9cb239328bd849ac45ac128ad6e5a9271da",
"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.Bool
f : Bool → Bool
f x = let y = x in {!!}
| {
"alphanum_fraction": 0.6056338028,
"avg_line_length": 14.2,
"ext": "agda",
"hexsha": "ba6cae6eaef42f7280a809a01c2705cb9635e57a",
"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 --cubical --safe #-}
module Cubical.HITs.Ints.QuoInt where
open import Cubical.HITs.Ints.QuoInt.Base public
-- open import Cubical.HITs.Ints.QuoInt.Properties public
| {
"alphanum_fraction": 0.7666666667,
"avg_line_length": 25.7142857143,
"ext": "agda",
"hexsha": "1478c4e40129474f1bc01b186ccf34692e270c97",
"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 --exact-split #-}
module dn-sheaves where
import rings
open rings public
{- We postulate a propositional resizing axiom -}
raise-UU-Prop :
(l : Level) → UU-Prop lzero → UU-Prop l
raise-UU-Prop l (pair P is-prop-P) =
pair ( raise l P)
( is-prop-is-equiv' P
( map-raise l P)... | {
"alphanum_fraction": 0.6168261563,
"avg_line_length": 33,
"ext": "agda",
"hexsha": "058c390189274159129041b0c0b3ea34f3d8b0af",
"lang": "Agda",
"max_forks_count": 30,
"max_forks_repo_forks_event_max_datetime": "2022-03-16T00:33:50.000Z",
"max_forks_repo_forks_event_min_datetime": "2018-09-26T09:08:57.0... |
-- MIT License
-- Copyright (c) 2021 Luca Ciccone and Luca Padovani
-- Permission is hereby granted, free of charge, to any person
-- obtaining a copy of this software and associated documentation
-- files (the "Software"), to deal in the Software without
-- restriction, including without limitation the rights to use... | {
"alphanum_fraction": 0.6231034483,
"avg_line_length": 37.8260869565,
"ext": "agda",
"hexsha": "9e0fae5e0d33a035f462960a0878c81eb9a09440",
"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 Algebra.Dioid.Bool where
open import Algebra.Dioid
data Bool : Set where
true : Bool
false : Bool
data _≡_ : (x y : Bool) -> Set where
reflexivity : ∀ {x : Bool} -> x ≡ x
symmetry : ∀ {x y : Bool} -> x ≡ y -> y ≡ x
transitivity : ∀ {x y z : Bool} -> x ≡ y -> y ... | {
"alphanum_fraction": 0.5278969957,
"avg_line_length": 22.1904761905,
"ext": "agda",
"hexsha": "05b6e63181d31d24e4d8ec1c9ef844b8c5d856d0",
"lang": "Agda",
"max_forks_count": 6,
"max_forks_repo_forks_event_max_datetime": "2019-05-09T23:53:28.000Z",
"max_forks_repo_forks_event_min_datetime": "2017-12-17T... |
{- Byzantine Fault Tolerant Consensus Verification in Agda, version 0.9.
Copyright (c) 2020, 2021, Oracle and/or its affiliates.
Licensed under the Universal Permissive License v 1.0 as shown at https://opensource.oracle.com/licenses/upl
-}
open import LibraBFT.Prelude
open import LibraBFT.Lemmas
open import Lib... | {
"alphanum_fraction": 0.6065516641,
"avg_line_length": 46.2822580645,
"ext": "agda",
"hexsha": "ee14fcbcaa062a2b01f39f7579c1517e43366607",
"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 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 ... | {
"alphanum_fraction": 0.4264705882,
"avg_line_length": 31.829787234,
"ext": "agda",
"hexsha": "df2308b02c0dcc0e57a0c7d0b1d8f00833f0228b",
"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-12T1... |
{-# OPTIONS --no-auto-inline #-}
module Haskell.Prim.Num where
open import Agda.Builtin.Nat as Nat hiding (_+_; _-_; _*_; _<_; _==_)
open import Agda.Builtin.Int using (pos; negsuc)
open import Agda.Builtin.FromNat
open import Agda.Builtin.FromNeg
open import Agda.Builtin.Unit
open import Haskell.Prim
open import Ha... | {
"alphanum_fraction": 0.5572763029,
"avg_line_length": 34.1848739496,
"ext": "agda",
"hexsha": "b7730b3959ecadd50700cca0a56ca4ce01d59e23",
"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
--
-- Some derivable properties
------------------------------------------------------------------------
open import Algebra
module Algebra.Properties.Lattice {l₁ l₂} (L : Lattice l₁ l₂) where
open Lattice L
open im... | {
"alphanum_fraction": 0.4404384194,
"avg_line_length": 32.4018691589,
"ext": "agda",
"hexsha": "13d039104419bf020adf0c94637845186e5f5e7a",
"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 #-}
-- Some of the obvious properties of cartesian functors
module Categories.Functor.Cartesian.Properties where
open import Level
open import Data.Product using (Σ ; _,_)
open import Categories.Category
open import Categories.Category.Cartesian.Structure
open import Categories.Functor... | {
"alphanum_fraction": 0.4630865374,
"avg_line_length": 51.3097826087,
"ext": "agda",
"hexsha": "daf13df4a4255e2d3daaffb765a88b573528066a",
"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... |
-- Andreas, 2012-05-24, issue reported by Nisse
{-# OPTIONS --allow-unsolved-metas #-}
-- {-# OPTIONS -v tc.meta:50 #-}
module Issue658 where
import Common.Level
postulate
A : Set
P : A → Set
Q : (x : A) → P x → Set
p : (x : A) → P x
record R : Set where
field
a : A
r : R
r = {!!}
postulate
q : Q (... | {
"alphanum_fraction": 0.6383701188,
"avg_line_length": 20.3103448276,
"ext": "agda",
"hexsha": "50897da48e4aca86bb43f22165320f9975904490",
"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... |
{- Byzantine Fault Tolerant Consensus Verification in Agda, version 0.9.
Copyright (c) 2020 Oracle and/or its affiliates.
Licensed under the Universal Permissive License v 1.0 as shown at https://opensource.oracle.com/licenses/upl
-}
open import LibraBFT.Prelude
open import LibraBFT.Hash
open import LibraBFT.Ab... | {
"alphanum_fraction": 0.7509113001,
"avg_line_length": 39.8225806452,
"ext": "agda",
"hexsha": "32b6f679d16522bbfbbf7fb37ecee84889fdcd77",
"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 #-}
-- Pi combinators inspired by duals and traced monoidal categories
module PiPointedFracTrace where
open import Data.Unit
open import Data.Sum
open import Data.Product
open import Relation.Binary.PropositionalEquality
open import PiPointedFrac
-------------------------------------... | {
"alphanum_fraction": 0.4102508651,
"avg_line_length": 30.8266666667,
"ext": "agda",
"hexsha": "875167df3b74d032b986e139637486bfa4b7d773",
"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 McK-B where
open import CS410-Prelude
open import CS410-Nat
open import CS410-Vec
data Bit : Set where O I : Bit
exp2 : Nat -> Nat
exp2 zero = 1
exp2 (suc n) = exp2 n +N exp2 n
WordNZ : Nat -> Set
data Word (n : Nat) : Set where
O : Word n
[_] : WordNZ n -> Word n
WordNZ zero = One
WordNZ (suc n) ... | {
"alphanum_fraction": 0.47275144,
"avg_line_length": 26.869047619,
"ext": "agda",
"hexsha": "af4bfbe9cca463b77e37b3f19ed7e303650305db",
"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-13T12:... |
module IdentP where
data Bool
: Set
where
false
: Bool
true
: Bool
f
: {A : Set}
→ A
→ A
→ A
f x y
= x
g
: Bool
→ Bool
g false
= true
g true
= true
| {
"alphanum_fraction": 0.4787234043,
"avg_line_length": 6.4827586207,
"ext": "agda",
"hexsha": "60ce1b23817909e32f4574fb7c7293e0cc497f30",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2022-03-01T16:38:14.000Z",
"max_forks_repo_forks_event_min_datetime": "2022-03-01T1... |
-- Andreas, 2018-09-03, issue #3207
--
-- Error message for disabled Prop.
{-# OPTIONS --no-prop #-}
test = Prop
| {
"alphanum_fraction": 0.6260869565,
"avg_line_length": 14.375,
"ext": "agda",
"hexsha": "437410a9de72894de6267d0a268e473c33df4407",
"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... |
module Fin where
open import Prelude
open import Star
open import Modal
open import Nat
Fin : Nat -> Set
Fin = Any (\_ -> True)
fzero : {n : Nat} -> Fin (suc n)
fzero = done _ • ε
fsuc : {n : Nat} -> Fin n -> Fin (suc n)
fsuc i = step • i
| {
"alphanum_fraction": 0.6106557377,
"avg_line_length": 14.3529411765,
"ext": "agda",
"hexsha": "9e8ff81b08ada8e5db0f1dd7b2b809bd26170388",
"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 HasDecidableSalvation where
open import OscarPrelude
open import HasSalvation
record HasDecidableSalvation (A : Set) : Set₁
where
field
⦃ hasSalvation ⦄ : HasSalvation A
▷?_ : (x : A) → Dec $ ▷ x
open HasDecidableSalvation ⦃ … ⦄ public
{-# DISPLAY HasDecidableSalvation.▷?_ _ = ▷?_ #-}
| {
"alphanum_fraction": 0.6957928803,
"avg_line_length": 19.3125,
"ext": "agda",
"hexsha": "c2fad8079e24e749c871c7c608b37e75c3e0ff73",
"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":... |
{-
A couple of general facts about equivalences:
- if f is an equivalence then (cong f) is an equivalence ([equivCong])
- if f is an equivalence then pre- and postcomposition with f are equivalences ([preCompEquiv], [postCompEquiv])
- if f is an equivalence then (Σ[ g ] section f g) and (Σ[ g ] retract f g) are contr... | {
"alphanum_fraction": 0.5690645052,
"avg_line_length": 41.5093457944,
"ext": "agda",
"hexsha": "a4b4cf59b210f691dce6622f71a4cb31a8247ff7",
"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 List where
import Prelude
import Equiv
import Datoid
import Nat
open Prelude
open Equiv
open Datoid
open Nat
data List (a : Set) : Set where
nil : List a
_::_ : a -> List a -> List a
map : {a b : Set} -> (a -> b) -> List a -> List b
map f nil = nil
map f (x :: xs) = f ... | {
"alphanum_fraction": 0.5102249489,
"avg_line_length": 30.5625,
"ext": "agda",
"hexsha": "fa5b916c3a18609f390b1b05950b476e8a1fa970",
"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":... |
interleaved mutual
data CoNat : Set
record ∞CoNat : Set
constructor
zero : CoNat
record ∞CoNat where
coinductive
field force : CoNat
constructor
suc : ∞CoNat → ?
| {
"alphanum_fraction": 0.6458333333,
"avg_line_length": 12.8,
"ext": "agda",
"hexsha": "2da9588828f6cbd99e26b3f173aa2c91567b34c9",
"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": "e... |
------------------------------------------------------------------------------
-- Inductive PA properties using the induction principle
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-u... | {
"alphanum_fraction": 0.4270724029,
"avg_line_length": 29.78125,
"ext": "agda",
"hexsha": "7cd0aae676206d3cde94273c46092926aeb98f4f",
"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... |
-- Andreas, 2014-03-27 fixed issue
{-# OPTIONS --copatterns --sized-types #-}
open import Common.Size
record R (i : Size) : Set where
inductive
constructor c
field
j : Size< i
r : R j
data ⊥ : Set where
elim : (i : Size) → R i → ⊥
elim i (c j r) = elim j r
-- elim should be rejected by termination c... | {
"alphanum_fraction": 0.6426282051,
"avg_line_length": 17.8285714286,
"ext": "agda",
"hexsha": "42cce6ea68a9a1c84fade710b161b5e2a2b65372",
"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... |
module Rationals.Properties where
open import Nats renaming (_*_ to _:*:_)
open import Rationals
open import Data.Empty
open import Data.Product
open import Equality
------------------------------------------------------------------------
-- internal stuffs
private
a*b÷b=a : ∀ a b → a :*: b ÷ b →ℕ ≡ (a , refl)
... | {
"alphanum_fraction": 0.45256917,
"avg_line_length": 23,
"ext": "agda",
"hexsha": "de1597559b587ef079cc2d0dae7694d0d1568da1",
"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": "7dc0e... |
module RandomAccessList.Standard.Core where
open import BuildingBlock.BinaryLeafTree using (BinaryLeafTree; Node; Leaf)
open import Data.Nat
open import Data.Nat.Etc
-- parameterized by the level of the least significant digit
data 0-1-RAL (A : Set) : ℕ → Set where
[] : ∀ {n} → ... | {
"alphanum_fraction": 0.4395750332,
"avg_line_length": 31.375,
"ext": "agda",
"hexsha": "6b3bb0df18eed111614e22e9556a39db9a1c5713",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2015-05-30T05:50:50.000Z",
"max_forks_repo_forks_event_min_datetime": "2015-05-30T05:50:5... |
------------------------------------------------------------------------------
-- Test the consistency of PA.Axiomatic.Standard.Base
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-univ... | {
"alphanum_fraction": 0.4761904762,
"avg_line_length": 37.2272727273,
"ext": "agda",
"hexsha": "1c9db04abbaa28623110c1337874ec7005a8135f",
"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... |
-- Box modality: cofree presheaf on a family
module SOAS.Abstract.Box {T : Set} where
open import SOAS.Common
open import SOAS.Context
open import SOAS.Sorting
open import SOAS.Variable
open import SOAS.Families.Core {T}
open import SOAS.Families.Isomorphism
open import SOAS.Families.BCCC using (_×ₘ_; _+ₘ_; _⇨_; _⇨̣_... | {
"alphanum_fraction": 0.5934833204,
"avg_line_length": 22.224137931,
"ext": "agda",
"hexsha": "b73ddfd902568bc546b7d0aeedad4f0deeb1111e",
"lang": "Agda",
"max_forks_count": 4,
"max_forks_repo_forks_event_max_datetime": "2022-01-24T12:49:17.000Z",
"max_forks_repo_forks_event_min_datetime": "2021-11-09T2... |
-- 2011-10-04 Andreas
{-# OPTIONS --experimental-irrelevance #-}
module TerminationOnIrrelevant where
data ⊥ : Set where
data Empty : Set where
c : Empty → Empty
d : Empty → Empty
d (c x) = x
f : .Empty → ⊥
f (c x) = f x
g : .Empty → ⊥
g (c x) = g x
data _≡_ {A : Set}(a : A) : A → Set where
refl : a ≡ a
-- t... | {
"alphanum_fraction": 0.5930232558,
"avg_line_length": 17.9166666667,
"ext": "agda",
"hexsha": "f55a73beaafe3fff560caea260875ad0cb6936b7",
"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 RepeatedVariableInPattern where
K : Set -> Set
K A A = A
| {
"alphanum_fraction": 0.7014925373,
"avg_line_length": 9.5714285714,
"ext": "agda",
"hexsha": "26d6bc82940de6eef74917cbcc62a4340a3944a5",
"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... |
module Categories.Functor.CartesianClosed where
open import Categories.Category using (Category; _[_∘_]; _[_,_])
open import Categories.Category.Cartesian using (Cartesian)
open import Categories.Category.Cartesian.Bundle using (CartesianCategory)
open import Categories.Category.CartesianClosed using (CartesianClosed)... | {
"alphanum_fraction": 0.7250445633,
"avg_line_length": 34.5230769231,
"ext": "agda",
"hexsha": "1b269d220d9c4646d4baa65b68dc56902d9d6e35",
"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 Issue2937.WithUnicode where
foo : _ → _ → Set
foo bar x = λ x → foo (bar x {!!}) x
| {
"alphanum_fraction": 0.6086956522,
"avg_line_length": 18.4,
"ext": "agda",
"hexsha": "7e1334632341e05c46dc314d3e2eeacc7e2a6bd9",
"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... |
-- Left ℤ-multiplication on groups and some of its properties
{-# OPTIONS --safe --experimental-lossy-unification #-}
module Cubical.Algebra.Group.ZAction where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Isomorphism
open import Cubical.Foundations.Equiv
open import Cubical.Data.Sigma
open... | {
"alphanum_fraction": 0.5193361391,
"avg_line_length": 39.8512658228,
"ext": "agda",
"hexsha": "020248927701f367f1b9ae44e80086881897c672",
"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
--
-- Monad syntax for the TC monad
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Reflection.TypeChecking.MonadSyntax where
open import Agda.Built... | {
"alphanum_fraction": 0.4322373697,
"avg_line_length": 21.8771929825,
"ext": "agda",
"hexsha": "5df23171cd2cd7b04067973631281734575d6e74",
"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 --without-K --rewriting #-}
open import HoTT
open import homotopy.HSpace
open import homotopy.EM1HSpace
open import homotopy.EilenbergMacLane1 using (EM₁-level₁)
open import lib.types.TwoSemiCategory
open import lib.two-semi-categories.FundamentalCategory
module homotopy.EM1HSpaceAssoc where
module EM₁HS... | {
"alphanum_fraction": 0.5559484718,
"avg_line_length": 37.7047619048,
"ext": "agda",
"hexsha": "8c648234e22cbdad3300f64092da4225f8de5bff",
"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 Vec where
open import Basics
open import Ix
open import All
open import Cutting
open import Tensor
data Vec (X : Set) : Nat -> Set where
[] : Vec X zero
_,-_ : forall {n} -> X -> Vec X n -> Vec X (suc n)
_+V_ : forall {X n m} -> Vec X n -> Vec X m -> Vec X (n +N m)
[] +V ys = ys
(x ,- xs) +V ys = x... | {
"alphanum_fraction": 0.5501912046,
"avg_line_length": 29.8857142857,
"ext": "agda",
"hexsha": "36021a5fee36b8b7a58c08dfb540065f391b5421",
"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 the consistency of FOTC.Relation.Binary.Bisimilarity.Type
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIO... | {
"alphanum_fraction": 0.4912442396,
"avg_line_length": 33.90625,
"ext": "agda",
"hexsha": "eeeedb9851e776d83a0a01aefa43bfa958156ac7",
"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... |
{-# OPTIONS --without-K --safe #-}
module Math.NumberTheory.Product.Nat where
-- agda-stdlib
open import Data.Nat.Properties
-- agda-misc
open import Math.NumberTheory.Product.Generic
open MonoidProduct *-1-monoid public
| {
"alphanum_fraction": 0.76,
"avg_line_length": 18.75,
"ext": "agda",
"hexsha": "6b8eecc6c44e92eec05e5c51e14d3a2a0f73a0b6",
"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": "37200ea9... |
open import Prelude
module Implicits.Syntax.Context where
open import Implicits.Syntax.Type
open import Data.List.All
open import Data.Vec
open import Data.List
Ctx : ℕ → ℕ → Set
Ctx ν n = Vec (Type ν) n
ICtx : ℕ → Set
ICtx ν = List (Type ν)
-- wellformed implicit contexts
_⊢OK : ∀ {ν} → ICtx ν → Set
Δ ⊢OK = All (... | {
"alphanum_fraction": 0.5520833333,
"avg_line_length": 19.7647058824,
"ext": "agda",
"hexsha": "afad3da5e97dfb90c1ea73f57d2b0c8eaf5b2e39",
"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... |
------------------------------------------------------------------------------
-- Distributive laws on a binary operation (Stanovský example)
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS ... | {
"alphanum_fraction": 0.5488235294,
"avg_line_length": 36.170212766,
"ext": "agda",
"hexsha": "d66c03388c488dfe49c780a7e2985d934253ae67",
"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-19T1... |
{-# OPTIONS --safe --warning=error --without-K #-}
open import Sets.EquivalenceRelations
open import LogicalFormulae
open import Setoids.Setoids
open import Rings.Definition
open import Modules.Definition
open import Numbers.Naturals.Semiring
open import Numbers.Naturals.Order
open import Lists.Lists
open import Vecto... | {
"alphanum_fraction": 0.6617793594,
"avg_line_length": 66.9047619048,
"ext": "agda",
"hexsha": "9a590a214ec53f91574dbe1b08b8f38570e65038",
"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 --rewriting #-}
-- 2014-05-27 Jesper and Andreas
postulate
A B : Set
R : A → B → Set
{-# BUILTIN REWRITE R #-}
| {
"alphanum_fraction": 0.5681818182,
"avg_line_length": 13.2,
"ext": "agda",
"hexsha": "cd5aeaebde3a8d4b92bfb3031ef49df2caa77830",
"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 --without-K --exact-split --rewriting --overlapping-instances #-}
open import lib.Basics
open import lib.NConnected
open import lib.NType2
open import lib.types.Truncation
open import Coequalizers.Definition
open import Coequalizers.Misc
open import Graphs.Definition
open import Util.Misc
module Groups... | {
"alphanum_fraction": 0.6533430233,
"avg_line_length": 28.6666666667,
"ext": "agda",
"hexsha": "4d3cdf3754f8e2105bfa6d42ec05a9425f156875",
"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 CTL.Proof where
open import CTL.Proof.AG public
open import CTL.Proof.EG public
| {
"alphanum_fraction": 0.8068181818,
"avg_line_length": 17.6,
"ext": "agda",
"hexsha": "da62d6c1681fcca397d2f16f1811abf0f0996e85",
"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-13T15:56:38.... |
module ReflectionExposeConstraints where
open import Agda.Builtin.Reflection
open import Agda.Builtin.List
open import Agda.Builtin.Nat
open import Agda.Builtin.Unit
open import Agda.Builtin.Equality
_>>=_ : ∀ {a b} {A : Set a} {B : Set b} → TC A → (A → TC B) → TC B
_>>=_ = bindTC
_ifMeta_ : {A : Set} → Term → (Meta... | {
"alphanum_fraction": 0.4690763052,
"avg_line_length": 27.0652173913,
"ext": "agda",
"hexsha": "b83ab0048b7853a504c07e545817c01049c81eca",
"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 Relation.Unary
open import Relation.Ternary.Separation
module Relation.Ternary.Separation.Monad.Free {ℓ} {A : Set ℓ}
{{r : RawSep A}}
(Cmd : Pred A ℓ)
(δ : ∀ {Φ} → Cmd Φ → Pred A ℓ)
where
open import Level
open import Function
open import Data.Unit
open import Data.Product
open import Relation.U... | {
"alphanum_fraction": 0.5713660245,
"avg_line_length": 31.7222222222,
"ext": "agda",
"hexsha": "7385bef34343cb9a4f5046173faa8950a7ee3bd8",
"lang": "Agda",
"max_forks_count": 2,
"max_forks_repo_forks_event_max_datetime": "2020-05-23T00:34:36.000Z",
"max_forks_repo_forks_event_min_datetime": "2020-01-30T... |
module PLRTree.Complete.Correctness.Alternative {A : Set} where
open import BTree.Complete.Alternative {A}
open import BTree.Complete.Alternative.Properties {A}
open import BTree.Equality {A}
open import PLRTree {A}
open import PLRTree.Complete {A} renaming (Complete to Complete' ; _⋗_ to _⋗'_ ; _⋘_ to _⋘'_ ; _⋙_ to ... | {
"alphanum_fraction": 0.4834653004,
"avg_line_length": 53.675,
"ext": "agda",
"hexsha": "c04dda70b674650b8fe0495a9ca5b08a351d7ae1",
"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": ... |
-- Andreas, 2012-02-13: polarity info must be correct
{-# OPTIONS --sized-types --show-implicit #-}
-- {-# OPTIONS -v tc.size.solve:20 -v tc.conv.size:20 #-}
-- {-# OPTIONS -v tc.polarity.set:10 -v tc.conv.term.shortcut:20 #-}
module WrongPolarity where
open import Common.Size
data ⊥ : Set where
data Sink (A : Set... | {
"alphanum_fraction": 0.611183355,
"avg_line_length": 27.4642857143,
"ext": "agda",
"hexsha": "c4abe154e5de6d11725f1ab85c833e7714640677",
"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 DescStrat where
open import StratSigma
data Desc42 : Set43 where
id42 : Desc42
const42 : Set42 -> Desc42
prod42 : Desc42 -> Desc42 -> Desc42
sigma42 : (S : Set42) -> (S -> Desc42) -> Desc42
pi42 : (S : Set42) -> (S -> Desc42) -> Desc42
[|_|]42_ : Desc42 -> Set42 -> Set42
[| id42 |]42 Z ... | {
"alphanum_fraction": 0.597567402,
"avg_line_length": 32.4609338881,
"ext": "agda",
"hexsha": "7e8034ee96f0af945e7f7bc9dcfd8a643e377afd",
"lang": "Agda",
"max_forks_count": 12,
"max_forks_repo_forks_event_max_datetime": "2022-02-11T01:57:40.000Z",
"max_forks_repo_forks_event_min_datetime": "2016-08-14T... |
module CombinatoryLogic.Semantics where
open import Relation.Binary using (Rel)
open import CombinatoryLogic.Syntax
-- Kapitel 1, Abschnitt C, §5 (Axiome)
data Axiom : Combinator → Set where
Q : Axiom (Π ∙ (W ∙ (C ∙ Q)))
B : Axiom (C ∙ (B ∙ B ∙ (B ∙ B ∙ B)) ∙ B == B ∙ (B ∙ B) ∙ B)
C : Axiom (C ∙ (B ∙ B ∙ (B ∙ ... | {
"alphanum_fraction": 0.477427598,
"avg_line_length": 38.4918032787,
"ext": "agda",
"hexsha": "0bb3d057fd21df0d9ad27f3891dfc407171a10ed",
"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 Prelude
open import dynamics-core
open import progress-checks
module finality where
finality : Σ[ d ∈ ihexp ] (d final × (Σ[ d' ∈ ihexp ] (d ↦ d'))) → ⊥
finality (π1 , π2 , π3 , π4) = final-not-step π2 (π3 , π4)
-- a slight restatement of the above, generalizing it to the
-- multistep judgement
... | {
"alphanum_fraction": 0.6282051282,
"avg_line_length": 31.2,
"ext": "agda",
"hexsha": "72c359edb843a5f60368092a18932dd22922a4bd",
"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": "a... |
postulate A : Set
record R : Set where
constructor c
field f : A
open R {{...}}
works : {{_ : R}} → A
works = f
works' : {{_ : R}} → Set → A
works' B = f
test : {{_ : R}} → A
test {{_}} = f
-- No variable of type R was found in scope.
-- when checking that the expression f has type A
test1 : {{_ : R}} → Set... | {
"alphanum_fraction": 0.5889145497,
"avg_line_length": 16.037037037,
"ext": "agda",
"hexsha": "45c74c2a7af3e357a523456afa978873df082511",
"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... |
module monad where
open import eq
record Monad (M : Set → Set) : Set₁ where
field
return : ∀{A : Set} → A → M A
bind : ∀{A B : Set} → M A → (A → M B) → M B
monad-left-id : ∀{A B : Set}{a : A}{f : A → M B}
→ bind (return a) f ≡ f a
monad-right-id : ∀{A : Set}{c : M A}
→ bind c... | {
"alphanum_fraction": 0.4482758621,
"avg_line_length": 24.4210526316,
"ext": "agda",
"hexsha": "ee9d26c8672c84e8b414e84099a5693d02992bdc",
"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... |
------------------------------------------------------------------------
-- Higher lenses with erased proofs
------------------------------------------------------------------------
-- At the time of writing there are counterparts in this file of more
-- or less everything in Lens.Non-dependent.Higher, except for part... | {
"alphanum_fraction": 0.4759829242,
"avg_line_length": 37.6578059072,
"ext": "agda",
"hexsha": "ce602a6bc9b80d899389512fe132ed654e4d5ccb",
"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 --safe #-}
module Cubical.HITs.Cylinder.Base where
open import Cubical.Core.Everything
open import Cubical.Foundations.Everything
open import Cubical.HITs.PropositionalTruncation
import Cubical.Data.Everything as Data
open Data hiding (inl; inr)
open import Cubical.HITs.Interval
-- Cylinder... | {
"alphanum_fraction": 0.6373424691,
"avg_line_length": 30.6104868914,
"ext": "agda",
"hexsha": "0d1dfc6f0bd0a10b5af550998d07bb75fed46d33",
"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 Editor where
open import Agda.Builtin.FromNat
open import BasicIO
open import Data.Bool
open import Data.Char
open import Data.List hiding (_++_)
open import Data.String
open import Data.Unit
open import Function
open import Int
open import Terminal
readTimeout : Int
readTimeout = 0
readMinChars : Int
readMin... | {
"alphanum_fraction": 0.7489975942,
"avg_line_length": 23.5283018868,
"ext": "agda",
"hexsha": "f651415abb1a2e7ce114557ade0f969f8f336c9f",
"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 --safe #-}
module Cubical.Foundations.UnivalenceId where
open import Cubical.Core.Glue
renaming ( isEquiv to isEquivPath
; _≃_ to EquivPath
; equivFun to equivFunPath )
open import Cubical.Core.Id
open import Cubical.Foundations.Prelude public
hiding (... | {
"alphanum_fraction": 0.6358823529,
"avg_line_length": 39.5348837209,
"ext": "agda",
"hexsha": "0d74e1bb2ddf616ce70c1429f79ac02225c9ac70",
"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 Ual.Void where
data ⊥ : Set where
¬ : Set → Set
¬ p = p → ⊥
| {
"alphanum_fraction": 0.5507246377,
"avg_line_length": 9.8571428571,
"ext": "agda",
"hexsha": "9d4fcef32b685c92f07b0098a093a689bcb091d9",
"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 Arity where
open import OscarPrelude
record Arity : Set
where
constructor ⟨_⟩
field
arity : Nat
open Arity public
instance EqArity : Eq Arity
Eq._==_ EqArity _ = decEq₁ (cong arity) ∘ (_≟_ on arity $ _)
| {
"alphanum_fraction": 0.6964285714,
"avg_line_length": 14,
"ext": "agda",
"hexsha": "348a98e0f9a20d600a46cf7afc2ae0963f91eadb",
"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": "52e... |
open import Common.Reflect
open import Common.Prelude
data Z : Set where
zero : Z
foo : QName → Bool → Bool
foo (quote Nat.zero) b = {!b!}
foo _ _ = false
| {
"alphanum_fraction": 0.66875,
"avg_line_length": 14.5454545455,
"ext": "agda",
"hexsha": "0b770b23d6b49038c99f1e4ee4673d0edef3e434",
"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... |
open import Oscar.Prelude
open import Oscar.Class
open import Oscar.Class.Leftunit
open import Oscar.Class.Reflexivity
open import Oscar.Class.Transitivity
open import Oscar.Class.Transleftidentity
module Oscar.Class.Transleftidentity.ToLeftunit where
module _
{𝔬} {𝔒 : Ø 𝔬}
{𝔯} {_∼_ : 𝔒 → 𝔒 → Ø 𝔯}
{ℓ} {... | {
"alphanum_fraction": 0.690936107,
"avg_line_length": 29.2608695652,
"ext": "agda",
"hexsha": "53aa3d8f69e51d639420f0de3a4ffaa7e636a1d5",
"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... |
------------------------------------------------------------------------
-- A map function for the substitutions
------------------------------------------------------------------------
open import Data.Universe.Indexed
module deBruijn.Substitution.Function.Map
{i u e} {Uni : IndexedUniverse i u e} where
import Ax... | {
"alphanum_fraction": 0.4264846743,
"avg_line_length": 36.6315789474,
"ext": "agda",
"hexsha": "474d7ae5cecab42ea448a878a4035b304d92f8cb",
"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 --sized-types #-}
module SList.Properties (A : Set) where
open import Data.List
open import List.Permutation.Base A
open import SList
lemma-unsize-size : (xs : List A) → xs ∼ unsize A (size A xs)
lemma-unsize-size [] = ∼[]
lemma-unsize-size (x ∷ xs) = ∼x /head /head (lemma-unsize-size xs)
| {
"alphanum_fraction": 0.6699029126,
"avg_line_length": 22.0714285714,
"ext": "agda",
"hexsha": "c7afcac6214f57a1f3c81c916c07af15e402135b",
"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 Relation.Unary using ( ∅ ; _∪_ )
open import Web.Semantic.DL.Concept using ( Concept )
open import Web.Semantic.DL.Role using ( Role )
open import Web.Semantic.DL.Signature using ( Signature )
open import Web.Semantic.Util using ( Subset ; ⁅_⁆ )
module Web.Semantic.DL.TBox where
infixl 5 _⊑₁_ _⊑₂_
infixr ... | {
"alphanum_fraction": 0.5760992108,
"avg_line_length": 28.6129032258,
"ext": "agda",
"hexsha": "7bb3d281c4e5fca19d512dfd7917d4ae7018752a",
"lang": "Agda",
"max_forks_count": 3,
"max_forks_repo_forks_event_max_datetime": "2022-03-12T11:40:03.000Z",
"max_forks_repo_forks_event_min_datetime": "2017-12-03T... |
module GUIgeneric.GUIFeatures where
open import GUIgeneric.Prelude
open import GUIgeneric.GUIDefinitions renaming (add to add'; add' to add)
open import GUIgeneric.GUI
open import GUIgeneric.GUIExampleLib
open import StateSizedIO.GUI.WxGraphicsLibLevel3
open Interfaceˢ public
-- Components
--
frameAndOKButton : ... | {
"alphanum_fraction": 0.7480454344,
"avg_line_length": 33.7263681592,
"ext": "agda",
"hexsha": "a749711b4d4260622d51235a48733a4182ea01a4",
"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 #-}
{- 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 Haskell.Modules.RWS
open i... | {
"alphanum_fraction": 0.6204232968,
"avg_line_length": 45.6649029982,
"ext": "agda",
"hexsha": "b460eb3d52bbcf64a38dd1e69635d6a5d5105d6a",
"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... |
------------------------------------------------------------------------
-- From the Agda standard library
--
-- Sizes for Agda's sized types
------------------------------------------------------------------------
module Common.Size where
open import Agda.Builtin.Size public renaming (ω to ∞; SizeU to SizeUniv)
| {
"alphanum_fraction": 0.4018987342,
"avg_line_length": 31.6,
"ext": "agda",
"hexsha": "235a824b62084edce3febd84b8c52ad2634a5a3e",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2022-03-12T11:39:14.000Z",
"max_forks_repo_forks_event_min_datetime": "2022-03-12T11:39:14.... |
module cfg1 where
open import Level renaming ( suc to succ ; zero to Zero )
open import Data.Nat hiding ( _≟_ )
-- open import Data.Fin
-- open import Data.Product
open import Data.List
open import Data.Maybe
-- open import Data.Bool using ( Bool ; true ; false ; _∧_ ; _∨_ )
open import Relation.Binary.Propositional... | {
"alphanum_fraction": 0.5688381464,
"avg_line_length": 29.2918032787,
"ext": "agda",
"hexsha": "5ac732363ae45c4f9aeb13649a216d54de451115",
"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.Equality
variable
A B : Set
f g : A
postulate
F : Set → Set
map : (A → B) → F A → F B
lemma : (x : F A) → map (λ x → f (g x)) x ≡ map f (map g x) → F A
lemma {A = A} {f = f} {g = g} x _ = x
| {
"alphanum_fraction": 0.4912280702,
"avg_line_length": 17.5384615385,
"ext": "agda",
"hexsha": "d0e168068c0be7f0c3803fabc2ef853d5517ddf7",
"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... |
------------------------------------------------------------------------
-- Coinductive higher lenses with erased "proofs"
------------------------------------------------------------------------
{-# OPTIONS --guardedness #-}
import Equality.Path as P
module Lens.Non-dependent.Higher.Coinductive.Erased
{e⁺} (eq : ... | {
"alphanum_fraction": 0.4397508273,
"avg_line_length": 41.096,
"ext": "agda",
"hexsha": "f7ba0d3a597dbb2a96a84693cc3555d4719aef79",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2020-07-01T14:33:26.000Z",
"max_forks_repo_forks_event_min_datetime": "2020-07-01T14:33:2... |
{-# OPTIONS --warning=error --without-K --safe #-}
open import LogicalFormulae
open import Categories.Definition
open import Categories.Functor.Definition
module Categories.Functor.Lemmas where
functorCompose : {a b c d e f : _} {B : Category {a} {b}} {C : Category {c} {d}} {D : Category {e} {f}} → (Functor C D) → (... | {
"alphanum_fraction": 0.6532744074,
"avg_line_length": 113.1363636364,
"ext": "agda",
"hexsha": "1c159f3b42974f373c687e0c1e1eec0fc6eb32f2",
"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-29... |
{-# OPTIONS --without-K #-}
module Pi0Examples where
open import PiU using (U; ZERO; ONE; PLUS; TIMES)
open import PiLevel0
using (_⟷_;
unite₊l; uniti₊l; unite₊r; uniti₊r; swap₊; assocl₊; assocr₊;
unite⋆l; uniti⋆l; unite⋆r; uniti⋆r; swap⋆; assocl⋆; assocr⋆;
absorbr; absorbl; factorzr; fac... | {
"alphanum_fraction": 0.4940258474,
"avg_line_length": 33.8925619835,
"ext": "agda",
"hexsha": "a97cc6c9524805076f0809ba11847b8e4ebcafb9",
"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... |
import Lvl
open import Data.Boolean
open import Type
module Data.List.Sorting.MergeSort {ℓ} {T : Type{ℓ}} (_≤?_ : T → T → Bool) where
open import Data.List
open import Data.List.Functions as List
open import Data.List.Relation.Membership as Membership using (_∈_ ; use ; skip)
open import Data.List.Relation.Membe... | {
"alphanum_fraction": 0.6584249084,
"avg_line_length": 42,
"ext": "agda",
"hexsha": "799a478a9bb4a09f927773789f5178dfdb4773aa",
"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": "70f... |
{-
This file contains basic theory about subgroups.
The definition is the same as the first definition of subgroups in:
https://www.cs.bham.ac.uk/~mhe/HoTT-UF-in-Agda-Lecture-Notes/HoTT-UF-Agda.html#subgroups-sip
-}
{-# OPTIONS --safe #-}
module Cubical.Algebra.Group.Subgroup where
open import Cubical.Foundations.... | {
"alphanum_fraction": 0.5703692934,
"avg_line_length": 32.7523809524,
"ext": "agda",
"hexsha": "3e060f289b790f8a05a6152c2a8e754bf53b48c3",
"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 CompleteSemantics.Iemhoff where
open import Syntax public
-- Introspective brilliant Kripke models.
record Model : Set₁ where
infix 3 _⊩ᵅ_
field
World : Set
_≤_ : World → World → Set
refl≤ : ∀ {w} → w ≤ w
trans≤ : ∀ {w w′ w″} → w ≤ w′ → w′ ≤ w″ → w ≤ w″
_R_ : World → Worl... | {
"alphanum_fraction": 0.3620250232,
"avg_line_length": 36.1171548117,
"ext": "agda",
"hexsha": "ff02449ca83473f32d3e3238e86a1456befc206e",
"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 sum-thms where
open import eq
open import sum
open import list
open import product
inj₁-inj : ∀{ℓ ℓ'}{A : Set ℓ}{B : Set ℓ'}{x : A}{x'} → inj₁{ℓ}{ℓ'}{A}{B} x ≡ inj₁ x' → x ≡ x'
inj₁-inj refl = refl
| {
"alphanum_fraction": 0.6105769231,
"avg_line_length": 18.9090909091,
"ext": "agda",
"hexsha": "75c084e2c667222edcbfb97ec7c65508628c634a",
"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 MultiSorted.Context {s} (Sort : Set s) where
-- An attempt to define more structured context
-- that directly support the cartesian structure
data Context : Set s where
ctx-empty : Context
ctx-slot : Sort → Context
ctx-concat : Context → Context → Context
-- the variables in a context
data var : Contex... | {
"alphanum_fraction": 0.6425902864,
"avg_line_length": 32.12,
"ext": "agda",
"hexsha": "0c0c7f04252d6be2072b6ffe6fcebedd55f8c5b9",
"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-16T13:43:07... |
{-# OPTIONS --prop #-}
open import Agda.Primitive
record LiftP {ℓ ℓ'}(A : Prop ℓ) : Prop (ℓ ⊔ ℓ') where
constructor liftP
field
unliftP : A
open LiftP public
unliftP' : {ℓ ℓ' ℓ'' : Level} {A : Prop ℓ}{B : Set ℓ''}(f : A → B) → LiftP {ℓ}{ℓ'} A → B
unliftP' f (liftP x) = f x
| {
"alphanum_fraction": 0.5684210526,
"avg_line_length": 21.9230769231,
"ext": "agda",
"hexsha": "b92630ba0529918218732b28fa0ebfd6469f84e3",
"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 --cubical --no-import-sorts #-}
module Cubical.Codata.Everything where
open import Cubical.Codata.EverythingSafe public
--- Modules making assumptions that might be incompatible with other
-- flags or make use of potentially unsafe features.
-- Assumes --guardedness
open import Cubical.Codata.Stream pub... | {
"alphanum_fraction": 0.7857900318,
"avg_line_length": 29.46875,
"ext": "agda",
"hexsha": "cbe837ff3ae8033f5410a65b0e9fceea26dc43f2",
"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-22T02:02... |
module Automaton.Pushdown where
| {
"alphanum_fraction": 0.875,
"avg_line_length": 16,
"ext": "agda",
"hexsha": "bc3187ac2d661584de3fe936123e5e031f659483",
"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": "70f4fba849... |
module Naturals where
open import Library
open import Categories
open import Functors
open Fun
record NatT {a b c d}{C : Cat {a}{b}}{D : Cat {c}{d}}(F G : Fun C D) :
Set (a ⊔ b ⊔ c ⊔ d) where
constructor natural
open Cat
field cmp : ∀ {X} → Hom D (OMap F X) (OMap G X)
nat : ∀{X Y}{f : Hom C X Y} → ... | {
"alphanum_fraction": 0.4864463424,
"avg_line_length": 30.9540229885,
"ext": "agda",
"hexsha": "5600dc0ae58742db06a99c1fa14f49107643ca07",
"lang": "Agda",
"max_forks_count": 1,
"max_forks_repo_forks_event_max_datetime": "2019-11-04T21:33:13.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-11-04T... |
module PushProdPull where
open import Categories.Category
open import Categories.Category.Cartesian.Bundle
open import Categories.Category.CartesianClosed.Canonical
open import Categories.Category.Core
open import Categories.Category.Product
open import Categories.Diagram.Pullback
open import Categories.Diagram.Pushou... | {
"alphanum_fraction": 0.5584866366,
"avg_line_length": 28.5247524752,
"ext": "agda",
"hexsha": "c22edf11c15e71da837ae70960890c23c5f30ecf",
"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 Esterel.Lang.Properties where
open import Esterel.Lang
open import Relation.Binary.PropositionalEquality
open import Relation.Unary
open import Relation.Nullary using (¬_ ; Dec ; yes ; no)
open import Esterel.Environment
open import Esterel.Variable.Signal as Signal
open import Esterel.Variable.Shared as Shared... | {
"alphanum_fraction": 0.6146771654,
"avg_line_length": 45.2279202279,
"ext": "agda",
"hexsha": "4091afc553536dbc359b39a2ef2ba87a5bd3a503",
"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... |
------------------------------------------------------------------------
-- Safe modules that use --erased-cubical and --guardedness
------------------------------------------------------------------------
{-# OPTIONS --safe --erased-cubical --guardedness #-}
module README.Safe.Cubical.Erased.Guardedness where
-- M-... | {
"alphanum_fraction": 0.5286624204,
"avg_line_length": 33.6428571429,
"ext": "agda",
"hexsha": "37a3a3842669512c07c0cb86108057bf1223e940",
"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 OpenModule where
module A where
postulate X : Set
-- Both open import and open module applies the directives
-- to the "open" rather than to the module.
open import Nat hiding (zero) renaming (Nat to N)
open module B = A renaming (X to Y)
Test : Set
Test = Y → B.X → N → Nat.Nat
zero : N
zero = Nat.zero
... | {
"alphanum_fraction": 0.6820925553,
"avg_line_length": 19.88,
"ext": "agda",
"hexsha": "b9bc34242074ed9e5841cfbd45012ff3814e260c",
"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 category of contexts and renamings
module SOAS.ContextMaps.CategoryOfRenamings {T : Set} where
open import SOAS.Common
open import SOAS.Context {T}
open import SOAS.Variable
open import SOAS.ContextMaps.Combinators (ℐ {T})
open import Categories.Functor.Bifunctor
open import Categories.Object.Initial
open imp... | {
"alphanum_fraction": 0.5402144772,
"avg_line_length": 33.4743589744,
"ext": "agda",
"hexsha": "ed18dc393846cc7ef78d6d9112460b5883dfa25d",
"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 --universe-polymorphism #-}
module Categories.Support.SetoidPi where
open import Level
open import Function as Fun using (_on_)
open import Relation.Binary as B using () renaming (_=[_]⇒_ to _=[_]⇒₀_; _⇒_ to _⊆_)
open import Relation.Binary.PropositionalEquality as PE using (_≡_)
open import Relation.Bina... | {
"alphanum_fraction": 0.5519223147,
"avg_line_length": 37.1029411765,
"ext": "agda",
"hexsha": "506065a875fa7725e9a1b849cedc654e443e0653",
"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... |
{-# OPTIONS --without-K --safe #-}
-- This module provides the basic expression type for polynomials.
module Polynomial.Expr where
open import Data.Nat using (ℕ)
open import Data.Fin using (Fin)
infixl 6 _⊕_
infixl 7 _⊗_
infixr 8 _⊛_
data Expr {ℓ} (A : Set ℓ) (n : ℕ) : Set ℓ where
Κ : A → Expr A n
Ι : Fin ... | {
"alphanum_fraction": 0.5756256801,
"avg_line_length": 25.5277777778,
"ext": "agda",
"hexsha": "d453b9def9169483b03a0bb25d043a0dadb2981a",
"lang": "Agda",
"max_forks_count": 4,
"max_forks_repo_forks_event_max_datetime": "2022-01-20T07:07:11.000Z",
"max_forks_repo_forks_event_min_datetime": "2019-04-16T... |
-- 2012-09-25 Andreas, reported by Nicolas Pouillard
{-# OPTIONS --sized-types #-}
module Issue700 where
import Common.Level
open import Common.Size
postulate
Size< : Size → Set
{-# BUILTIN SIZELT Size< #-}
postulate
A : Set
data T (i : Size) : Set where
c : (j : Size< i) → T j → T _
bug : ∀ i → T i → A
bug ... | {
"alphanum_fraction": 0.6092436975,
"avg_line_length": 23.0322580645,
"ext": "agda",
"hexsha": "6d849c7bca1e3761fd7c1a564f5aeb3ec11b13e8",
"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 term:30 #-}
{-# OPTIONS --copatterns #-}
module ColistMutual where
mutual
data CoList (A : Set) : Set where
[] : CoList A
_∷_ : (x : A)(xs : ∞CoList A) → CoList A
record ∞CoList (A : Set) : Set where
coinductive
field out : CoList A
open ∞CoList
mutual
repeat : {A : Set}(a... | {
"alphanum_fraction": 0.6016511868,
"avg_line_length": 17,
"ext": "agda",
"hexsha": "61ec7a2d943e99d804b56f52996815934af54e7d",
"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.00... |
-- Saturated sets.
module SAT3 where
open import Library
open import Terms
open import Substitution
open import Reduction
open import SN
open import SN.AntiRename
-- Kripke predicates on well-typed terms.
TmSet : (a : Ty) → Set₁
TmSet a = {Γ : Cxt} (t : Tm Γ a) → Set
_⊆_ : ∀{a} (𝑨 𝑨′ : TmSet a) → Set
𝑨 ⊆ 𝑨′ = ... | {
"alphanum_fraction": 0.4975969241,
"avg_line_length": 25.5819672131,
"ext": "agda",
"hexsha": "c35f407196079386b8e189cc44a420befe86cca7",
"lang": "Agda",
"max_forks_count": 4,
"max_forks_repo_forks_event_max_datetime": "2018-02-23T18:22:17.000Z",
"max_forks_repo_forks_event_min_datetime": "2017-11-10T... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.