Lambda Calculus: The Y combinator in ruby
In a previous article, we have shown how one can write recursive functions without using names.
Developer. Author. Speaker.
In a previous article, we have shown how one can write recursive functions without using names.
In a previous article, we have shown how one can write recursive functions without using names.
This is an introductory article to the Y combinator from lambda-calculus. But we won’t mention the Y combinator in this article.
When we presented the Y combinator, we said that it was very aesthetic but not so practical.
In a previous article, we have shown how one can write recursive functions without using names.
In this article, we are going to show how one could write recursive functions in a language where there are no names and no loops.
This is an introductory article to the Y combinator from lambda-calculus. But we won’t mention the Y combinator in this article.
In our previous article, we showed how the numbers are represented in lambda calculus.
The mathematical theory behind LISP is the λ-calculus (pronounced lambda-calculus).
testcheck-js is a library for generative testing of program properties.