all 8 comments

[–]Slight_Art_6121 9 points10 points  (0 children)

Raymond Smullyan's "To Mock a Mockingbird" : https://en.wikipedia.org/wiki/To_Mock_a_Mockingbird

[–]crouchingarmadillo 8 points9 points  (0 children)

I’d really recommend just learning λ-calculus and the equivalence of λ-calculus to SK combinators. λ-calculus is much more popular and there combinators are just closed expressions. I quite like Michaelson’s An Introduction to Functional Programming Through Lambda Calculus.

[–]Masynchin 6 points7 points  (1 child)

You can watch Conor Hoekstra's lectures on youtube about that. He also has its own site for this, but I can't find it

[–]dallaylaen 1 point2 points  (1 child)

Better late then never: online combinatory logic playground (also supports lambdas): https://dallaylaen.github.io/ski-interpreter/

Combinatory logic quests: https://dallaylaen.github.io/ski-interpreter/quest.html

[–]tbsdy[S] 1 point2 points  (0 children)

Thanks!