Coq vector: shiftin, shiftout, and last...

Coq vector: equality of shiftin...

Agda: cannot instantiate metavariable...

Agda: is there a way to use the information provided by with-abstraction in the function definition?...

Can I write a dependent left fold in terms of a dependent right fold?...

Is there any difference between "parameters" and "indices" in Coq theorems?...

Composing dependent functions in Lean...

Does calling a dependent function that has not been yet declared at the point of template definition...

Agda-like programming in Coq/Proof General?...

How to Notify the Agda Type-Checker that two Types are Indeed Equal?...

Wrong Typeclass Instance used in Coq Proof...

How do I annotate a function whose return type depends on its argument?...

How to define mutual inductive propositions in Lean?...

Proving that user has always less money than bank...

In Scala 3 with DOT calculus, is `this.type` a path-dependent type? What makes it special?...

Can a dependently typed language be Turing complete?...

How to promote value into type with withKnownNat...

Can I get a Rust array's length with only a type, not a concrete variable?...

Notation for functions returning dependent types...

Simple dependent type example in Haskell for Dummies. How are they useful in practice in Haskell? Wh...

Dependent equality with 2 different type functions...

How can I prove dependent function types equal in Agda?...

How to prove a = b → a + 1 = b + 1 in lean?...

How do I run Pie (from The Little Typer) from the command line?...

How do I efficiently add existentially typed safe money values?...

Why can some disjoint and exhaustive patterns not be represented as definitional equalities?...

In Scala 3 (dotty) or Scala 2, how to make dependent types transitive?...

How to deal with non-termination error in Cubical Agda...

List without gaps in Coq...

How to use the result of a depedent pair?...