[Experimental] Recursion using the Y combinator #3103
Closed
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This is a proof of concept that's not meant to be merged. It implements a fixed-piont combinator, more commonly known as the Y combinator. Using this, we can do recursion in KCL.
I implemented a recursive
isEven()
function as a test case to prove that it works.The few things missing that I also implemented were:
||
!
I bumped into a few rough edges of the parser while implementing the Y combinator, but they're already separate issues.
Reference:
closes KCL doesn't support negation #745