adambard/learnxinyminutes-docs
1
1
Fork 0
mirror of https://github.com/adambard/learnxinyminutes-docs.git synced 2024-12-23 07:12:31 +03:00
Code Issues Projects Releases Wiki Activity

[ocaml/en] Change the example of mutually recursive functions

Browse Source 
Change the example to a meaningful and self-contained example of
mutually recursive functions.
This commit is contained in:
Chenggang Duan 2015-02-12 16:54:26 +08:00
parent 6edf12c4d7
commit 8c70acc9fb
1 changed files with 10 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
ocaml.html.markdown
View File

@ -144,11 +144,16 @@ x + y ;;
(* Alternatively you can use "let ... and ... in" construct. (* Alternatively you can use "let ... and ... in" construct.
This is especially useful for mutually recursive functions, This is especially useful for mutually recursive functions,
with ordinary "let .. in" the compiler will complain about with ordinary "let .. in" the compiler will complain about
unbound values. unbound values. *)
It's hard to come up with a meaningful but self-contained let rec
example of mutually recursive functions, but that syntax is_even = function
works for non-recursive definitions too. *) | 0 -> true
let a = 3 and b = 4 in a * b ;; | n -> is_odd (n-1)
and
is_odd = function
| 0 -> false
| n -> is_even (n-1)
;;
(* Anonymous functions use the following syntax: *) (* Anonymous functions use the following syntax: *)
let my_lambda = fun x -> x * x ;; let my_lambda = fun x -> x * x ;;