<?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 on Kevin wang's blog</title><link>https://kevinwang930.github.io/tags/functional-programming/</link><description>Recent content in Functional Programming on Kevin wang's blog</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Sat, 31 Oct 2026 17:45:00 +0100</lastBuildDate><atom:link href="https://kevinwang930.github.io/tags/functional-programming/index.xml" rel="self" type="application/rss+xml"/><item><title>The Lambda Calculus and Its Racket Implementation</title><link>https://kevinwang930.github.io/post/computer/lambda-calculus/</link><pubDate>Sat, 31 Oct 2026 17:45:00 +0100</pubDate><guid>https://kevinwang930.github.io/post/computer/lambda-calculus/</guid><description>&lt;p&gt;The lambda calculus (also written as λ-calculus) is a formal system for expressing computation based on function abstraction and application using variable binding and substitution. The calculus is a universal machine: a model of computation that can be used to simulate any Turing machine. Alonzo Church introduced it in the 1930s as part of his research into the foundations of mathematics. Racket implements it directly: &lt;code&gt;lambda&lt;/code&gt; is the abstraction, and &lt;code&gt;(f a)&lt;/code&gt; is the application.&lt;/p&gt;</description></item></channel></rss>