From mboxrd@z Thu Jan 1 00:00:00 1970 X-Msuck: nntp://news.gmane.io/gmane.science.mathematics.categories/3443 Path: news.gmane.org!not-for-mail From: Hasegawa Masahito Newsgroups: gmane.science.mathematics.categories Subject: TLCA '07 - Preliminary Call for Papers Date: Wed, 04 Oct 2006 10:25:22 +0900 Message-ID: NNTP-Posting-Host: main.gmane.org X-Trace: ger.gmane.org 1241019307 8774 80.91.229.2 (29 Apr 2009 15:35:07 GMT) X-Complaints-To: usenet@ger.gmane.org NNTP-Posting-Date: Wed, 29 Apr 2009 15:35:07 +0000 (UTC) To: categories@mta.ca Original-X-From: rrosebru@mta.ca Wed Oct 4 15:40:35 2006 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 04 Oct 2006 15:40:35 -0300 Original-Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1GVBYA-0007Ay-KG for categories-list@mta.ca; Wed, 04 Oct 2006 15:32:58 -0300 Original-Sender: cat-dist@mta.ca Precedence: bulk X-Keywords: X-UID: 4 Original-Lines: 85 Xref: news.gmane.org gmane.science.mathematics.categories:3443 Archived-At: Preliminary Call for Papers Eight International Conference on Typed Lambda Calculi and Applications (TLCA '07) Paris, June 26-28, 2007 Part of RDP 07 (http://www.lsv.ens-cachan.fr/rdp07/) The TLCA series of conferences serves as a forum for presenting original research results that are broadly relevant to the theory and applications of typed calculi. The following list of topics is non-exhaustive: * Proof-theory: Natural deduction and sequent calculi, cut elimination and normalisation, linear logic and proof nets, type-theoretic aspects of computational complexity * Semantics: Denotational semantics, game semantics, realisability, categorical models * Implementation: Abstract machines, parallel execution, optimal reduction, type systems for program optimisation * Types: Subtypes, dependent types, type inference, polymorphism, types in theorem proving * Programming: Foundational aspects of functional and object-oriented programming, proof search and logic programming, connections between and combinations of functional and logic programming, type checking The programme of TLCA will consist of three invited talks and about 25 papers selected from original contributions. Accepted papers will be published as a volume of Springer Lecture Notes in Computer Science series (http://www.springer.de/comp/lncs/index.html). Submissions: The submitted papers should describe original work and should allow the Programme Committee to assess the merits of the contribution: in particular references and comparisons with related work should be included. Submission of material already published or submitted to other conferences with published proceedings is not allowed. Papers should not exceed 15 pages in Springer LNCS format (http://www.springer.de/comp/lncs/authors.html). Instructions for submissions will appear soon. Program Committee * Chantal Berline (CNRS, France) * Peter Dybjer (Chalmers, Sweden) * Healfdene Goguen (Google, USA) * Robert Harper (Carnegie Mellon University, USA) * Olivier Laurent (CNRS, France) * Simone Martini (University of Bologna, Italy) * Simona Ronchi Della Rocca (University of Torino, Italy), chair * Peter Selinger (University of Dalhousie, Canada) * Paula Severi (University of Leicester, UK) * Kazushige Terui (University of Sokendai, Japan) * Pawel Urzyczyn (University of Warsaw, Poland) Important Dates December 22 Title and abstract due January 2 Deadline for submission March 10-15 Author review period March 25 Notification of acceptance-rejection April 20 Deadline for the final version Steering Committe Samson Abramsky, Oxford, chair Henk Barendregt, Nijmegen Mariangiola Dezani-Ciancaglini, Turin Roger Hindley, Swansea Martin Hofmann, Munich Pawel Urzyczyn, Warsaw Publicity Chair Masahito Hasegawa