Subject: call for demos, and tentative NEPLS meet schedule
From: Shriram Krishnamurthi (sk@cs.brown.edu)
Date: Thu Nov 09 2000 - 14:35:07 EST
If you would like to set up a software/tool demo at the NEPLS meet,
let me know. (Ideally, you would bring your own equipment; all you'd
need from us is table space and power.)
----------
Following is the tentative schedule for the event. Unlike NJPLS
events, the first NEPLS meeting will have more talks of shorter
duration (15-45 minutes). Over time, NEPLS will presumably evolve to
the format its attendees like best.
Frank Tip, IBM Watson:
Scalable Propagation-Based Call Graph Construction Algorithms
Paul Levy, Queen Mary, London:
Call-By-Push-Value: A Subsuming Paradigm
Chris League, Yale:
Type-Preserving Compilation of Java
Greg Sullivan, MIT:
Dynamic Partial Evaluation
Abhik Roychoudhury, SUNY Stony Brook:
unfold/fold transformations of logic programs
Sibylle Schupp, RPI:
current work by generic programming group at RPI
Torben Amtoft, Boston University:
What are Polymorphically-Typed Ambients?
Norman Ramsey, Harvard:
report on the state of C--
Full titles and abstracts will eventually be available from the NEPLS
home page.
Shriram
This archive was generated by hypermail 2b28 : Thu Nov 09 2000 - 14:39:53 EST