Path: csiph.com!optima2.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!1.eu.feeder.erje.net!newsfeed.xs4all.nl!newsfeed7.news.xs4all.nl!post.news.xs4all.nl!not-for-mail Return-Path: X-Original-To: python-list@python.org Delivered-To: python-list@mail.python.org X-Spam-Status: OK 0.013 X-Spam-Evidence: '*H*': 0.97; '*S*': 0.00; '16,': 0.03; 'indicating': 0.05; 'received:134': 0.05; 'assignment': 0.07; 'subject:module': 0.09; 'thu,': 0.15; 'algorithmic': 0.16; 'insights': 0.16; 'received:ac.be': 0.16; 'thread?': 0.16; 'trivially': 0.16; 'wrote:': 0.16; '2015': 0.20; 'machine': 0.21; 'examples': 0.24; 'header:In-Reply-To:1': 0.24; 'header:User-Agent:1': 0.26; 'chris': 0.26; 'question': 0.27; 'change,': 0.27; 'tail': 0.29; 'talked': 0.29; '(including': 0.30; 'code': 0.30; 'received:be': 0.30; "can't": 0.32; 'point': 0.33; 'though.': 0.33; 'next': 0.35; 'replace': 0.35; 'should': 0.36; 'to:addr:python-list': 0.36; 'pm,': 0.36; 'subject:: ': 0.37; 'being': 0.37; 'expect': 0.37; 'turned': 0.38; 'anything': 0.38; 'why': 0.39; 'subject:-': 0.39; 'rather': 0.39; 'to:addr:python.org': 0.40; 'collection': 0.60; 'care': 0.60; 'real': 0.62; 'world': 0.64; 'jul': 0.72; 'improved.': 0.84; 'pardon': 0.84; 'seen?': 0.91 X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: AnUFALK8p1WGuA9G/2dsb2JhbABahCsBJIMkwBUCghgBAQEBAQGFLgEBAQMBI1UGCwsYAgIFFgsCAgkDAgECAUUTBgICiCIIuiaRJ4R4AQEIAiCBIooqhQ0WglKBQwEElEaMGIg7kEQmgg0cgVVtAYJKAQEB Date: Thu, 16 Jul 2015 16:21:10 +0200 From: Antoon Pardon User-Agent: Mozilla/5.0 (X11; Linux i686; rv:31.0) Gecko/20100101 Icedove/31.7.0 MIME-Version: 1.0 To: python-list@python.org Subject: Re: A new module for performing tail-call elimination References: <55a3dcd9$0$3024$426a34cc@news.free.fr> <55a76628$0$2846$c3e8da3$76491128@news.astraweb.com> <55A78A42.4090506@rece.vub.ac.be> <55A7B309.8080903@rece.vub.ac.be> In-Reply-To: Content-Type: text/plain; charset=utf-8 Content-Transfer-Encoding: 7bit X-BeenThere: python-list@python.org X-Mailman-Version: 2.1.20+ Precedence: list List-Id: General discussion list for the Python programming language List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Newsgroups: comp.lang.python Message-ID: Lines: 24 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1437056472 news.xs4all.nl 2838 [2001:888:2000:d::a6]:44660 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:93930 On 07/16/2015 03:47 PM, Chris Angelico wrote: > On Thu, Jul 16, 2015 at 11:35 PM, Antoon Pardon > wrote: >> Any collection of functions that tail calls each other can rather >> trivially be turned into a state machine like the above. You can >> just paste in the code of the individual functions and replace >> the return call combo's with an assignment indicating which 'function' >> is to be 'called' next and its arguments. > That's not an algorithmic change, though. That's just a mechanical > change, and a poorly-written one. What did you expect when you talked about all tco examples (including real world ones) and the reimplementation being trivial? > My point was that I have yet to see > anything that demands TCO and can't be algorithmically improved. And how is this point relevant? Why should I care about what you have not seen? Will it give me new insights about my original question in this thread? -- Antoon Pardon