4 Nov 2006 23:20:17 -0500

Related articles |
---|

[3 earlier articles] |

Re: Tail recursion toon@moene.indiv.nluug.nl (Toon Moene) (2000-08-14) |

Re: Tail recursion fjh@cs.mu.OZ.AU (2000-08-21) |

Re: Tail recursion Wilco.Dijkstra@arm.com (Wilco Dijkstra) (2000-08-21) |

Re: Tail recursion mrs@kithrup.com (2000-08-21) |

Re: Tail recursion ian0kerr@my-deja.com (2000-09-08) |

Tail recursion Alexey.Mikhailov@gmail.com (jjb) (2006-11-04) |

Re: Tail recursion kym@ukato.freeshell.org (russell kym horsell) (2006-11-04) |

Re: Tail recursion diablovision@yahoo.com (2006-11-05) |

Re: Tail recursion owong@castortech.com (Oliver Wong) (2006-11-08) |

Re: Tail recursion jboehm@gmx.net (=?ISO-8859-1?Q?J=FCrgen_B=F6hm?=) (2007-02-04) |

From: | russell kym horsell <kym@ukato.freeshell.org> |

Newsgroups: | comp.compilers |

Date: | 4 Nov 2006 23:20:17 -0500 |

Organization: | Central Iowa (Model) Railroad, Plano, TX, USA |

References: | 06-11-018 |

Keywords: | optimize, theory |

Posted-Date: | 04 Nov 2006 23:20:17 EST |

jjb <Alexey.Mikhailov@gmail.com> wrote:

*> Hello!*

*> Recently I read about "tail recursion" (in SICP) - ability of*

*> programming language realization to convert linear recursive proccess*

*> to linear iterative proccess. So I tried to find formal algorithm of*

*> this transformation for any function written using functional paradigm*

*> but I failed. May be someone can help me?*

[...]

Formal theory is covered in many textbooks on functional programming.

Treatments of "FP" and "ML" used to cover this.

Algebra is pretty simple in functional languages.

There's also something called "concatenated languages" where the

algebra is even easier.

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.