Re: [stack] disallowing recursive definitions

Daniel Ehrenberg scripsit:
> >  Sure, but then you can only compute primitive-recursive functions
> >  (roughly speaking, ones in which all loops are bounded at compile time).
> 
> With linrec and cons, I think you could build yourself an ad-hoc
> variable-depth stack anyway, where loops aren't necessarily bounded.
> It'd just be awkward and not any more efficient.

True.  It would be interesting to see a concatenative language
with support for data/codata, where you recurse downward on data
and upward on codata, a la "total functional programming".

-- 
John Cowan  <[email protected]>  http://www.ccil.org/~cowan
        Raffiniert ist der Herrgott, aber boshaft ist er nicht.
                --Albert Einstein