# Recursion without Recursive Bindings

**URL:** <https://discourse.elm-lang.org/t/recursion-without-recursive-bindings/10936>\
**Category:** Show and Tell\
**Created:** [October 13, 2026, 9:29am UTC](https://discourse.elm-lang.org/t/recursion-without-recursive-bindings/10936 "2026-10-13T09:29:01Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![dwayne](https://yyz1.discourse-cdn.com/flex035/user_avatar/discourse.elm-lang.org/dwayne/32/5478_2.png) [@dwayne](https://discourse.elm-lang.org/u/dwayne)\
**Post date:** [October 13, 2026, 9:29am UTC](https://discourse.elm-lang.org/t/recursion-without-recursive-bindings/10936/1 "2026-10-13T09:29:01Z")

</div>

I explain how to solve the challenge from my previous post and then we apply the idea to several more recursive functions to see the pattern. It begins our exploration into a certain famous combinator.

> **[Recursion without Recursive Bindings | Tiny Interpreters](https://blog.tinyinterpreters.dev/posts/recursion-without-recursive-bindings/)**
>
> Learn how to express recursion in FUN even though it lacks recursive bindings.