pufferffish / agda-symmetries

MIT License
5 stars 1 forks source link

Show that Tree is Free on the empty signature of equations #27

Closed vikraman closed 9 months ago

vikraman commented 10 months ago

Using Free.Definition you can show that Tree X is Free when the equations are empty.

There might be some circularity because the definition of is using Tree.sharp, but we could make sharp private to the internal module and only expose the Free instance of Tree.

Depends on #26