Path: news.net.uni-c.dk!arclight.uoregon.edu!newsfeed.srv.cs.cmu.edu!cantaloupe.srv.cs.cmu.edu!lamppc11.epfl.ch From: Martin Odersky Newsgroups: comp.object,comp.object.logic,comp.databases.object,comp.lang.beta,comp.lang.functional,comp.lang.scheme,comp.lang.clos,comp.lang.oberon,comp.lang.smalltalk,comp.lang.eiffel Subject: CFP: FOOL 9 -- Foundations of Object-Oriented Languages Date: 20 Jul 2001 14:04:07 GMT Organization: Carnegie Mellon Univ. -- Computer Science Dept. Lines: 84 Distribution: world Message-ID: <9j9don$obc$1@cantaloupe.srv.cs.cmu.edu> Reply-To: Martin Odersky NNTP-Posting-Host: nuked.fox.cs.cmu.edu X-Trace: cantaloupe.srv.cs.cmu.edu 995637847 24940 128.2.181.171 (20 Jul 2001 14:04:07 GMT) X-Complaints-To: postmaster@cs.cmu.edu NNTP-Posting-Date: 20 Jul 2001 14:04:07 GMT Originator: leaf@nuked.fox.cs.cmu.edu Xref: news.net.uni-c.dk comp.object:148056 comp.object.logic:12824 comp.databases.object:36600 comp.lang.beta:12945 comp.lang.functional:39810 comp.lang.scheme:48238 comp.lang.clos:15724 comp.lang.oberon:24723 comp.lang.smalltalk:132134 comp.lang.eiffel:61183 Call for Papers The Ninth International Workshop on Foundations of Object-Oriented Languages FOOL 9 Sponsored by ACM SIGPLAN January 19, 2002 Portland, Oregon, USA Following POPL '02 http://www.cs.williams.edu/~kim/FOOL/fool9.html Deadlines Submissions: October 12, 2001 Notifications: November 12, 2001 Final versions: December 10, 2001 The search for sound principles for object-oriented languages has given rise to much work on the theory of programming languages during the past 15 years, leading to a better understanding of the key concepts of object-oriented languages and to important developments in type theory, semantics, and program verification. The FOOL workshops bring together researchers to share new ideas and results in these areas. The next workshop, FOOL 9, will be held in Portland, Oregon, on Saturday January 19, 2002, the day after POPL '02. Submissions for this event are invited in the general area of foundations of object-oriented languages; topics of interest include language semantics, type systems, program analysis and verification, programming calculi, concurrent and distributed languages, and database languages. The main focus in selecting workshop contributions will be the intrinsic interest and timeliness of the work, so authors are encouraged to submit polished descriptions of work in progress as well as papers describing completed projects. A web page will be created and made available as informal electronic conference proceedings. Submission procedure We solicit submissions on original research not previously published or currently submitted for publication elsewhere, in the form of extended abstracts. These extended abstracts should not exceed 5000 words (approximately 10 pages); shorter extended abstracts (e.g., 2000 words) are often sufficient. Submissions should be e-mailed to fool9@lampsun1.epfl.ch by Friday, October 12, 2001, using Postscript or PDF. Each submission may be included inline in a message or as a MIME attachment only. We may not be able to consider late submissions, or submissions that do not have a working and attended return e-mail address. (If electronic submission is impossible, please contact the program chair in September.) Receipt of the submissions will be acknowledged by e-mail. Authors should inquire in case a prompt acknowledgment is not received. Correspondence and questions should be sent to fool9@lampsun1.epfl.ch Steering Committee Martin Abadi, Bell Labs Kim Bruce, Williams College Luca Cardelli, Microsoft Research Kathleen Fisher, AT&T Labs Benjamin Pierce, University of Pennsylvania (chair) Didier Remy, INRIA Rocquencourt Program Chair Martin Odersky, Swiss Federal Institute of Technology Lausanne, fool9@lampsun1.epfl.ch Program Committee Viviana Bono, Universita di Torino Craig Chambers, University of Washington Erik Ernst, University of Aalborg Giorgio Ghelli, University of Pisa Atsushi Igarashi, University of Tokyo Shriram Krishnamurthi, Brown University Clemens Szyperski, Microsoft Research Jan Vitek, Purdue University