作者: J S. Rohl
DOI:
关键词: Algebra 、 Structural induction 、 Mutual recursion 、 Corecursion 、 Theoretical computer science 、 Functional programming 、 Recursive definition 、 Left recursion 、 Divide and conquer algorithms 、 Mathematics 、 Double recursion
摘要: This book is devoted to recursion in programming, the technique by which solution a problem expressed partly terms of simpler version same problem. Ultimately simplest must be given explicitly. In functional has received its full due since it quite often only repetitive construct. However, programming language used here Pascal and examples have been chosen accordingly. It makes an interesting contrast with use logic programming. The early chapters consider simple linear using such as finding highest common factor pair numbers, processing linked lists. Subsequent move up through binary recursion, include Towers Hanoi symbolic differentiation, general recursion. contains well over 100 examples.