"Brett C." <bac at OCF.Berkeley.EDU> writes:
> Restricted execution
> --------------------
> from Andrew Bennett (private email)
>
> See the python-dev archives and Summaries for more painful details.
I think this would be a good choice, actually. Probably fairly
hard...
> Tail Recursion
> --------------
> from Me (my brain)
>
> Have proper tail recursion in Python. Would require identifying where
> a direct function call is returned (could keep it simple and just do
> it where CALL_FUNCTION and RETURN bytecodes are in a row). Also have
> to deal with exception catching since that requires the frame to stay
> alive to handle the exception.
>
> But getting it to work well could help with memory and
> performance. Don't know if it has been done for a language that had
> exception handling.
How is this different from stackless?
Cheers,
mwh
--
QNX... the OS that walks like a duck, quacks like a duck, but is,
in fact, a platypus. ... the adventures of porting duck software
to the platypus were avoidable this time.
-- Chris Klein, alt.sysadmin.recovery
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4