Exploring a number of concepts at the base of a programming language I discovered that it was possible to do without "closures", whatever their indisputable int

Exploring a number of concepts at the base of a programming language I discovered that it was possible to do without "closures", whatever their indisputable interest. * http://lambdaway.free.fr/lambdawalks/ http://lambdaway.free.fr/lambdawalks/ * http://lambdaway.free.fr/lambdawalks/?view=unclosure http://lambdaway.free.fr/lambdawalks/?view=unclosure I wonder if such a language in which the management of the lexical context would have become useless could lead to optimizations. For example in recursive operations. What do you think about it?