<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A type system for Continuation Calculus · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1409.3313/</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/1409.3313/feed.xml" rel="self" type="application/rss+xml" /><item><title>A type system for Continuation Calculus — mentioned by k_g_b_</title><link>https://news.ycombinator.com/item?id=40196474</link><guid isPermaLink="false">urn:hackerpapers:mention:1409.3313:40196474</guid><pubDate>Mon, 29 Apr 2024 10:05:56 GMT</pubDate><description>&lt;p&gt;The problem with typing continuations -in my opinion - stems from the fact that nearly all discussion of continuation starts from a functional context/view/programming language and often also in an untyped language/formalism. Additionally, CPS ends with &amp;quot;style&amp;quot; suggesting that it&amp;#x27;s fully expressible in the original programming language. But if we truly type it after a style transformation we need to introduce polymorphism everywhere, see e.g. the first example for Haskell on https://en.m.wikipedia.org/wiki/Continuation-passing_style If we use CPS as an IR, typing the continuations as…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1409.3313/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item></channel></rss>
