Yes, it makes more sense in reducing type languages like scheme and Haskell, where its operating model is identical to the recursion that would normally be implemented.
On Tue, Oct 9, 2018, 4:03 PM Johann-Tobias Schäg <[email protected]> wrote: > > > It is quite inefficient, as it needs to build a new list of > all > arguments on > > each call: > Well i see ways how it could be speed up it up in assembly but only by > adding lots of complexity. > > (conc (rest) (cons I)) > > > and it has no advantage over a direct inline > > expression of what it does IMHO. > > Often it is contra-productive to over-abstract things. > > T > >
