You need to say
let rec count_help ...
to allow the name count_help to be used recursively within its definition.
Related Posts:
- List.fold_left in OCaml
- Print a List in OCaml
- “Error: unbound module” in OCaml
- Absolute value for floats in core OCaml
- OCaml cons (::) operator?
- What is tail recursion?
- What is the maximum recursion depth in Python, and how to increase it?
- What is the maximum recursion depth in Python, and how to increase it?
- how to implement quick sort algorithm in C++
- Python: maximum recursion depth exceeded while calling a Python object
- Exception in thread “main” java.lang.StackOverflowError
- Python: maximum recursion depth exceeded while calling a Python object
- Exception in thread “main” java.lang.StackOverflowError
- What is the maximum recursion depth in Python, and how to increase it?
- Does != have meaning in OCaml?
- Determining complexity for recursive functions (Big O notation)
- Java recursive Fibonacci sequence
- C++ Algorithmically Simple Recursive Palindrome Checker
- Recursive print Factorial
- Python: maximum recursion depth exceeded while calling a Python object
- Print singly linked list in reverse order
- Recursion vs. Iteration (Fibonacci sequence)
- Python Array Rotation
- What is tail call optimization?
- IDE for OCaml language
- OCaml: Match expression inside another one?
- Is log(n!) = Θ(n·log(n))?
- Recursion in Python? RuntimeError: maximum recursion depth exceeded while calling a Python object
- What does the `and` keyword mean in OCaml?
- Understanding Recursion to generate permutations
- How to solve: T(n) = T(n/2) + T(n/4) + T(n/8) + (n)
- Making a deep copy of a LinkedList in java
- MIPS Recursive Fibonacci Sequence
- Python Quicksort Runtime Error: Maximum Recursion Depth Exceeded in cmp
- OCaml mod function returns different result compared with %
- Multiplication function with recursion in Python