递归透视编程语言丹格罗斯曼视角定义总尾.pdfVIP

  • 2
  • 0
  • 约2.46千字
  • 约 5页
  • 2023-09-28 发布于北京
  • 举报

递归透视编程语言丹格罗斯曼视角定义总尾.pdf

Always tail-recursive? There are certainly cases where recursive functions cannot be evaluated in a constant amount of space Most obviou amples are functions that process trees In these cases, the natural recursive approach is the way to go – You could get one recursive call to b

文档评论(0)

1亿VIP精品文档

相关文档