It gives a pretty facinating point of view onto computation in general.
You only the ability to define and call functions. Functions can only recombine their input. And somehow it is still as powerful as, say, python!
Don't need some built in math , invent numbers using function definitions. Don't need built in recursion, just implement it using functions as the y-combinator!
There are also some practical usages of the whole implement-data-as-functions idea. There are some libraries in haskell that do this, for instance, which means that the compiler can optimize dsl's.
You only the ability to define and call functions. Functions can only recombine their input. And somehow it is still as powerful as, say, python!
Don't need some built in math , invent numbers using function definitions. Don't need built in recursion, just implement it using functions as the y-combinator!
There are also some practical usages of the whole implement-data-as-functions idea. There are some libraries in haskell that do this, for instance, which means that the compiler can optimize dsl's.