663 karma · joined April 10, 2016
Your (gentle) opinion is welcome. Alain Marty
This is at least a subject that could be discussed. Gently.
In other words "go your way" you will not understand anything about recursion if you are not among the lucky ones. In this paper, taking forgotten byways, I propose to demonstrate the opposite, to show why recursion is consubstantial to us and why it concerns us all as humans.
In other words "go your way" you will not understand anything about recursion if you are not among the lucky ones. In this paper, taking forgotten byways, I propose to demonstrate the opposite, to show why recursion is consubstantial to us and why it concerns us all as humans.
More to see here : http://lambdaway.fr/workshop?view=levithan
More in the linked wiki page...
In my (humble) opinion and more generally, I think that the roots of coding can be built on a more simple foundation, a simple text rewriting process.
See more in the linked page. Your (gentle) opinion is welcome...
It's the quest of the {lambda way} project.
As explained in this page - http://lambdaway.fr/workshop/?view=coding the lambdatalk evaluator is built so that:
3) lambdas are special forms evaluated to a single word - a function's reference added to a dictionary, initially empty - and follow these 3 rules:
3.1) called on a number of words lesser than the number of arguments, a lambda memorizes the given words and returns a new lambda waiting for missing words,
3.2) called on a number of words equal to the number of arguments a lambda returns a word or a sequence of words,
3.3) called on a number of words greater than the number of arguments, the last one gets the exceeding words and the lambda returns a word or a sequence of words.
So:
1) {SWAP Hello}, ie {{lambda {:a :b} :b :a} Hello}, replaces :a by Hello and returns the anonymous unary function {lambda {:b} :b Hello} waiting for the missing one,
2) {SWAP Hello World} replaces :a by Hello and :b by World and returns "World Hello",
3) {SWAP one two three} replaces :a by "one", :b by all following words, here "two three", and returns "two three one"
The javascript code can be seen in the 100 first lines of this file - http://lambdaway.fr/workshop/meca/JS.js
The lambdaway project is introduced in deep here - http://lambdaway.fr/
with a lot of links to plain explanations on the lambdatalk language.
Thank you for your interest. Alain
Note: Please, don’t be disoriented by the wiki page splitted in narrow columns lost in a wide format. Like any spreadsheet (Excel, ...) it can be comfortably consulted and edited on any screens, wide and as narrow as those of smartphones, just use zooms +/- or dblclicks, sliders and fingers, it's easy and safe. Thank you.