Hi All,
I'll second the nomination for hearing about the tetris experiment.
On the subject of presentations, I am in the early stages of writing a translator from Scheme to a statically typed functional stack-based language. I would enjoy giving a short presentation on my project, to talk briefly about the core issues being tackled:
- How do types in a stack-based language differ from types in a standard functional language like ML or Haskell? - How do you implement and compute the type of call/cc in a stack-based language? - How do you share environment bindings in a type safe manner ? - How do you infer the type of recursive combinators such as Y and M?
I'd appreciate hearing if anyone has interest in such a presentation (or suggestions about how to make it more relevant to the audience), I don't want to make anyone suffer unneccessarily, even if only for 15 minutes. :-)
Christopher Diggins
On 8/8/07, David St-Hilaire sthilaid@iro.umontreal.ca wrote:
Paul Khuong wrote:
Sounds like a good idea. I think many of us have hacked, over the summer, on small things (maybe in CL, Erlang, etc ;) for which a full-blown presentation might be overkill.
Paul Khuong
Yes indeed. Some friends and me worked on a small tetris game made in scheme. It could maybe interesting to present a bit what we did and maybe get some good suggestions from the community on how to ameliorate our game! ^_^Y
David St-Hilaire _______________________________________________ MSLUG mailing list MSLUG@iro.umontreal.ca https://webmail.iro.umontreal.ca/mailman/listinfo/mslug