Files
Provable-Programming-exercises/chap_4/e4_5.dfy
2026-03-10 13:05:37 +01:00

10 lines
215 B
Plaintext

datatype Tree<T> = Leaf(data: T)
| Node(left: Tree<T>, right: Tree<T>)
function Mirror<T>(t: Tree<T>): Tree<T> {
match t
case Leaf(_) => t
case Node(left, right) => Node(Mirror(right), Mirror(left))
}