[Agda] Enumeration of Binary Trees

[Dima Zhyltsov]

Hi, Agda list.

I would like to share some code with you. Binary tree enumeration procedure
is defined and verified. It is typical combinatorial problem, and I just
wondered how hard it could be to define and reason about it in Agda. As far
as I know, it hasn't been done before. Please, let me know if it's not
so.

It is available here: https://github.com/zhyltsovd/agda-btree-enumeration

I hope somebody finds it useful.
All improvement suggestions are welcomed.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.chalmers.se/pipermail/agda/attachments/20130407/3c8e3bf5/attachment.html