<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Lambda-Calculus on emsenn.net</title>
    <link>https://emsenn.net/tags/lambda-calculus/</link>
    <description>Recent content in Lambda-Calculus on emsenn.net</description>
    <generator>Hugo</generator>
    <language>en</language>
    <lastBuildDate>Thu, 05 Mar 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://emsenn.net/tags/lambda-calculus/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Untyped Lambda Calculus</title>
      <link>https://emsenn.net/library/domains/science/domains/math/domains/type-theory/texts/untyped-lambda-calculus/</link>
      <pubDate>Thu, 05 Mar 2026 00:00:00 +0000</pubDate>
      <guid>https://emsenn.net/library/domains/science/domains/math/domains/type-theory/texts/untyped-lambda-calculus/</guid>
      <description>&lt;h2 id=&#34;entry-conditions&#34;&gt;&lt;a href=&#34;#entry-conditions&#34; class=&#34;heading-anchor&#34; aria-label=&#34;Link to this section&#34;&gt;¶&lt;/a&gt;Entry conditions&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;Use this lesson when you want to understand computation at its most fundamental level — before types, before programming languages, before machines. The lambda calculus is a formal system where every computation is expressed using only three constructs: variables, function definitions, and function application.&lt;/p&gt;&#xA;&lt;p&gt;No prior knowledge of logic, type theory, or programming is assumed. If you have written functions in any programming language, the intuitions will be familiar.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
