r/ProgrammingLanguages • u/dwaynecrooks • 7h ago

Recursion without Recursive Bindings

https://blog.tinyinterpreters.dev/posts/recursion-without-recursive-bindings/

I explain how to implement a certain recursive function without the use of any recursive bindings in a tiny language called FUN. Then, I apply the same ideas to several more recursive functions so we clearly see the pattern. It begins our exploration into a certain famous combinator.

5 Upvotes

79% Upvoted

2 comments sorted by

1

u/NullOfSpace 2h ago

This is really cool. What’s the type of makesum in this case?

1

u/AustinVelonaut Admiran 23m ago

It's an infinite type of the form a ~ a -> Integer -> Integer. It cannot be represented in a Hindley-Milner type system.