[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Tail call elimination
From: |
Paul Smith |
Subject: |
Re: Tail call elimination |
Date: |
Mon, 11 May 2020 16:35:32 -0400 |
On Mon, 2020-05-11 at 14:01 -0500, Pete Dietl wrote:
> What do you all think about me attempting to implementing tail call
> elimination for recursive make functions? This combined with the
> proposed (let) construct would be rather powerful.
If it's straightforward it doesn't bother me. I'd have to see the code
involved. It seems likely that it would be sufficient to require
copyright assignment.
As mentioned by Daniel I'm uneasy about, basically, inventing a
completely new, fully functional language in make. We already have
plenty of those.
I suspect it's not what Tim has in mind :) but for what it's worth, GNU
make has supported using Guile as an extension language since GNU make
4.0 (2013). Making simple enhancements and performance improvements to
make's language is fine but if people REALLY need a full language I
think an extension for an existing language is a better bet.
- Tail call elimination, Pete Dietl, 2020/05/11
- Re: Tail call elimination, Daniel Herring, 2020/05/11
- Re: Tail call elimination,
Paul Smith <=
- Re: Tail call elimination, Pete Dietl, 2020/05/11
- Re: Tail call elimination, Pete Dietl, 2020/05/11
- Re: Tail call elimination, Jouke Witteveen, 2020/05/13
- Re: Tail call elimination, Pete Dietl, 2020/05/18
- Re: Tail call elimination, Tim Murphy, 2020/05/18
- Re: Tail call elimination, Pete Dietl, 2020/05/18
- Re: Tail call elimination, Paul Smith, 2020/05/18
- Re: Tail call elimination, Pete Dietl, 2020/05/18
- Re: Tail call elimination, Jouke Witteveen, 2020/05/18
- Re: Tail call elimination, Pete Dietl, 2020/05/18