<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>CodePlan: Repository-level Coding using LLMs and Planning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2309.12499/</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/2309.12499/feed.xml" rel="self" type="application/rss+xml" /><item><title>CodePlan: Repository-level Coding using LLMs and Planning — HN submission</title><link>https://news.ycombinator.com/item?id=40320548</link><guid isPermaLink="false">urn:hackerpapers:submission:2309.12499:40320548</guid><pubDate>Fri, 10 May 2024 16:03:07 GMT</pubDate><description>&lt;p&gt;Show HN: I built an AI agent that upgrades NPM packages&lt;/p&gt;&lt;p&gt;Hi HN, I built a tool [1] that resolves breaking changes when you upgrade npm packages. I know keeping my dependencies updated is good hygiene but I really have no motivations to do them. The time to fix breaking changes then validate them makes the ROI lopsided. Automating these helps me reduce the barrier to a good habit. It works on typescript and tsx projects. BYOK (bring your own GPT-4 key) for the codegen. MIT license. How does it work? - Bumps the package version, builds your project, and then runs tsc over your project to understand what breaks - Uses ts-morph [2] to create an AST of…&lt;/p&gt;&lt;p&gt;5 points; 2 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2309.12499/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item><item><title>CodePlan: Repository-level Coding using LLMs and Planning — HN submission</title><link>https://news.ycombinator.com/item?id=40275424</link><guid isPermaLink="false">urn:hackerpapers:submission:2309.12499:40275424</guid><pubDate>Mon, 06 May 2024 14:55:41 GMT</pubDate><description>&lt;p&gt;Show HN: Can AI keep my code up-to-date?&lt;/p&gt;&lt;p&gt;Hey HN, We are open sourcing (https://github.com/xeol-io/bumpgen/), a tool that uses an LLM to upgrade your dependencies to their newer versions. We are building this for our customers (security teams) who need to upgrade their dependencies for security and compliance but lack engineering resources. Most patching tend to be painless but major version upgrades will cause breaking changes that require engineers to fix. We want bumpgen to reduce this engineering cost to security. It has been an interesting experience using AI to identify breaking changes, fix them, then propagate the fixes…&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2309.12499/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item><item><title>CodePlan: Repository-level Coding using LLMs and Planning — HN submission</title><link>https://news.ycombinator.com/item?id=40211351</link><guid isPermaLink="false">urn:hackerpapers:submission:2309.12499:40211351</guid><pubDate>Tue, 30 Apr 2024 14:35:04 GMT</pubDate><description>&lt;p&gt;Show HN: Bumpgen – upgrade NPM packages using AI&lt;/p&gt;&lt;p&gt;Hey HN, we are building bumpgen (https://github.com/xeol-io/bumpgen/) to remove the toil of fixing breaking changes during version bumps. bumpgen bumps your npm package version then generates the fixes to potential breaking changes. There were some interesting challenges we encountered using an LLM to fix breaking changes: [1] Finding the breaking changes → know how is a dependency used through the codebase [2] Knowing how to fix the a breaking change → know how the dependency has changed from one version to another [3] Understanding how the fix has modified existing behavior → know how the…&lt;/p&gt;&lt;p&gt;20 points; 9 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2309.12499/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item><item><title>CodePlan: Repository-level Coding using LLMs and Planning — mentioned by famouswaffles</title><link>https://news.ycombinator.com/item?id=37682040</link><guid isPermaLink="false">urn:hackerpapers:mention:2309.12499:37682040</guid><pubDate>Wed, 27 Sep 2023 22:06:50 GMT</pubDate><description>&lt;p&gt;This looks promising when Microsoft release the code for it. https://arxiv.org/abs/2309.12499&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2309.12499/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item><item><title>CodePlan: Repository-level Coding using LLMs and Planning — mentioned by famouswaffles</title><link>https://news.ycombinator.com/item?id=37652642</link><guid isPermaLink="false">urn:hackerpapers:mention:2309.12499:37652642</guid><pubDate>Tue, 26 Sep 2023 00:19:57 GMT</pubDate><description>&lt;p&gt;&amp;gt;It can&amp;#x27;t even generate flashcards from a textbook chapter, because it can&amp;#x27;t load the entire chapter into memory. Heck, it doesn&amp;#x27;t even know what textbook I&amp;#x27;m talking about; I have to provide the content! Okay...? That&amp;#x27;s a context window problem. and you could manage it if you sent the textbook in chunks. &amp;gt;The improvement GPT 5 would have to provide is multiple orders of magnitude in order for this to be a realistic proposition. No..it wouldn&amp;#x27;t https://arxiv.org/abs/2309.12499&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2309.12499/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item><item><title>CodePlan: Repository-level Coding using LLMs and Planning — mentioned by famouswaffles</title><link>https://news.ycombinator.com/item?id=37649863</link><guid isPermaLink="false">urn:hackerpapers:mention:2309.12499:37649863</guid><pubDate>Mon, 25 Sep 2023 20:08:48 GMT</pubDate><description>&lt;p&gt;&amp;gt;And it is not true that computing power will continue to reduce; Moore&amp;#x27;s Law has been dead for some time now, and if incremental growth in LLMs require exponential growth in computing power the marginal difference won&amp;#x27;t matter. This is a lot of unfounded assumptions. You don&amp;#x27;t need Moore&amp;#x27;s Law. GPU&amp;#x27;s are not really made with ML training in mind. You don&amp;#x27;t need exponential growth for anything. The money Open ai spent on GPT-4 a year ago could train a model twice as large today. and that amount is a drop in the bucket for the R&amp;amp;D of large corporations. Microsoft gave open ai 10B. amazon gave…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2309.12499/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item><item><title>CodePlan: Repository-level Coding using LLMs and Planning — mentioned by famouswaffles</title><link>https://news.ycombinator.com/item?id=37648963</link><guid isPermaLink="false">urn:hackerpapers:mention:2309.12499:37648963</guid><pubDate>Mon, 25 Sep 2023 19:06:42 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/2309.12499&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2309.12499/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item><item><title>CodePlan: Repository-level Coding using LLMs and Planning — HN submission</title><link>https://news.ycombinator.com/item?id=37644687</link><guid isPermaLink="false">urn:hackerpapers:submission:2309.12499:37644687</guid><pubDate>Mon, 25 Sep 2023 14:45:57 GMT</pubDate><description>&lt;p&gt;CodePlan: Repository-level Coding using LLMs and Planning&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2309.12499/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item></channel></rss>
