Because it's another way to pass the tests, and it's no worse than guards, or pattern matching, or indexing a list?

You can't find the sum(n)-(a+b) == (a*b), (as the problem is saying) if you are not including the n, this should be the first thing you would look into when you start solving this kata. Idk why would you ask this.

had the same question and only reason I look into comment section right away. Thanks for asking and the reply.
For me it is not clearly.

No, not clearly.

He's #9 on the LC leaderboard. Doesn't say everything, but he's not a total beginner.

Joao, if you are missing specific information on datatypes, try the Encodings Guide. If you are missing necessary information in the Wiki, let us know on Discord:#lambda-calculus.

Most LC kata do not preload any functions, you have to build them yourself.

Also, as some advice, this particular kata is fairly hard in LC. I am not sure how familiar you are, but you might want to start with this collection to warm up.

There is no standard library for LC ( yet ).

You get variables, abstractions, applications, you even get recursion, and you get a Reference Guide for Binary Scott number encoding.

From there, you'll have to write your own succ function. ( Save it for later, and you'll have your own standard library. )

the sequence of all numbers from 1 to n

->

clearly inclusive, no?

Why conform if you can rebel?

I dont see how church is simpler tham scott. Maybe some definitions are shorter but pred for example is certainly simpler for scott numbers.