From 12d84e83a89e0e62c418f59c58f19615127252ae Mon Sep 17 00:00:00 2001 From: Kris Koishigawa Date: Mon, 11 Mar 2019 16:27:54 +0900 Subject: [PATCH] fix(challenges): Y problem --- .../rosetta-code/y-combinator.english.md | 28 +++++-------------- 1 file changed, 7 insertions(+), 21 deletions(-) diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/y-combinator.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/y-combinator.english.md index 8872e2c54e..3c81432925 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/y-combinator.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/y-combinator.english.md @@ -6,31 +6,17 @@ challengeType: 5 ## Description
-

-In strict -functional programming and -the lambda calculus, -functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. -This rules out the usual definition of a recursive function wherein a function is associated with the state of a variable and this variable's state is used in the body of the function. -

-

-The Y combinator is itself a stateless function that, -when applied to another stateless function, returns a recursive version of the function. The Y combinator is -the simplest of the class of such functions, called -fixed-point combinators. -

-Task: - - Define the stateless Y combinator function and use it to compute - factorial. - -factorial(N) function is already given to you. -See also Jim Weirich: Adventures in Functional Programming. +In strict functional programming and the lambda calculus, functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. This rules out the usual definition of a recursive function wherein a function is associated with the state of a variable and this variable's state is used in the body of the function. +The Y combinator is itself a stateless function that, when applied to another stateless function, returns a recursive version of the function. The Y combinator is the simplest of the class of such functions, called fixed-point combinators.
## Instructions
- +Define the stateless Y combinator function and use it to compute factorial. The factorial(N) function is already given to you. +See also: +
## Tests