<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Classical lambda calculus in modern dress · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1211.5762/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1211.5762/feed.xml" rel="self" type="application/rss+xml" /><item><title>Classical lambda calculus in modern dress — mentioned by danharaj</title><link>https://news.ycombinator.com/item?id=15450404</link><guid isPermaLink="false">urn:hackerpapers:mention:1211.5762:15450404</guid><pubDate>Wed, 11 Oct 2017 15:13:25 GMT</pubDate><description>&lt;p&gt;For a professional category theorist interested in theoretical computer science? The thing is, they could easily just dive into reading some papers on the subject. The intuition and mechanical skill of category theory is easily adapted to thinking about computation. Here are some relatively introductory treatments of some parts of CS in category theory: Introduction to Higher-Order Categorical Logic - Lambek and Scott Categorical Logic from a categorical point of view - Mike Shulman [0] Classical Lambda Calculus in Modern Dress - Martin Hyland [1] Computer Science page on the nlab - great…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1211.5762/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.CT</category></item></channel></rss>
