|
Re: Tail recursion -> while (?): msg#00248lang.scala
Iulian Dragos <iulian.dragos@xxxxxxx> writes: > No, I am afraid I was unclear. Scalac doesn't eliminate general tail > calls, it only treats the simple case: recursive tail calls. I thought > the paper was interesting in itself, although scalac does not > implement the techniques described. > Hello, thanks for the precision. Is there any reasons why scalac does not optimize general tail calls, if, as it is shown in the paper, this is possible in Java ? It seems to me that allowing unbounded recursion on tail calls is a central feature of FP. AFAIK, it is required (by r5rs) for scheme implementations. BTW, thanks for the great work done on scala ! regards, -- OQube < software engineering \ génie logiciel > Arnaud Bailly, Dr. \web> http://www.oqube.com |
|
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| Previous by Date: | Scala generics for automatic differentiation: 00248, Michel Salim |
|---|---|
| Next by Date: | Re: pattern matching works strange for an O'Caml programmer: 00248, Iulian Dragos |
| Previous by Thread: | Re: Tail recursion -> while (?)i: 00248, Iulian Dragos |
| Next by Thread: | Re: Tail recursion -> while (?): 00248, Tony Morris |
| Indexes: | [Date] [Thread] [Top] [All Lists] |
| News | FAQ | advertise |