commit stringlengths 40 40 | old_file stringlengths 2 205 | new_file stringlengths 2 205 | old_contents stringlengths 0 32.9k | new_contents stringlengths 1 38.9k | subject stringlengths 3 9.4k | message stringlengths 6 9.84k | lang stringlengths 3 13 | license stringclasses 13
values | repos stringlengths 6 115k |
|---|---|---|---|---|---|---|---|---|---|
1b5c3931a31ac1d019f7a68f56a036201f92a46e | lambda.agda | lambda.agda | module lambda where
open import Relation.Binary.PropositionalEquality
open import Syntactic.Types public
open import Syntactic.Contexts Type public
open import Denotational.Notation
open import Denotational.Values public
open import Denotational.Environments Type ⟦_⟧Type public
-- TERMS
-- Syntax
data Term : Cont... | module lambda where
open import Relation.Binary.PropositionalEquality
open import Syntactic.Types public
open import Syntactic.Contexts Type public
open import Denotational.Notation
open import Denotational.Values public
open import Denotational.Environments Type ⟦_⟧Type public
-- TERMS
-- Syntax
data Term : Cont... | Fix mixed-if. | Fix mixed-if.
Old-commit-hash: 18ad0d9a08607bece81abf4bedc81a7763b56b9a
| Agda | mit | inc-lc/ilc-agda |
998682f0d09f06ad7918732abe550b386afe02e2 | Syntax/Type/Popl14.agda | Syntax/Type/Popl14.agda | module Syntax.Type.Popl14 where
-- Types of Calculus Popl14
infixr 5 _⇒_
data Type : Set where
int : Type
bag : Type
_⇒_ : (σ : Type) → (τ : Type) → Type
ΔType : Type → Type
ΔType int = int
ΔType bag = bag
ΔType (σ ⇒ τ) = σ ⇒ ΔType σ ⇒ ΔType τ
| module Syntax.Type.Popl14 where
-- Types of Calculus Popl14
data Popl14-type : Set where
base-int : Popl14-type
base-bag : Popl14-type
open import Syntax.Type.Plotkin Popl14-type public
pattern int = base base-int
pattern bag = base base-bag
Popl14-Δbase : Popl14-type → Popl14-type
Popl14-Δbase base-int = base... | Make Syntax.Type.Popl14 use Syntax.Type.Plotkin | Make Syntax.Type.Popl14 use Syntax.Type.Plotkin
Old-commit-hash: 031c97aee2022a85ee855ec3149f0f8cd160d5af
| Agda | mit | inc-lc/ilc-agda |
47b55ae0449921322131bd6dbdab41837ccb68c8 | flat-funs.agda | flat-funs.agda | module flat-funs where
open import Data.Nat
import Level as L
open import composable
open import vcomp
record FlatFuns {t} (T : Set t) : Set (L.suc t) where
constructor mk
field
`Bits : ℕ → T
`Bit : T
_`×_ : T → T → T
_`→_ : T → T → Set
infixr 2 _`×_
infix 0 _`→_
record FlatFunsOps {t} {T ... | module flat-funs where
open import Data.Nat
import Level as L
open import composable
open import vcomp
record FlatFuns {t} (T : Set t) : Set (L.suc t) where
constructor mk
field
`⊤ : T
`Bit : T
_`×_ : T → T → T
_`^_ : T → ℕ → T
_`→_ : T → T → Set
`Vec : T → ℕ → T
`Vec A n = A `^ n
... | Add support for general vector to our flat-funs abstraction | Add support for general vector to our flat-funs abstraction
| Agda | bsd-3-clause | crypto-agda/crypto-agda |
fce4641e9e8aec601f2ab48e128ad529e5ac3a98 | Thesis/SIRelBigStep/DeriveCorrect.agda | Thesis/SIRelBigStep/DeriveCorrect.agda | --
-- In this module we conclude our proof: we have shown that t, derive-dterm t
-- and produce related values (in the sense of the fundamental property,
-- rfundamental3), and for related values v1, dv and v2 we have v1 ⊕ dv ≡
-- v2 (because ⊕ agrees with validity, rrelV3→⊕).
--
-- We now put these facts together via ... | --
-- In this module we conclude our proof: we have shown that t, derive-dterm t
-- and produce related values (in the sense of the fundamental property,
-- rfundamental3), and for related values v1, dv and v2 we have v1 ⊕ dv ≡
-- v2 (because ⊕ agrees with validity, rrelV3→⊕).
--
-- We now put these facts together via ... | Clarify the problem even more | Clarify the problem even more
| Agda | mit | inc-lc/ilc-agda |
6ecbb2d5d6f0f6024afa19dfbd12fdcad3b23439 | incremental.agda | incremental.agda | module incremental where
-- SIMPLE TYPES
-- Syntax
data Type : Set where
_⇒_ : (τ₁ τ₂ : Type) → Type
infixr 5 _⇒_
-- Semantics
Dom⟦_⟧ : Type -> Set
Dom⟦ τ₁ ⇒ τ₂ ⟧ = Dom⟦ τ₁ ⟧ → Dom⟦ τ₂ ⟧
-- TYPING CONTEXTS
-- Syntax
data Context : Set where
∅ : Context
_•_ : (τ : Type) (Γ : Context) → Context
infixr 9 _... | module incremental where
-- SIMPLE TYPES
-- Syntax
data Type : Set where
_⇒_ : (τ₁ τ₂ : Type) → Type
infixr 5 _⇒_
-- Denotational Semantics
Dom⟦_⟧ : Type -> Set
Dom⟦ τ₁ ⇒ τ₂ ⟧ = Dom⟦ τ₁ ⟧ → Dom⟦ τ₂ ⟧
-- TYPING CONTEXTS
-- Syntax
data Context : Set where
∅ : Context
_•_ : (τ : Type) (Γ : Context) → Contex... | Implement natural semantics. | Implement natural semantics.
Natural semantics (= big-step operational semantics) came up in
a Skype chat with Paolo.
Old-commit-hash: 40138450230bdc6326bbd4d47b011921433466b1
| Agda | mit | inc-lc/ilc-agda |
64e621c3d2a135c31988f71656671c97b59d8eca | arrow.agda | arrow.agda | data Bool : Set where
true : Bool
false : Bool
_or_ : Bool → Bool → Bool
true or true = true
true or false = true
false or true = true
false or false = false
----------------------------------------
data ℕ : Set where
zero : ℕ
suc : ℕ → ℕ
{-# BUILTIN NATURAL ℕ #-}
_≡_ : ℕ → ℕ → Bool
zero ≡ zero ... | data Bool : Set where
true : Bool
false : Bool
_or_ : Bool → Bool → Bool
true or true = true
true or false = true
false or true = true
false or false = false
----------------------------------------
data ℕ : Set where
zero : ℕ
suc : ℕ → ℕ
{-# BUILTIN NATURAL ℕ #-}
_≡_ : ℕ → ℕ → Bool
zero ≡ zero ... | Add separations | Add separations
| Agda | mit | louisswarren/hieretikz |
af9d23c116a68842dcbe0843b111aba0220b3560 | Atlas/Change/Term.agda | Atlas/Change/Term.agda | module Atlas.Change.Term where
open import Atlas.Syntax.Type
open import Atlas.Syntax.Term
open import Atlas.Change.Type
-- nil-changes
nil-const : ∀ {ι : Base} → Const ∅ (base (ΔBase ι))
nil-const {ι} = neutral {ΔBase ι}
nil-term : ∀ {ι Γ} → Term Γ (base (ΔBase ι))
nil-term {Bool} = curriedConst (nil-const {Boo... | module Atlas.Change.Term where
open import Atlas.Syntax.Type
open import Atlas.Syntax.Term
open import Atlas.Change.Type
-- nil-changes
nil-const : ∀ {ι : Base} → Const ∅ (base (ΔBase ι))
nil-const {ι} = neutral {ΔBase ι}
nil-term : ∀ {ι Γ} → Term Γ (base (ΔBase ι))
nil-term {Bool} = curriedConst (nil-const {Boo... | Rename Atlas-apply to apply-base. | Rename Atlas-apply to apply-base.
Old-commit-hash: aa571d5b9c41b6b4aa16886b55721dc3dbd9e033
| Agda | mit | inc-lc/ilc-agda |
aa15436d10416e76d1a5f6494f6bf9dfde53c404 | Thesis/SIRelBigStep/DSyntax.agda | Thesis/SIRelBigStep/DSyntax.agda | module Thesis.SIRelBigStep.DSyntax where
open import Thesis.SIRelBigStep.Syntax public
-- data DType : Set where
-- _⇒_ : (σ τ : DType) → DType
-- int : DType
DType = Type
import Base.Syntax.Context
module DC = Base.Syntax.Context DType
Δτ : Type → DType
Δτ (σ ⇒ τ) = σ ⇒ Δτ σ ⇒ Δτ τ
Δτ (pair τ1 τ2) = pair (Δτ τ... | module Thesis.SIRelBigStep.DSyntax where
open import Thesis.SIRelBigStep.Syntax public
-- data DType : Set where
-- _⇒_ : (σ τ : DType) → DType
-- int : DType
DType = Type
import Base.Syntax.Context
module DC = Base.Syntax.Context DType
Δτ : Type → DType
Δτ (σ ⇒ τ) = σ ⇒ Δτ σ ⇒ Δτ τ
Δτ (pair τ1 τ2) = pair (Δτ τ... | Drop unused redundant case | Drop unused redundant case
| Agda | mit | inc-lc/ilc-agda |
9e3f211e88b705e21001d83b692c5504a15a4f1a | lib/Data/Bits.agda | lib/Data/Bits.agda | module Data.Bits where
-- cleanup
open import Category.Applicative
open import Category.Monad
open import Data.Nat.NP hiding (_≤_; _==_)
open import Data.Nat.DivMod
open import Data.Bool.NP hiding (_==_)
open import Data.Bool.Properties using (not-involutive)
open import Data.Maybe
import Data.Fin as Fin
open Fin usin... | module Data.Bits where
-- cleanup
open import Category.Applicative
open import Category.Monad
open import Data.Nat.NP hiding (_≤_; _==_)
open import Data.Nat.DivMod
open import Data.Bool.NP hiding (_==_)
open import Data.Bool.Properties using (not-involutive)
open import Data.Maybe
import Data.Fin as Fin
open Fin usin... | use 2^ instead of _^_ 2 in allBits and #⟨_⟩ | Data.Bits: use 2^ instead of _^_ 2 in allBits and #⟨_⟩
| Agda | bsd-3-clause | crypto-agda/agda-nplib |
00065eb75ec8eb897e66dfd3bfb4c202d976fd57 | Denotational/Values.agda | Denotational/Values.agda | module Denotational.Values where
-- VALUES
--
-- This module defines the model theory of simple types, that is,
-- it defines for every type, the set of values of that type.
--
-- In fact, we only describe a single model here.
import Relation.Binary as B
open import Relation.Binary using
(IsEquivalence; Setoid; Re... | module Denotational.Values where
-- VALUES
--
-- This module defines the model theory of simple types, that is,
-- it defines for every type, the set of values of that type.
--
-- In fact, we only describe a single model here.
open import Data.Bool public
import Relation.Binary as B
open import Relation.Binary usin... | Use booleans from Data.Bool (fix #31). | Use booleans from Data.Bool (fix #31).
Old-commit-hash: c2de96202cc68d0b06b45d3c977bdf935e14eec1
| Agda | mit | inc-lc/ilc-agda |
64a0d4678c9a3cfe69e473c9b5f335cd071c1e13 | Parametric/Change/Validity.agda | Parametric/Change/Validity.agda | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Dependently typed changes (Def 3.4 and 3.5, Fig. 4b and 4e)
------------------------------------------------------------------------
import Parametric.Syntax.Type as Type
import Parametric.Denotation.Value as Value... | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Dependently typed changes (Def 3.4 and 3.5, Fig. 4b and 4e)
------------------------------------------------------------------------
import Parametric.Syntax.Type as Type
import Parametric.Denotation.Value as Value... | Move import to more sensible place | Move import to more sensible place
| Agda | mit | inc-lc/ilc-agda |
a6bbe5d2b2206e1090e8303580a73956ec707683 | formalization/agda/Spire/Examples/DarkwingDuck/Primitive.agda | formalization/agda/Spire/Examples/DarkwingDuck/Primitive.agda | module Spire.Examples.DarkwingDuck.Primitive where
----------------------------------------------------------------------
infixr 4 _,_
infixr 5 _∷_
----------------------------------------------------------------------
postulate String : Set
{-# BUILTIN STRING String #-}
-------------------------------------------... | module Spire.Examples.DarkwingDuck.Primitive where
----------------------------------------------------------------------
infixr 4 _,_
infixr 5 _∷_
----------------------------------------------------------------------
postulate String : Set
{-# BUILTIN STRING String #-}
-------------------------------------------... | Add bot to primitives. | Add bot to primitives.
Consistency at last.
| Agda | bsd-3-clause | spire/spire |
6dbde1e52f3b14199a1e9ee7097d079561b3923e | Thesis/SIRelBigStep/FundamentalProperty.agda | Thesis/SIRelBigStep/FundamentalProperty.agda | module Thesis.SIRelBigStep.FundamentalProperty where
open import Data.Product
open import Relation.Binary.PropositionalEquality
open import Thesis.SIRelBigStep.IlcSILR
rfundamentalV3v : ∀ {Γ τ} (x : Var Γ τ) → (n : ℕ) → ∀ ρ1 dρ ρ2 (ρρ : rrelρ3 Γ ρ1 dρ ρ2 n) → rrelV3 τ (⟦ x ⟧Var ρ1) (D.⟦ x ⟧Var dρ) (⟦ x ⟧Var ρ2) n
rf... | module Thesis.SIRelBigStep.FundamentalProperty where
open import Data.Product
open import Relation.Binary.PropositionalEquality
open import Thesis.SIRelBigStep.IlcSILR
rfundamentalV3v : ∀ {Γ τ} (x : Var Γ τ) → (n : ℕ) → ∀ ρ1 dρ ρ2 (ρρ : rrelρ3 Γ ρ1 dρ ρ2 n) → rrelV3 τ (⟦ x ⟧Var ρ1) (D.⟦ x ⟧Var dρ) (⟦ x ⟧Var ρ2) n
rf... | Correct local variable name | Correct local variable name
| Agda | mit | inc-lc/ilc-agda |
fb73c4c68d0d9e00dac3fd35d9b93d3d01182522 | Popl14/Change/Term.agda | Popl14/Change/Term.agda | module Popl14.Change.Term where
-- Terms Calculus Popl14
--
-- Contents
-- - Term constructors
-- - Weakening on terms
-- - `fit`: weaken a term to its ΔContext
-- - diff-term, apply-term and their syntactic sugars
open import Syntax.Context.Popl14 public
open import Data.Integer
open import Popl14.Syntax.Term publi... | module Popl14.Change.Term where
-- Terms Calculus Popl14
--
-- Contents
-- - Term constructors
-- - Weakening on terms
-- - `fit`: weaken a term to its ΔContext
-- - diff-term, apply-term and their syntactic sugars
open import Syntax.Context.Popl14 public
open import Data.Integer
open import Popl14.Syntax.Term publi... | Use HOAS-enabled helpers for nested abstractions. | Use HOAS-enabled helpers for nested abstractions.
Old-commit-hash: cffcfea69d7b1877dc5d63b49ee0ed9f24dce0d2
| Agda | mit | inc-lc/ilc-agda |
9d1e02a049e0eac1e796dc1d74d47064871effb3 | otp-sem-sec.agda | otp-sem-sec.agda | module otp-sem-sec where
import Level as L
open import Function
open import Data.Nat.NP
open import Data.Bits
open import Data.Bool
open import Data.Bool.Properties
open import Data.Vec hiding (_>>=_)
open import Data.Product.NP hiding (_⟦×⟧_)
open import Relation.Nullary
open import Relation.Binary
open import Relati... | module otp-sem-sec where
import Level as L
open import Function
open import Data.Nat.NP
open import Data.Bits
open import Data.Bool
open import Data.Bool.Properties
open import Data.Vec hiding (_>>=_)
open import Data.Product.NP hiding (_⟦×⟧_)
open import Relation.Nullary
open import Relation.Binary
open import Relati... | Remove power from the guessing game | Remove power from the guessing game
| Agda | bsd-3-clause | crypto-agda/crypto-agda |
242a602d070c3965f3dedd346bff306ec822c452 | lib/Algebra/Group/Homomorphism.agda | lib/Algebra/Group/Homomorphism.agda | {-# OPTIONS --without-K #-}
module Algebra.Group.Homomorphism where
open import Type using (Type_)
open import Function.NP using (Op₂; _∘_)
import Algebra.FunctionProperties.Eq
open Algebra.FunctionProperties.Eq.Implicits
open import Algebra.Monoid
open import Algebra.Monoid.Homomorphism
open import Algebra.Raw
open i... | {-# OPTIONS --without-K #-}
module Algebra.Group.Homomorphism where
open import Type using (Type_)
open import Function.NP using (Op₂; _∘_; id)
import Algebra.FunctionProperties.Eq
open Algebra.FunctionProperties.Eq.Implicits
open import Algebra.Monoid
open import Algebra.Monoid.Homomorphism
open import Algebra.Raw
op... | add id, ∘, Δ, zip, pair | Group.Homomorphism: add id, ∘, Δ, zip, pair
| Agda | bsd-3-clause | crypto-agda/agda-nplib |
39d9e13ae25672af17181a0c3d1fee2118ac33c9 | Syntax/Term/Plotkin.agda | Syntax/Term/Plotkin.agda | import Syntax.Type.Plotkin as Type
import Syntax.Context as Context
module Syntax.Term.Plotkin
{B : Set {- of base types -}}
{C : Context.Context {Type.Type B} → Type.Type B → Set {- of constants -}}
where
-- Terms of languages described in Plotkin style
open import Function using (_∘_)
open import Data.Pr... | import Syntax.Type.Plotkin as Type
import Syntax.Context as Context
module Syntax.Term.Plotkin
{B : Set {- of base types -}}
{C : Context.Context {Type.Type B} → Type.Type B → Set {- of constants -}}
where
-- Terms of languages described in Plotkin style
open import Function using (_∘_)
open import Data.Pr... | Introduce and use UncurriedTermConstructor. | Introduce and use UncurriedTermConstructor.
Old-commit-hash: d36f33b097ddb2444e6409de52048ef9bf94b001
| Agda | mit | inc-lc/ilc-agda |
81c758c5545a825b9152e8e2ab898c688bf0d4a9 | Solver/Linear/Parser.agda | Solver/Linear/Parser.agda | open import Data.Vec as Vec using ([]; _∷_)
open import Text.Parser
open import Data.One
open import Data.Char
open import Data.Nat
open import Data.List
open import Data.Product hiding (map)
open import Data.String as String renaming (toList to S▹L; fromList to L▹S)
open import Solver.Linear.Syntax
open import Data.Ma... | open import Data.Vec as Vec using ([]; _∷_)
open import Text.Parser
open import Data.One
open import Data.Char
open import Data.Nat
open import Data.List
open import Data.Product hiding (map)
open import Data.String as String renaming (toList to S▹L; fromList to L▹S)
open import Solver.Linear.Syntax
open import Data.Ma... | comment out the example (long to check) | Solver.Linear.Parser: comment out the example (long to check)
| Agda | bsd-3-clause | crypto-agda/crypto-agda |
32b4e15a9837ed6e6276af1fd200e4a3dffc2223 | flipbased.agda | flipbased.agda | module flipbased where
open import Algebra
import Level as L
open L using () renaming (_⊔_ to _L⊔_)
open import Function hiding (_⟨_⟩_)
open import Data.Nat.NP
open import Data.Bool
open import Data.Nat.Properties
open import Data.Product using (proj₁; proj₂; _,_; swap; _×_)
open import Data.Bits hiding (replicateM)
o... | module flipbased where
open import Algebra
import Level as L
open L using () renaming (_⊔_ to _L⊔_)
open import Function hiding (_⟨_⟩_)
open import Data.Nat.NP
open import Data.Bool
open import Data.Nat.Properties
open import Data.Product using (proj₁; proj₂; _,_; swap; _×_)
open import Data.Bits hiding (replicateM)
o... | fix choose | flipbased: fix choose
| Agda | bsd-3-clause | crypto-agda/crypto-agda |
df41c005d15604256ca7d340975689955ae6729f | protocols.agda | protocols.agda | module protocols where
import Control.Protocol
import Control.Protocol.Additive
import Control.Protocol.CLL
import Control.Protocol.ClientServer
import Control.Protocol.Examples
import Control.Protocol.MultiParty
import Control.Protocol.Multiplicative
import Control.Protocol.Relation
import Control.Protocol.Sequence
| module protocols where
import Control.Protocol
import Control.Protocol.Additive
import Control.Protocol.CLL
import Control.Protocol.ClientServer
import Control.Protocol.Examples
import Control.Protocol.Extend
import Control.Protocol.Lift
import Control.Protocol.MultiParty
import Control.Protocol.Multiplicative
import C... | update protocols.agda | update protocols.agda
| Agda | bsd-3-clause | crypto-agda/protocols |
a3a6c0d7b42940b151354af420f8d4469955d5c8 | Atlas/Change/Term.agda | Atlas/Change/Term.agda | module Atlas.Change.Term where
open import Atlas.Syntax.Type
open import Atlas.Syntax.Term
open import Atlas.Change.Type
-- nil-changes
nil-const : ∀ {ι : Base} → Const ∅ (base (ΔBase ι))
nil-const {ι} = neutral {ΔBase ι}
nil-term : ∀ {ι Γ} → Term Γ (base (ΔBase ι))
nil-term {Bool} = curriedConst (nil-const {Boo... | module Atlas.Change.Term where
open import Atlas.Syntax.Type
open import Atlas.Syntax.Term
open import Atlas.Change.Type
-- nil-changes
nil-const : ∀ {ι : Base} → Const ∅ (base (ΔBase ι))
nil-const {ι} = neutral {ΔBase ι}
nil-term : ∀ {ι Γ} → Term Γ (base (ΔBase ι))
nil-term {Bool} = curriedConst (nil-const {Boo... | Simplify Atlas-diff and Atlas-apply. | Simplify Atlas-diff and Atlas-apply.
Old-commit-hash: ada22ebb7416f8c4fb19882d4080166628b1b292
| Agda | mit | inc-lc/ilc-agda |
d41e35b9fb769cc937f3fa2787fe655ac719f13a | Syntax/Language/Atlas.agda | Syntax/Language/Atlas.agda | module Syntax.Language.Atlas where
-- Base types of the calculus Atlas
-- to be used with Plotkin-style language description
--
-- Atlas supports maps with neutral elements. The change type to
-- `Map κ ι` is `Map κ Δι`, where Δι is the change type of the
-- ground type ι. Such a change to maps can support insertions
... | module Syntax.Language.Atlas where
-- Base types of the calculus Atlas
-- to be used with Plotkin-style language description
--
-- Atlas supports maps with neutral elements. The change type to
-- `Map κ ι` is `Map κ Δι`, where Δι is the change type of the
-- ground type ι. Such a change to maps can support insertions
... | add primitives `lookup`, `fold` and various improvements | Atlas: add primitives `lookup`, `fold` and various improvements
Improvements:
- speed up derivative of zip
- less verbose term constructors for constants
- remove need to support conjunction and union directly
Future work:
- elimination forms: if-then-else, if-nonempty
Old-commit-hash: 9aafd0c2835ff027b57e44ed29... | Agda | mit | inc-lc/ilc-agda |
233ce4867a6fc1f8c29c642b2516cc11c7edd483 | Parametric/Change/Term.agda | Parametric/Change/Term.agda | import Parametric.Syntax.Type as Type
import Parametric.Syntax.Term as Term
import Parametric.Change.Type as ChangeType
module Parametric.Change.Term
{Base : Set}
(Constant : Term.Structure Base)
(ΔBase : ChangeType.Structure Base)
where
-- Terms that operate on changes
open Type.Structure Base
open Te... | import Parametric.Syntax.Type as Type
import Parametric.Syntax.Term as Term
import Parametric.Change.Type as ChangeType
module Parametric.Change.Term
{Base : Set}
(Constant : Term.Structure Base)
(ΔBase : ChangeType.Structure Base)
where
-- Terms that operate on changes
open Type.Structure Base
open Te... | Implement apply-term and diff-term directly. | Implement apply-term and diff-term directly.
Before this commit: Mutual recursion of apply-term and diff-term encoded
explicitly via a product type. After this commit: Mutual recursion
expressed with Agda mutual recursion.
Old-commit-hash: 9a7571f8ef5cf6765629a001c46870e002f54d7e
| Agda | mit | inc-lc/ilc-agda |
b51a3256a3c1252ef33def3ad7127f444c50c44e | incremental.agda | incremental.agda | module incremental where
-- SIMPLE TYPES
-- Syntax
data Type : Set where
_⇒_ : (τ₁ τ₂ : Type) → Type
infixr 5 _⇒_
-- Semantics
Dom⟦_⟧ : Type -> Set
Dom⟦ τ₁ ⇒ τ₂ ⟧ = Dom⟦ τ₁ ⟧ → Dom⟦ τ₂ ⟧
-- TYPING CONTEXTS
-- Syntax
data Context : Set where
∅ : Context
_•_ : (τ : Type) (Γ : Context) → Context
infixr 9 _... | module incremental where
-- SIMPLE TYPES
-- Syntax
data Type : Set where
_⇒_ : (τ₁ τ₂ : Type) → Type
infixr 5 _⇒_
-- Semantics
Dom⟦_⟧ : Type -> Set
Dom⟦ τ₁ ⇒ τ₂ ⟧ = Dom⟦ τ₁ ⟧ → Dom⟦ τ₂ ⟧
-- TYPING CONTEXTS
-- Syntax
data Context : Set where
∅ : Context
_•_ : (τ : Type) (Γ : Context) → Context
infixr 9 _... | Fix Δ-Context. | Fix Δ-Context.
Old-commit-hash: ce2c7324266f9f7511dd78f63accb2c3ae8c54fb
| Agda | mit | inc-lc/ilc-agda |
c1ff9f6bce16be7d52bc424c1c012656dec37587 | Parametric/Change/Validity.agda | Parametric/Change/Validity.agda | import Parametric.Syntax.Type as Type
import Parametric.Denotation.Value as Value
module Parametric.Change.Validity
{Base : Type.Structure}
(⟦_⟧Base : Value.Structure Base)
where
open Type.Structure Base
open Value.Structure Base ⟦_⟧Base
-- Changes for Calculus Popl14
--
-- Contents
-- - Mutually recursive... | import Parametric.Syntax.Type as Type
import Parametric.Denotation.Value as Value
module Parametric.Change.Validity
{Base : Type.Structure}
(⟦_⟧Base : Value.Structure Base)
where
open Type.Structure Base
open Value.Structure Base ⟦_⟧Base
-- Changes for Calculus Popl14
--
-- Contents
-- - Mutually recursive... | Implement apply-env and diff-env. | Implement apply-env and diff-env.
Old-commit-hash: 0a4d0485631257cbfb9ee522e8ac6facb88f0721
| Agda | mit | inc-lc/ilc-agda |
79eb1bff6fe6f19057332ff8737b10e85457ff5f | Parametric/Denotation/CachingEvaluation.agda | Parametric/Denotation/CachingEvaluation.agda | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Caching evaluation
------------------------------------------------------------------------
import Parametric.Syntax.Type as Type
import Parametric.Syntax.Term as Term
import Parametric.Syntax.MType as MType
impor... | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Caching evaluation
------------------------------------------------------------------------
import Parametric.Syntax.Type as Type
import Parametric.Syntax.Term as Term
import Parametric.Syntax.MType as MType
impor... | Drop dead comment | Drop dead comment
| Agda | mit | inc-lc/ilc-agda |
1dd4f0f861df9af4f01a33af2bb834b72be708cc | Base/Data/DependentList.agda | Base/Data/DependentList.agda | module Base.Data.DependentList where
open import Level
open import Data.Unit
open import Data.Product using (Σ ; _×_ ; _,_)
import Data.List as List
open List using (List ; [] ; _∷_)
data DependentList {a b} {A : Set a}
(F : A → Set b) : (type-args : List A) → Set (a ⊔ b)
where
∅ : DependentList F []
_•_ : ... | module Base.Data.DependentList where
open import Data.List.All public
renaming
( All to DependentList
; _∷_ to _•_
; [] to ∅
)
| Implement DependentList on top of Data.List.All. | Implement DependentList on top of Data.List.All.
Old-commit-hash: 32c7c7edadf9940f3c013ca3d4ebfdc8b3cbc4f4
| Agda | mit | inc-lc/ilc-agda |
816cffb53d3bae1af15f0f477ac1a68ccfa88b05 | Control/Protocol/Sequence.agda | Control/Protocol/Sequence.agda | {-# OPTIONS --without-K #-}
open import Function.NP
open import Type
open import Data.Product.NP using (Σ; _×_; _,_; first) renaming (proj₁ to fst; proj₂ to snd)
open import Data.Two hiding (_≟_)
open import Data.Nat hiding (_⊔_)
open import Relation.Binary.PropositionalEquality.NP using (_≡_; _∙_; refl; ap; coe; coe!;... | {-# OPTIONS --without-K #-}
open import Function.NP
open import Type
open import Data.Product.NP using (Σ; _×_; _,_; first) renaming (proj₁ to fst; proj₂ to snd)
open import Data.Two hiding (_≟_)
open import Data.Nat hiding (_⊔_)
open import Relation.Binary.PropositionalEquality.NP using (_≡_; _∙_; refl; ap; coe; coe!;... | add more composision with >> | add more composision with >>
| Agda | bsd-3-clause | crypto-agda/protocols |
11dd97138b62b839e6eff70a2897426660d4fd10 | Parametric/Change/Validity.agda | Parametric/Change/Validity.agda | import Parametric.Syntax.Type as Type
import Parametric.Denotation.Value as Value
module Parametric.Change.Validity
{Base : Type.Structure}
(⟦_⟧Base : Value.Structure Base)
where
open Type.Structure Base
open Value.Structure Base ⟦_⟧Base
-- Changes for Calculus Popl14
--
-- Contents
-- - Mutually recursive... | import Parametric.Syntax.Type as Type
import Parametric.Denotation.Value as Value
module Parametric.Change.Validity
{Base : Type.Structure}
(⟦_⟧Base : Value.Structure Base)
where
open Type.Structure Base
open Value.Structure Base ⟦_⟧Base
-- Changes for Calculus Popl14
--
-- Contents
-- - Mutually recursive... | Rename (ignore|update)-valid-change to (before|after). | Rename (ignore|update)-valid-change to (before|after).
Old-commit-hash: 16288a40704567fce8f03420af8050326b9b9b34
| Agda | mit | inc-lc/ilc-agda |
75429bb69a022fe800c050d4e53fdc2a9ccc9261 | PLDI14-List-of-Theorems.agda | PLDI14-List-of-Theorems.agda | module PLDI14-List-of-Theorems where
open import Function
-- List of theorems in PLDI submission
--
-- For hints about installation and execution, please refer
-- to README.agda.
--
-- Agda modules corresponding to definitions, lemmas and theorems
-- are listed here with the most important names. For example,
-- afte... | module PLDI14-List-of-Theorems where
-- List of theorems in PLDI submission
--
-- For hints about installation and execution, please refer
-- to README.agda.
--
-- Agda modules corresponding to definitions, lemmas and theorems
-- are listed here with the most important names. For example,
-- after this file type check... | Update PLDI14-List-of-Theorems.agda (for #275). | Update PLDI14-List-of-Theorems.agda (for #275).
The list included plugin requirements, but we left them out of the
paper, so the theorem numbers were off.
Old-commit-hash: d4ea643c7474f10c798fcb0d494db9f941e3deb5
| Agda | mit | inc-lc/ilc-agda |
ef3f46045d85fef7b038b4703fc7d2fee8d29a8a | Denotational/Equivalence.agda | Denotational/Equivalence.agda | module Denotational.Equivalence where
-- TERM EQUIVALENCE
--
-- This module defines term equivalence as the relation that
-- identifies terms with the same meaning.
open import Relation.Nullary using (¬_)
open import Relation.Binary hiding (_⇒_)
open import Relation.Binary.PropositionalEquality
open import Syntacti... | module Denotational.Equivalence where
-- TERM EQUIVALENCE
--
-- This module defines term equivalence as the relation that
-- identifies terms with the same meaning.
open import Relation.Nullary using (¬_)
open import Relation.Binary hiding (_⇒_)
open import Relation.Binary.PropositionalEquality
open import Denotati... | Generalize term equivalence to arbitrary calculi. | Generalize term equivalence to arbitrary calculi.
Old-commit-hash: 239a4be82a8af884669ca62db624782bee407ca1
| Agda | mit | inc-lc/ilc-agda |
90e62144b22dcc8d6181e110e5f313f406aff57f | proposal/examples/TacticsMatchingFunctionCalls.agda | proposal/examples/TacticsMatchingFunctionCalls.agda | {-
This file demonstrates a technique that simulates the ability to
pattern match against function calls rather than just variables
or constructors.
This technique is necessary to write certain kinds of tactics
as generic functions.
-}
module TacticsMatchingFunctionCalls where
open import Data.Bool hiding ( _≟_ )
op... | {-
This file demonstrates a technique that simulates the ability to
pattern match against function calls rather than just variables
or constructors.
This technique is necessary to write certain kinds of tactics
as generic functions.
-}
module TacticsMatchingFunctionCalls where
open import Data.Bool hiding ( _≟_ )
op... | change wording | change wording
| Agda | bsd-3-clause | spire/spire |
224bef483393cb10b22b2f51c63865cc5ddf471f | partial.agda | partial.agda | module partial where
-- INCREMENTAL λ-CALCULUS
-- with (one-variable) partial derivatives
--
-- Features:
-- * Changes and derivatives are different.
-- * Δ x e maps changes of x to changes of e.
-- * a full denotational semantics is given.
-- * the domain of change types `⟦Δ τ⟧` is uniformly defined as `⟦τ... | module partial where
-- INCREMENTAL λ-CALCULUS
-- with (one-variable) partial derivatives
--
-- Features:
-- * Changes and derivatives are different.
-- * Δ x dx e describes how e changes if x changes by dx.
-- * a full denotational semantics is given.
-- * the domain of change types `⟦Δ τ⟧` is uniformly de... | Fix comment (fix #20). | Fix comment (fix #20).
Old-commit-hash: d5a7ef44c7c38bf82aa00466ee0bac803dd860d3
| Agda | mit | inc-lc/ilc-agda |
64c7aa44ab0d86c66f744241c812cc27ab7fb2c6 | Base/Change/Sums.agda | Base/Change/Sums.agda | module Base.Change.Sums where
open import Relation.Binary.PropositionalEquality
open import Level
open import Base.Change.Algebra
open import Base.Change.Equivalence
open import Postulate.Extensionality
open import Data.Sum
module SumChanges ℓ (X Y : Set ℓ) {{CX : ChangeAlgebra ℓ X}} {{CY : ChangeAlgebra ℓ Y}} where... | module Base.Change.Sums where
open import Relation.Binary.PropositionalEquality
open import Level
open import Base.Change.Algebra
open import Base.Change.Equivalence
open import Postulate.Extensionality
open import Data.Sum
module SumChanges ℓ (X Y : Set ℓ) {{CX : ChangeAlgebra ℓ X}} {{CY : ChangeAlgebra ℓ Y}} where... | Add TODO | Add TODO
| Agda | mit | inc-lc/ilc-agda |
e0b2a2036942b7b9010a4d1e45e94ed00a26742d | Atlas/Change/Term.agda | Atlas/Change/Term.agda | module Atlas.Change.Term where
open import Atlas.Syntax.Type
open import Atlas.Syntax.Term
open import Atlas.Change.Type
-- nil-changes
nil-const : ∀ {ι : Base} → Const ∅ (base (ΔBase ι))
nil-const {ι} = neutral {ΔBase ι}
nil-term : ∀ {ι Γ} → Term Γ (base (ΔBase ι))
nil-term {Bool} = curriedConst (nil-const {Boo... | module Atlas.Change.Term where
open import Atlas.Syntax.Type
open import Atlas.Syntax.Term
open import Atlas.Change.Type
-- nil-changes
nil-const : ∀ {ι : Base} → Const ∅ (base (ΔBase ι))
nil-const {ι} = neutral {ΔBase ι}
nil-term : ∀ {ι Γ} → Term Γ (base (ΔBase ι))
nil-term {Bool} = curriedConst (nil-const {Boo... | Rename Atlas-diff to diff-base. | Rename Atlas-diff to diff-base.
Old-commit-hash: 8940b78431520f22d625a114d12ce0faee05542c
| Agda | mit | inc-lc/ilc-agda |
5a499d733fe3968065e0ae2b47d1393cf5980209 | lib/Data/Two.agda | lib/Data/Two.agda | {-# OPTIONS --without-K #-}
module Data.Two where
open import Data.Bool public hiding (if_then_else_) renaming (Bool to 𝟚; false to 0₂; true to 1₂; T to ✓)
open import Data.Bool.Properties
public
using (isCommutativeSemiring-∨-∧
;commutativeSemiring-∨-∧
;module RingSolver
;isCommutativeSem... | {-# OPTIONS --without-K #-}
module Data.Two where
open import Data.Bool public hiding (if_then_else_) renaming (Bool to 𝟚; false to 0₂; true to 1₂; T to ✓)
open import Data.Bool.Properties
public
using (isCommutativeSemiring-∨-∧
;commutativeSemiring-∨-∧
;module RingSolver
;isCommutativeSem... | add _² | Data.Two: add _²
| Agda | bsd-3-clause | crypto-agda/agda-nplib |
6ad96baab8d36671b146b356a5a446ae10e1b832 | Parametric/Change/Validity.agda | Parametric/Change/Validity.agda | import Parametric.Syntax.Type as Type
import Parametric.Denotation.Value as Value
module Parametric.Change.Validity
{Base : Type.Structure}
(⟦_⟧Base : Value.Structure Base)
where
open Type.Structure Base
open Value.Structure Base ⟦_⟧Base
open import Base.Denotation.Notation public
open import Relation.Bin... | import Parametric.Syntax.Type as Type
import Parametric.Denotation.Value as Value
module Parametric.Change.Validity
{Base : Type.Structure}
(⟦_⟧Base : Value.Structure Base)
where
open Type.Structure Base
open Value.Structure Base ⟦_⟧Base
open import Base.Denotation.Notation public
open import Relation.Bin... | Remove apply-env and diff-env. | Remove apply-env and diff-env.
Old-commit-hash: 0901643e49a0e4ff70db8f16278c25bd28348d3a
| Agda | mit | inc-lc/ilc-agda |
973a194f1e408a138980b8d9e4156302e223bc75 | Thesis/SIRelBigStep/DeriveCorrect.agda | Thesis/SIRelBigStep/DeriveCorrect.agda | --
-- In this module we conclude our proof: we have shown that t, derive-dterm t
-- and produce related values (in the sense of the fundamental property,
-- rfundamental3), and for related values v1, dv and v2 we have v1 ⊕ dv ≡
-- v2 (because ⊕ agrees with validity, rrelV3→⊕).
--
-- We now put these facts together via ... | --
-- In this module we conclude our proof: we have shown that t, derive-dterm t
-- and produce related values (in the sense of the fundamental property,
-- rfundamental3), and for related values v1, dv and v2 we have v1 ⊕ dv ≡
-- v2 (because ⊕ agrees with validity, rrelV3→⊕).
--
-- We now put these facts together via ... | Define a correct nil on values and environments | Define a correct nil on values and environments
Compose is trickier because I must match on two validity proofs, need an
inversion lemma for that.
| Agda | mit | inc-lc/ilc-agda |
1da0c206672cf5880079e99b71f1940b6df8932e | lambda.agda | lambda.agda | module lambda where
open import Relation.Binary.PropositionalEquality
open import Syntactic.Types public
open import Syntactic.Contexts Type public
open import Denotational.Notation
open import Denotational.Values public
open import Denotational.Environments Type ⟦_⟧Type public
-- TERMS
-- Syntax
data Term : Cont... | module lambda where
open import Relation.Binary.PropositionalEquality
open import Syntactic.Types public
open import Syntactic.Contexts Type public
open import Denotational.Notation
open import Denotational.Values public
open import Denotational.Environments Type ⟦_⟧Type public
-- TERMS
-- Syntax
data Term : Cont... | Implement NbE for lambda calculus with conditionals (see #50). | Implement NbE for lambda calculus with conditionals (see #50).
This version is simpler than the code in NormalizationByEvaluation
in the following ways:
- Instead of supporting arbitrary base types and constants,
bool, true, false, and if are hard-coded.
- Instead of supporting arbitrary Kripke structures,
m... | Agda | mit | inc-lc/ilc-agda |
2bc86b16750cda8c1189ff286ba5405a47076a56 | README.agda | README.agda | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Machine-checked formalization of the theoretical results presented
-- in the paper:
--
-- Yufei Cai, Paolo G. Giarrusso, Tillmann Rendel, Klaus Ostermann.
-- A Theory of Changes for Higher-Order Languages:
-- ... | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Machine-checked formalization of the theoretical results presented
-- in the paper:
--
-- Yufei Cai, Paolo G. Giarrusso, Tillmann Rendel, Klaus Ostermann.
-- A Theory of Changes for Higher-Order Languages:
-- ... | Update Agda version in README.agda | Update Agda version in README.agda
| Agda | mit | inc-lc/ilc-agda |
1fd2e308e6cbee61ce0c527c7a1c8fa86ae11694 | Base/Change/Equivalence.agda | Base/Change/Equivalence.agda | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Delta-observational equivalence
------------------------------------------------------------------------
module Base.Change.Equivalence where
open import Relation.Binary.PropositionalEquality
open import Base.Chang... | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Delta-observational equivalence
------------------------------------------------------------------------
module Base.Change.Equivalence where
open import Relation.Binary.PropositionalEquality
open import Base.Chang... | Remove more dead code | Remove more dead code
Old-commit-hash: 20e82287ead4c99b0bce90e095ed1f7711119d2a
| Agda | mit | inc-lc/ilc-agda |
e87a9fc0946ded53de5e1775b46c12ba9a8ba6dc | ZK/GroupHom/Types.agda | ZK/GroupHom/Types.agda | {-# OPTIONS --without-K #-}
open import Type using (Type)
open import Data.Bool.Base using (Bool) renaming (T to ✓)
open import Relation.Binary.PropositionalEquality.NP using (_≡_)
open import Algebra.Group
open import Algebra.Group.Homomorphism
module ZK.GroupHom.Types where
record GrpHom (G+ G* : Type)(P : G+ → Typ... | {-# OPTIONS --without-K #-}
open import Type using (Type)
open import Type.Eq
open import Relation.Binary.PropositionalEquality.NP using (_≡_)
open import Algebra.Group
open import Algebra.Group.Homomorphism
module ZK.GroupHom.Types where
-- P is the "valid witness" predicate.
record ZK-hom (G+ G* : Type)(P : G+ → Ty... | use Eq? | ZK.GroupHom.Types: use Eq?
| Agda | bsd-3-clause | crypto-agda/crypto-agda |
61adc205859b99f216096bf10da4b6ffe56adfc7 | Base/Syntax/Context.agda | Base/Syntax/Context.agda | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Variables and contexts
--
-- This module defines the syntax of contexts, prefixes of
-- contexts and variables and properties of these notions.
--
-- This module is parametric in the syntax of types, so it
-- can be... | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Variables and contexts
--
-- This module defines the syntax of contexts, prefixes of
-- contexts and variables and properties of these notions.
--
-- This module is parametric in the syntax of types, so it
-- can be... | Simplify _⋎_ | Simplify _⋎_
| Agda | mit | inc-lc/ilc-agda |
b93733dc8edf5e1dc3e416dfa0bca1405b5ae331 | total.agda | total.agda | module total where
-- INCREMENTAL λ-CALCULUS
-- with total derivatives
--
-- Features:
-- * changes and derivatives are unified (following Cai)
-- * Δ e describes how e changes when its free variables or its arguments change
-- * denotational semantics including semantics of changes
--
-- Note that Δ is *not* ... | module total where
-- INCREMENTAL λ-CALCULUS
-- with total derivatives
--
-- Features:
-- * changes and derivatives are unified (following Cai)
-- * Δ e describes how e changes when its free variables or its arguments change
-- * denotational semantics including semantics of changes
--
-- Note that Δ is *not* ... | Break lines. | Break lines.
Old-commit-hash: c7c69f51c35066147017459aa226bebe26d68df2
| Agda | mit | inc-lc/ilc-agda |
fdb5d8f0195c9849f6e208db228bb650fe5eba97 | Parametric/Change/Term.agda | Parametric/Change/Term.agda | import Parametric.Syntax.Type as Type
import Parametric.Syntax.Term as Term
import Parametric.Change.Type as ChangeType
module Parametric.Change.Term
{Base : Set}
(Constant : Term.Structure Base)
(Δbase : ChangeType.Structure Base)
where
-- Terms that operate on changes
open Type.Structure Base
open Te... | import Parametric.Syntax.Type as Type
import Parametric.Syntax.Term as Term
import Parametric.Change.Type as ChangeType
module Parametric.Change.Term
{Base : Set}
(Constant : Term.Structure Base)
(ΔBase : ChangeType.Structure Base)
where
-- Terms that operate on changes
open Type.Structure Base
open Te... | Rename Δbase to ΔBase. | Rename Δbase to ΔBase.
Old-commit-hash: e9efdc6e4dd5d76003e901e1ef557ec049d5e59c
| Agda | mit | inc-lc/ilc-agda |
7ed997a9f08476266fb59fb488eac08ad40048de | parametricity.agda | parametricity.agda | module parametricity where
import Data.Bool.Param.NatBool
import Data.Dec.Param.Binary
import Data.Dec.Param.Unary
import Data.Fin.Param.Binary
import Data.Maybe.Param.Binary
import Data.Maybe.Param.Unary
import Data.Nat.Param.Binary
import Data.One.Param.Binary
import Data.One.Param.Unary
import Data.Product.Param.Bin... | module parametricity where
import Data.Bool.Param.NatBool
import Data.Dec.Param.Binary
import Data.Dec.Param.Unary
import Data.Fin.Param.Binary
import Data.Maybe.Param.Binary
import Data.Maybe.Param.Unary
import Data.Nat.Param.Binary
import Data.One.Param.Binary
import Data.One.Param.Unary
import Data.Product.Param.Bin... | Disable reflection for now | Disable reflection for now
| Agda | bsd-3-clause | np/agda-parametricity |
5bd1cb31b6ff25934b1212da8538587845a850b9 | lib/Relation/Binary/PropositionalEquality/NP.agda | lib/Relation/Binary/PropositionalEquality/NP.agda | {-# OPTIONS --without-K #-}
-- move this to propeq
module Relation.Binary.PropositionalEquality.NP where
open import Type hiding (★)
open import Data.One using (𝟙)
open import Data.Product using (Σ; _,_)
open import Relation.Binary.PropositionalEquality public hiding (module ≡-Reasoning)
open import Relation.Binary.N... | {-# OPTIONS --without-K #-}
-- move this to propeq
module Relation.Binary.PropositionalEquality.NP where
open import Type hiding (★)
open import Data.One using (𝟙)
open import Data.Product using (Σ; _,_)
open import Relation.Binary.PropositionalEquality public hiding (module ≡-Reasoning; subst)
open import Relation.B... | Hide subst, expose tr... | ≡: Hide subst, expose tr...
| Agda | bsd-3-clause | crypto-agda/agda-nplib |
690f2df38e24ddcd80d24056254c61364cc071fd | Base/Change/Equivalence.agda | Base/Change/Equivalence.agda | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Delta-observational equivalence
------------------------------------------------------------------------
module Base.Change.Equivalence where
open import Relation.Binary.PropositionalEquality
open import Base.Chang... | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Delta-observational equivalence
------------------------------------------------------------------------
module Base.Change.Equivalence where
open import Relation.Binary.PropositionalEquality
open import Base.Chang... | Add ≙-cong₂ | Add ≙-cong₂
Useful for next steps.
| Agda | mit | inc-lc/ilc-agda |
c68ae3394af059da44a270c4286cea18d3987019 | Syntax/Term/Plotkin.agda | Syntax/Term/Plotkin.agda | import Syntax.Type.Plotkin as Type
import Syntax.Context as Context
module Syntax.Term.Plotkin
{B : Set {- of base types -}}
{C : Context.Context {Type.Type B} → Type.Type B → Set {- of constants -}}
where
-- Terms of languages described in Plotkin style
open import Function using (_∘_)
open import Data.Pr... | import Syntax.Type.Plotkin as Type
import Syntax.Context as Context
module Syntax.Term.Plotkin
{B : Set {- of base types -}}
{C : Context.Context {Type.Type B} → Type.Type B → Set {- of constants -}}
where
-- Terms of languages described in Plotkin style
open import Function using (_∘_)
open import Data.Pr... | Document Term and Terms. | Document Term and Terms.
Old-commit-hash: 7f9cbb4cffc6d9343c93f495fd39e0d6b1bcd855
| Agda | mit | inc-lc/ilc-agda |
f5b981ea7905d4deb015eced08bb201e6b26490f | Crypto/JS/BigI/FiniteField.agda | Crypto/JS/BigI/FiniteField.agda | {-# OPTIONS --without-K #-}
open import Type.Eq
open import Data.Two hiding (_==_)
open import Relation.Binary.PropositionalEquality
open import FFI.JS using (Bool; trace-call; _++_)
open import FFI.JS.Check
renaming (check to check?)
--renaming (warn-check to check?)
open import FFI.JS.BigI
open import Data.Li... | {-# OPTIONS --without-K #-}
open import Type.Eq
open import Data.Two hiding (_==_)
open import Relation.Binary.PropositionalEquality
open import FFI.JS using (JS[_]; _++_; return; _>>_)
open import FFI.JS.Check
using (check!)
renaming (check to check?)
--renaming (warn-check to check?)
open import FFI.JS.B... | rename as ℤ[_], and improve imports from BigI | FiniteField: rename as ℤ[_], and improve imports from BigI
| Agda | bsd-3-clause | crypto-agda/crypto-agda |
5d3aa98ffc0c22e45257913557e911cc654c4777 | Popl14/Change/Evaluation.agda | Popl14/Change/Evaluation.agda | module Popl14.Change.Evaluation where
open import Popl14.Syntax.Type
open import Popl14.Syntax.Term
open import Popl14.Change.Type
open import Popl14.Change.Term
open import Popl14.Change.Value
open import Popl14.Denotation.Value
open import Popl14.Denotation.Evaluation
open import Relation.Binary.PropositionalEquali... | module Popl14.Change.Evaluation where
open import Popl14.Syntax.Type
open import Popl14.Syntax.Term
open import Popl14.Change.Type
open import Popl14.Change.Term
open import Popl14.Change.Value
open import Popl14.Denotation.Value
open import Popl14.Denotation.Evaluation
open import Relation.Binary.PropositionalEquali... | Use ⟦⊕₍_₎⟧ and ⟦⊝₍_₎⟧ in Popl14.Change.Evaluation. | Use ⟦⊕₍_₎⟧ and ⟦⊝₍_₎⟧ in Popl14.Change.Evaluation.
Old-commit-hash: a05b08ff42508e49817f899523f4849e9334e057
| Agda | mit | inc-lc/ilc-agda |
69fe0b1567d5b5439ff7565a79deffd679e3a82b | Parametric/Change/Type.agda | Parametric/Change/Type.agda | module Parametric.Change.Type
(Base : Set)
where
import Parametric.Syntax.Type as Type
open Type.Structure Base
Structure : Set
Structure = Base → Base
module Structure (ΔBase : Structure) where
ΔType : Type → Type
ΔType (base ι) = base (ΔBase ι)
ΔType (σ ⇒ τ) = σ ⇒ ΔType σ ⇒ ΔType τ
open import Base.Ch... | import Parametric.Syntax.Type as Type
module Parametric.Change.Type
(Base : Type.Structure)
where
open Type.Structure Base
Structure : Set
Structure = Base → Base
module Structure (ΔBase : Structure) where
ΔType : Type → Type
ΔType (base ι) = base (ΔBase ι)
ΔType (σ ⇒ τ) = σ ⇒ ΔType σ ⇒ ΔType τ
open im... | Make P.C.Type conform to plugin pattern. | Make P.C.Type conform to plugin pattern.
Old-commit-hash: 8dc76b168a0b8d9f859a69834d52d91e2f34b235
| Agda | mit | inc-lc/ilc-agda |
799ecf7906eb3e8eafef355dc3f96dfd5a71014e | one-time-semantic-security.agda | one-time-semantic-security.agda | module one-time-semantic-security where
open import Function
open import Data.Nat
open import Data.Product using (∃; module Σ; _×_; _,_; proj₁; proj₂)
open import Data.Vec using (splitAt; take; drop)
import Relation.Binary.PropositionalEquality as ≡
open ≡ using (_≗_)
open import Data.Bits
open import flat-funs
open... | module one-time-semantic-security where
open import Function
open import Data.Nat
open import Data.Product using (∃; module Σ; _×_; _,_; proj₁; proj₂)
open import Data.Vec using (splitAt; take; drop)
import Relation.Binary.PropositionalEquality as ≡
open ≡ using (_≗_)
open import Data.Bits
open import flat-funs
open... | Improve change-adv and add ≗A→⇓ | one-time-semantic-security: Improve change-adv and add ≗A→⇓
| Agda | bsd-3-clause | crypto-agda/crypto-agda |
ab1099f8573c544e98531d58aac709002e109268 | lib/Type.agda | lib/Type.agda | module Type where
★₂ : Set₃
★₂ = Set₂
★₁ : ★₂
★₁ = Set₁
★ : ★₁
★ = Set
| module Type where
open import Level
★₂ : Set₃
★₂ = Set₂
★₁ : ★₂
★₁ = Set₁
★₀ : ★₁
★₀ = Set
★ : ★₁
★ = ★₀
★_ : ∀ ℓ → Set (suc ℓ)
★_ ℓ = Set ℓ
| add ★_ for the universal type of type | Type: add ★_ for the universal type of type
| Agda | bsd-3-clause | crypto-agda/agda-nplib |
244c3b4285d455271121fa1cc4982d804ffe9437 | Solver/Linear.agda | Solver/Linear.agda | -- NOTE with-K
module Solver.Linear where
open import FunUniverse.Types
open import FunUniverse.Rewiring.Linear
open import Data.Two hiding (_≟_)
open import Data.Nat as ℕ using (ℕ)
import Solver.Linear.Syntax as LinSyn
open import Relation.Nullary.Decidable
open import Relation.Binary
open import Relation.Binary.Prop... | -- NOTO with-K
module Solver.Linear where
open import FunUniverse.Types
open import FunUniverse.Rewiring.Linear
open import Data.Two hiding (_≟_)
open import Data.Nat as ℕ using (ℕ)
import Solver.Linear.Syntax as LinSyn
open import Relation.Nullary.Decidable
open import Relation.Binary
open import Relation.Binary.Prop... | Fix a note | Fix a note
| Agda | bsd-3-clause | crypto-agda/crypto-agda |
23195232ac9f45758a208ab48715260ca5c37781 | FunUniverse/Rewiring/Linear.agda | FunUniverse/Rewiring/Linear.agda | {-# OPTIONS --without-K #-}
open import Level.NP
open import Type
open import FunUniverse.Types
open import Data.One using (𝟙)
import Data.Vec as V
open V using (Vec; []; _∷_)
open import Data.Nat.NP using (ℕ; zero; suc; _+_; _*_; 2^_)
import FunUniverse.Category
import FunUniverse.Defaults.FirstPart as Defaults⟨first... | {-# OPTIONS --without-K #-}
open import Level.NP
open import Type
open import FunUniverse.Types
open import Data.One using (𝟙)
import Data.Vec as V
open V using (Vec; []; _∷_)
open import Data.Nat.NP using (ℕ; zero; suc; _+_; _*_; 2^_)
import FunUniverse.Category
import FunUniverse.Defaults.FirstPart as Defaults⟨first... | add mapAccum | FunUniverse/Rewiring/Linear: add mapAccum
| Agda | bsd-3-clause | crypto-agda/crypto-agda |
2c661467da93de9a39c40cddc61abeeca5350793 | Denotation/Specification/Canon-Popl14.agda | Denotation/Specification/Canon-Popl14.agda | module Denotation.Specification.Canon-Popl14 where
-- Denotation-as-specification for Calculus Popl14
--
-- Contents
-- - ⟦_⟧Δ : binding-time-shifted derive
-- - Validity and correctness lemmas for ⟦_⟧Δ
-- - `corollary`: ⟦_⟧Δ reacts to both environment and arguments
-- - `corollary-closed`: binding-time-shifted main t... | module Denotation.Specification.Canon-Popl14 where
-- Denotation-as-specification for Calculus Popl14
--
-- Contents
-- - ⟦_⟧Δ : binding-time-shifted derive
-- - Validity and correctness lemmas for ⟦_⟧Δ
-- - `corollary`: ⟦_⟧Δ reacts to both environment and arguments
-- - `corollary-closed`: binding-time-shifted main t... | Make some arguments of validVar explicit. | Make some arguments of validVar explicit.
Old-commit-hash: dc6d178e02b8bdd4f772dddbba1bf337f3b1d74c
| Agda | mit | inc-lc/ilc-agda |
3ee4b4fed60cc477d5e3672148d7f6f90db3368f | arrow.agda | arrow.agda | open import Data.Bool
open import Data.List
open import Data.Nat
----------------------------------------
_≡_ : ℕ → ℕ → Bool
zero ≡ zero = true
suc n ≡ suc m = n ≡ m
_ ≡ _ = false
----------------------------------------
_∈_ : ℕ → List ℕ → Bool
x ∈ [] = false
x ∈ (y ∷ ys) with x ≡ y
... ... | open import Agda.Builtin.Bool
_or_ : Bool → Bool → Bool
true or _ = true
_ or true = true
false or false = false
_and_ : Bool → Bool → Bool
false and _ = false
_ and false = false
true and true = true
----------------------------------------
data ℕ : Set where
zero : ℕ
suc : ℕ → ℕ
{-# BUILTIN... | Revert "Convert to stdlib" | Revert "Convert to stdlib"
This reverts commit 68af677d56d4f0a4c1aaa95134ae06f0813500c1.
| Agda | mit | louisswarren/hieretikz |
ca3585f55fde86ac7d664ac346618396c7308e11 | Parametric/Change/Validity.agda | Parametric/Change/Validity.agda | import Parametric.Syntax.Type as Type
import Parametric.Denotation.Value as Value
module Parametric.Change.Validity
{Base : Type.Structure}
(⟦_⟧Base : Value.Structure Base)
where
open Type.Structure Base
open Value.Structure Base ⟦_⟧Base
-- Changes for Calculus Popl14
--
-- Contents
-- - Mutually recursive... | import Parametric.Syntax.Type as Type
import Parametric.Denotation.Value as Value
module Parametric.Change.Validity
{Base : Type.Structure}
(⟦_⟧Base : Value.Structure Base)
where
open Type.Structure Base
open Value.Structure Base ⟦_⟧Base
-- Changes for Calculus Popl14
--
-- Contents
-- - Mutually recursive... | Implement apply-valid-change. | Implement apply-valid-change.
Old-commit-hash: 64cc4483b462c94a945aa312124cbdf090ffd619
| Agda | mit | inc-lc/ilc-agda |
fbf5d17dabb1058927efc56a1b0c092c4e68e355 | incremental.agda | incremental.agda | module incremental where
open import Relation.Binary.PropositionalEquality
open import meaning
-- SIMPLE TYPES
-- Syntax
data Type : Set where
_⇒_ : (τ₁ τ₂ : Type) → Type
-- `Δ τ` is the type of changes to `τ`
Δ : (τ : Type) → Type
infixr 5 _⇒_
-- Denotational Semantics
⟦_⟧Type : Type -> Set
⟦ τ₁ ⇒ τ₂ ⟧T... | module incremental where
open import Relation.Binary.PropositionalEquality
open import meaning
-- SIMPLE TYPES
-- Syntax
data Type : Set where
_⇒_ : (τ₁ τ₂ : Type) → Type
-- `Δ τ` is the type of changes to `τ`
Δ : (τ : Type) → Type
infixr 5 _⇒_
-- Denotational Semantics
⟦_⟧Type : Type -> Set
⟦ τ₁ ⇒ τ₂ ⟧T... | Change Δ to expect the change in a free variable. | Change Δ to expect the change in a free variable.
Proposed by Paolo in a whiteboard discussion today.
Old-commit-hash: bce0357c249c6ae66ad8fe002147ad07623d842f
| Agda | mit | inc-lc/ilc-agda |
1d32ad0cbc8582d30660167abe83ddda4a4cf6d1 | lib/Relation/Nullary/NP.agda | lib/Relation/Nullary/NP.agda | module Relation.Nullary.NP where
open import Type
open import Data.Sum
open import Relation.Nullary public
module _ {a b} {A : ★_ a} {B : ★_ b} where
Dec-⊎ : Dec A → Dec B → Dec (A ⊎ B)
Dec-⊎ (yes p) _ = yes (inj₁ p)
Dec-⊎ (no ¬p) (yes p) = yes (inj₂ p)
Dec-⊎ (no ¬p) (no ¬q) = no [ ¬p , ¬q ]
... | module Relation.Nullary.NP where
open import Type
open import Function
open import Data.Zero
open import Data.One
open import Data.Sum
open import Data.Product renaming (proj₁ to fst; proj₂ to snd)
open import Relation.Nullary public
Dec-𝟘 : Dec 𝟘
Dec-𝟘 = no id
Dec-𝟙 : Dec 𝟙
Dec-𝟙 = yes _
module _ {a b} {A : ... | add Dec-{𝟘,𝟙,×,→} | Dec: add Dec-{𝟘,𝟙,×,→}
| Agda | bsd-3-clause | crypto-agda/agda-nplib |
0ea795d1835bb4e398a04244310fe6e1eed4388f | one-time-semantic-security.agda | one-time-semantic-security.agda | module one-time-semantic-security where
open import Function
open import Data.Nat
open import Data.Product
open import Data.Vec using (splitAt; take; drop)
import Relation.Binary.PropositionalEquality as ≡
open ≡ using (_≗_)
open import Data.Bits
open import flat-funs
open import program-distance
open import flipbas... | module one-time-semantic-security where
open import Function
open import Data.Nat
open import Data.Product using (∃; module Σ; _×_; _,_; proj₁; proj₂)
open import Data.Vec using (splitAt; take; drop)
import Relation.Binary.PropositionalEquality as ≡
open ≡ using (_≗_)
open import Data.Bits
open import flat-funs
open... | add ♭EncParams² | one-time-semantic-security: add ♭EncParams²
| Agda | bsd-3-clause | crypto-agda/crypto-agda |
00a7767b9e6a38ec98ff6336651129e2786a6a98 | lib/Data/Fin/Logical.agda | lib/Data/Fin/Logical.agda | -- NOTE with-K
module Data.Fin.Logical where
open import Data.Nat.Param.Binary
open import Data.Fin.Param.Binary
open import Function
open import Data.Fin
open import Relation.Binary
open import Relation.Binary.Logical
private
module ⟦ℕ⟧s = Setoid ⟦ℕ⟧-setoid
{-
data ⟦Fin⟧ : (⟦ℕ⟧ ⟦→⟧ ⟦★₀⟧) Fin Fin where
⟦zero⟧ :... | {-# OPTIONS --with-K #-}
module Data.Fin.Logical where
open import Data.Nat.Logical
open import Data.Nat.Param.Binary
-- open import Data.Fin.Param.Binary
open import Function
open import Data.Fin
open import Relation.Binary
open import Relation.Binary.Logical
private
module ⟦ℕ⟧s = Setoid ⟦ℕ⟧-setoid
data ⟦Fin⟧ : ... | Fix Data.Fin.Logical | Fix Data.Fin.Logical
| Agda | bsd-3-clause | crypto-agda/agda-nplib |
8403c80b80206ebcbe4f1d3acfac2cfce30552ca | Parametric/Syntax/Term.agda | Parametric/Syntax/Term.agda | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- The syntax of terms (Fig. 1a and 1b).
------------------------------------------------------------------------
-- The syntax of terms depends on the syntax of simple types
-- (because terms are indexed by types in ... | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- The syntax of terms (Fig. 1a and 1b).
------------------------------------------------------------------------
-- The syntax of terms depends on the syntax of simple types
-- (because terms are indexed by types in ... | Drop unused defs | Drop unused defs
| Agda | mit | inc-lc/ilc-agda |
c7ad461731109d522f831464e795886500cbf40d | README.agda | README.agda | module README where
-- INCREMENTAL λ-CALCULUS
-- with total derivatives
--
-- Features:
-- * changes and derivatives are unified (following Cai)
-- * multiple calculi
import Popl14.Syntax.Term
import Base.Syntax.Context
import Base.Change.Context
import Popl14.Change.Derive
{- Language definition of Calc. Atla... | module README where
-- INCREMENTAL λ-CALCULUS
-- with total derivatives
--
-- Features:
-- * changes and derivatives are unified (following Cai)
-- * multiple calculi
--
-- To typecheck this formalization, you need to install the appropriate version
-- of Agda, the Agda standard library (version 0.7), generate E... | Add instructions for users to README.agda | Add instructions for users to README.agda
Old-commit-hash: c0018596eda8908801ba4aa7eeec5aa0ef9452b5
| Agda | mit | inc-lc/ilc-agda |
97ac1ebb0cbaecc1af38b1d9916fb946e06656a7 | PLDI14-List-of-Theorems.agda | PLDI14-List-of-Theorems.agda | module PLDI14-List-of-Theorems where
open import Function
-- List of theorems in PLDI submission
--
-- For hints about installation and execution, please refer
-- to README.agda.
--
-- Agda modules corresponding to definitions, lemmas and theorems
-- are listed here with the most important name. For example,
-- after... | module PLDI14-List-of-Theorems where
open import Function
-- List of theorems in PLDI submission
--
-- For hints about installation and execution, please refer
-- to README.agda.
--
-- Agda modules corresponding to definitions, lemmas and theorems
-- are listed here with the most important name. For example,
-- after... | remove redundant comment | remove redundant comment
Old-commit-hash: 72138e09941c4514d0acef9dc39a91cd83e8077c
| Agda | mit | inc-lc/ilc-agda |
ceb7acd1c67116365b51503065e55f947cda63a5 | total.agda | total.agda | module total where
-- INCREMENTAL λ-CALCULUS
-- with total derivatives
--
-- Features:
-- * changes and derivatives are unified (following Cai)
-- * Δ e describes how e changes when its free variables or its arguments change
-- * denotational semantics including semantics of changes
--
-- Work in Progress:
-- ... | module total where
-- INCREMENTAL λ-CALCULUS
-- with total derivatives
--
-- Features:
-- * changes and derivatives are unified (following Cai)
-- * Δ e describes how e changes when its free variables or its arguments change
-- * denotational semantics including semantics of changes
--
-- Work in Progress:
-- ... | simplify weakenMore | agda/...: simplify weakenMore
* Inline some definitions where appropriate.
* Remove useless pattern matching on context.
Old-commit-hash: a4c4aee377597f7c17b5fa7d8b1c8a02492041c0
| Agda | mit | inc-lc/ilc-agda |
a737167afb8fb406b75d8e0d52fdfb3fa6c50035 | Parametric/Change/Specification.agda | Parametric/Change/Specification.agda | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Change evaluation (Def 3.6 and Fig. 4h).
------------------------------------------------------------------------
import Parametric.Syntax.Type as Type
import Parametric.Syntax.Term as Term
import Parametric.Denota... | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Change evaluation (Def 3.6 and Fig. 4h).
------------------------------------------------------------------------
import Parametric.Syntax.Type as Type
import Parametric.Syntax.Term as Term
import Parametric.Denota... | Rename locals in proof for clarity | Rename locals in proof for clarity
Was re-reading this proof for the thesis.
| Agda | mit | inc-lc/ilc-agda |
a06adfefda06e416bc4f111d7085cd3b5ad42568 | Parametric/Change/Evaluation.agda | Parametric/Change/Evaluation.agda | import Parametric.Syntax.Type as Type
import Parametric.Syntax.Term as Term
import Parametric.Denotation.Value as Value
import Parametric.Denotation.Evaluation as Evaluation
import Parametric.Change.Type as ChangeType
import Parametric.Change.Term as ChangeTerm
import Parametric.Change.Value as ChangeValue
module Para... | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Connecting Parametric.Change.Term and Parametric.Change.Value.
------------------------------------------------------------------------
import Parametric.Syntax.Type as Type
import Parametric.Syntax.Term as Term
im... | Document P.C.Evaluation. | Document P.C.Evaluation.
Old-commit-hash: d56cb423e28dc729478353d4e2d2c4fb422d2f8f
| Agda | mit | inc-lc/ilc-agda |
61de78a178ea4a23092e726b277f92787528c970 | Denotation/Specification/Canon-Popl14.agda | Denotation/Specification/Canon-Popl14.agda | module Denotation.Specification.Canon-Popl14 where
-- Denotation-as-specification for Calculus Popl14
--
-- Contents
-- - ⟦_⟧Δ : binding-time-shifted derive
-- - Validity and correctness lemmas for ⟦_⟧Δ
-- - `corollary`: ⟦_⟧Δ reacts to both environment and arguments
-- - `corollary-closed`: binding-time-shifted main t... | module Denotation.Specification.Canon-Popl14 where
-- Denotation-as-specification for Calculus Popl14
--
-- Contents
-- - ⟦_⟧Δ : binding-time-shifted derive
-- - Validity and correctness lemmas for ⟦_⟧Δ
-- - `corollary`: ⟦_⟧Δ reacts to both environment and arguments
-- - `corollary-closed`: binding-time-shifted main t... | Make some arguments of correctness explicit. | Make some arguments of correctness explicit.
Old-commit-hash: b8f4ff3d6b2f0ea72c79a94c10ae3ec1b545c2ca
| Agda | mit | inc-lc/ilc-agda |
80463c85413df224feab7c464101dbfd5ff7ec77 | Syntax/Language/Atlas.agda | Syntax/Language/Atlas.agda | module Syntax.Language.Atlas where
-- Base types of the calculus Atlas
-- to be used with Plotkin-style language description
--
-- Atlas supports maps with neutral elements. The change type to
-- `Map κ ι` is `Map κ Δι`, where Δι is the change type of the
-- ground type ι. Such a change to maps can support insertions
... | module Syntax.Language.Atlas where
-- Base types of the calculus Atlas
-- to be used with Plotkin-style language description
--
-- Atlas supports maps with neutral elements. The change type to
-- `Map κ ι` is `Map κ Δι`, where Δι is the change type of the
-- ground type ι. Such a change to maps can support insertions
... | improve specification of union | Atlas: improve specification of union
Old-commit-hash: cda40f70859c26a48a9077ad39b93d3b9a0af045
| Agda | mit | inc-lc/ilc-agda |
2c54443576bbae481639179d8b3bc48566274aad | Syntax/FreeVars/Popl14.agda | Syntax/FreeVars/Popl14.agda | module Syntax.FreeVars.Popl14 where
-- Free variables of Calculus Popl14
--
-- Contents
-- FV: get the free variables of a term
-- closed?: test if a term is closed, producing a witness if yes.
open import Popl14.Syntax.Type
open import Popl14.Change.Term
open import Base.Syntax.Vars Type public
open import Relation... | module Syntax.FreeVars.Popl14 where
-- Free variables of Calculus Popl14
--
-- Contents
-- FV: get the free variables of a term
-- closed?: test if a term is closed, producing a witness if yes.
open import Popl14.Syntax.Type
open import Popl14.Change.Term
open import Base.Syntax.Vars Type public
open import Relation... | Implement FV more parametrically. | Implement FV more parametrically.
Old-commit-hash: 470f2fd7a3e73bb1ac01fce483f8aa80e4ec51e3
| Agda | mit | inc-lc/ilc-agda |
e71e428c1e63d766e7896b94aa406645ef65a52e | ModalLogic.agda | ModalLogic.agda | module ModalLogic where
-- Implement Frank Pfenning's lambda calculus based on modal logic S4, as
-- described in "A Modal Analysis of Staged Computation".
open import Denotational.Notation
data BaseType : Set where
Base : BaseType
Next : BaseType → BaseType
data Type : Set where
base : BaseType → Type
_⇒_ ... | module ModalLogic where
-- Implement Frank Pfenning's lambda calculus based on modal logic S4, as
-- described in "A Modal Analysis of Staged Computation".
open import Denotational.Notation
data BaseType : Set where
Base : BaseType
Next : BaseType → BaseType
data Type : Set where
base : BaseType → Type
_⇒_ ... | implement substitution for modal logic | Agda: implement substitution for modal logic
Old-commit-hash: e8580d4ac39e998fdf42c16064112cd2c0326763
| Agda | mit | inc-lc/ilc-agda |
d02c0c3ef60a8f1e0b8ace3fdea7c8bb38c61281 | Syntax/Context.agda | Syntax/Context.agda | module Syntax.Context
{Type : Set}
where
-- CONTEXTS
--
-- This module defines the syntax of contexts, prefixes of
-- contexts and variables and properties of these notions.
--
-- This module is parametric in the syntax of types, so it
-- can be reused for different calculi.
open import Relation.Binary
open imp... | module Syntax.Context
{Type : Set}
where
-- CONTEXTS
--
-- This module defines the syntax of contexts, prefixes of
-- contexts and variables and properties of these notions.
--
-- This module is parametric in the syntax of types, so it
-- can be reused for different calculi.
open import Relation.Binary
open imp... | rename type parameter of `that` | Agda: rename type parameter of `that`
Old-commit-hash: 0b30e5858214cb3ecab7a1661b7a2a79ac6bc871
| Agda | mit | inc-lc/ilc-agda |
cd132a2ada356a76c361341940070bcfccc2c571 | lib/Explore/Zero.agda | lib/Explore/Zero.agda | open import Type
open import Type.Identities
open import Level.NP
open import Explore.Core
open import Explore.Properties
open import Explore.Explorable
open import Data.Zero
open import Function.NP
open import Function.Extensionality
open import Data.Product
open import Relation.Binary.PropositionalEquality.NP using (... | open import Type
open import Type.Identities
open import Level.NP
open import Explore.Core
open import Explore.Properties
open import Explore.Explorable
open import Data.Zero
open import Function.NP
open import Function.Extensionality
open import Data.Product
open import Relation.Binary.PropositionalEquality.NP using (... | add explore function for Lift 𝟘 | add explore function for Lift 𝟘
| Agda | bsd-3-clause | crypto-agda/explore |
8aefca99408c27e4a214ce4b0721a4e4794eeb87 | Atlas/Change/Derivation.agda | Atlas/Change/Derivation.agda | module Atlas.Change.Derivation where
open import Atlas.Syntax.Type
open import Atlas.Syntax.Term
open import Atlas.Change.Type
open import Atlas.Change.Term
open import Base.Syntax.Context Type
open import Base.Change.Context ΔType
Atlas-Δconst : ∀ {Γ Σ τ} → (c : Const Σ τ) →
Term Γ (internalizeContext (ΔContext′ ... | module Atlas.Change.Derivation where
open import Atlas.Syntax.Type
open import Atlas.Syntax.Term
open import Atlas.Change.Type
open import Atlas.Change.Term
open import Base.Syntax.Context Type
open import Base.Change.Context ΔType
ΔConst : ∀ {Γ Σ τ} → (c : Const Σ τ) →
Term Γ (internalizeContext (ΔContext′ Σ) (ΔT... | Rename Atlas-Δconst to ΔConst. | Rename Atlas-Δconst to ΔConst.
Old-commit-hash: e7ed19ec0ca363e486fe72ac858facfcd192e057
| Agda | mit | inc-lc/ilc-agda |
af1d5371ab683fac0cfee48a20cabc40e4da7d41 | program-distance.agda | program-distance.agda | module program-distance where
open import flipbased-implem
open import Data.Bits
open import Data.Bool
open import Data.Vec.NP using (Vec; count; countᶠ)
open import Data.Nat.NP
open import Data.Nat.Properties
open import Relation.Binary
open import Relation.Binary.PropositionalEquality.NP
import Data.Fin as Fin
reco... | module program-distance where
open import flipbased-implem
open import Data.Bits
open import Data.Bool
open import Data.Vec.NP using (Vec; count; countᶠ)
open import Data.Nat.NP
open import Data.Nat.Properties
open import Relation.Binary
open import Relation.Binary.PropositionalEquality.NP
import Data.Fin as Fin
reco... | document a broken (so far) proof | document a broken (so far) proof
| Agda | bsd-3-clause | crypto-agda/crypto-agda |
d0df7845258df353bcf850c309c4a494f9869248 | Parametric/Denotation/CachingEvaluation.agda | Parametric/Denotation/CachingEvaluation.agda | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Caching evaluation
------------------------------------------------------------------------
import Parametric.Syntax.Type as Type
import Parametric.Syntax.Term as Term
import Parametric.Denotation.Value as Value
im... | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Caching evaluation
------------------------------------------------------------------------
import Parametric.Syntax.Type as Type
import Parametric.Syntax.Term as Term
import Parametric.Denotation.Value as Value
im... | Reorder code | Reorder code
Separate non-CBPV and CBPV version of the code
| Agda | mit | inc-lc/ilc-agda |
9654b48257da5d67093ffa9653ed62f10df0bfa4 | composition-sem-sec-reduction.agda | composition-sem-sec-reduction.agda | module otp-sem-sec where
import Level as L
open import Function
open import Data.Nat.NP
open import Data.Bits
open import Data.Bool
open import Data.Bool.Properties
open import Data.Vec hiding (_>>=_)
open import Data.Product.NP hiding (_⟦×⟧_)
open import Relation.Nullary
open import Relation.Binary
open import Relati... | module composition-sem-sec-reduction where
import Level as L
open import Function
open import Data.Nat.NP
open import Data.Bits
open import Data.Bool
open import Data.Vec hiding (_>>=_)
open import Data.Product.NP using (_,_)
open import Relation.Nullary
open import Relation.Binary
open import Relation.Binary.Proposit... | Rework composition-sem-sec-reduction.agda | Rework composition-sem-sec-reduction.agda
| Agda | bsd-3-clause | crypto-agda/crypto-agda |
be0274dd27e35d690791eb80a7b4b66635414047 | Thesis/ANormalDTerm.agda | Thesis/ANormalDTerm.agda | module Thesis.ANormalDTerm where
open import Thesis.ANormal
{-
Try defining an alternative syntax for differential terms. We'll need this for
cache terms. Maybe?
Options:
1. use standard untyped lambda calculus as a target language. This requires much
more weakening in the syntax, which is a nuisance in proofs. May... | module Thesis.ANormalDTerm where
open import Thesis.ANormal
ΔΔ : Context → Context
ΔΔ ∅ = ∅
ΔΔ (τ • Γ) = Δt τ • ΔΔ Γ
Δτ = Δt
ChΔ : ∀ (Δ : Context) → Set
ChΔ Δ = ⟦ ΔΔ Δ ⟧Context
-- [_]Δ_from_to_ : ∀ Δ → ChΔ Δ → (ρ1 ρ2 : ⟦ Δ ⟧Context) → Set
-- [ ∅ ]Δ ∅ from ∅ to ∅ = ⊤
-- [ τ • Δ ]Δ dv • dρ from v1 • ρ1 to (v2 • ρ2) ... | remove bad experiments | ANormalDTerm: remove bad experiments
| Agda | mit | inc-lc/ilc-agda |
3ef9b9505385dfad155ad9a494a161385271f576 | ZK/GroupHom/ElGamal.agda | ZK/GroupHom/ElGamal.agda | {-# OPTIONS --without-K #-}
open import Type using (Type)
open import Function using (flip; _∘_)
open import Data.Product renaming (proj₁ to fst; proj₂ to snd)
open import Data.Two
open import Relation.Binary
open import Relation.Binary.PropositionalEquality.NP using (_≡_; ap; ap₂; !_; _∙_; module ≡-Reasoning)
open imp... | {-# OPTIONS --without-K #-}
open import Type using (Type)
open import Type.Eq
open import Function.NP using (flip; _∘_; it)
open import Data.Product.NP
open import Data.Two hiding (_²)
open import Relation.Binary
open import Relation.Binary.PropositionalEquality.NP using (idp; _≡_; ap; ap₂; !_; _∙_; module ≡-Reasoning)... | add proofs of equality of message (two styles) | ZK.GroupHom.ElGamal: add proofs of equality of message (two styles)
| Agda | bsd-3-clause | crypto-agda/crypto-agda |
ccb724c55f5701acf132f0a3045f0a1c2d116f96 | Denotational/ValidChanges.agda | Denotational/ValidChanges.agda | module Denotational.ValidChanges where
open import Data.Product
open import Data.Unit
open import Relation.Binary.PropositionalEquality
open import Syntactic.Types
open import Denotational.Notation
open import Denotational.Values
open import Denotational.Equivalence
open import Changes
-- DEFINITION of valid chang... | module Denotational.ValidChanges where
open import Data.Product
open import Data.Unit
open import Relation.Binary.PropositionalEquality
open import Syntactic.Types
open import Denotational.Notation
open import Denotational.Values
open import Denotational.Equivalence
open import Changes
-- DEFINITION of valid chang... | Update alternative definition of Valid-Δ | agda: Update alternative definition of Valid-Δ
Rationale for maintaining this alternative definition: If all proofs
go through with the current definition of Valid-Δ, which can be
expressed as a datatype, we'll switch to defining it with a datatype.
Old-commit-hash: a21df87af1c12f4d94d3710d37e6e4eedfcc83b0
| Agda | mit | inc-lc/ilc-agda |
884a5f0cedea9599476b8420c36f53c0676e8551 | arrow.agda | arrow.agda | data Bool : Set where
true : Bool
false : Bool
--------------------
data ℕ : Set where
zero : ℕ
suc : ℕ → ℕ
{-# BUILTIN NATURAL ℕ #-}
_≡_ : ℕ → ℕ → Bool
zero ≡ zero = true
suc n ≡ suc m = n ≡ m
_ ≡ _ = false
--------------------
data List (A : Set) : Set where
∘ : List A
_∷_ : A → Lis... | data Bool : Set where
true : Bool
false : Bool
--------------------
data ℕ : Set where
zero : ℕ
suc : ℕ → ℕ
{-# BUILTIN NATURAL ℕ #-}
_≡_ : ℕ → ℕ → Bool
zero ≡ zero = true
suc n ≡ suc m = n ≡ m
_ ≡ _ = false
--------------------
data List (A : Set) : Set where
∘ : List A
_∷_ : A → Lis... | Add turnstile | Add turnstile
| Agda | mit | louisswarren/hieretikz |
b5aa26aa273178564c9e3df4846793f1e96e2e81 | Parametric/Change/Validity.agda | Parametric/Change/Validity.agda | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Dependently typed changes (Def 3.4 and 3.5, Fig. 4b and 4e)
------------------------------------------------------------------------
import Parametric.Syntax.Type as Type
import Parametric.Denotation.Value as Value... | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Dependently typed changes (Def 3.4 and 3.5, Fig. 4b and 4e)
------------------------------------------------------------------------
import Parametric.Syntax.Type as Type
import Parametric.Denotation.Value as Value... | Disable unused instance | Disable unused instance
Agda will not infer explicit arguments of instance arguments. On the
other hand, trying to make this into a proper instance (with an implicit
argument) makes typechecking too much slower or not terminating (more
precisely, on some modules typechecking took longer than I wanted to
wait and I did... | Agda | mit | inc-lc/ilc-agda |
e41ee7bc6a42348d7050206b8746f460ef632c69 | Parametric/Change/Validity.agda | Parametric/Change/Validity.agda | import Parametric.Syntax.Type as Type
import Parametric.Denotation.Value as Value
module Parametric.Change.Validity
{Base : Type.Structure}
(⟦_⟧Base : Value.Structure Base)
where
open Type.Structure Base
open Value.Structure Base ⟦_⟧Base
-- Changes for Calculus Popl14
--
-- Contents
-- - Mutually recursive... | import Parametric.Syntax.Type as Type
import Parametric.Denotation.Value as Value
module Parametric.Change.Validity
{Base : Type.Structure}
(⟦_⟧Base : Value.Structure Base)
where
open Type.Structure Base
open Value.Structure Base ⟦_⟧Base
-- Changes for Calculus Popl14
--
-- Contents
-- - Mutually recursive... | Move ValidChange next to Change. | Move ValidChange next to Change.
This commit prepares for using ValidChange in the definition of Change.
Old-commit-hash: a90d85385de56e35cc3aba5821ddc4a2d3448247
| Agda | mit | inc-lc/ilc-agda |
6156984d33b98f39610ee7244b167632999b9b41 | Parametric/Change/Correctness.agda | Parametric/Change/Correctness.agda | import Parametric.Syntax.Type as Type
import Parametric.Syntax.Term as Term
import Parametric.Denotation.Value as Value
import Parametric.Denotation.Evaluation as Evaluation
import Parametric.Change.Validity as Validity
import Parametric.Change.Specification as Specification
import Parametric.Change.Type as ChangeType
... | import Parametric.Syntax.Type as Type
import Parametric.Syntax.Term as Term
import Parametric.Denotation.Value as Value
import Parametric.Denotation.Evaluation as Evaluation
import Parametric.Change.Validity as Validity
import Parametric.Change.Specification as Specification
import Parametric.Change.Type as ChangeType
... | call derive-correct-closed instead of derive-correct in thm:main | call derive-correct-closed instead of derive-correct in thm:main
Old-commit-hash: 9fa1103b0ac110498ae8ab0d0c0f3320ff4b264f
| Agda | mit | inc-lc/ilc-agda |
88a46de4b9496c0c6c4f861d964d90e3ae3cfd27 | Syntax/Derive/Plotkin.agda | Syntax/Derive/Plotkin.agda | import Parametric.Syntax.Type as Type
import Base.Syntax.Context as Context
import Syntax.Term.Plotkin as Term
import Syntax.DeltaContext as DeltaContext
import Parametric.Change.Type as DeltaType
module Syntax.Derive.Plotkin
{Base : Set {- of base types -}}
{Constant : Context.Context (Type.Type Base) → Type.... | import Parametric.Syntax.Type as Type
import Base.Syntax.Context as Context
import Syntax.Term.Plotkin as Term
import Syntax.DeltaContext as DeltaContext
import Parametric.Change.Type as ChangeType
module Syntax.Derive.Plotkin
{Base : Set {- of base types -}}
{Constant : Context.Context (Type.Type Base) → Type... | Update qualified import for new module name. | Update qualified import for new module name.
Old-commit-hash: 2cb47a8d412768ed582e8af1a042b51c3ca781be
| Agda | mit | inc-lc/ilc-agda |
92f785054b5dd55703ecbd7d5aec15af5e0d04d2 | README.agda | README.agda | module README where
-- INCREMENTAL λ-CALCULUS
-- with total derivatives
--
-- Features:
-- * changes and derivatives are unified (following Cai)
-- * Δ e describes how e changes when its free variables or its arguments change
-- * denotational semantics including semantics of changes
--
-- Note that Δ is *not*... | module README where
-- INCREMENTAL λ-CALCULUS
-- with total derivatives
--
-- Features:
-- * changes and derivatives are unified (following Cai)
--
-- XXX: fill in again other details.
-- 41e0f95d7fda7244a258b67f8a4255e4128a42c3 declares that the main theorems are
-- in these files:
open import Denotation.Derive... | Update a bit README.agda (#41) | Update a bit README.agda (#41)
README.agda was not up-to-date. Remaining issues are described inline.
Old-commit-hash: 93469332bbc849a2a13486a1bfae7d21dc9eb399
| Agda | mit | inc-lc/ilc-agda |
9cdc324caee9ca0888f5f85d83d0727e04d6e654 | incremental.agda | incremental.agda | module incremental where
-- SIMPLE TYPES
-- Syntax
data Type : Set where
_⇒_ : (τ₁ τ₂ : Type) → Type
infixr 5 _⇒_
-- Semantics
Dom⟦_⟧ : Type -> Set
Dom⟦ τ₁ ⇒ τ₂ ⟧ = Dom⟦ τ₁ ⟧ → Dom⟦ τ₂ ⟧
-- TYPING CONTEXTS
-- Syntax
data Context : Set where
∅ : Context
_•_ : (τ : Type) (Γ : Context) → Context
infixr 9 _... | module incremental where
-- SIMPLE TYPES
-- Syntax
data Type : Set where
_⇒_ : (τ₁ τ₂ : Type) → Type
infixr 5 _⇒_
-- Semantics
Dom⟦_⟧ : Type -> Set
Dom⟦ τ₁ ⇒ τ₂ ⟧ = Dom⟦ τ₁ ⟧ → Dom⟦ τ₂ ⟧
-- TYPING CONTEXTS
-- Syntax
data Context : Set where
∅ : Context
_•_ : (τ : Type) (Γ : Context) → Context
infixr 9 _... | Implement 'Δ-term' for variables. | Implement 'Δ-term' for variables.
Old-commit-hash: dd0c2916cc4b7472353b0073fa6538f60e7325f5
| Agda | mit | inc-lc/ilc-agda |
f9aeb58a90443e04e8fd3afd4951c3d768d88d29 | Syntax/Context/Plotkin.agda | Syntax/Context/Plotkin.agda | module Syntax.Context.Plotkin where
-- Context for Plotkin-stype language descriptions
--
-- Duplicates Syntax.Context to a large extent.
-- Consider having Syntax.Context import this module.
infixr 9 _•_
data Context {Type : Set} : Set where
∅ : Context {Type}
_•_ : (τ : Type) (Γ : Context {Type}) → Context {Ty... | module Syntax.Context.Plotkin where
-- Context for Plotkin-stype language descriptions
--
-- This module will tend to duplicate Syntax.Context to a large
-- extent. Consider having Syntax.Context specialize future
-- content of this module to maintain its interface.
infixr 9 _•_
data Context {Type : Set} : Set where... | update description of Plotkin's context | Agda: update description of Plotkin's context
Reason: the previous description contains a modularization task
that is already partially carried out.
Reference:
https://github.com/ps-mr/ilc/commit/249e99d807e2382a37fb35aee78c235b98e427aa#commitcomment-3659727
Old-commit-hash: 3c52ba4a07600646db8de764b1460fa6b69c3014
| Agda | mit | inc-lc/ilc-agda |
63b0b983e562c4195da605874a1e5b1e379fa13c | UNDEFINED.agda | UNDEFINED.agda | -- Allow holes in modules to import, by introducing a single general postulate.
module UNDEFINED where
open import Data.Unit.NonEta using (Hidden)
open import Data.Unit.NonEta public using (reveal)
postulate
-- If this postulate would produce a T, it could be used as instance argument, triggering many ambiguities.... | -- Allow holes in modules to import, by introducing a single general postulate.
module UNDEFINED where
postulate
UNDEFINED : ∀ {ℓ} → {T : Set ℓ} → T
| Refactor UNDEFINED to simplify it (XXX untested) | Refactor UNDEFINED to simplify it (XXX untested)
Instance arguments changed behavior, so not every definition is
available anymore. Hence we can avoid the wrapping.
It typechecks, but not really tested on clients.
| Agda | mit | inc-lc/ilc-agda |
9c628f8fc4514a3379c8bb109b925c9a196d5571 | Parametric/Syntax/MTerm.agda | Parametric/Syntax/MTerm.agda | import Parametric.Syntax.Type as Type
import Parametric.Syntax.Term as Term
import Parametric.Syntax.MType as MType
module Parametric.Syntax.MTerm
{Base : Type.Structure}
(Const : Term.Structure Base)
where
open Type.Structure Base
open MType.Structure Base
open Term.Structure Base Const
-- Our extension p... | import Parametric.Syntax.Type as Type
import Parametric.Syntax.Term as Term
import Parametric.Syntax.MType as MType
module Parametric.Syntax.MTerm
{Base : Type.Structure}
(Const : Term.Structure Base)
where
open Type.Structure Base
open MType.Structure Base
open Term.Structure Base Const
-- Our extension p... | Drop extra parens | Drop extra parens
| Agda | mit | inc-lc/ilc-agda |
bf4c2374eee5aebf6d658c3c557a4233b3ba3172 | flipbased.agda | flipbased.agda | module flipbased where
open import Algebra
import Level as L
open L using () renaming (_⊔_ to _L⊔_)
open import Function hiding (_⟨_⟩_)
open import Data.Nat.NP
open import Data.Nat.Properties
open import Data.Product using (proj₁; proj₂; _,_; swap; _×_)
open import Data.Bits hiding (replicateM)
open import Data.Bool
o... | module flipbased where
open import Algebra
import Level as L
open L using () renaming (_⊔_ to _L⊔_)
open import Function hiding (_⟨_⟩_)
open import Data.Nat.NP
open import Data.Bool
open import Data.Nat.Properties
open import Data.Product using (proj₁; proj₂; _,_; swap; _×_)
open import Data.Bits hiding (replicateM)
o... | add choose | flipbased: add choose
| Agda | bsd-3-clause | crypto-agda/crypto-agda |
b2e5536ab47da9ade851c78e2d0e284fdaed9d6e | SymbolicDerivation.agda | SymbolicDerivation.agda | module SymbolicDerivation where
open import Relation.Binary.PropositionalEquality
open import Syntactic.Types
open import Syntactic.Contexts Type
open import Syntactic.Terms.Total
open import Syntactic.Changes
open import Denotational.Notation
open import Denotational.Values
open import Denotational.Environments Typ... | module SymbolicDerivation where
open import Relation.Binary.PropositionalEquality
open import Syntactic.Types
open import Syntactic.Contexts Type
open import Syntactic.Terms.Total
open import Syntactic.Changes
open import Denotational.Notation
open import Denotational.Values
open import Denotational.Environments Typ... | Break some lines. | Break some lines.
Old-commit-hash: f541af3f72f8831d3daba892d4230bda0bdb2cdf
| Agda | mit | inc-lc/ilc-agda |
789ee03b932a743e1b7f9832f09bd7efc37f4fa8 | Popl14/Denotation/Value.agda | Popl14/Denotation/Value.agda | module Popl14.Denotation.Value where
open import Popl14.Syntax.Type public
open import Popl14.Change.Type public
open import Base.Denotation.Notation public
open import Structure.Bag.Popl14
open import Data.Integer
-- Values of Calculus Popl14
--
-- Contents
-- - Domains associated with types
-- - `diff` and `apply`... | module Popl14.Denotation.Value where
open import Popl14.Syntax.Type public
open import Popl14.Change.Type public
open import Base.Denotation.Notation public
open import Structure.Bag.Popl14
open import Data.Integer
-- Values of Calculus Popl14
--
-- Contents
-- - Domains associated with types
-- - `diff` and `apply`... | Split ⟦_⟧Base from ⟦_⟧Type (WIP). | Split ⟦_⟧Base from ⟦_⟧Type (WIP).
Needs fixes to type inference failures!
Old-commit-hash: 4f7d5e46e2d2a202dc2c672a08ae4deeebe589c2
| Agda | mit | inc-lc/ilc-agda |
3ef3b1f40e4b0b9e7308a67388ab552654f5feeb | lib/Data/Bits.agda | lib/Data/Bits.agda | {-# OPTIONS --without-K #-}
module Data.Bits where
open import Algebra
open import Level.NP
open import Type hiding (★)
open import Data.Nat.NP hiding (_==_) renaming (_<=_ to _ℕ<=_)
open import Data.Bit using (Bit)
open import Data.Two renaming (_==_ to _==ᵇ_)
open import Data.Fin.NP using (Fin; zero; suc; inject₁; i... | {-# OPTIONS --without-K #-}
module Data.Bits where
open import Algebra
open import Level.NP
open import Type hiding (★)
open import Data.Nat.NP hiding (_==_) renaming (_<=_ to _ℕ<=_)
open import Data.Bit using (Bit)
open import Data.Two renaming (_==_ to _==ᵇ_)
open import Data.Fin.NP using (Fin; zero; suc; inject₁; i... | use patterns 0∷ and 1∷ | Bits: use patterns 0∷ and 1∷
| Agda | bsd-3-clause | crypto-agda/agda-nplib |
4cbed45974f3385d5c182dddefd1bb738b95c793 | ChangeContexts.agda | ChangeContexts.agda | module ChangeContexts where
open import IlcModel
open import Changes
open import meaning
-- TYPING CONTEXTS, VARIABLES and WEAKENING
open import binding Type ⟦_⟧Type
-- CHANGE CONTEXTS
Δ-Context : Context → Context
Δ-Context ∅ = ∅
Δ-Context (τ • Γ) = Δ-Type τ • τ • Δ-Context Γ
update : ∀ {Γ} → ⟦ Δ-Context Γ ⟧ → ⟦ ... | module ChangeContexts where
open import IlcModel
open import Changes
open import meaning
-- TYPING CONTEXTS, VARIABLES and WEAKENING
open import binding Type ⟦_⟧Type
-- CHANGE CONTEXTS
Δ-Context : Context → Context
Δ-Context ∅ = ∅
Δ-Context (τ • Γ) = Δ-Type τ • τ • Δ-Context Γ
update : ∀ {Γ} → ⟦ Δ-Context Γ ⟧ → ⟦ ... | document a function | agda: document a function
Old-commit-hash: c0550a6f2e84b20bc63a5c0f91a168988125b117
| Agda | mit | inc-lc/ilc-agda |
70907b2ea28e2d6559f103705f74a8fefbca6f63 | Parametric/Change/Validity.agda | Parametric/Change/Validity.agda | import Parametric.Syntax.Type as Type
import Parametric.Denotation.Value as Value
module Parametric.Change.Validity
{Base : Type.Structure}
(⟦_⟧Base : Value.Structure Base)
where
open Type.Structure Base
open Value.Structure Base ⟦_⟧Base
-- Changes for Calculus Popl14
--
-- Contents
-- - Mutually recursive... | import Parametric.Syntax.Type as Type
import Parametric.Denotation.Value as Value
module Parametric.Change.Validity
{Base : Type.Structure}
(⟦_⟧Base : Value.Structure Base)
where
open Type.Structure Base
open Value.Structure Base ⟦_⟧Base
-- Changes for Calculus Popl14
--
-- Contents
-- - Mutually recursive... | Move before and after out of the mutually dependent block. | Move before and after out of the mutually dependent block.
Old-commit-hash: 1d7a74aa7d62457de4936eae9faaeb605d739bf3
| Agda | mit | inc-lc/ilc-agda |
6f7fde98554f01770bfdbd43711ab8e45eab8b9b | Control/Protocol.agda | Control/Protocol.agda | {-# OPTIONS --without-K #-}
open import Function.NP
open import Type
open import Level.NP
open import Data.Product.NP using (Σ; _×_; _,_) renaming (proj₁ to fst)
open import Data.One using (𝟙)
open import Relation.Binary.PropositionalEquality.NP using (_≡_; !_; _∙_; refl; ap; coe; coe!)
open import Function.Extensiona... | module Control.Protocol where
open import Control.Protocol.InOut public
open import Control.Protocol.End public
open import Control.Protocol.Core public
| Split Control.Protocol | Split Control.Protocol
| Agda | bsd-3-clause | crypto-agda/protocols |
81eecc922c3dc4fc227770d378988bd4c8881616 | ZK/GroupHom.agda | ZK/GroupHom.agda | {-# OPTIONS --without-K #-}
open import Type using (Type)
open import Type.Eq using (Eq?; _==_; ≡⇒==; ==⇒≡)
open import Function using (case_of_)
open import Data.Sum renaming (inj₁ to inl; inj₂ to inr)
open import Data.Product renaming (proj₁ to fst; proj₂ to snd)
open import Relation.Binary.PropositionalEquality.Base... | {-# OPTIONS --without-K #-}
open import Type using (Type)
open import Type.Eq using (Eq?; _==_; ≡⇒==; ==⇒≡)
open import Function using (case_of_)
open import Data.Sum renaming (inj₁ to inl; inj₂ to inr)
open import Data.Product renaming (proj₁ to fst; proj₂ to snd)
open import Relation.Binary.PropositionalEquality.Base... | split the verifier function | GroupHom: split the verifier function
| Agda | bsd-3-clause | crypto-agda/crypto-agda |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.