2018-05-14
1389
#vanilla javascript
Benjamin Johnson
390
May 14, 2018 â‹… 4 min read

Using trampolines to manage large recursive loops in JavaScript

Benjamin Johnson Software engineer. Learning every day, one mistake at a time. You can find me online at benjaminjohnson.me.

Recent posts:

Fix over-caching with dynamic IO caching in Next.js 15

Next.js 15 caching overhaul: Fix overcaching with Dynamic IO and the use cache directive.

David Omotayo
Aug 6, 2025 â‹… 10 min read
LLMs are facing a QA crisis here’s how we could solve it

LLMs are facing a QA crisis: Here’s how we could solve it

LLM QA isn’t just a tooling gap — it’s a fundamental shift in how we think about software reliability.

Rosario De Chiara
Aug 4, 2025 â‹… 7 min read

Windsurf vs. Cursor: When to choose the challenger

Windsurf AI brings agentic coding and terminal control right into your IDE. We compare it to Cursor, explore its features, and build a real frontend project.

Chizaram Ken
Jul 31, 2025 â‹… 9 min read

The CSS if() function: Conditional styling will never be the same

The CSS Working Group has approved the if() function for development, a feature that promises to bring true conditional styling directly to our stylesheets.

Ikeh Akinyemi
Jul 30, 2025 â‹… 12 min read
View all posts

3 Replies to "Using trampolines to manage large recursive loops in JavaScript"

  1. Thanks for the article, i would argue the same as above but also without any need for the sum accumulator e.g.:

    “`
    const sumBelowRec (n) => () =>
    n === 0
    ? 0
    : n + sumBelowRec(n – 1)
    “`

  2. Accumulator is important because it will only work if you return trampoline function (same as Tail call). Otherwise you will sum up number with function.

Leave a Reply