@LottieVixen @bram It's very simple. It's a formal language (so just a toy to build «terms», with no particular «meaning» until you decide to assign one to them) that has expressions of three forms :
«variables» (give yourself a set of acceptable names for variables, just writing the name of a variable is a statement in itself)
«lambda abstractions» λx -> t
where x is chosen in your variables set and t must be a term itself and so recursively can be a variable, or a lambda, or an
«application» a term that you write «f t» where f and t are both terms (recursively again, f and t can be variables, lambdas or applications)
mh(-), programming, learning Afficher plus
@LottieVixen @bram
My two cents but the most difficult to understand for me at first was actually how *simple* functional programming was. Seriously, it can be all very impressioning and first and it might sound like there's «something big» to get because you can hear people boasting about their superior intellect for digging functional programming but actually just stick to what you read, it's very powerful but based on very few simple premises. Do you know about lambda-calculus ?