[Prev][Next][Index][Thread]
LICS '90: Call for Papers
Date: Fri, 4 Aug 89 22:15:45 EDT
CALL FOR PAPERS
Fifth Annual IEEE Symposium on
LOGIC IN COMPUTER SCIENCE
June 4--7, 1990, Philadelphia, PA
The LICS Symposium aims for wide coverage of theoretical and practical
issues in computer science that relate to logic in a broad sense, including
algebraic, categorical and topological approaches.
Suggested, but not exclusive, topics of interest include: abstract data
types, automated deduction, concurrency, constructive mathematics, data base
theory, finite model theory, knowledge representation, lambda and combinatory
calculi, logical aspects of computational complexity, logics in artificial
intelligence, logic programming, modal and temporal logics, program logic and
semantics, rewrite rules, software specification, type systems, verification.
PAPER SUBMISSION: Fifteen (15) copies of a detailed abstract ---not a full
paper --- should be received by DECEMBER 1, 1989 by:
Prof. John C. Mitchell, LICS Program Chair
Department of Computer Science
Stanford University
Stanford, CA 94305, USA
Internet: jcm@cs.stanford.edu
Authors from locations where access to reproduction facilities is severely
limited may submit a single copy of their abstract. All authors will be
notified of acceptance or rejection by JANUARY 22, 1990. Accepted papers
typed on special forms for inclusion in the symposium proceedings will be
due MARCH 1, 1990.
Abstracts must be clearly written and provide sufficient detail to allow
the program committee to assess the merits of the paper. References and
comparisons with related work should be included. The entire extended
abstract should not exceed ten (10) standard font double-spaced pages
(2500 words). The title page of the submission should include a brief
synopsis and author's name, address, phone number, and e-mail address if
available. Papers must be unpublished and not submitted for publication
elsewhere, including proceedings of other symposia or workshops.
The December 1 deadline for receipt applies to overseas submissions as well.
Late abstracts, or those departing significantly from these guidelines,
run a high risk of rejection.
PROGRAM COMMITTEE: GENERAL CHAIR:
K. Apt, CWI and Texas Prof. Albert R. Meyer
J. Barwise, Stanford MIT Lab. for Computer Science, NE43-315
E. Clarke, CMU 545 Technology Square
S. Cook, Toronto Cambridge, MA 02139, USA
S. Hayashi, Ryukoku Internet: meyer@theory.lcs.mit.edu
P. Kanellakis, Brown
J.-P. Jouannaud, Paris-Sud CONFERENCE CHAIR:
D. Leivant, CMU Prof. Jean Gallier
J. Mitchell (chair), Stanford Dept. Computer and Info. Sciences
U. Montanari, Pisa Philadelphia, PA 19104, USA
A. Pitts, Cambridge Internet: jean@cis.upenn.edu
E. Sandewall, Linkoping
A. Scedrov, Univ. of Pennsylvania
M. Stickel, SRI International
G. Winskel, Aarhus
The symposium is sponsored by the IEEE Technical Committee on Mathematical
Foundations of Computing in cooperation with the Association for Symbolic
Logic and the European Association of Theoretical Computer Science, and with
the anticipated cooperation of ACM SIGACT.
ORGANIZING COMMITTEE:
M. Abadi, J. Barwise, A. Chandra, E. Dijkstra, E. Engeler, J. Gallier,
J. Goguen, D. Gries, Y. Gurevich, D. Kozen, Z. Manna, A. Meyer (chair),
J. Mitchell, C. Papadimitriou, R. Parikh, G. Plotkin, D. Scott.
PUBLICITY CHAIR:
Prof. Daniel Leivant, School of Computer Science, Carnegie Mellon University,
Pittsburgh, PA 15213, USA.
Requests to receive the LaTEX source of this announcement or to join the
LICS mailing list should be addressed to
Internet: lics@cs.cmu.edu
Please bear with us for multiple mailings.