[TYPES] CPS and accumulators

[Giuseppe Maggiore]

Hello! First of all I'd like to introduce myself: I'm Giuseppe Maggiore, MSc
student doing his thesis who has very recently found out about the wonders
of functional languages. Having always been extremely fond of computer
graphics, when I found out that there is another field at least as worthy of
my affections tore me a bit. Luckily all is well now, since I have realized
that functional languages are actually one of the best imaginable tools for
writing the extremely high parallel code that modern graphics cards (GPUs)
execute. I have realized after a bunch of long sessions with my advisor
(prof. Michele Bugliesi) that all we need is a way to generate tail
recursive code to find all those hidden dependencies between computations so
that we can map those to the same parallel processors (or if there are too
many dependencies we just don't execute the computation in parallel at all).
A CPS transform is apparently all we need, but I was wondering if there is a
more straightforward way to generate tail recursion with accumulating
parameters. Am I rambling about this last part? Can I get some more feedback
from you experts (my advisor is really great, but there isn't that many
people in our university you can discuss these topics with :D)?

thanks!
-- 
Giuseppe Maggiore
Microsoft Student Partner - Ca' Foscari University of Venice, Italy
B.Sc. in Computer Science
Tel. +393319040031