From mboxrd@z Thu Jan 1 00:00:00 1970 X-Msuck: nntp://news.gmane.io/gmane.science.mathematics.categories/1857 Path: news.gmane.org!not-for-mail From: Martin Hofmann Newsgroups: gmane.science.mathematics.categories Subject: 2nd CFP: WS on Implicit Computational Complexity Date: Tue, 13 Feb 2001 11:17:34 GMT Message-ID: <200102131117.LAA25831@brittle.dcs.ed.ac.uk> NNTP-Posting-Host: main.gmane.org X-Trace: ger.gmane.org 1241018155 839 80.91.229.2 (29 Apr 2009 15:15:55 GMT) X-Complaints-To: usenet@ger.gmane.org NNTP-Posting-Date: Wed, 29 Apr 2009 15:15:55 +0000 (UTC) To: categories@mta.ca Original-X-From: rrosebru@mta.ca Thu Feb 15 16:08:38 2001 -0400 Return-Path: Original-Received: (from Majordom@localhost) by mailserv.mta.ca (8.11.1/8.11.1) id f1FJSg202726 for categories-list; Thu, 15 Feb 2001 15:28:42 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Original-Sender: cat-dist@mta.ca Precedence: bulk X-Keywords: X-UID: 39 Original-Lines: 91 Xref: news.gmane.org gmane.science.mathematics.categories:1857 Archived-At: Third international workshop on Implicit Computational Complexity-2001 (ICC'01) ------------------------------------------------------------------------------- (affiliated with PADO and MFPS) The Implicit Complexity Workshop (ICC'01) will be held on Sunday, 20 May 2001 in Aarhus as part of the joint PADO/MFPS 2000 conferences. Topics of Interest: ------------------- The synergy between Logic, Computational Complexity and Programming Language Theory has gained importance and vigour in recent years, cutting across areas such as Proof Theory, Computation Theory, Applicative Programming, and Philosophical Logic. Several machine-independent approaches to computational complexity have been developed, which characterize complexity classes by conceptual measures borrowed primarily from mathematical logic. Collectively these approaches might be dubbed IMPLICIT COMPUTATIONAL COMPLEXITY. Practically, implicit computational complexity provides a framework for a streamlined incorporation of computational complexity into areas such as formal methods in software development, programming language theory. In addition to research reports on theoretical advances in implicit computational complexity, practical contributions bridging the gap between Computational Complexity and Programming Language Theory are therefore of particular interest. Previous Workshops ------------------ have been held in Indianapolis 1994, Baltimore 1998, Trento 1999, Santa Barbara 2000. Programme committee ------------------- Samson Abramsky (University of Oxford, UK) Martin Hofmann (University of Edinburgh, UK) (Chair) Bruce Kapron (University of Victoria, Canada) Harry Mairson (Brandeis University) Jean-Yves Marion (Loria, Nancy, France) So/ren Riis (Queen Mary and Westfield College, London) Helmut Schwichtenberg (University of Munich, Germany) Steering committee ------------------ Daniel Leivant (University of Indiana at Bloomington) Jean-Yves Marion (Loria, Nancy, France) Submission procedure -------------------- E-mail your contribution as a PostScript file to the programme chair (mxh@dcs.ed.ac.uk) to bereceived by 16 March 2001. Alternatively, you can send 5 hardcopies by air mail to the program chair. Authors with restricted copying facilities may also send a single hardcopy. Important dates --------------- 16 March 2001 Submission deadline (late submissions may be accepted after consultation with the PC chair) 10 April 2001 Notification of authors of accepted papers 20 May 2001 Workshop Workshop WWW-page ----------------- http://www.dcs.ed.ac.uk/home/mxh/ICC01.html Contact information ------------------- Martin Hofmann Division of Informatics University of Edinburgh JCMB, KB Mayfield Road Edinburgh EH9 3JZ UK tel : (44) 131 650 5187 fax : (44) 131 667 7209 mxh@dcs.ed.ac.uk