Title: SpecConstr: specialize recursive functions on known-constructor call patterns · Issue #208 · purescript-lua/purescript-lua · GitHub
Open Graph Title: SpecConstr: specialize recursive functions on known-constructor call patterns · Issue #208 · purescript-lua/purescript-lua
X Title: SpecConstr: specialize recursive functions on known-constructor call patterns · Issue #208 · purescript-lua/purescript-lua
Description: Problem A recursive function that carries a constructor accumulator allocates the box on every iteration only to take it apart at the top of the next one: loop :: Tuple Int Int -> Int loop acc = case acc of Tuple s i | i >= n -> s | othe...
Open Graph Description: Problem A recursive function that carries a constructor accumulator allocates the box on every iteration only to take it apart at the top of the next one: loop :: Tuple Int Int -> Int loop acc = ca...
X Description: Problem A recursive function that carries a constructor accumulator allocates the box on every iteration only to take it apart at the top of the next one: loop :: Tuple Int Int -> Int loop acc =...
Opengraph URL: https://github.com/purescript-lua/purescript-lua/issues/208
X: @github
Domain: github.com
{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"SpecConstr: specialize recursive functions on known-constructor call patterns","articleBody":"## Problem\n\nA recursive function that carries a constructor accumulator allocates the box on every iteration only to take it apart at the top of the next one:\n\n```purescript\nloop :: Tuple Int Int -> Int\nloop acc = case acc of\n Tuple s i\n | i >= n -> s\n | otherwise -> loop (Tuple (s + i) (i + 1))\n```\n\nEvery iteration builds a fresh `Tuple` table and the next iteration's match immediately deconstructs it. Fold-shaped loops with `Tuple`/`Maybe`/`Either` accumulators are everyday PureScript, and the #177/#178/#180 cascades will produce more of these shapes as they collapse monadic chains into recursive functions.\n\n## Approach\n\nGHC's SpecConstr (call-pattern specialisation): for a recursive binding whose body scrutinizes a parameter and whose recursive call sites pass a known constructor at that position, mint a specialized copy taking the constructor's fields as separate parameters, and rewrite those sites:\n\n```lua\n-- specialized worker: zero allocations per iteration\nlocal loop_s = function(s, i)\n if i >= n then return s else return loop_s(s + i, i + 1) end\nend\n-- entry wrapper stays: a boxed accumulator can still arrive from outside\nlocal loop = function(acc) return loop_s(acc.value0, acc.value1) end\n```\n\nThe machinery is the #24 discipline reapplied (mint a copy, rewrite the qualifying sites, keep the wrapper for the rest), with beta plus the #177 fold cleaning up the specialized body. Guards learned from GHC:\n\n- cap the number of specializations per function (the `-fspec-constr-count` analogue);\n- bound the rounds instead of iterating to a fixpoint, since a specialized body can expose new call patterns;\n- recursive bindings only: the non-recursive case is ordinary inlining plus #177.\n\n## Prerequisites / Relations\n\nHard prerequisite: #177, the specialized body's deconstruction folds away through it. Composes with the landed #24 split (specialization applies to n-ary workers) and with #181 (after loopification, per-iteration allocation is the main remaining cost in these loops). #206 is the result-side dual: together they pass raw components through a loop with no box materialized in either direction.\n\nParked: pick this up once #177/#178/#180 have landed and the #172 counters show constructor allocations inside hot recursions.\n\n## Verification / Measurement\n\nAn allocation counter on a Tuple-accumulator fold benchmark drops to zero tables per iteration, eval goldens stay byte-identical, and `golden.lua` sizes confirm the code-growth cap holds.\n","author":{"url":"https://github.com/Unisay","@type":"Person","name":"Unisay"},"datePublished":"2026-07-08T07:24:41Z","url":"https://github.com/purescript-lua/purescript-lua/issues/208"}
| react-profiling | 0 |
| react-import-map | react,react-dom,react-dom/client,react-dom/profiling,react-is,react/compiler-runtime,react/jsx-dev-runtime,react/jsx-runtime,scheduler@b8488ee2c322 |
| route-pattern | /_view_fragments/issues/show/:user_id/:repository/:id/issue_layout(.:format) |
| route-controller | voltron_issues_fragments |
| route-action | issue_layout |
| fetch-nonce | v2:ac57cba0-1600-f330-ba34-ff1366b4e193 |
| current-catalog-service-hash | 81bb79d38c15960b92d99bca9288a9108c7a47b18f2423d0f6438c5b7bcd2114 |
| request-id | DFFA:1C6C3E:7D8CD4:A817CA:6B00DB6C |
| html-safe-nonce | 6276424ace10bfd708cf08902d3121815ee43268c0c805cefc65586d9a61002e |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJERkZBOjFDNkMzRTo3RDhDRDQ6QTgxN0NBOjZCMDBEQjZDIiwidmlzaXRvcl9pZCI6Ijg3NDIxNzgyODIzNTY2NjExMDAiLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ== |
| visitor-hmac | 835f654d363a7331b21c91c5f08dfa065e05bd5c73b3e1ca06a4e36273648194 |
| hovercard-subject-tag | issue:4835294350 |
| github-keyboard-shortcuts | repository,issues,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location | / |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/_view_fragments/issues/show/purescript-lua/purescript-lua/208/issue_layout |
| twitter:image | https://opengraph.githubassets.com/a6f5254e7f6f7b01ccae3a8362c7f8b583bd59166dc3d2a583b88fdfbd1066f7/purescript-lua/purescript-lua/issues/208 |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/a6f5254e7f6f7b01ccae3a8362c7f8b583bd59166dc3d2a583b88fdfbd1066f7/purescript-lua/purescript-lua/issues/208 |
| og:image:alt | Problem A recursive function that carries a constructor accumulator allocates the box on every iteration only to take it apart at the top of the next one: loop :: Tuple Int Int -> Int loop acc = ca... |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| og:author:username | Unisay |
| hostname | github.com |
| expected-hostname | github.com |
| None | 043c3f30fbcbe2c6c8e729e10cbbbc90c406546f9fbbb67c648d38f6b7d16daf |
| turbo-cache-control | no-preview |
| go-import | github.com/purescript-lua/purescript-lua git https://github.com/purescript-lua/purescript-lua.git |
| octolytics-dimension-user_id | 131581790 |
| octolytics-dimension-user_login | purescript-lua |
| octolytics-dimension-repository_id | 587200487 |
| octolytics-dimension-repository_nwo | purescript-lua/purescript-lua |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 587200487 |
| octolytics-dimension-repository_network_root_nwo | purescript-lua/purescript-lua |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | 5425dc24e8bd8d6fca9641a12afc984825a43875 |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
| react-app-name | issues |
Links:
Viewport: width=device-width