[Agda] Termination checking on coinduction

Nils Anders Danielsson nad at chalmers.se
Sun Feb 19 07:37:58 CET 2012

On 2012-02-18 19:40, Alex Rozenshteyn wrote:
> Wouldn't it also be useful to have a function which returns a Costring
> and a proof that it's finite?
> That way you'd have a lazy string like in haskell, but you'd be able
> to use it in more ways, right?

If you use the MAlonzo backend, then Strings are represented as Haskell


More information about the Agda mailing list