<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Functional Programming</title><link>https://blog.shuaizhang.cc/zh-hans/category/functional-programming/</link><description>查看归入当前术语的文章。</description><generator>Hugo</generator><language>zh-Hans</language><lastBuildDate>Thu, 18 Jul 2013 00:00:00 +0000</lastBuildDate><atom:link href="https://blog.shuaizhang.cc/zh-hans/category/functional-programming/index.xml" rel="self" type="application/rss+xml"/><item><title>尾递归、CPS和将递归转化为循环的一般方法</title><link>https://blog.shuaizhang.cc/zh-hans/posts/tail-recursion-cps-and-recursion-to-loop/</link><pubDate>Thu, 18 Jul 2013 00:00:00 +0000</pubDate><guid>https://blog.shuaizhang.cc/zh-hans/posts/tail-recursion-cps-and-recursion-to-loop/</guid><description>本文介绍了什么是尾递归，什么是CPS，以及如何应用前两者将递归转化为循环。</description></item></channel></rss>