agda

agda

How does one use identity elimination (in agda) to prove Eckmann Hilton for higher dimensional paths in HoTT?

Agda: Constructing a recursive record value?

Could not parse the left-hand side (m + 1) * n

Where is _≡⟨_⟩_ Agda standard lib?

Is this formulation of Modulo a Set?

Working within agda's decideability framework

Using Agda "rewrite" to prove "composition of maps is map of compositions"

Derivatives of data structures in Agda

Intuition for difference between eta for function from top and empty functions in Agda

When should I use data types vs calculating types

Does safe Agda support coinduction w/out sized-types?

Can I use inductive type families in Cubical Agda?

Why does `sym` need to be used in this case when using `rewriting`?

How to prove that division is cancellative?

Is it possible to prove not equals is irrelevant without funext?

Proving the false case of an if and only if in Agda

What is the parse error referred to in this error?

Simple refl-based proof problem in Lean (but not in Agda)

How to prove that the halving function over positive rationals always has an existential?

How to choose the design for a well-founded inductive type?

Is Well-Founded recursion safe?

How can i prove that cons after uncons over coinductive list(a.k.a Stream) are identity, in Agda?

With clauses obscuring termination

Loading files in Agda: unclear explanation in Learn you an Agda

Is there an associative list in the standard library?

`with f x` matches `false`, but cannot construct `f x == false`

Is there an element-in-list datatype defined in the standard library?

How to deal with conflicting module definitions?

How is Agda inferring the implicit argument to `Vec.foldl`?

What would be a simple implementation of a collection with non-repeating elements?

How to convince the Agda compiler that an expression terminates?

How to go from an explicit proof of size decrease to a halting reduction algorithm?

Usage of Agda Data.Bool solver

Representing homomorphisms without writing all laws out

Convert indexed Agda data type to record

How do I handle the higher inductive cases when defining functions on HITs?

Constructing squares with constraints in an isSet type

How would reals be implemented in Cubical Agda?

What are the definitions for `isoToEquiv` and `iso`?

Error compiling Hello World with Agda 2.5.4.2 at command line

How do I define a type whose definition is implicit in the typing?

Simple encoding of category of sets and functions in Agda

Agda error when checking the inferred type

System F Church numerals in Agda

How to import the `∃-syntax`?

What is a valid type signature for the `Any-∃` exercise?

How to do a local rewrite?

missing documentation about agda-writer

How to do a rewrite in a premise?

Does Agda have any support for renaming variables?

With-abstraction and equality

How to create a 'do' block in Agda

Termination checker fails after abstracting the call site

Agda: Simplifying recursive definitions involving Thunk

How do you represent terms of the CoC in Agda?

What is the right way to use the `do` notation with Agda-stdlib's IO?

Is there any relationship between representing beta-equality as its congruence closure, and as sub-expression substitutions?

Why Agda sometimes complains about the code it writes itself when you use a case split?

What is the proper way to represent a beta-equality type for λ-terms?

Agda: rewriting instead of explicit coercion in type definition?

page:2 of 5 prev page next page main page

Categories

xamarin.android

beagleboneblack

firebase-remote-config

kotlin-multiplatform

data-annotations

system.linq.dynamic

autodesk-designautomation

spring-websocket

splunk-dashboard

asp.net-core-tag-helpers

tf.data.dataset

git-merge-conflict

mongo-cxx-driver

sharepoint-2007

google-cloud-ml-engine

mysql-error-2003

rsacryptoserviceprovider

mysqli-multi-query

Resources