OurBigBook
About
$
Donate
Sign in
Sign up
Structural recursion
Ancestors will show here when the tree index is updated
2026-10-13
0
Like
NaN By others
on same topic
0 Discussions
Create my own version
Recursion
following the constructors of
a
finite inductive datatype. Correctness is naturally proved by
structural induction
.
// Target:
computer-science
.bigb
Incoming links
(5)
Binary tree
Past exam of the mathematics course of the University of Cambridge
/
2006
/
ia
/
Paper 5
/
1
/
d
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2006
/
ia
/
Paper 5
/
1
/
e
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2007
/
ia
/
Paper 5
/
6
/
c
/
Solution
Rooted tree
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(NaN)
There are currently no matching articles.
See all articles in the same topic
Create my own version