How to reduce a cofix expression?...

Is an infinite list of ones sane?...

Are codatatypes really terminal algebras?...

How to define constant heterogeneous streams in Haskell?...

Can I prove "coinductive principles" about coinductive type?...

Eliminating erased argument with only one valid case...

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

Coinduction not of form A -> A?...

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

Defining equality relation for infinite trees...

CoNat : proving that 0 is neutral to the left...

Termination checker fails after abstracting the call site...

Proving a coinduction principle for co-natural numbers...

Why can't I define the following CoFixpoint?...

Ltac call to "cofix" failed. Error: All methods must construct elements in coinductive typ...

Mutual recursion in primcofix...

Trouble to understand Agda's Coinduction...

Define a 'head' for coinductive type stream in Coq(without pattern matching)...

Coinduction and dependent types...

Let-binding intermediate results in IO monad...

Proving equality on coinductive lazy lists in Coq...

Are Lists Inductive or Coinductive in Haskell?...

Compute an (infinite) tree from fixpoint operator using delay modality...

How to prove sset (cycle xs) = set xs...

Proof of stream's functor laws...

Is equality decidable on any coinductive type?...

Proving a Co-Inductive property (lexical ordering is transitive) in Coq...

How to create the `enumFromTo` function on Morte?...