| | | Writing correct recursive definitions of functions | Documentation and user's manual | Table of contents | OCaml programs |
|
A function can be considered as the set of pairs (x,y) where y is the image of x under the function.
Therefore from a mathematical standpoint writing correct recursive definitions of functions amounts to writing correct inductive definitions of sets. |
| Thus inductive definitions of sets are first considered. |
| | | Writing correct recursive definitions of functions | Documentation and user's manual | Table of contents | OCaml programs |