New comment on block [block-idp7088656]

[edwintorok]

(Previous comment lost while site was not responding?) For people coming from only an imperative programming background (as opposed to a more mathematic one) 'stopping condition' or 'termination condition' might be a more familiar term, so perhaps you could mention that in parantheses.

[bactrian]

This comment references this from milestone beta1: http://www.realworldocaml.org/beta1/en/html/a-guided-tour.html#idp7088656

Context:

Recursive functions, or, functions that call themselves, are an important technique in OCaml and in any functional language. The typical approach to designing a recursive function is to separate the logic into a set of base cases, that can be solved directly, and a set of inductive cases, where the function breaks the problem down into smaller pieces and then calls itself to solve those smaller problems.

[yminsky]

I prefer the term base case, and think it's widely enough known among the target audience.