<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Speculative Staging for Interpreter Optimization · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1310.2300/</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/1310.2300/feed.xml" rel="self" type="application/rss+xml" /><item><title>Speculative Staging for Interpreter Optimization — mentioned by gergo_barany</title><link>https://news.ycombinator.com/item?id=17100762</link><guid isPermaLink="false">urn:hackerpapers:mention:1310.2300:17100762</guid><pubDate>Fri, 18 May 2018 12:13:41 GMT</pubDate><description>&lt;p&gt;&amp;gt; Is that because Python already is the way it is? Partly, yes. But also because the optimizations I would have come up with were all tried by Stefan Brunthaler before. See some citations in the paper, in particular to: http://arxiv.org/abs/1310.2300 where he claims a 4x speedup over CPython using purely interpreter-based and safe optimizations. So I guess I should have written &amp;quot;no really obvious and new optimizations to try&amp;quot;. Anyway, Stefan&amp;#x27;s work in general is very interesting for implementors of dynamic language interpreters. A lot of it harks back to things that were first developed for…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1310.2300/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>Speculative Staging for Interpreter Optimization — mentioned by gergo_barany</title><link>https://news.ycombinator.com/item?id=16324985</link><guid isPermaLink="false">urn:hackerpapers:mention:1310.2300:16324985</guid><pubDate>Wed, 07 Feb 2018 15:24:02 GMT</pubDate><description>&lt;p&gt;&amp;gt; Where are the main blowouts in python performance? I did some research a few years ago that tried to quantify some of this. If you trust my methodology, the biggest problems (depending on application, of course) are: boxing of numbers; list/array indexing with boxed numbers and bounds checking; and late binding of method calls. Basically, doing arithmetic on lists of numbers in pure Python is about the worst thing you can do. And it&amp;#x27;s not just due to dynamic typing: Even if you know that two numbers you want to add are floats, they are still floats stored in boxed form as objects in memory…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1310.2300/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>Speculative Staging for Interpreter Optimization — HN submission</title><link>https://news.ycombinator.com/item?id=6997806</link><guid isPermaLink="false">urn:hackerpapers:submission:1310.2300:6997806</guid><pubDate>Thu, 02 Jan 2014 02:11:54 GMT</pubDate><description>&lt;p&gt;Speculative Staging for Interpreter Optimization&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1310.2300/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item></channel></rss>
