Mutually recursive definitions

Documentation and user's manual

Table of contents

OCaml programs

Mutually recursive definitions

This code gives a correct definition of both the predicate functions checking whether a natural number is even and whether a natural number is odd let rec is_even = function n -> (* n >= 0 *) if n = 0 then true (* basis *) else is_odd (n - 1) (* induction *) and is_odd = function n -> (* n >= 0 *) if n = 0 then false (* basis *) else is_even (n - 1) (* induction *) This is a mutually recursive definition.

Similarly mutually recursive definitions of types can be written.

Mutually recursive definitions

Documentation and user's manual

Table of contents

OCaml programs