Explore >> Select a destination
|
You are here 
|
sookocheff.com | ||
| | | | |
deniskyashif.com
|
|
| | | | | How to define a recursive function in a language which doesn't support recursion using the Y combinator. | |
| | | | |
johnazariah.github.io
|
|
| | | | | The Y-Combinator. How to derive recursion in a purely functional context. | |
| | | | |
nguyenhuythanh.com
|
|
| | | | | "Y Combinator" is the name of a "meta" startup (one that powers other startups), and also is considered the most beautiful term of Computer Science, or Lambda Calculus. You may encountered this kind of post somewhere else, but I cannot stop doing the same. It blown my mind. Spares the techinal jargons, we should just jump straight into Lisp code. I will try to go step by step in the hope that you will "get" it. | |
| | | | |
mmhaskell.com
|
|
| | | [AI summary] This article compares Functional Programming and Object Oriented Programming paradigms, discussing their key differences, strengths, weaknesses, and how Haskell fits into the functional paradigm. | ||
