<?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/en-us/tags/functional-programming/</link><description>Posts gathered under this term.</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Thu, 18 Jul 2013 00:00:00 +0000</lastBuildDate><atom:link href="https://blog.shuaizhang.cc/en-us/tags/functional-programming/index.xml" rel="self" type="application/rss+xml"/><item><title>Tail Recursion, CPS, and a General Method for Converting Recursion to Loops</title><link>https://blog.shuaizhang.cc/en-us/posts/tail-recursion-cps-and-recursion-to-loop/</link><pubDate>Thu, 18 Jul 2013 00:00:00 +0000</pubDate><guid>https://blog.shuaizhang.cc/en-us/posts/tail-recursion-cps-and-recursion-to-loop/</guid><description>This article introduces what tail recursion is, what CPS is, and how to apply the first two concepts to convert recursion into loops.</description></item></channel></rss>