Implicit Computational Complexity
in Programming Language Design and Methodology
A Workshop affiliated with the
1998 International Conference on Functional Programming (ICFP)
The workshop co-organizers are Robert Constable (Cornell)
and Daniel Leivant (Indiana).
The meeting is made possible by a grant from the National Science Foundation, which the organizers gratefully acknowledge.
Advances in implicit computational complexity, i.e., machine independent characterizations of computational complexity classes, have been confined to date mostly to theoretical foundations. The areas involved, including restricted function algebras, lambda calculi, weak formal theories, and finite model theory, have seen an explosion of research activity, publications, and scientific meetings.
The time seems ripe for a community effort to implement these ideas in programming language design and implementation.
The workshop will cover issues such as type theories that support computational complexity, user friendly programming languages built on top of those, and compiler construction for such languages.
Conference and Workshop Registration
The deadline for workshop registration is Monday, September 14.
Sign up forms are available at ACM's web site:
Conference fees are posted at the ICFP web site. The registration fee covers breakfast, lunch and breaks. Fees for early, late and on-site registration are available at the ACM sites by using the pull-down options.
You may register for a workshop without registering for the conference.
Joan Lockwood, Department of Computer Science, Cornell University, Ithaca, NY. Mail to: email@example.com