From schmidt@heze.cis.ksu.edu Wed Sep 17 15:59:47 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h8HJxlEY031193 for ; Wed, 17 Sep 2003 15:59:47 -0400 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h8HJxkYu006984 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 17 Sep 2003 15:59:47 -0400 (EDT) Received: from gemini.cis.ksu.edu (gemini.cis.ksu.edu [129.130.10.176]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h8HJxjLR021575 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 17 Sep 2003 15:59:46 -0400 (EDT) Received: from me (heze.cis.ksu.edu [129.130.10.170]) by gemini.cis.ksu.edu (8.12.9+/8.12.9) with SMTP id h8HJxjq7024264 for ; Wed, 17 Sep 2003 14:59:45 -0500 (CDT) From: Dave Schmidt Received: (nullmailer pid 25198 invoked by uid 15061); Wed, 17 Sep 2003 19:59:44 -0000 To: types@cis.upenn.edu Date: Wed, 17 Sep 2003 14:59:44 -0500 (CDT) X-Mailer: ELM [version 2.5 PL6] MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-Id: <1063828784.884125.25197.nullmailer@me> X-Mailman-Approved-At: Fri, 19 Sep 2003 13:38:53 -0400 Cc: Subject: [Types-list] ESOP 2004, Barcelona: Call for Papers X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 17 Sep 2003 19:59:48 -0000 X-IMAPbase: 1069863610 66 Status: O X-Status: X-Keywords: X-UID: 1 ********************************************************** *** CALL FOR PAPERS *** *** ESOP 2004: The European Symposium on Programming *** *** *** *** Affiliated with ETAPS 2004 *** *** March 27 - April 4, 2004 *** *** Barcelona, SPAIN *** *** *** *** Submission deadline: OCTOBER 17, 2003 *** *** http://www.cis.ksu.edu/santos/esop2004 *** ********************************************************** ----------------------------------------------------------------- IMPORTANT DATES ----------------------------------------------------------------- October 17, 2003 Submission deadline December 12, 2003 Notification of acceptance/rejection January 9, 2004 Camera-ready version due March 29 - April 2, 2004 ESOP and ETAPS main conferences March 27 - April 4, 2004 ETAPS satellite events ----------------------------------------------------------------- From sangio@cs.unibo.it Thu Sep 18 04:42:36 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h8I8gaEY032542 for ; Thu, 18 Sep 2003 04:42:36 -0400 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h8I8gYYu012618 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 18 Sep 2003 04:42:34 -0400 (EDT) Received: from pob.cs.unibo.it (pob.cs.unibo.it [130.136.10.114]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h8I8gXLQ005240 for ; Thu, 18 Sep 2003 04:42:33 -0400 (EDT) Received: from le1.cs.unibo.it (backle.cs.unibo.it [130.136.10.110]) by pob.cs.unibo.it (Postfix) with ESMTP id 03DCF2A1AC; Thu, 18 Sep 2003 10:42:25 +0200 (CEST) Received: from papagena.cs.unibo.it (postfix@papagena.cs.unibo.it [130.136.5.38]) by le1.cs.unibo.it (8.9.3/8.9.3/Debian 8.9.3-21) with ESMTP id KAA11468; Thu, 18 Sep 2003 10:42:16 +0200 Received: by papagena.cs.unibo.it (Postfix, from userid 4626) id 360BB26FB7; Thu, 18 Sep 2003 10:41:32 +0200 (CEST) MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <16233.28603.919224.977940@papagena.cs.unibo.it> Date: Thu, 18 Sep 2003 10:41:31 +0200 From: Davide Sangiorgi To: types@cis.upenn.edu, concurrency@cwi.nl, amast@cs.utwente.nl, categories@mta.ca, cpworld@gmu.edu, csl@dbai.tuwien.ac.at, eatcs-it@cs.unibo.it, formal-methods@cs.uidaho.edu, lics@research.bell-labs.com, prog-lang@diku.dk, theory-logic@cs.cmu.edu, THEORYNT@LISTSERV.NODAK.EDU X-Mailer: VM 7.03 under 21.4 (patch 6) "Common Lisp" XEmacs Lucid X-Mailman-Approved-At: Fri, 19 Sep 2003 13:38:53 -0400 Cc: Ernst.Ruediger.Olderog@Informatik.Uni-Oldenburg.DE, denicola@dsi.unifi.it Subject: [Types-list] Special Issue on Types in Concurrency for ACTA INFORMATICA X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 18 Sep 2003 08:42:36 -0000 Status: O X-Status: X-Keywords: X-UID: 2 Special Issue on Types in Concurrency for ACTA INFORMATICA (http://www.springerlink.com/link.asp?id=100460) Proposed by IFIP Working Group 2.2 on Formal Description of Programming Concepts (http://www.irisa.fr/s4/wg22) Guest Editors: R. De Nicola, Univ. Firenze (http://www.dsi.unifi.it/~denicola/) and D. Sangiorgi, Univ. Bologna http://www.cs.unibo.it/~sangio/ Traditionally types have played a very limited role in concurrency; they were essentially used for specifying the nature of the exchanged values. The picture has changed after the introduction of formalisms for dealing with systems of mobile processes. In addition to the classical use of types in sequential languages, e.g. for static detection of run time error, enhancing program readability, memory management, abstracting from implementation details, ... types have emerged as an important tool for: - Specifying Interfaces and possible interactions - Controlling Process Mobility - Controlling Resource Usage - Controlling Access Rights - Developing new proof techniques - Improving efficiency of verification algorithms - Guaranteeing integrity and confidentiality of data - etc. We are seeking papers on the above subject to collect them in a special issue of ACTA INFORMATICA. Both research and tutorial/surveys papers are welcome. Authors are invited to send a pdf or a ps file with their paper to denicola@dsi.unifi.it AND davide.sangiorgi@cs.unibo.it by 15 January 2004. Authors are also requested to email us a title and a short abstract in plain text as early as possible (ideally before end October). Acta Informatica will guarantee a short publication delay (less than four months) and the immediate electronic availability of the accepted papers. Apart for publication on Acta Informatica, some of the submitted papers will be also considered for presentation at the meeting of the IFIP Working group 2.2 that will take place in Bertinoro (Italy) 12-17 September 2004. One day of this meeting will be specifically dedicated to Types in Concurrency. The authors of the submitted papers will be considered for invitation as observers of the working group From frust@iti.cs.tu-bs.de Wed Sep 17 07:26:14 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h8HBQEEY029981 for ; Wed, 17 Sep 2003 07:26:14 -0400 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.9/8.12.9) with ESMTP id h8HBQC5q008631 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 17 Sep 2003 07:26:13 -0400 (EDT) Received: from George.iti.cs.tu-bs.de (george.iti.cs.tu-bs.de [134.169.39.8]) by central.cis.upenn.edu (8.12.9/8.12.9) with ESMTP id h8HBQB5e002726 for ; Wed, 17 Sep 2003 07:26:12 -0400 (EDT) Received: from trek (trek.iti.cs.tu-bs.de [134.169.39.111]) by George.iti.cs.tu-bs.de (8.12.2/8.12.2) with ESMTP id h8HBQ2kW003354; Wed, 17 Sep 2003 13:26:02 +0200 (MEST) From: "Frank Rust" To: , , , , , , , , , , , , , , , , , , , , , , , , , Date: Wed, 17 Sep 2003 13:26:00 +0200 Organization: Techn. Uni, Inst. f. Theoretische Informatik Message-ID: <004401c37d0e$7c1ceb30$6f27a986@trek> X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook, Build 10.0.4510 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2800.1165 Importance: Normal X-Mailman-Approved-At: Fri, 19 Sep 2003 13:40:39 -0400 Cc: Subject: [Types-list] CMCS '04, FIRST ANNOUNCEMENT, CALL FOR PAPERS X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 17 Sep 2003 11:26:15 -0000 Status: O X-Status: X-Keywords: X-UID: 3 + + + CMCS '04 + + + FIRST ANNOUNCEMENT + + + CALL FOR PAPERS + + + Apologies if you receive multiple copies of this message. +----------------------------------------------------------+ | | | | | 7th International Workshop on | | Coalgebraic Methods in Computer Science | | | | C M C S 2004 | | | | | | Barcelona, March 27-29, 2004 | | http://www.iti.cs.tu-bs.de/~cmcs/ | | | +----------------------------------------------------------+ The workshop is held in conjunction with ETAPS 2004 (7th European Joint Conferences on Theory Theory and Practice of Software, March 27- April 4,2004) http://www.lsi.upc.es/etaps04/ AIMS AND SCOPE During the last few years, it is becoming increasingly clear that a great variety of state-based dynamical systems, like transition systems, automata, process calculi and class-based systems can be captured uniformly as coalgebras. Coalgebra is developing into a field of its own interest presenting a deep mathematical foundation, a growing field of applications and interactions with various other fields such as reactive and interactive system theory, object oriented and concurrent programming, formal system specification, modal logic, dynamical systems, control systems, category theory, algebra, analysis, etc. The aim of the workshop is to bring together researchers with a common interest in the theory of coalgebras and its applications. The topics of the workshop include, but are not limited to: - the theory of coalgebras (including set theoretic and categorical approaches); - coalgebras as computational and semantical models (for programming languages, dynamical systems, etc.); - coalgebras in (functional, object-oriented, concurrent) programming; - coalgebras and data types; - (coinductive) definition and proof principles for coalgebras (with bisimulations or invariants); - coalgebras and algebras; - coalgebraic specification and verification; - coalgebras and (modal) logic; - coalgebra and control theory (notably of discrete event and hybrid systems). The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends. Previous workshops of the same series have been organized in Lisbon, Amsterdam, Berlin, Genova, Grenoble, and Warsaw. The proceedings appeared as "Electronic Notes in Theoretical Computer Science (ENTCS)", Volumes 11, 19, 33, 41, 65.1 and 82.1. Selected papers have been/are being published in Theoretical Computer Science, Theoretical Informatics and Applications, and Mathematical Structures in Computer Science. You can get an idea of the types of papers presented at previous meetings by looking at the tables of content of the above ENTCS volumes from these meetings. They are available via the ENTCS page http://www.elsevier.nl/gej-ng/31/29/23/show/Products/notes/contents.htt PROGRAM COMMITTEE Jiri Adamek, chair (Braunschweig), Corina Cirstea (Oxford), H. Peter Gumm (Marburg), Alexander Kurz (Amsterdam), Ugo Montanari (Pisa), Larry Moss (Bloomington, IN), Ataru T. Nakagawa (Tokyo), Dirk Pattinson (Muenchen) Grigore Rosu (Urbana, ILL), Jan Rutten (Amsterdam), James Worrell (New Orleans). LOCATION CMCS 2004 will be held in Barcelona on March 27-29, 2004. It is a satellite workshop of ETAPS 20034, the European Joint Conferences on Theory and Practice of Software. For venue, registration and suggested accommodation see the ETAPS 2004 Web page: http://www.lsi.upc.es/etaps04/ SUBMISSIONS Submissions will be evaluated by the Program Committee for inclusion in the proceedings, which will be published in the ENTCS series. Papers must contain original contribution, be clearly written, and include appropriate reference to and comparison with related work. Papers (of at most 15 pages) should be submitted electronically as PostScript files at the address J.Adamek@tu-bs.de. A separate message should also be sent, with a text-only one-page abstract and with mailing addresses (both postal and electronic), telephone number and fax number of the corresponding author. IMPORTANT DATES Deadline for submission: January 1, 2004 Notification of acceptance: February 1, 2004 Final version due: February 16, 2004 Workshop dates: March 27-29, 2004 For more information, please contact: Jiri Adamek, Technical University of Braunschweig phone: (0049) 5319521 fax: (0049) 5319529 e-mail: J.Adamek@tu-bs.de + + + CMCS '04 + + + FIRST ANNOUNCEMENT + + + CALL FOR PAPERS + + + From lmagnani@cc.gatech.edu Sun Sep 21 19:29:39 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h8LNTdEY015484 for ; Sun, 21 Sep 2003 19:29:39 -0400 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h8LNS9Yu026257 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Sun, 21 Sep 2003 19:28:09 -0400 (EDT) Received: from smtp.baruch.cuny.edu (smtp.baruch.cuny.edu [150.210.225.245]) by central.cis.upenn.edu (8.12.10/8.12.9) with SMTP id h8LNS9LQ013399 for ; Sun, 21 Sep 2003 19:28:09 -0400 (EDT) Received: (qmail 18251 invoked by uid 85); 21 Sep 2003 23:22:39 -0000 Received: from lmagnani@cc.gatech.edu by smtp.baruch.cuny.edu by uid 82 with qmail-scanner-1.10 (uvscan: v4.2.40/v4294. . Clear:0. Processed in 19.506912 secs); 21 Sep 2003 23:22:39 -0000 Received: from unknown (HELO smtp25.baruch.cuny.edu) (150.210.155.201) by 0 with SMTP; 21 Sep 2003 23:22:14 -0000 Received: (qmail 8400 invoked by uid 0); 22 Sep 2003 00:22:42 -0000 Received: from unknown (HELO cc.gatech.edu) (10.2.106.133) by smtp25.baruch.cuny.edu with SMTP; 22 Sep 2003 00:22:42 -0000 Message-ID: <3F6E5F56.7070705@cc.gatech.edu> Date: Sun, 21 Sep 2003 19:32:54 -0700 From: Lorenzo Magnani User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.0; en-US; rv:1.4) Gecko/20030624 Netscape/7.1 (ax) X-Accept-Language: en-us, en MIME-Version: 1.0 To: acl@cs.columbia.edu, aisb@cogs.sussex.ac.uk, alp-list@intellektik.informatik.th-darmstadt.de, appiar@ncc.up.pt, CADEinc@cs.albany.edu, calligramme@loria.fr, ccl@ps.uni-sb.de, cg@cs.umn.edu, clp@cis.ohio-state.edu, compulog-deduction@cs.bham.ac.uk, compulog@doc.imperial.ac.uk, compulognet-parimp@clip.dia.fi.upm.es, compunode@compulog.org, csp-list@saturne.cert.fr, deduktion@intellektik.informatik.th-darmstadt.de, dl@dl.kr.org, elsnet-list@let.ruu.nl, flprog@informatik.uni-muenchen.de, folli@fwi.uva.nl, gulp@di.unipi.it, kgs@dbai.tuwien.ac.at, kr@kr.org, krr-actions@irst.itc.it, idss@socs.uts.edu.au, igpl@doc.ic.ac.uk, info-elra@calva.net, lics-email@cs.indiana.edu, linear@cs.stanford.edu, lfg@lists.stanford.edu, ln-fr@cnusc.fr, ln@cnusc.fr, logic@cs.cornell.edu, logic@theory.lcs.mit.edu, loom-forum@isi.edu, lpnmr@cs.engr.uky.edu, lprolog@central.cis.upenn.edu, mol@cis.upenn.edu, mlnet@swi.psy.uva.nl, nlcl@cogs.susx.ac.uk, nlp-ia@bosoleil.ci.umoncton.ca, prog-logique@irisa.fr, sgaico@cui.unige.ch, siggen@cs.bgu.ac.il, sigparse-list@cs.cmu.edu, theorem-provers@ai.mit.edu, eapls@mailbase.ac.uk, sicstus-users@sics.se, announce@sigart.acm.org, types@cis.upenn.edu, lp-internet@doc.ic.ac.uk, concurrency@cwi.nl, formal-methods@cs.uidaho.edu, ealps@mailbase.ac.uk, oz-users@dfki.uni-sb.de, eatcs-it@cs.unibo.it, haskell@haskell.org Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 8bit X-Mailman-Approved-At: Mon, 22 Sep 2003 09:32:35 -0400 Cc: Subject: [Types-list] E-Cap2004_Italy Call for papers X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sun, 21 Sep 2003 23:31:31 -0000 Status: O X-Status: X-Keywords: X-UID: 4 CALL FOR PAPERS ********************************************************************** COMPUTING AND PHILOSOPHY E-CAP2004_ITALY Pavia, Italy, Collegio Ghislieri, June 3-5, 2004 ********************************************************************** Up-to date information on the conference will be found at http://www.unipv.it/webphilos_lab/courses/progra2.html ********************************************************************** ALSO NEW !! Conference MODEL-BASED REASONING IN SCIENCE AND ENGINEERING Pavia, December 2004 http://www.unipv.it/webphilos_lab/courses/progra1.html ********************************************************************** GENERAL INFORMATION From Thursday 3 to Saturday 5 June 2004 (three days) the International European Conference ``COMPUTING AND PHILOSOPHY'' will be held at the University of Pavia (near Milan, Italy). GENERAL INFORMATION The Computational Philosophy Laboratory and the Department of Philosophy of the University of Pavia will be hosting the European Computing and Philosophy (CAP) conference from the 3rd to the 5th of June. PROGRAM The conference will deal with all aspects of the "computational turn" that is occurring within the discipline of Philosophy. The Programme Committee are particularly interested in submissions in Cognitive Science, Epistemology and Metaphysics. RELEVANT RESEARCH AREAS We call for papers that cover topics pertaining to computing and philosophy from the following list: * Cognitive Science, Epistemology, and Metaphysics * Abductive reasoning, Scientific discovery, Creative processes * Internal and External Representations in Cognitive Science * Simulation, Embodiment, and Distributed Reasoning in Computational Models of Cognitive * Problem of Consciousness in PhilosophyI * New Models of Logic Software * Computer-based Learning and Teaching Strategies and Resources * Ethics * The Impact of Distance Learning on the Teaching of Philosophy * The Role of Computers as Tools for Philosophical Research SUBMISSIONS OF PAPERS The deadline for submission is 19th December 2003 - though late submissions will be considered. Papers submitted for contributed sessions or poster presentations must not exceed a total word count of 3500 words. Papers must be accompanied by a word count and an abstract of not more than 500 words (to be included in the conference program booklet). Authors may submit only one paper and should submit it in either RTF or PDF format by using the MANAGEMENT SYSTEM (in http://www.unipv.it/cap2004). The MANAGEMENT SYSTEM (Registration, Accommodation, Submissions, Participants and Reviewers) in http://www.unipv.it/cap2004 Conference Email Address: infoCAP04@unipv.it in case of problem with the above address please use lmagnani@unipv.it or lmagnani@cc.gatech.edu or elena@acrossevents.com REGISTRATION AND FURTHER INFORMATION (to register please use the Management System, in http://www.unipv.it/cap2004 Registration Fees: Before 15 April 2004: Standard: ? 150,00 (to participate in all the activities of the Conference Reception Included) Phd Students: ? 90,00 Students: Free After 15 April 2004: Standard: ? 180,00 (to participate in all the activities of the Conference Reception Included) Phd Students: ? 110,00 Students: Free One day only: ? 80,00 No refunds will be granted after May 12th, 2004 Terms & Conditions: an administration fee of ? 75,00 will be charged for cancellations confirmed in writing by 12th May. We regret that no refund can be made after that date, for whatever reason, although substitutions will be acceptable if notified in writing before the event. ACCOMMODATION (to book a reservation please use the Management System, in http://www.unipv.it/webphilos_lab/courses/progra2.html) All accomodation is hotel-based with en-suite facilities. Hotel Moderno **** EURO 100,00 (single b&b) EURO 135,00 (double b&b) Hotel Ariston *** EURO 80,00 (single b&b) EURO 110,00 (double b&b) Hotel Excelsior *** EURO 50,00 (single) EURO 73,00 (double) EURO 62,00 (D/S) breakfast EURO 6,00 A very limited number of less expensive rooms is available in the several Colleges (some of them historical) of the ancient University of Pavia. IMPORTANT DATES Submission deadline...........................19 December 2003 Notification of acceptance................... 19 March 2004 Conference................................... 3-5 June 2004 Final papers............................due.. 15 July 2004 PROGRAM CHAIR Lorenzo MAGNANI Professor of Logic and Epistemology Department of Philosophy and Computational Philosophy Laboratory University of Pavia, Piazza Botta 6, 27100 Pavia, Italy Office: +39-0382-506283, Home: +39-0383-371067 Fax: +39-0382-23215 & Weissman Distinguished Visiting Professor Department of Philosophy, Baruch College, 1 Bernard Baruch Way, New York , NY 10010 Office: +646-312-4367, Fax: +646- 312-4361, Home: 646-432-9309 Email: lmagnani@unipv.it, lmagnani@cc.gatech.edu PROGRAM COMMITTEE (provisional, TO BE UPDATED) - Atocha Aliseda, Instituto de Investigaciones Filosoficas Universidad Nacional Autonoma de Mexico (UNAM), Mexico City, MEXICO e-mail: atocha@minerva.filosoficas.unam.mx - Diderik Batens, Centre for Logic and Philosophy of Science, Universiteit Gent, Ghent, Belgium e-mail: Diderik.Batens@rug.ac.be - Robert Cavalier, Department of Philosophy, Carnegie Mellon, Pittsburgh, PA, USA e-mail: rc2z@andrew.cmu.edu - Simon Colton, Department of Computing, Imperial College London, London, UK e-mail: sgc@doc.ic.ac.uk - Roberto Cordeschi, Department of Philosophy, University of Salerno, Salerno , ITALY e-mail: cordeschi@caspur.it - Chris Dobbyn, Faculty of Maths and Computing,The Open University,Walton Hall, Milton Keynes MK7 6AA e-mail: c.h.dobbyn@open.ac.uk - Roy Dyckhoff, School of Computer Science,University of St Andrews,North Haugh, St Andrews,Fife, KY16 9SS, Scotland e-mail: rd@dcs.st-and.ac.uk - Luciano Floridi, Wolfson College, University of Oxford, Oxford, UK and University of Bari,Bari, ITALY e-mail: luciano.floridi@philosophy.oxford.ac.uk - Theo Kuypers, Dept. of Philosophy, University of Groningen, Groningen, The Netherlands e-mail: T.A.F.Kuipers@philos.rug.nl - Lorenzo Magnani, Department of Philosophy, University of Pavia, Pavia, ITALY and Baruch College, The City University of New York, New York, USA e-mail: lmagnani@unipv.it, lmagnani@cc.gatech.edu - Nancy J. Nersessian, College of Computing, Georgia Institute of Technology, Atlanta, GA, USA e-mail: nancyn@cc.gatech.edu - Claudio Pizzi, Department of Philosophy and Social Sciences, University of Siena, Siena, ITALY e-mail: pizzic@unisi.it,claudiopizzi@everyday.com - Susan Stuart, Humanities Advanced Technology and Information Institute, University of Glasgow, Glasgow, UK e-mail: S.Stuart@philosophy.arts.gla.ac.uk - Guglielmo Tamburrini, Department of Philosophy, University of Pisa, Pisa, ITALY e-mail: gugt@inwind.it - Riccardo Viale, Fondazione Rosselli,Via San Quintino, 18/c, 10121 Torino, Italy e-mail: riccardo.viale@fondazionerosselli.it LOCAL ORGANIZER dr. Elena Gandini Across Events s.r.l. Via A. Moro, 12 27021 Bereguardo (PV) Italy mobile +39 349 55 41 915 e-mail: elena@acrossevents.com www.acrossevents.com LOCAL ORGANIZING COMMITTEE Elena Gandini (elena@acrossevents.com), Alberto Gatti (gatti_alberto@hotmail.com), Riccardo Dossena (riki.dox@libero.it),Lorenzo Magnani (lmagnani@cc.gatech.edu), Matteo Piazza (pimat@yahoo.com), (Department of Philosophy, University of Pavia, Pavia, Italy) IMPORTANT ADDRESSES PROGRAM CHAIR Lorenzo MAGNANI Department of Philosophy and Computational Philosophy Laboratory University of Pavia, Piazza Botta 6, 27100 Pavia, Italy Office: +39-0382-506283, Home: +39-0383-371067 Fax: +39-0382-23215 Email: lmagnani@unipv.it also Department of Philosophy, Baruch College, The City University of New York 1 Bernard Baruch Way, New York , NY 10010 Office: +646-312-4364 Fax: +646- 312-4361 CONFERENCE SITE: Collegio Ghislieri, Piazza Ghislieri, 27100 PAVIA, Italy, phone +39 0382 37861. http://www.ghislieri.it/ The Conference is sponsored by UNIVERSITY OF PAVIA, ITALY UNIVERSITY OF SIENA, ITALY MIUR (Ministero dell'Università e della Ricerca Scientifica e Tecnologica), ITALY HOW TO REACH PAVIA LINATE Airport: www.sea-aeroportimilano.it/linate People arriving by plane at LINATE should take the bus to the CENTRAL STATION of Milan (cf. below from this Station to Pavia). In LINATE it could be convenient to take a Taxi because the airport is close to the center of Milan. Moreover,the bus company SGEA ( www.sgea.it ) offers six runs from LINATE to Pavia at 9.00, 10.00, 12.00 AM and 2.00, 5.00, 8.30 PM. The last stop is Pavia, near the station (see again our updated web page for possible alterations of this time-table) (from Pavia to LINATE six runs at 5.00, 7.30, 10.00 AM, 1.00, 4.00, 6.00 PM) (one hour trip; _13,00 return ticket, _8,00 one way ticket). In Pavia there is only one station. The easiest way to reach the center of the town is to get off at the station and than take the bus n. 3. MALPENSA 2000 and OLD MALPENSA Airports: www.sea-aeroportimilano.it/malpensa (usually people arrive to Malpensa 2000 and not to OLD MALPENSA): People arriving by plane at MALPENSA 2000 (also called MALPENSA 2000 Terminal 1) or at "old" MALPENSA (now called MALPENSA NORTH but also called Malpensa 2000 Terminal 2) should take the bus to the CENTRAL STATION of Milan. There is also a bus AND A shuttle TRAIN (Malpensa Express) from Malpensa 2000 to the NORTH STATION (Piazzale Cadorna) of Milan, in this case from NORTH Station you will have to take the underground MM2 (green line) to the Central Raylway Station: trains to Pavia leave from Central station. Moreover, the bus company SGEA offers various runs from MALPENSA 2000 to Pavia at 9.00, 11:00 AM, 1:30 3:00, 5:00, 7:00, 9:30, PM (from Pavia to MALPENSA 2000 and to OLD MALPENSA various runs at 7.00, 9:00, 11:00 AM, 1:00, 3:15, 5:00, 7:00 PM) (one hour and half trip; _18,00 retourn ticket, _12,00 one way ticket). The last stop is Pavia, near the rail station In Pavia there is only one rail station. The easiest way to reach the center of the town is to get off at the station and than take the bus n. 3. There are trains from MILAN (Central Raylway Station) to PAVIA and vice versa about every an hour www.trenitalia.it (routes: MILAN-GENOVA; MILAN-VENTIMIGLIA; MILAN-LA SPEZIA; MILAN-SAVONA; MILAN-SESTRI LEVANTE; MILAN-IMPERIA; MILAN-ALBENGA; Pavia is the first stop only if the train is not slow, that is, if it is not, in ITALIAN, "L", locale). (see again our updated web page for possible alterations of this time-table) For any further information do not hesitate to contact our local organizer, Elena Gandini at elena@acrossevents.com From femke@cs.vu.nl Wed Oct 22 08:43:18 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9MChIEY011993 for ; Wed, 22 Oct 2003 08:43:18 -0400 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9MChIYu005472 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 22 Oct 2003 08:43:18 -0400 (EDT) Received: from skiff.cs.vu.nl (skiff.cs.vu.nl [192.31.231.56]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9MChH3U008652 for ; Wed, 22 Oct 2003 08:43:17 -0400 (EDT) Received: from localhost (localhost [127.0.0.1]) by skiff.cs.vu.nl with esmtp (Smail #87) id m1ACIKa-000012C; Wed, 22 Oct 2003 14:43 +0200 Date: Wed, 22 Oct 2003 14:43:16 +0200 (CEST) From: Femke van Raamsdonk To: types@cis.upenn.edu Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=X-UNKNOWN Content-Transfer-Encoding: QUOTED-PRINTABLE X-Mailman-Approved-At: Wed, 22 Oct 2003 08:49:47 -0400 Cc: Femke van Raamsdonk Subject: RTA'04: call for papers X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 22 Oct 2003 12:43:19 -0000 Status: O X-Status: X-Keywords: X-UID: 11 RTA'04 may be of interest to the readers of the types mailinglist because the subjects lambda calculus, theorem proving and proof checking are explicitly mentioned. ****************************** * * * RTA'04 CALL FOR PAPERS * * * ****************************** http://www-i2.informatik.rwth-aachen.de/RTA04/ The 15th Int. Conf. on Rewriting Techniques and Applications (RTA'04) will be part of the Federated Conference on Rewriting, Deduction and Programming (RDP'04). IMPORTANT DATES: Jan 15 2004: Deadline electronic submission of title+short abstract Jan 22 2004: Deadline electronic submission of papers Mar 14 2004: Notification of acceptance of papers Apr 4 2004: Deadline for final versions of accepted papers Jun 3-5 2004: Conference. RTA is the major forum for the presentation of research on all aspects of rewriting. Typical areas of interest include (but are not limited to): * APPLICATIONS: case studies; rule-based (functional and logic) programming; symbolic and algebraic computation; theorem proving; system synthesis and verification; proof checking. * FOUNDATIONS: matching and unification; narrowing; completion techniques; strategies; constraint solving; explicit substitutions; tree automata. * FRAMEWORKS: string, term, and graph rewriting; lambda-calculus and higher-order rewriting; proof nets; constrained rewriting/deduction; categorical and infinitary rewriting. * IMPLEMENTATION: compilation techniques; parallel execution; rewriting tools. * SEMANTICS: equational logic; rewriting logic. INVITED TALKS will be given at RTA'04 by: * Neil Jones (Copenhagen) * Aart Middeldorp (Innsbruck) * Robin Milner (Cambridge) BEST PAPER AWARDS: A 1000 Euro award wil be given to the best paper or papers as decided by the PC. The award may also totally or partially go to the best paper with a student as main author, according to the submission letter. RTA'04 PROGRAM COMMITEE: * Zena Ariola (Oregon) * J=FCrgen Giesl (Aachen) * Masahito Hasegawa (Kyoto) * H=E9l=E8ne Kirchner (Nancy) * Pierre Lescanne (Lyon) * Klaus Madlener (Kaiserslautern) * Narciso Mart=ED-Oliet (Madrid) * Paul-Andr=E9 Melli=E8s (Paris) * Oege de Moor (Oxford) * Vincent van Oostrom (Utrecht, Chair) * Frank Pfenning (Carnegie Mellon) * Ashish Tiwari (SRI) * Ralf Treinen (ENS Cachan) * Roel de Vrijer (Amsterdam) RTA'04 SUBMISSIONS: Submissions must be original and not submitted for publication elsewhere. Submission categories include regular research papers and system descriptions. Also problem sets and submissions decribing interesting applications of rewriting techniques will be very welcome. As usual, accepted papers will appear in the Springer-Verlag Lecture Notes in Computer Science series. More information about paper submission will be available at the RDP'04 web page For further questions please contact the program chair: RTA'04 PROGRAM CHAIR: Vincent van Oostrom Universiteit Utrecht Department of Philosophy Heidelberglaan 8 3584 CS Utrecht, Netherlands Vincent.vanOostrom@phil.uu.nl From tarmo@cs.ioc.ee Fri Oct 24 12:45:28 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9OGjSEY022689 for ; Fri, 24 Oct 2003 12:45:28 -0400 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9OGjQYu003074 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 24 Oct 2003 12:45:27 -0400 (EDT) Received: from suhkur.cc.ioc.ee (suhkur.cc.ioc.ee [193.40.251.100]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9OGjP3U016462 for ; Fri, 24 Oct 2003 12:45:26 -0400 (EDT) Received: from localhost (ness.kybi [172.17.1.37]) by suhkur.cc.ioc.ee (Postfix) with ESMTP id A741141FA4; Fri, 24 Oct 2003 19:45:20 +0300 (EET DST) X-Mailer: exmh version 2.5 07/13/2001 (debian 2.5-1) with nmh-1.1-RC1 To: types@cis.upenn.edu Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: quoted-printable Date: Fri, 24 Oct 2003 19:40:16 +0300 From: Tarmo Uustalu Message-Id: <20031024164520.A741141FA4@suhkur.cc.ioc.ee> X-Mailman-Approved-At: Fri, 24 Oct 2003 13:28:36 -0400 Cc: Tarmo Uustalu Subject: 9th Estonian Winter School in Comp. Sci., 1st call for partic. X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 24 Oct 2003 16:45:28 -0000 Status: O X-Status: X-Keywords: X-UID: 12 [Two courses out of the total five at EWSCS'04 are related to types, proo= f = theory, programming language semantics: the course by Artemov on explicit= = provability and that by Jung on Stone duality and program logics.] [Lecturers: Artemov, Freivalds, Jung, Naor, Sudan. Place/time: Palmse, Estonia, 29 Feb-5 March 2004. Deadline for registration and submission of abstracts for student talks/posters: 16 Jan 2004.] Call for Participation 9th Estonian Winter School in Computer Science EWSCS'04 Palmse, Estonia, 29 February-5 March 2004 www.cs.ioc.ee/yik/schools/win2004 Background and objectives EWSCS is a series of regional-scope international winter schools held annually in Estonia. EWSCS are organized by CIDEC, a joint initiative of Institute of Cybernetics (Tallinn), Tallinn Technical University and University of Tartu for the advancement of higher education in computer science and information technology in Estonia. EWSCS'04 is the = ninth event of the series. The main objective of EWSCS is to expose Estonian, Baltic, and Nordic graduate students in computer science (but also interested students from elsewhere) to frontline research topics usually not covered within the regular curricula. The subject of the schools is general computer science, with a bias towards theory, this comprising both algorithms, complexity and models of computation, and semantics, logic and programming theory. The working language of the schools is English. Programme The schools' scientific programme consists of short courses by renowned specialists and a student session. The course list for EWSCS'04 is the following: Prof. Sergei Artemov (City University of New York, USA): [Explicit Provability and Constructive Semantics] Prof. Rusins Freivalds (University of Latvia, Riga, Latvia): Unreasonable Effectiveness of Classical Mathematics = in Computer Science Prof. Achim Jung (University of Birmingham, UK): Stone Duality and Program Logics Prof. Moni Naor (Weizmann Institute, Rehovot, Israel): Cryptography and Privacy-Preserving Operations Prof. Madhu Sudan (MIT / Radcliffe Institute, Cambridge, MA, USA): Algorithmic Introduction to Coding Theory The purpose of the student session is to give students an opportunity to present their work (typically, thesis work) and get feedback. Registrants are invited to propose short talks (20 min) or posters. The selection will be based on abstracts of 150-400 words. The social programme consists of an excursion and a conference dinner. Venue Palmse is a small settlement 80 kms to the east from Tallinn in the county of L=E4=E4ne-Viru. It is renowned for a large manor that used to belong to the von Pahlen family, today hosting the visitors' center of the Lahemaa National Park, a museum, and a hotel. Tallinn, Estonia's capital, is famous for its pictoresque mediaeval Old Town, a UNESCO World Heritage site. There are direct flights to Tallinn from London, Paris, Amsterdam, Frankfurt, Hamburg, Berlin, Prague, Warsaw, Moscow, Kiev, Copenhagen, Oslo, Stockholm, Helsinki, Vilnius, Riga, ferries from Stockholm and Helsinki. From Vilnius, Riga, the Eurolines coach service is the practical travel option. Registration and cost The deadline for registration and submission of abstracts is 16 January 2004. All registrants will be notified of acceptance to school and acceptance of their talks/posters by 30 January 2004. The participation fee 4000 EEK (260 EUR) includes course materials, full boarding at Palmse, transportation from Tallinn to Palmse, excursion and conference dinner. For some students, we can fully or partially waive the fee. Programme committee / organizing committee Tarmo Uustalu (IoC) (chair), Monika Perkmann (IoC) (secretary), Helger Lipmaa (Helsinki U. of Techn.), Peeter Laud (U. of Tartu), Jaan Penjam (IoC), Heli Uibo (U. of Tartu), J=FCri Vain (Tallinn Techn. U.), Varmo Vene (U. of Tartu) Sponsors Tiigri=FClikool Programme, Centers of Excellence in Research Programme of Ministry of Education and Research of Estonia, FP5 IST project eVikings II Further information Details on the submission of abstracts, registration procedure and cost, application for fee waiver are available from the school webpage, www.cs.ioc.ee/yik/schools/win2004. Questions should be sent to cidec@cs.ioc.ee. From jcheney@cs.cornell.edu Fri Oct 24 17:09:01 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9OL91EY023419 for ; Fri, 24 Oct 2003 17:09:01 -0400 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9OL90Yu021486 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 24 Oct 2003 17:09:00 -0400 (EDT) Received: from sundown.cs.cornell.edu (sundown.cs.cornell.edu [128.84.96.20]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9OL8x3U019649 for ; Fri, 24 Oct 2003 17:08:59 -0400 (EDT) Received: from dhcp98-4.cs.cornell.edu (dhcp98-4.cs.cornell.edu [128.84.98.4]) by sundown.cs.cornell.edu (8.11.7-20031020/8.11.7/R-3.10) with ESMTP id h9OL8w529059 for ; Fri, 24 Oct 2003 17:08:59 -0400 (EDT) From: James Cheney To: types@cis.upenn.edu Content-Type: text/plain Content-Transfer-Encoding: 7bit X-Mailer: Ximian Evolution 1.0.8 (1.0.8-11) Message-Id: <1067029735.1538.85.camel@dhcp98-4.cs.cornell.edu> Mime-Version: 1.0 X-Mailman-Approved-At: Sat, 25 Oct 2003 10:08:35 -0400 Cc: Subject: AlphaProlog 0.3 releae announcement X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Date: Fri, 24 Oct 2003 21:09:01 -0000 X-Original-Date: 24 Oct 2003 17:08:54 -0400 X-List-Received-Date: Fri, 24 Oct 2003 21:09:01 -0000 Status: O X-Status: X-Keywords: X-UID: 13 I am pleased to announce the initial public release of AlphaProlog, version 0.3. What is AlphaProlog? -------------------- AlphaProlog is a logic programming language with built-in names, fresh name generation, name binding, and unification up to alpha-equivalence (that is, consistent renaming of bound names). Though still in development, its ultimate aim is to provide a better way of both writing and reasoning about programs that rely heavily on names and binding, such as compilers, interpreters, and theorem provers. AlphaProlog supports a declarative, stateless approach to programming with names, based on FM, a permutation-based theory of abstract syntax and binding developed by Gabbay and Pitts and used in the FreshML programming language, and, more directly, on Pitts's nominal logic and Urban, Pitts, and Gabbay's nominal unification algorithm. Languages like Twelf, Qu-Prolog, and Lambda-Prolog also support encoding names and binding using built-in meta-level variables and bindings. These languages are semantically much richer and more complex than AlphaProlog, which is essentially first-order. While these languages are more mature and provide some features which AlphaProlog lacks, there are some kinds of programs which are difficult to express using higher-order encodings but easy to express in AlphaProlog. Examples include computations involving open terms, fresh name generation, or varying numbers of bound variables. This makes AlphaProlog a very useful tool for prototyping languages, type systems, operational semantics, and logics that sometimes play the square peg to higher-order encoding techniques' round hole. Some examples that are included with the AlphaProlog distribution include: * The operational semantics of the pi-calculus in its original form * Regular expression-to-automata translation * An object calculus and its translation from the lambda-calculus * A closure-conversion translation * First-order unification and MiniML type inference * A natural deduction calculus for Dynamic Logic with proof terms Features -------- AlphaProlog has the following features shared by other logic and functional programming languages: * Built-in basic types like integers, lists, strings, and terms * First order Horn clause and definite clause grammar programming * Static typechecking and polymorphic types and data structures In addition, AlphaProlog has several new features for programming with names and binding: * Names are concrete data inhabiting name types. * Names can be bound within terms using an abstraction construction inhabiting abstraction types (distinct from function types). * Names can be swapped with each other, and though there is no built-in notion of substitution of terms for names, capture-avoiding substitution operations are definable. * Term equality and unification are modulo alpha-equivalence. * Fresh names are generated automatically as needed during execution, instead of explicitly (and imperatively) by the programmer. * Freshness is an explicit built-in predicate relating names and terms. Where can I get AlphaProlog? ---------------------------- A source distribution as well as more information about AlphaProlog, including examples and (draft) documentation, is available at http://www.cs.cornell.edu/People/jcheney/aprolog/ Questions, comments, and bug reports should be direted to the author at jcheney@cs.cornell.edu Related Information ------------------- More information about FM, nominal logic/unification, and FreshML can be found at: http://www.freshml.org/ http://www.cl.cam.ac.uk/~cu200/Unification --James From doronp@dcs.warwick.ac.uk Sat Oct 25 17:58:33 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9PLwXEY028747 for ; Sat, 25 Oct 2003 17:58:33 -0400 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9PLwWYu014937 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Sat, 25 Oct 2003 17:58:33 -0400 (EDT) Received: from mail.dcs.warwick.ac.uk (mail.dcs.warwick.ac.uk [137.205.224.1]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9PLwV3U015876 for ; Sat, 25 Oct 2003 17:58:32 -0400 (EDT) Received: from gem.dcs.warwick.ac.uk (gem [137.205.224.9]) by mail.dcs.warwick.ac.uk (8.11.1/8.10.2) with ESMTP id h9PLwVw06822 for ; Sat, 25 Oct 2003 22:58:31 +0100 (BST) Received: (from doronp@localhost) by gem.dcs.warwick.ac.uk (8.11.1/8.10.2) id h9PLwPU13389 for types@cis.upenn.edu; Sat, 25 Oct 2003 22:58:26 +0100 (BST) Date: Sat, 25 Oct 2003 22:58:25 +0100 From: Doron Peled TMP ACCT To: types@cis.upenn.edu Message-ID: <20031025225825.A13387@gem.dcs.warwick.ac.uk> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline User-Agent: Mutt/1.2.5i X-Mailman-Approved-At: Sat, 25 Oct 2003 19:06:17 -0400 Cc: Subject: Subject: CFP: Computer Aided Verification (CAV) 2004, Boston, MA X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sat, 25 Oct 2003 21:58:34 -0000 Status: O X-Status: X-Keywords: X-UID: 14 CALL FOR PAPERS COMPUTER AIDED VERIFICATION (CAV) 16th International Conference July 13 -- 17 , 2004, Omni Parker House Hotel, Boston, USA http://www.dcs.warwick.ac.uk/CAV Aims and Scope: CAV'04 conference is the 16th in a series dedicated to the advancement of the theory and practice of computer-assisted formal analysis methods for software and hardware systems. The conference covers the spectrum from theoretical results to concrete applications, with an emphasis on practical verification tools and the algorithms and techniques that are needed for their implementation. The proceedings of the conference will be published in the Springer-Verlag Lecture Notes in Computer Science series. Sample topics of interest include: o Algorithms and tools for verifying models and implementations o Deductive, compositional, and abstraction techniques for verification o Modeling and specification formalisms o Program analysis and software verification o Testing and runtime analysis based on verification technology o Applications and case studies o Verification in industrial practice Special Events: CAV'04 is colocated with the International ACM Symposium on Software Testing and Analysis, ISSTA'04. Invited speakers for CAV'04 are David Harel (Weizmann Institute, plenary speaker for the joint CAV-ISSTA session), Mary Jean Harrold (Georgia Institute of Technology), and Tom Reps (University of Wisconsin). CAV will be preceded by an invited tutorial on processor verification by Randy Bryant (Carnegie Mellon University), David Dill (Stanford University), and Warren Hunt (University of Texas, Austin). The conference will be followed by special workshops. Paper submission: There are two categories of submissions: A. Regular papers. Submissions, not exceeding thirteen (13) pages using Springer's LNCS format, should contain original research, and sufficient detail to assess the merits and relevance of the contribution. For papers reporting experimental results, authors are strongly encouraged to make their data available with their submission. Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. B. Tool presentations. Submissions, not exceeding four (4) pages using Springer's LNCS format, should describe the implemented tool and its novel features. A demonstration is expected to accompany a tool presentation. Papers describing tools that have already been presented in this conference before will be accepted only if significant and clear enhancements to the tool are reported and implemented. Information concerning the procedure for submissions is available on the conference home page http://www.dcs.warwick.ac.uk/CAV Important dates: Paper submission (strict): January 23, 2004 Notification of acceptance/rejection: March 29, 2004 Final version due: April 30, 2004 Program Chairs: Rajeev Alur, University of Pennsylvania alur@cis.upenn.edu Doron A. Peled, The University of Warwick doron@dcs.warwick.ac.uk Program Committee: Rajeev Alur, U Pennsylvania David Basin, ETH Zurich Armin Biere, ETH Zurich Randy Bryant, CMU Dennis Dams, Bell Labs Luca de Alfaro, UC Santa Cruz David Dill, Stanford U Allen Emerson, UT Austin Kousha Etessami, U of Edinburgh Steven German, IBM Rob Gerth, Intel Mike Gordon, U of Cambridge Aarti Gupta, NEC Labs Klaus Havelund, NASA Ames Holger Hermanns, Saarland U Pei-Hsin Ho, Synopsis Alan Hu, U of British Columbia Bengt Jonsson, Uppsala U Andreas Kuehlman, Cadence Labs Salvatore La Torre, U of Salerno Oded Maler, Verimag Pete Manolias, Georgia Tech Ken McMillan, Cadence Labs Anca Muscholl, U of Paris 7 Chris Myers, U of Utah Doron Peled, U of Warwick Fabio Somenzi, U of Colorado Amir Pnueli, NYU Shaz Qadeer, Microsoft Research Jun Sawada, IBM Frits Vaandrager, U of Nijmegen Pierre Wolper, U of Liege Sergio Yovine, Verimag\\[1mm] Steering Committee: Edmund M. Clarke, CMU Mike Gordon, U of Cambridge Robert P. Kurshan, Cadence Amir Pnueli, NYU From milad@cs.kun.nl Mon Oct 27 10:46:24 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9RFkOEY010471 for ; Mon, 27 Oct 2003 10:46:24 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9RFkOYu021090 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 27 Oct 2003 10:46:24 -0500 (EST) Received: from pandora.cs.kun.nl (pandora.cs.kun.nl [131.174.33.4]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9RFkN3U027370 for ; Mon, 27 Oct 2003 10:46:23 -0500 (EST) Received: from cs.kun.nl by pandora.cs.kun.nl via zoroaster.cs.kun.nl [131.174.33.82] with ESMTP for id h9RFkM6G022418 (8.12.10/3.58); Mon, 27 Oct 2003 16:46:22 +0100 (MET) Message-ID: <3F9D3D96.10008@cs.kun.nl> Date: Mon, 27 Oct 2003 16:45:26 +0100 From: Milad Niqui User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-GB; rv:1.4) Gecko/20030703 X-Accept-Language: en-gb, en-us, en MIME-Version: 1.0 To: types@cis.upenn.edu Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit X-Mailman-Approved-At: Mon, 27 Oct 2003 10:54:22 -0500 Cc: Subject: query: models of CIC X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 27 Oct 2003 15:46:25 -0000 Status: O X-Status: X-Keywords: X-UID: 15 Dear Type Community, Is there a realizability semantics or set theoretical model known for CIC (i.e. Calculus of Inductive Contrsuctions, the underlying type theory of Coq proof assistant)? In CIC we have two impredicative universes,Prop and Set and a cumulative hierarchy of Type_0, Type_1, ... on top of them. Moreover we have (dependent) inductive types both on the predicative and the impredicative level and we have dependent elimination on Set (which is stronger than the one for Prop). Regards, -- Milad Niqui Computing Science Department, tel:+31 24 365 2631 University of Nijmegen, fax:+31 24 365 2525 P.O.B. 9010, email: milad@cs.kun.nl 6500 GL Nijmegen, http://www.cs.kun.nl/~milad The Netherlands. From txa@Cs.Nott.AC.UK Mon Oct 27 11:43:39 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9RGhdEY010645 for ; Mon, 27 Oct 2003 11:43:39 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9RGhcYu025042 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 27 Oct 2003 11:43:38 -0500 (EST) Received: from Cs.Nott.AC.UK (pat.cs.nott.ac.uk [128.243.20.9]) by central.cis.upenn.edu (8.12.10/8.12.9) with SMTP id h9RGhb3U018014 for ; Mon, 27 Oct 2003 11:43:37 -0500 (EST) Received: from jacob.cs.nott.ac.uk by pat.Cs.Nott.AC.UK id aa10736; 27 Oct 2003 16:43 GMT Received: (from txa@localhost) by cs.nott.ac.uk (8.12.8/8.12.5/Submit) id h9RGhEnS014561; Mon, 27 Oct 2003 16:43:14 GMT From: Thorsten Altenkirch MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <16285.19233.670137.163505@gargle.gargle.HOWL> Date: Mon, 27 Oct 2003 16:43:13 +0000 To: Milad Niqui In-Reply-To: <200310271555.h9RFtCmd011123@saul.cis.upenn.edu> References: <200310271555.h9RFtCmd011123@saul.cis.upenn.edu> X-Mailer: VM 7.07 under 21.4 (patch 8) "Honest Recruiter" XEmacs Lucid X-Mailman-Approved-At: Mon, 27 Oct 2003 11:47:44 -0500 Cc: types@cis.upenn.edu Subject: query: models of CIC X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 27 Oct 2003 16:43:39 -0000 Status: O X-Status: X-Keywords: X-UID: 16 Hi Milad, > Is there a realizability semantics or set theoretical model known for > CIC (i.e. Calculus of Inductive Contrsuctions, the underlying type > theory of Coq proof assistant)? In CIC we have two impredicative > universes,Prop and Set and a cumulative hierarchy of Type_0, Type_1, ... > on top of them. Moreover we have (dependent) inductive types both on the > predicative and the impredicative level and we have dependent > elimination on Set (which is stronger than the one for Prop). I am not sure what you mean by a "set theoretic model": there is an old result by Reynolds which shows that there are no non-trivial set-theoritic models of impredicativity (in classical set theory). As far as realizability goes: omega-sets (and related models called D-sets by Thomas Streicher) provide models for CIC and similar calculi. Basically the idea is that a Type is modelled by an omega-set (X,||-_X) where X is a set and ||-_X a relation between the natural numbers (hence omega) and X s.t. forall x in X there is a number i s.t. i ||-_X x. i is called the realizer of x. Given omega-sets (X,||-_X) and (Y,||-_Y) the omega-set of functions is given by those set-theoretic functions which are tracked by a recursive function (which again can be encoded as a number) giving rise to a new relation ||-_X->Y. To be precise ({f : X-> Y | Ex m. m ||-X->Y f, m ||-_X->Y f iff Forall i,x.i||- x -> {m}i ||- f(x)) This can be extended to dependent function spaces (Pi-type), Sigma types and it is easy to see that omega-sets support inductive types such as Natural Numbers and W-types. To construct an impredicative universe one observes that the subcategory of modest omega-sets (where the ||- relation is injective) provide a good interpretation fro Prop. To model the hierarchy of Type-universes one seems to need inaccessible cardinals. There are a lot of (old) references to this, w-sets (or D-sets) are the main topic of Thomas Streichers PhD and book (Semantics of Type Theory, Birkhaeuser, 1991). Zhaohui Luo extended this in his PhD to ECC. I used a variant - lambda sets - in my own PhD to show strong normalisation also covering inductive types. There is much more... Provaktive question: why does one need an impredicative universe? Cheers, Thorsten From hilde@itu.dk Mon Oct 27 11:38:19 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9RGcJEY010621 for ; Mon, 27 Oct 2003 11:38:19 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9RGcHYu024683 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 27 Oct 2003 11:38:17 -0500 (EST) Received: from mail.itu.dk (tarzan.itu.dk [130.226.133.3]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9RGcG3U016476 for ; Mon, 27 Oct 2003 11:38:17 -0500 (EST) Received: from localhost (localhost.localdomain [127.0.0.1]) by mail.itu.dk (Postfix) with ESMTP id 0EE92AB954; Mon, 27 Oct 2003 17:38:03 +0100 (CET) Received: from mail.itu.dk ([127.0.0.1]) by localhost (tarzan [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 24781-88; Mon, 27 Oct 2003 17:38:02 +0100 (CET) Received: from itu.dk (vip141.itu.dk [130.226.133.141]) by mail.itu.dk (Postfix) with ESMTP id C0136AB5AA; Mon, 27 Oct 2003 17:38:01 +0100 (CET) Message-ID: <3F9D49F6.5090708@itu.dk> Date: Mon, 27 Oct 2003 17:38:14 +0100 From: Thomas Hildebrandt User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.0.2) Gecko/20030208 Netscape/7.02 X-Accept-Language: en-us, en MIME-Version: 1.0 To: categories@mta.ca, types@cis.upenn.edu, concurrency@cwi.nl, proglang@diku.dk, prog-lang@brics.dk, ctcs04@itu.dk, appsem@cs.chalmers.se, lics@research.bell-labs.com Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit X-Virus-Scanned: by amavisd-new at itu.dk X-Mailman-Approved-At: Mon, 27 Oct 2003 11:47:52 -0500 Cc: Subject: CFP: 10th Conference on Category Theory and Computer Science (CTCS 2004) and Summer School X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 27 Oct 2003 16:38:19 -0000 Status: O X-Status: X-Keywords: X-UID: 17 10th CONFERENCE ON CATEGORY THEORY AND COMPUTER SCIENCE (CTCS'04) AUGUST 12-14, 2004 AND SUMMER SCHOOL AUGUST 9-11, 2004 IT University of Copenhagen (ITU) Copenhagen, Denmark FIRST CALL FOR PAPERS CTCS'04 is the 10th Conference on Category Theory and Computer Science. The purpose of the conference series is the advancement of the foundations of computing using the tools of category theory. The emphasis is upon applications of category theory, but it is recognized that the area is highly interdisciplinary. Typical topics of interest include, but are not limited to, category-theoretic aspects of the following: coalgebras and computing concurrent and distributed systems constructive mathematics declarative programming and term rewriting domain theory and topology foundations of computer security linear logic modal and temporal logics models of computation program logics, data refinement, and specification programming language semantics type theory Previous meetings have been held in Guildford (Surrey), Edinburgh (twice), Manchester, Paris, Amsterdam, Cambridge, S. Margherita Ligure (Genova), and Ottawa. The proceedings of the conference will be published as a special issue of ENTCS (Electronic Notes in Theoretical Computer Science). Invited Speakers: Francois Bergeron Martin Hyland Robin Milner Andrew Pitts Thomas Streicher SUMMER SCHOOL Inspired by the success of the graduate student preconference of CTCS'02 in Ottawa, the CTCS of this year will have a similar event: A summer school from August 9-11. The goal is to prepare students - both graduate and undergraduate, with basic knowledge of category theory - for CTCS, through mini-courses in the basic areas underlying some of the fields of the conference. We anticipate offering courses in among others the following areas: Coalgebras Game Semantics Categorical Models for Concurrency Operational Semantics in Concurrency PROGRAMME COMMITTEE Lars Birkedal, Chair (IT University of Copenhagen) Marcelo Fiore (University of Cambridge) Masahito Hasegawa (Kyoto University) Bart Jacobs (University of Nijmegen) Ugo Montanari (University of Pisa) Valeria de Paiva (Palo Alto Research Center) Dusko Pavlovic (Kestrel Institute) John Power (University of Edinburgh) Edmund Robinson (University of London) Peter Selinger (University of Ottawa) ORGANIZING COMMITTEE E. Moggi, Chair, (Genova) S. Abramsky (Oxford) P. Dybjer (Chalmers) B. Jay (Sydney) A. Pitts (Cambridge) LOCAL ORGANIZING COMMITTEE C. Butz T. Hildebrandt A.L. Moerk SUBMISSION OF PAPERS Papers should be submitted, preferably in electronic form, to ctcs04@itu.dk. Papers are limited to 15 pages, and must be submitted in dvi, postscript, or pdf format, possibly gzipped and/or uuencoded, or sent as a standard email attachment. All submissions must be received by April 9th, 2004. If you cannot submit your paper electronically, please contact the program chair at ctcs04@itu.dk. IMPORTANT DATES April 9th, 2004: Submission deadline June 1st, 2004: Notification of authors of accepted papers July 1st, 2004: Revised Papers Due CONFERENCE HOMEPAGE Updated information is available from http://www.itu.dk/research/theory/ctcs2004 SPONSORSHIP The conference and summer school are sponsored by the FIRST graduate school (www.first.dk) and the Theory Department at the IT University of Copenhagen (www.itu.dk/English/research/theory/ From milad@cs.kun.nl Mon Oct 27 12:33:09 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9RHX9EY010932 for ; Mon, 27 Oct 2003 12:33:09 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9RHX8Yu028875 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 27 Oct 2003 12:33:08 -0500 (EST) Received: from pandora.cs.kun.nl (pandora.cs.kun.nl [131.174.33.4]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9RHX73U007500 for ; Mon, 27 Oct 2003 12:33:07 -0500 (EST) Received: from cs.kun.nl by pandora.cs.kun.nl via zoroaster.cs.kun.nl [131.174.33.82] with ESMTP id h9RHX66G011071 (8.12.10/3.58); Mon, 27 Oct 2003 18:33:07 +0100 (MET) Message-ID: <3F9D569A.1000500@cs.kun.nl> Date: Mon, 27 Oct 2003 18:32:10 +0100 From: Milad Niqui User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-GB; rv:1.4) Gecko/20030703 X-Accept-Language: en-gb, en-us, en MIME-Version: 1.0 To: types@cis.upenn.edu References: <200310271555.h9RFtCmd011123@saul.cis.upenn.edu> <16285.19233.670137.163505@gargle.gargle.HOWL> In-Reply-To: <16285.19233.670137.163505@gargle.gargle.HOWL> Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit X-Mailman-Approved-At: Mon, 27 Oct 2003 12:51:08 -0500 Cc: txa@Cs.Nott.AC.UK Subject: Re: query: models of CIC X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 27 Oct 2003 17:33:09 -0000 Status: O X-Status: X-Keywords: X-UID: 18 Dear Thorsten, Thanks for the explanation and references. I have some further remarks/questions: > I am not sure what you mean by a "set theoretic model": there is an > old result by Reynolds which shows that there are no non-trivial > set-theoritic models of impredicativity (in classical set theory). I clarify my question. By set theoretical model I mean any extension of constructive set theories of Aczel, based on subset collection or different forms of power-set axiom [1]. [1] P. Aczel . On Relating Type Theoreis and Set theories. Proceedings of Types 98, LNCS 1257 > To construct an impredicative > universe one observes that the subcategory of modest omega-sets > (where the ||- relation is injective) provide a good interpretation > fro Prop. How do we intrepret the impredicative universe Set then? The elimination rules for types Prop and Set are not symmetric so I guess we need some modification of subcategory of modes-sets to interpret both. Can this be done in a straightforward way? Regards, Milad From antoy@redstar.cs.pdx.edu Mon Oct 27 13:07:51 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9RI7pEY011015 for ; Mon, 27 Oct 2003 13:07:51 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9RI7oYu001301 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 27 Oct 2003 13:07:51 -0500 (EST) Received: from redstar.cs.pdx.edu (redstar.cs.pdx.edu [131.252.214.18]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9RI7n3V019077 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 27 Oct 2003 13:07:50 -0500 (EST) Received: from redstar.cs.pdx.edu (localhost [127.0.0.1]) by redstar.cs.pdx.edu (8.12.5/8.12.5) with ESMTP id h9RIEAc1022899; Mon, 27 Oct 2003 10:14:21 -0800 Received: (from antoy@localhost) by redstar.cs.pdx.edu (8.12.5/8.12.5/Submit) id h9RHdYRY022620; Mon, 27 Oct 2003 09:39:34 -0800 Date: Mon, 27 Oct 2003 09:39:34 -0800 From: Sergio Antoy Message-Id: <200310271739.h9RHdYRY022620@redstar.cs.pdx.edu> To: types@cis.upenn.edu X-Mailman-Approved-At: Mon, 27 Oct 2003 13:16:01 -0500 Cc: Subject: Call for papers: Fourth International Workshop on Reduction Strategies in Rewriting and Programming (WRS'04) X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 27 Oct 2003 18:07:52 -0000 Status: O X-Status: X-Keywords: X-UID: 19 =============================================================== We apologize for multiple copies of this call for participation =============================================================== ******************************** * * * WRS'04 CALL FOR PAPERS * * * ******************************** http://www-i2.informatik.rwth-aachen.de/WRS04/ The Fourth International Workshop on Reduction Strategies in Rewriting and Programming (WRS'04) will be held on June, 2, 2003, in Aachen, Germany, as a part of the Federated Conference on Rewriting, Deduction, and Programming (RDP'04). IMPORTANT DATES: March 17, 2004 Deadline for electronic submission of papers April 14, 2004 Notification of acceptance of papers May 2, 2004 Deadline for final versions of accepted papers June 2, 2004 Workshop TOPICS include, but are not restricted to: * theoretical foundations for the definition and semantic description of reduction strategies * strategies in different frameworks (term rewriting, graph rewriting, infinitary rewriting, lambda calculi, higher order rewriting, conditional rewriting, rewriting with built-ins, narrowing, constraint solving, etc.) and their application in (equational, functional, functional-logic) programming (languages) * properties of reduction strategies / computations under strategies (e.g., completeness, computability, decidability, complexity, optimality, (hyper-)normalization, cofinality, fairness, perpetuality, context-freeness, neededness, laziness, eagerness, strictness) * interrelations, combinations and applications of reduction under different strategies (e.g., evaluation mechanisms in programming languages, equivalence conditions for fundamental properties like termination and confluence, applications in modularity analysis, connections between strategies of different frameworks, etc.) * program analysis and other semantics-based optimization techniques dealing with reduction strategies * rewrite systems / tools / implementations with flexible / programmable strategies as essential concept / ingredient * specification of reduction strategies in (real) languages * tutorials and systems related to evaluation strategies INVITED TALKS will be given by: * Olivier Danvy (University of Aarhus, Denmark), Normalization by Evaluation * Jan Willem Klop (Vrije Universiteit Amsterdam, The Netherlands), Reduction Cycles PROGRAM COMMITTEE: Sergio Antoy Portland (USA) (co-chair) Roberto Di Cosmo Paris VII (France) Juergen Giesl Aachen (Germany) Bernhard Gramlich Wien (Austria) Salvador Lucas Valencia (Spain) Aart Middeldorp Innsbruck (Austria) Jaco van de Pol Amsterdam (The Netherlands) Pierre Rety Orleans (France) Amr Sabry Bloomington (USA) Yoshihito Toyama Sendai (Japan) (co-chair) SUBMISSIONS: We solicit papers on all aspects of reduction strategies in rewriting and programming. Submissions should describe unpublished work, except for survey papers which are explicitly welcome, too. Submissions should not exceed 10 pages (however, survey papers may be longer) and be sent in PostScript or PDF format to the PC co-chairs at wrs04@redstar.cs.pdx.edu by March 17, 2004. The use of the style file available from the RDP workshop style page is encouraged. The call-for papers is also available in PDF format. Submissions should include the title, authors' names, affiliations, addresses, and e-mail. Selection of papers by the PC will be based on originality, significance, and correctness. Final versions will be due by May 2, 2004. PUBLICATION: Accepted papers will be included in the preliminary workshop proceedings that will be available at the workshop. The final workshop proceedings will be published in Elsevier's Electronic Notes in Theoretical Computer Science (ENTCS) series. For further questions please contact the program co-chairs: Sergio Antoy and Yoshihito Toyama at wrs04@redstar.cs.pdx.edu. From maribel@dcs.kcl.ac.uk Tue Oct 28 05:12:35 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9SACZEY014057 for ; Tue, 28 Oct 2003 05:12:35 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9SACYYu019558 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Tue, 28 Oct 2003 05:12:35 -0500 (EST) Received: from argon.dcs.kcl.ac.uk (argon.dcs.kcl.ac.uk [137.73.8.3]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9SACY3U017968 for ; Tue, 28 Oct 2003 05:12:34 -0500 (EST) Received: from st149.dcs.kcl.ac.uk ([137.73.8.149] helo=dcs.kcl.ac.uk) by argon.dcs.kcl.ac.uk with esmtp (Exim 3.36 #1) id 1AEQpl-00078U-00; Tue, 28 Oct 2003 10:12:17 +0000 Sender: maribel@dcs.kcl.ac.uk Message-ID: <3F9E4101.ECA82E34@dcs.kcl.ac.uk> Date: Tue, 28 Oct 2003 10:12:17 +0000 From: Maribel Fernandez Organization: King's College London X-Mailer: Mozilla 4.75 [en] (X11; U; Linux 2.4.18 i686) X-Accept-Language: en MIME-Version: 1.0 To: types@cis.upenn.edu Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit X-MailScanner: Found to be clean X-Mailman-Approved-At: Tue, 28 Oct 2003 08:21:27 -0500 Cc: Subject: Workshop on Lambda-Calculus, Type Theory and Natural Language X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 28 Oct 2003 10:12:36 -0000 Status: O X-Status: X-Keywords: X-UID: 20 Workshop on Lambda-Calculus, Type Theory, and Natural Language 2003 King's College, London December 8 and 9, 2003 Organizers: Maribel Fernandez (King's College London), Chris Fox (University of Essex), Shalom Lappin (King's College London). Sponsors: Department of Computer Science, King's College London Department of Computer Science, University of Essex Speakers: David Clark , King's College London, U.K. Robin Cooper , Göteborg University, Sweden Maribel Fernandez , King's College London, U.K. Chris Fox , University of Essex, U.K. Dov Gabbay , King's College London, U.K. Jamie Gabbay , INRIA Futurs, France Simon Gay , University of Glasgow, U.K. Jonathan Ginzburg , King's College London, U.K. Chris Hankin , Imperial College, U.K. Shalom Lappin , King's College London, U.K. Ian Mackie , King's College London, U.K. Francois-Regis Sinot , Ecole Polytechnique, France Ray Turner , University of Essex, U.K. Keynote Speaker: Jan van Eijck , CWI, Netherlands Programme: Monday, December 8th. 9:30 Coffee - Welcome 10:00 Opening 10:15 Chris Hankin. Lambda calculus and static analysis. 11:00 Coffee Break 11:30 Ian Mackie. Reduction in the lambda calculus. 12:15 Francois-Regis Sinot. N-ary director strings: Efficient representations of variables in terms. 13:00 Lunch 14:00 Jan van Eijck. Relations, Types and Scoping. 15:00 Chris Fox and Shalom Lappin. Underspecified Semantic Representations for Natural Language in a Lambda Calculus with Curry Typing. 15:45 Coffee Break 16:15 Jonathan Ginzburg. Abstraction and Ontology. 17:00 Robin Cooper. Records and record types in semantic theory. 19:00 Dinner Tuesday, December 9th. 9:30 Coffee 10:00 Maribel Fernandez. Rewriting Frameworks and Types. 10:45 David Clark. Measuring interference in PCF. 11:30 Coffee Break 12:00 Jamie Gabbay and Dov Gabbay. The restart rule and evaluation. 12:45 Lunch 14:00 Ray Turner. Polymorphism in Specifications. 14:45 Simon Gay. Session Types: Specifying Structured Communication. 15:30 Closing Participation: Everyone is cordially invited to attend, and there is no registration charge. Proceedings: A collection of abstracts will be available at the workshop. After the workshop full papers will be considered for publication in a special issue of Logic and Computation. Full papers will be subject to a refereeing process according to the standards of the journal. Location: All the talks will take place at King's College London: Room GFES3 (Ground Floor, Strand Building), Strand, London, WC2R 2LS, U.K. Maps and information: King's College London For any further questions: Please contact the organizers Maribel Fernandez, maribel@dcs.kcl.ac.uk Chris Fox, foxcj@essex.ac.uk Shalom Lappin, lappin@dcs.kcl.ac.uk Workshop web site: www.dcs.kcl.ac.uk/staff/maribel/Workshop-Kings.html From streicher@mathematik.tu-darmstadt.de Tue Oct 28 06:06:07 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from mailserver1.hrz.tu-darmstadt.de (mailserver1.hrz.tu-darmstadt.de [130.83.126.41]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9SB66EY014146 for ; Tue, 28 Oct 2003 06:06:07 -0500 Received: from fb04281.mathematik.tu-darmstadt.de (fb04281.mathematik.tu-darmstadt.de [130.83.2.21]) by mailserver1.hrz.tu-darmstadt.de (8.12.10/8.12.8) with ESMTP id h9SB63mc024109 for ; Tue, 28 Oct 2003 12:06:03 +0100 Received: from fb04209.mathematik.tu-darmstadt.de (fb04209.mathematik.tu-darmstadt.de [130.83.2.209]) by fb04281.mathematik.tu-darmstadt.de (8.9.3p2/8.9.3/Debian 8.9.3-21) with ESMTP id MAA11817 for ; Tue, 28 Oct 2003 12:06:03 +0100 Received: (from streicher@localhost) by fb04209.mathematik.tu-darmstadt.de (8.9.3p2/8.9.3/Debian 8.9.3-21) id MAA07302 for types-list@lists.seas.upenn.edu; Tue, 28 Oct 2003 12:06:03 +0100 From: Thomas Streicher Message-Id: <200310281106.MAA07302@fb04209.mathematik.tu-darmstadt.de> To: types-list@lists.seas.upenn.edu Date: Tue, 28 Oct 2003 12:06:03 +0100 (CET) X-Mailer: ELM [version 2.4ME+ PL66 (25)] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit X-TUD-HRZ-MailScanner: Found to be clean X-TUD-HRZ-MailScanner-SpamCheck: not spam, SpamAssassin (Wertung=0, benoetigt 5) X-Mailman-Approved-At: Tue, 28 Oct 2003 08:24:22 -0500 Subject: addendum to models of CIC X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 28 Oct 2003 11:06:07 -0000 Status: O X-Status: X-Keywords: X-UID: 21 concerning the question of models for ECC with inductive types I think the following addenda to Thorsten's answer are in place: In my Thesis I didn't deal with inductive types at all. Nevertheless it was clear to me -- and, actually, a lot of other people working on semantics of type theory in that time -- that it is not a problem to give meaning to inductive types in assemblies (as \omega-sets or D-sets are called nowadays). The reason is quite easy. In assemblies one works as in Set up to the proviso that one has to restrict to realizable elements. So the receipe is to construct inductive types as usual but restrict to the realizable elements. E.g. for W-types, whose elements are infinite tree or terms, the elements in Asm(K_1) are just those trees which are effective (K_1 being numbers with Kleene application). I don't know of any systematic treatment of semantics of inductive types in realizability models up to the following citations (1) if I remember correctly in Thorsten's Thesis itself at least a few particular cases were dealt with (2) there is the These of Benjamin Werner (presumably obtainable from his home page) devoted to CIC (3) thre is a paper by Christian-Emil Ore (a student of D.Norman) Zbl 0784.03009 Ore, Christian-Emil The extended calculus of constructions (ECC) with inductive types. Inf. Comput. 99, No.2, 231-264 (1992). To my opinion the problem rather is to *fix* a syntactic notion of inductive type (which always will be incomplete) rather than to provide it with a semantics in assemblies. There is a general non-syntactic notion of inductive type as given by realizable endo-functors on PER(AA) that preserve coercion maps (those realizable by identity). These induce monotone endomaps on the complete poset (PER(AA),\subseteq) which by Knaster-Tarski do have a fixpoint. There is a general argument showing that these guys coincide with the initial algebras of the functors (I have a little note on that which I can provide on request). However, alas, from this general treatment it doesn't follow that these fixpoints are initial in the category of assemblies though in all interesting cases they are! Best, Thomas From streicher@mathematik.tu-darmstadt.de Tue Oct 28 06:15:28 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from mailserver1.hrz.tu-darmstadt.de (mailserver1.hrz.tu-darmstadt.de [130.83.126.41]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9SBFREY014172 for ; Tue, 28 Oct 2003 06:15:28 -0500 Received: from fb04281.mathematik.tu-darmstadt.de (fb04281.mathematik.tu-darmstadt.de [130.83.2.21]) by mailserver1.hrz.tu-darmstadt.de (8.12.10/8.12.8) with ESMTP id h9SBFJmc026049; Tue, 28 Oct 2003 12:15:19 +0100 Received: from fb04209.mathematik.tu-darmstadt.de (fb04209.mathematik.tu-darmstadt.de [130.83.2.209]) by fb04281.mathematik.tu-darmstadt.de (8.9.3p2/8.9.3/Debian 8.9.3-21) with ESMTP id MAA11935; Tue, 28 Oct 2003 12:15:19 +0100 Received: (from streicher@localhost) by fb04209.mathematik.tu-darmstadt.de (8.9.3p2/8.9.3/Debian 8.9.3-21) id MAA07530; Tue, 28 Oct 2003 12:15:19 +0100 From: Thomas Streicher Message-Id: <200310281115.MAA07530@fb04209.mathematik.tu-darmstadt.de> In-Reply-To: <200310271856.h9RIuWFk025083@saul.cis.upenn.edu> from Milad Niqui at "Oct 27, 2003 06:32:10 pm" To: Milad Niqui Date: Tue, 28 Oct 2003 12:15:19 +0100 (CET) X-Mailer: ELM [version 2.4ME+ PL66 (25)] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit X-TUD-HRZ-MailScanner: Found to be clean X-TUD-HRZ-MailScanner-SpamCheck: not spam, SpamAssassin (Wertung=-1, benoetigt 5, IN_REP_TO -0.50, QUOTED_EMAIL_TEXT -0.48) X-Mailman-Approved-At: Tue, 28 Oct 2003 08:24:22 -0500 Cc: types-list@lists.seas.upenn.edu Subject: Re: query: models of CIC X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 28 Oct 2003 11:15:28 -0000 Status: O X-Status: X-Keywords: X-UID: 22 Dear Milad, > I clarify my question. By set theoretical model I mean any extension of > constructive set theories of Aczel, based on subset collection or > different forms of power-set axiom [1]. > > [1] P. Aczel . On Relating Type Theoreis and Set theories. Proceedings > of Types 98, LNCS 1257 > > > To construct an impredicative > > universe one observes that the subcategory of modest omega-sets > > (where the ||- relation is injective) provide a good interpretation > > fro Prop. well, one can certainly perform realizability model construction in CZF but the PER will not be impredicative anymore; that should not affect the semantics of inductive types, however; in the Thesis of Anton Setzer (and probably in published material of his thesis as well) he constructed realizability semantics for MLTT with one universe and W-types based on some form of Kripke-Platek set theory; but maybe you rather ask the question to which extent the usual set-theoretic constructions of inductive types go through in CZF; there is certainly a limit to that because CZF can be interpreted in MLTT with one universe and W-types (as shown by Aczel in the late 1970ies) Best, Thomas From supratik@saul.cis.upenn.edu Tue Oct 28 08:34:50 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9SDYoEY014460 for ; Tue, 28 Oct 2003 08:34:50 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9SDYnYu026642 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Tue, 28 Oct 2003 08:34:50 -0500 (EST) Received: from saul.cis.upenn.edu (SAUL.CIS.UPENN.EDU [158.130.12.4]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9SDYn3V012313 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Tue, 28 Oct 2003 08:34:49 -0500 (EST) Received: from saul.cis.upenn.edu (localhost [127.0.0.1]) by saul.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9SDYmvv011399 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Tue, 28 Oct 2003 08:34:48 -0500 (EST) Received: from localhost (supratik@localhost) by saul.cis.upenn.edu (8.12.10/8.12.9/Submit) with ESMTP id h9SDYmZd011396 for ; Tue, 28 Oct 2003 08:34:48 -0500 (EST) Date: Tue, 28 Oct 2003 08:34:47 -0500 (EST) From: Supratik Mukhopadhyay To: types@cis.upenn.edu Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Mailman-Approved-At: Tue, 28 Oct 2003 08:38:13 -0500 Cc: Subject: Software Security Track at HASE'2004: CFP X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 28 Oct 2003 13:34:51 -0000 Status: O X-Status: X-Keywords: X-UID: 23 Prolog: One of the main areas in which papers are solicited is language-based security. This area involves techniques from type theory and semantics. CALL FOR PAPERS Software Security Research Track IEEE HASE 2004 25-26 March 2004 Tampa, Florida * Submission Deadline November 5, 2003 * The proliferation of the Internet has induced organizations to increasingly rely upon computers and networks to carry out mission critical tasks. This has made an organization's Information Technology (IT) infrastructure vulnerable to malicious attacks both from within and without. It is critical that the systems, in particular software, used to carry out such tasks are secure and resistant to such attacks. Further, IT is constantly being challenged to do more with fewer resources. The problem of building secure systems is further exacerbated by the current use of unsafe programming languages such as C or C++. The technical problem of building secure systems is rapidly becoming the crucial factor that determines an an organization's success. Therefore methods, tools, and processes used in the design and analysis of software systems -- together with techniques for assuring the quality of the code -- are critical for establishing the desired level of security, information integrity, and confidentiality of communicated information, between humans, federations, coalitions, and computers that have all come to rely on a public, and therefore untrusted medium, for communication. The software security track at HASE 2004 is intended to promote a lively discussion on new or novel processes and methods that deal with the enormous challenge of engineering software and systems that will continue to function correctly even when under malicious attacks. Topics of interest include, but are not restricted to: Language-based Security, Operating Systems Security, Secure Middleware, Malicious Code Detection, Intrusion Tolerance, Trust Management, Program Analysis. Submissions: Research Papers. Original, previously unpublished papers describing research results and prototype developments (max. 10 pages standard double-column IEEE format). Fast Abstracts. Fast Abstracts are short presentations of work in progress or opinion pieces that can cover any facet of software security (max. 2 pages, standard double-column IEEE format). Industrial Experience Papers. Primarily for practitioners to relay experiences in creating secure software systems (max. 2 pages standard double-column IEEE format). Panel Proposals. Organizers should submit proposals, including the title, scope, and the organizers' contact information. Maximum 2 pages, any format. Manuscript submission: http://www.softconf.com/start/HASE2004/submit.html Important Dates: Research Paper Submissions: November 5, 2003 Fast Abstracts and Industrial Experience Papers: November 10, 2003 Notification of Acceptance: December 8, 2003 Camera-ready copy due: January 6, 2004 Proceedings: The proceedings of the track will be published in the regular HASE 2004 proceedings which will be published by IEEE. Organizers: Ramesh Bharadwaj Iliano Cervesato Supratik Mukhopadhyay The website for the track is http://chacs.nrl.navy.mil/projects/HASE04/ About HASE 2004: The HASE Symposium is a forum for discussion of systems engineering issues specifically relating to high consequence and high assurance systems. Examples of high assurance applications include large complex systems, medical surgery equipment, unmanned air vehicles, military command and control, nuclear reactors, and secure telecommunication devices, as well as dedicated embedded systems such as vehicle braking, pacemakers, traffic-light control, MEMS, micro-robots, and satellites. In the past, experts from industry and government R & D labs represented close to half of the attendees, while academicians represented the other half. Our goal is to maintain and improve this interaction between government, industry, and academia through a high-quality program of research papers, panel discussions, demonstrations, focused workgroups, and presentations of case studies and experiences in system engineering for high assurance embedded systems. The website for HASE 2004 is: http://hasrc.csee.wvu.edu/hase04/index.htm Topics of interest include, but are not limited to: Formal Methods Transformation-based system development Validation of specifications, model checking, testing, system level V & V Quantitative and qualitative methods of evaluation Safety analysis, reliability evaluation and enhancement techniques Fault-tolerant software design Experimental and model based evaluation Real-time validation of existing systems Evolutionary design of complex systems Hardware/software design tradeoffs Software engineering for embedded systems Simulation Security Interoperability of secure systems Submisssions: Please consult the HASE 2004 website listed above. From supratik@saul.cis.upenn.edu Tue Oct 28 08:50:58 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9SDowEY014543 for ; Tue, 28 Oct 2003 08:50:58 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9SDovYu027506 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Tue, 28 Oct 2003 08:50:57 -0500 (EST) Received: from saul.cis.upenn.edu (SAUL.CIS.UPENN.EDU [158.130.12.4]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9SDou3V017320 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Tue, 28 Oct 2003 08:50:56 -0500 (EST) Received: from saul.cis.upenn.edu (localhost [127.0.0.1]) by saul.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9SDotvv012140 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Tue, 28 Oct 2003 08:50:55 -0500 (EST) Received: from localhost (supratik@localhost) by saul.cis.upenn.edu (8.12.10/8.12.9/Submit) with ESMTP id h9SDosv5012137 for ; Tue, 28 Oct 2003 08:50:54 -0500 (EST) Date: Tue, 28 Oct 2003 08:50:54 -0500 (EST) From: Supratik Mukhopadhyay To: types@cis.upenn.edu Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Mailman-Approved-At: Tue, 28 Oct 2003 08:53:35 -0500 Cc: Subject: AVIS'04 Call for Papers X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 28 Oct 2003 13:50:58 -0000 Status: O X-Status: X-Keywords: X-UID: 24 Prolog: Topics of the workshop include static analysis of programs. CALL FOR PAPERS Third International Workshop on Automated Verification of Infinite-State Systems (AVIS'04) Co-located with ETAPS 2004 28th March 2004 Barcelona, Spain This workshop is a forum for researchers, students, and practitioners interested in the application of formal methods and tools for the automatic verification of large practical systems. Formal methods, in particular model checking, is increasingly being used in industry to automatically establish the correctness of (and to find flaws in) finite-state systems, such as descriptions of hardware and protocols. However, model checking is limited in scope due to the state explosion problem. Most practical system descriptions, notably that of software, are therefore not directly amenable to finite-state verification methods since they have very large or infinite state spaces. For such systems, theorem proving -- a process that requires manual effort and mathematical sophistication to use -- has so far been the only viable alternative. More recently, we have seen the emergence of hybrid techniques that combine the ease-of-use of model checkers with the power of theorem provers. Tools based on these techniques afford users with full automation, and are less sensitive to the size of the state space (which may be infinite or arbitrarily large). There is a growing body of knowledge in this field which has a very exciting future. The intention of this workshop is to build a forum for exchanging ideas and experiences by bringing together theoreticians, tool builders, as well as practitioners who are interested in this emerging area of research in formal verification. Submission You are invited to submit an extended abstract, not to exceed 10 pages, on related research or case study. We invite both completed work as well as work in progress; the aim of the workshop is to stimulate discussion and to bring together people with varying backgrounds from disparate communities. Important Dates # 19th December 2003 Submission of extended abstract # 05th January 2004 Submission of paper # 16th January 2004 Notification of acceptance # 23rd February 2004 Camera-ready copies due # 28th March 2004 Workshop Publication The accepted papers will be published in the proceedings which will be available at the workshop. The proceedings will also be published electronically on ENTCS. Program Committee Ramesh Bharadwaj (Program Chair) Naval Research Laboratory USA Michael Colon Naval Research Laboratory USA Javier Esparza University of Stuttgart (D) Supratik Mukhopadhyay NASA/WVU Software Research Lab USA Joel Ouaknine Carnegie Mellon University USA R. Ramanujam The Institute of Mathematical Sciences IND Wolfgang Reif University of Augsburg (D) The website for the workshop is: http://chacs.nrl.navy.mil/projects/AVIS04/ From txa@Cs.Nott.AC.UK Tue Oct 28 09:43:21 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from Cs.Nott.AC.UK (pat.cs.nott.ac.uk [128.243.20.9]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with SMTP id h9SEhKEY014789 for ; Tue, 28 Oct 2003 09:43:21 -0500 Received: from jacob.cs.nott.ac.uk by pat.Cs.Nott.AC.UK id ab19770; 28 Oct 2003 14:43 GMT Received: (from txa@localhost) by cs.nott.ac.uk (8.12.8/8.12.5/Submit) id h9SEh9x5016817; Tue, 28 Oct 2003 14:43:09 GMT From: Thorsten Altenkirch MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <16286.32892.856306.693397@gargle.gargle.HOWL> Date: Tue, 28 Oct 2003 14:43:08 +0000 To: Thomas Streicher In-Reply-To: <200310281406.h9SE6wHt013041@saul.cis.upenn.edu> References: <200310281406.h9SE6wHt013041@saul.cis.upenn.edu> X-Mailer: VM 7.07 under 21.4 (patch 8) "Honest Recruiter" XEmacs Lucid X-Mailman-Approved-At: Tue, 28 Oct 2003 09:51:14 -0500 Cc: types-list@lists.seas.upenn.edu Subject: addendum to models of CIC X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 28 Oct 2003 14:43:21 -0000 Status: O X-Status: X-Keywords: X-UID: 25 Hi Thomas, good to hear form you. Thomas Streicher writes: > To my opinion the problem rather is to *fix* a syntactic notion of > inductive type (which always will be incomplete) rather than to > provide it with a semantics in assemblies. This is only a problem in intensional Type Theory, in extensional Type Theory W-types are sufficient. This has been observed by Peter Dybjer some time ago even though the paper got only published in TCS in 1997. Recently we (Michael Abbott,Neil Ghani and myselves) have shown that this also extends to nested datatypes (see http://www.cs.nott.ac.uk/~txa/publ/wtypes-draft.pdf). Nested types lead to a little technical problem, because you have to construct an isomorphism on families - see the paper for details. > There is a general non-syntactic notion of inductive type as given by > realizable endo-functors on PER(AA) that preserve coercion maps (those > realizable by identity). These induce monotone endomaps on the complete > poset (PER(AA),\subseteq) which by Knaster-Tarski do have a fixpoint. There > is a general argument showing that these guys coincide with the initial > algebras of the functors (I have a little note on that which I can provide on > request). However, alas, from this general treatment it doesn't follow that > these fixpoints are initial in the category of assemblies though in all > interesting cases they are! I would suggest to use container functors instead - see http://www.cs.nott.ac.uk/~txa/publ/fossacs03.pdf or Michael Abbott's http://www.cs.le.ac.uk/~ma139/ very recent PhD thesis (he just passed his Viva last Friday) The fossacs paper is a bit out of date, I wouldn't use LFPness anymore. They also have the advantage that you don't need Knaster-Tarski or any magic tricks like this... :-) Thorsten From blume@tti-c.org Wed Oct 29 18:51:51 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9TNppEY021485 for ; Wed, 29 Oct 2003 18:51:51 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9TNpoYu022687 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 29 Oct 2003 18:51:50 -0500 (EST) Received: from laime.cs.uchicago.edu (laime.cs.uchicago.edu [128.135.11.94]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9TNpo3U017461 for ; Wed, 29 Oct 2003 18:51:50 -0500 (EST) Received: from tti-c.org (tti5.uchicago.edu [128.135.191.139]) by laime.cs.uchicago.edu (Postfix) with ESMTP id BDCEA6BEC9 for ; Wed, 29 Oct 2003 17:51:49 -0600 (CST) Date: Wed, 29 Oct 2003 17:51:49 -0600 Mime-Version: 1.0 (Apple Message framework v552) Content-Type: text/plain; charset=US-ASCII; format=flowed From: Matthias Blume To: types@cis.upenn.edu Content-Transfer-Encoding: 7bit Message-Id: X-Mailer: Apple Mail (2.552) X-Mailman-Approved-At: Wed, 29 Oct 2003 19:47:18 -0500 Cc: Subject: United States Midwest Region: MSPLS Workshop on November 15 X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 29 Oct 2003 23:51:51 -0000 Status: O X-Status: X-Keywords: X-UID: 26 I would like to take the opportunity and announce that there will be a workshop on Programming Languages and Systems organized by the Midwest Society for Programming Languages and Systems and hosted by the Toyota Technological Institute at Chicago (TTI-C). Date: Saturday, November 15, 2003 Location: University of Chicago Campus (probably at TTI-C, i.e., the UofC Press Building -- unless there are too many participants for that location) The preliminary list of speakers and topics is the following: Dave McAllester ("A logical algorithm for polymorphic type inference") John Reppy ("A Typed Calculus of Traits") Allen Stoughton ("Experimenting with Formal Languages using Forlan") Jeff Siskind (on a logic for modeling the physics of the world) A. Mattox Beckman, Jr. (on controlling online PE of a LC using a functional parameter) James Riely ("A Calculus of Aspect-Oriented Programs") Christian Haack ("Type error slicing in implicitly typed higher-order languages") However, there is still room on the schedule, so if you are in the Chicago area that weekend, are interested in attending, and prepared to give a presentation, I'd be more than happy to hear from you. Of course, I am nearly as happy if you would like to attend without giving a presentation. Please, let me know a.s.a.p. either way! To stay informed, consider subscribing to the MSPLS mailing list: http://mail.cis.ohio-state.edu/mailman/listinfo/mspls I can be contacted here: blume (at) tti-c (dot) org Best regards, Matthias Blume From als+lics-junk@inf.ed.ac.uk Thu Oct 30 07:36:50 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9UCaoEY023453 for ; Thu, 30 Oct 2003 07:36:50 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9UCanYu024520 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 30 Oct 2003 07:36:49 -0500 (EST) Received: from topper.inf.ed.ac.uk (topper.inf.ed.ac.uk [129.215.32.40]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9UCal3U008153 for ; Thu, 30 Oct 2003 07:36:48 -0500 (EST) Received: from cuillin.inf.ed.ac.uk (IDENT:root@cuillin.inf.ed.ac.uk [129.215.32.61]) by topper.inf.ed.ac.uk (8.11.6/8.11.6) with ESMTP id h9UCa7r16131; Thu, 30 Oct 2003 12:36:07 GMT Received: (from als@localhost) by cuillin.inf.ed.ac.uk (8.11.6/8.11.6) id h9UCa6407385; Thu, 30 Oct 2003 12:36:06 GMT Date: Thu, 30 Oct 2003 12:36:06 GMT Message-Id: <200310301236.h9UCa6407385@cuillin.inf.ed.ac.uk> X-Authentication-Warning: cuillin.inf.ed.ac.uk: als set sender to als+lics-junk@inf.ed.ac.uk using -f To: LICS List From: Alex Simpson Errors-To: als+lics-junk@inf.ed.ac.uk X-Mailman-Approved-At: Thu, 30 Oct 2003 08:25:06 -0500 Cc: theorem-provers@mc.lcs.mit.edu, unification@sics.se, sigparse-list@cs.cmu.edu, theory-logic@cs.cmu.edu, types@cis.upenn.edu, theorem-provers@ai.mit.edu Subject: LICS 2004 - Call for Papers X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list Reply-To: als+lics-junk@dcs.ed.ac.uk List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 30 Oct 2003 12:36:50 -0000 Status: O X-Status: X-Keywords: X-UID: 27 CALL FOR PAPERS Nineteenth Annual IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS 2004) July 14th - 17th, 2004, Turku, Finland http://www.lfcs.informatics.ed.ac.uk/lics/ The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic in a broad sense. We invite submissions on that theme. Suggested, but not exclusive, topics of interest for submissions include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, domain theory, finite model theory, proof theory, formal aspects of program analysis, formal methods, hybrid systems, lambda and combinatory calculi, linear logic, logical aspects of computational complexity, logics in artificial intelligence, logical representation of knowledge, logics of programs, logic programming, modal and temporal logics, model checking, programming language semantics, reasoning about security, rewriting, specifications, type systems and type theory, and verification. Important Dates: Authors are required to submit electronically a paper title and a short abstract of about 100 words before submitting the extended abstract of the paper. Titles & Short Abstracts Due : January 26, 2004 Extended Abstracts Due : February 2, 2004 Author Notification : March 27, 2004 Camera-ready Papers Due : April 25, 2004 All deadlines are firm; late submissions will not be considered. Detailed information about electronic paper submission will be posted at the LICS website. Submission Instructions: Extended abstracts must be submitted electronically in the IEEE Proceedings two-column camera-ready format. Each abstract must be in English and provide sufficient detail to allow the program committee to assess the merits of the paper. It should begin with a succinct statement of the issues, a summary of the main results, and a brief explanation of their significance and relevance to the conference and to computer science, all phrased for the non-specialist. Technical development directed to the specialist should follow. References and comparisons with related work should be included. Extended abstracts may be no longer than 10 pages including references, and must be formatted in the IEEE Proceedings two-column camera-ready style (IEEE style files will be accessible from the LICS website). If necessary, detailed proofs of technical results can be included in a clearly-labelled appendix in the same two-column format following the 10-page extended abstract. This material may be read at the discretion of the program committee. Extended abstracts not conforming to the above requirements concerning format and length may be rejected without further consideration. The results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia or workshops. All authors of accepted papers will be expected to sign copyright release forms. One author of each accepted paper will be expected to present it at the conference. Short Presentations: LICS 2004 will have a session of short (5--10 minutes) presentations. This session is intended for descriptions of work in progress, student projects, and relevant research being published elsewhere; other brief communications may be acceptable. Submissions for these presentations, in the form of short abstracts (1 or 2 pages long), should be entered at the LICS 2004 submission site between March 27th and April 4th, 2004. Authors will be notified of acceptance or rejection by April 17th, 2004. Kleene Award for Best Student Paper: An award in honor of the late S.C. Kleene will be given for the best student paper, as judged by the program committee. For a submission to be eligible, the research presented in the paper must have been carried out while all authors were full-time students. The program committee may decline to make the award or may split it among several papers. Affiliated Workshops: As in previous years, there will be a number of workshops affiliated with LICS 2004; information will be posted at the LICS website. Program Chair: Harald Ganzinger MPI Informatik, Saarbruecken, Germany http://www.mpi-sb.mpg.de/~hg/ Program Committee: Rajeev Alur, U. of Pennsylvania Andrew Appel, Princeton U. Albert Atserias, UPC, Barcelona Franz Baader, Dresden U. Samuel Buss, U. of California, San Diego Roberto Di Cosmo, U. de Paris VII Gilles Dowek, Ecole Polytechnique, Paris Harald Ganzinger, MPI, Saarbruecken (chair) Martin Hofmann, LMU Muenchen Achim Jung, U. of Birmingham Leonid Libkin, U. of Toronto Kim Larsen, Aalborg U. Rocco de Nicola, U. di Firenze Damian Niwinski, Warsaw U. Prakash Panangaden, McGill U., Montreal Albert Rubio, UPC, Barcelona Vitaly Shmatikov, SRI International Moshe Vardi, Rice U., Houston Helmut Veith, TU Wien Andrei Voronkov, U. of Manchester Conference Chair: Lauri Hella Department of Math., Stat., and Phil. Kanslerinrinne 1 33014 University of Tampere, Finland Email: lauri.hella@uta.fi Workshops Chair: Phil Scott, U. of Ottawa Email: phil@site.uottawa.ca Publicity Chair: Alex Simpson, U. of Edinburgh Email: Alex.Simpson@ed.ac.uk General Chair: Phokion G. Kolaitis, UC Santa Cruz Email: kolaitis@cse.ucsc.edu Organizing Committee: S. Abramsky, A. Broder, E. Clarke, A. Felty, U. Furbach, H. Ganzinger, H. Gabow, J. Halpern, L. Hella, U. Kohlenbach, P. Kolaitis (chair), D. Leivant, G. Longo, H. Mairson, A. Middeldorp, J. Mitchell, M. Nielsen, P. Panangaden, G. Plotkin, P. Scott, R. Shore, A. Simpson, I.A. Stewart. Advisory Board: Y. Gurevich, C. Kirchner, D. Kozen, U. Martin, L. Pacholski, V. Pratt, A. Scedrov, M.Y. Vardi, G. Winskel. Sponsorship: 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 for Theoretical Computer Science. Collocated events: ICALP'04 will be collocated with LICS'04; for details see http://www.math.utu.fi/ICALP04/. From Arnaud.Gotlieb@irisa.fr Thu Oct 30 09:44:20 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9UEiKEY023850 for ; Thu, 30 Oct 2003 09:44:20 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9UEfdYu002321 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 30 Oct 2003 09:41:40 -0500 (EST) Received: from smtp.irisa.fr (smtp.irisa.fr [131.254.130.26]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9UEfd3U007568 for ; Thu, 30 Oct 2003 09:41:39 -0500 (EST) Received: from localhost (localhost.localdomain [127.0.0.1]) by localhost.irisa.fr (Postfix) with ESMTP id BBAD3FAD8; Thu, 30 Oct 2003 15:41:38 +0100 (CET) Received: from smtp.irisa.fr ([131.254.130.26]) by localhost (meli.irisa.fr [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 08911-10; Thu, 30 Oct 2003 15:41:36 +0100 (CET) Received: from (sanspub)irisa.fr (citrouille.irisa.fr [131.254.50.83]) by smtp.irisa.fr (Postfix) with ESMTP id D539AFAD4; Thu, 30 Oct 2003 15:41:36 +0100 (CET) Date: Thu, 30 Oct 2003 15:41:36 +0100 From: Arnaud Gotlieb <" Arnaud.Gotlieb\""@irisa.fr (sanspub)> User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.0.1) Gecko/20020823 Netscape/7.0 X-Accept-Language: en-us, en MIME-Version: 1.0 To: clp@comp.nus.edu.sg, curry@informatik.rwth-aachen.de, eacsl@dimi.uniud.it, EAPLS@JISCMAIL.AC.UK, erlang-questions@erlang.org, glp@first.gmd.de, gulp@dimi.uniud.it, ipa@tue.nl, lprolog@cs.umn.edu, mercury-ads@cs.mu.oz.au, prog-lang@diku.dk, prog-logique@irisa.fr, sicstus-users@sics.se, theorem-provers@ai.mit.edu, theory-logic@cs.cmu.edu, types@cis.upenn.edu, users@mozart-oz.org, aiia@di.unito.it, alp@doc.ic.ac.uk, amast@cs.utwente.nl, appiar@ncc.up.pt, compulog@doc.imperial.ac.uk, compulognet-parimp@dia.fi.upm.es, compunode@compulog.org, cphc-conf@JISCMAIL.AC.UK, cs-logic@cs.indiana.edu, dbworld@cs.wisc.edu, dreamers@dai.ed.ac.uk, fm-info@air16.larc.nasa.gov, formal-methods@cs.uidaho.edu, gulp@di.unipi.it, info-hol@jaguar.cs.byu.edu, isabelle-users@cl.cam.ac.uk, kgs@logic.tuwien.ac.at, logic-announce@uclink4.berkeley.edu, nuprllist@CS.Cornell.EDU, prolia@tlxf.geomail.org, quintus-users@quintus.com, pvs@csl.sri.com, theorynt@listserv.nodak.edu, seworld@cs.colorado.edu, clp-users-request@comp.nus.edu.sg, concurrency@cwi.nl Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Message-Id: <20031030144136.D539AFAD4@smtp.irisa.fr> X-Virus-Scanned: by amavisd-new at irisa.fr X-Mailman-Approved-At: Thu, 30 Oct 2003 10:13:25 -0500 Cc: Subject: ICLP'04 (International Conference on Logic Programming) -- First Call For Papers X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 30 Oct 2003 14:48:17 -0000 Status: O X-Status: X-Keywords: X-UID: 28 --------------------------------------------------------------------------- FIRST CALL FOR PAPERS Please distribute and accept our apologies if you receive multiple copies. Twentieth International Conference on Logic Programming ICLP'04 6-10 September, 2004 Saint-Malo, France URL: http://www.irisa.fr/ICLP04 --------------------------------------------------------------------------- Conference scope ---------------- Since the first conference held in Marseille in 1982, ICLP has been the premier international conference for presenting research in logic programming. Contributions (papers and posters) are sought in all areas of logic programming including but not restricted to: Theory: Semantic Foundations, Formalisms, Nonmonotonic Reasoning Knowledge Representation Implementation: Compilation, Memory Management, Virtual Machines, Parallelism Environments: Program Analysis, Program Transformation, Validation and Verification Debugging, Profiling Language Issues: Concurrency, Objects, Coordination, Mobility, Higher Order, Types, Modes Programming Techniques Alternative Paradigms: Constraint Logic Programming, Abductive Logic Programming, Inductive Logic Programming, Answer Set Programming Applications: Deductive Databases, Software Engineering, Natural Language, Web Tools Internet Agents, Artificial Intelligence Specific attention will be given to work providing novel integrations of these different areas, and to new applications of logic programming in general. Contributions on applications will be assessed with an emphasis on their impact and synergy with other areas, as opposed to technical maturity. The technical program will include several invited talks and advanced tutorials, in addition to the presentations of the accepted papers and posters. We also plan to have several workshops in parallel with the conference (see call for workshop proposals on the Conference web pages). Papers ------- Papers must describe original, previously unpublished research, and must not be simultaneously submitted for publication elsewhere. They must be written in English and not exceed 15 pages in Springer LNCS format. The authors are encouraged, although not obliged, to submit their papers already in Springer LNCS format. General information about the Springer LNCS series and the LNCS authors' instructions are available at the Springer LNCS/LNAI home page (http://www.springer.de/comp/lncs/index.html). Papers should express their contribution clearly, both in general and technical terms. It is essential to identify what was accomplished, describe its significance, and explain how the paper compares with and advances previous work. Authors should make every effort to make the technical content understandable to a broad audience. The primary means of submission will be electronic, in postscript format. If electronic submission is not possible, five hard copies should be sent to one of the program co-chairs. More information on the submission procedure will be available at http://www.cs.utexas.edu/users/ICLP04 Posters ------- Posters provide a forum for presenting work in an informal and interactive setting. They are ideal for discussing current work not yet ready for publication, for PhD thesis summaries and research project overviews. Posters must be submitted electronically. More information on the submission procedure will be available at http://www.cs.kuleuven.ac.be/conference/iclp04_posters. Publication ----------- Negotiation is under way to have the proceedings of the conference published by Springer-Verlag in the LNCS series. The proceedings will include the accepted papers and the abstracts of accepted posters. Sponsoring and prizes --------------------- The conference is sponsored by the Association for Logic Programming. The ALP has funds to assist financially disadvantaged participants. The ALP is planning to sponsor two prizes for ICLP'04: for the best technical paper and for the best application paper. Important dates --------------- PAPERS POSTERS Abstract submission deadline: 19 February Submission deadline: 23 February 10 April Notification of authors: 19 April 10 May Camera-ready copy due: 31 May 31 May Conference venue ---------------- ICLP'04 will be held at the "Palais du Grand Large" at Saint-Malo in Brittany, France. Saint-Malo is a historical pirate town located on the north coast of Brittany, close to Mont Saint-Michel and to Rennes. Saint-Malo is often compared to a great vessel preparing to set out to sea, always searching renewal and adventures. Every street corner, every shore recalls the city's legendary past, along the innumerable walks and seafront promenades. The conference will feature an excursion to Mont Saint-Michel, one of France's best-known attractions. Surrounded by the most powerful tides in Europe, perched high on a rocky island, this medieval city and its abbey are a UNESCO World Cultural and Natural Heritage Site. Organization ------------ Conference Chair: Mireille Ducasse (INSA Rennes, France) Program Co-Chairs: Bart Demoen (Catholic University Leuven, Belgium) Vladimir Lifschitz (University of Texas, USA) Workshop Chair: Fausto Spoto (Universita di Verona, Italy) Publicity Chair: Arnaud Gotlieb (IRISA Rennes, France) Program Committee: Chitta Baral Arizona State University, USA Piero Bonatti Universita di Napoli, Italy Gerhard Brewka Leipzig University, Germany Michael Codish Ben-Gurion University, Israel Veronica Dahl Simon Fraser University, Canada Bart Demoen Catholic University Leuven, Belgium Juergen Dix University of Manchester, UK Mireille Ducasse INSA Rennes, France Francois Fages INRIA Rocquencourt, France John Gallagher Roskilde University, Denmark Gopal Gupta University of Texas, USA Manuel Hermenegildo Universidad Politecnica de Madrid, Spain Antonis Kakas University of Cyprus, Cyprus Andy King University of Kent, UK Evelina Lamma University of Ferrara, Italy Vladimir Lifschitz University of Texas, USA Fangzhen Lin University of Science and Technology, Hong Kong Naomi Lindenstrauss Hebrew University, Israel Michael Maher Loyola University, USA Dale Miller INRIA Futurs, France Stephen Muggleton Imperial College, UK Ilkka Niemela Helsinki University of Technology, Finland Andreas Podelski Max Planck Institute, Germany Kostis Sagonas Uppsala University, Sweden Chiaki Sakama Wakayama University, Japan Vitor Santos Costa Universidade Federal do Rio de Janeiro, Brasil Zoltan Somogyi University of Melbourne, Australia Peter Stuckey University of Melbourne, Australia Paul Tarau University of North Texas, USA Contact addresses ----------------- General chair: iclp04@irisa.fr Mireille Ducasse IRISA Campus de Beaulieu, F-35042 Rennes Cedex, France Program co-chairs: iclp04-chairs@cs.utexas.edu Bart Demoen Vladimir Lifschitz Department of Computer Science Department of Computer Sciences Celestijnenlaan 200A The University of Texas at Austin 3001 Leuven 1 University Station C0500 Belgium Austin, TX 78712-0233 USA From Arnaud.Gotlieb@irisa.fr Fri Oct 31 04:12:07 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9V9C7EY026968 for ; Fri, 31 Oct 2003 04:12:07 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9V9ArYu021001 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 31 Oct 2003 04:10:53 -0500 (EST) Received: from smtp.irisa.fr (smtp.irisa.fr [131.254.130.26]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9V9Aq3U022445 for ; Fri, 31 Oct 2003 04:10:52 -0500 (EST) Received: from localhost (localhost.localdomain [127.0.0.1]) by localhost.irisa.fr (Postfix) with ESMTP id 0B6ACFADF; Fri, 31 Oct 2003 10:10:52 +0100 (CET) Received: from smtp.irisa.fr ([131.254.130.26]) by localhost (meli.irisa.fr [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 02502-01; Fri, 31 Oct 2003 10:10:50 +0100 (CET) Received: from irisa.fr (citrouille.irisa.fr [131.254.50.83]) by smtp.irisa.fr (Postfix) with ESMTP id 1EB7AFAC5; Fri, 31 Oct 2003 10:10:50 +0100 (CET) Message-ID: <3FA22718.6020308@irisa.fr> Date: Fri, 31 Oct 2003 10:10:48 +0100 From: Arnaud Gotlieb User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.0.1) Gecko/20020823 Netscape/7.0 X-Accept-Language: en-us, en MIME-Version: 1.0 To: clp@comp.nus.edu.sg, curry@informatik.rwth-aachen.de, eacsl@dimi.uniud.it, EAPLS@JISCMAIL.AC.UK, erlang-questions@erlang.org, glp@first.gmd.de, gulp@dimi.uniud.it, ipa@tue.nl, lprolog@cs.umn.edu, mercury-ads@cs.mu.oz.au, prog-lang@diku.dk, prog-logique@irisa.fr, theorem-provers@ai.mit.edu, theory-logic@cs.cmu.edu, types@cis.upenn.edu, users@mozart-oz.org, aiia@di.unito.it, alp@doc.ic.ac.uk, amast@cs.utwente.nl, appiar@ncc.up.pt, compulog@doc.imperial.ac.uk, compulognet-parimp@dia.fi.upm.es, compunode@compulog.org, cphc-conf@JISCMAIL.AC.UK, cs-logic@cs.indiana.edu, dbworld@cs.wisc.edu, dreamers@dai.ed.ac.uk, fm-info@air16.larc.nasa.gov, formal-methods@cs.uidaho.edu, gulp@di.unipi.it, info-hol@jaguar.cs.byu.edu, isabelle-users@cl.cam.ac.uk, kgs@logic.tuwien.ac.at, logic-announce@uclink4.berkeley.edu, nuprllist@CS.Cornell.EDU, prolia@tlxf.geomail.org, quintus-users@quintus.com, pvs@csl.sri.com, theorynt@listserv.nodak.edu, seworld@cs.colorado.edu, concurrency@cwi.nl, sicstus-users@sics.se X-Virus-Scanned: by amavisd-new at irisa.fr X-Mailman-Approved-At: Fri, 31 Oct 2003 08:43:35 -0500 Content-Type: text/plain; name="cfw04.txt" Content-Transfer-Encoding: 8bit Content-Disposition: inline; filename="cfw04.txt" X-Content-Filtered-By: Mailman/MimeDel 2.1.2 Cc: Subject: ICLP'04 -- Call For Workshops Proposals X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 31 Oct 2003 09:13:55 -0000 Status: O X-Status: X-Keywords: X-UID: 29 PLEASE ACCEPT MY APOLOGIES IF YOU RECEIVE THIS MESSASE MORE THAN ONCE. ICLP'04 Twentieth International Conference on Logic Programming URL: http://www.irisa.fr/manifestations/2004/ICLP04/ *** CALL FOR WORKSHOP PROPOSALS *** ICLP'04, the 20th International Conference on Logic Programming, will be held in Saint-Malo, France, from September 6 to September 10, 2004. We plan to have several workshops in parallel with the conference. Workshops have a key role in Logic Programming Conferences. They provide an ideal platform for the presentation of preliminary work or novel ideas in a less formal way than the conference itself. They also are an opportunity to disseminate work in progress, particularly for new researchers. Workshops also provide a venue for presenting more specialized topics and opportunities for more intensive discussions, exchange of ideas, and project collaboration. The topics of the workshops can cover any areas related to logic programming, including cross-disciplinary areas. Topics related to applications of logic programming to software verification and computational biology are particularly welcome. To encourage active participation and exchange of ideas, the workshops will be kept small, preferably under 40 participants. The format of the workshop will be determined by the organizer(s) proposing the workshop, but ample time must be allowed for general discussion. Workshops can vary in length, but the optimal duration will be half a day or a full day. Having two or three co-organizers for a workshop is strongly advised. Workshop Proposal: ================== The persons intending to organize a workshop at ICLP'04 are invited to submit a workshop proposal. Proposals should be in English and about two pages in length. They should contain: * the title of the workshop * a brief technical description of the topics covered by the workshop * a discussion of the timeliness and relevance of the workshop * the names, affiliation and contact details (email, web page, phone, fax) of the workshop organizing committee together with a designated contact person as the workshop coordinator * a preliminary plan/schedule for organizing the workshop, including the required number of half-days allotted to the workshop * a list of previously-organized related workshops by any of the workshop organizing committee. Although previous experience with organizing similar workshops is not required, this information will be helpful to the Workshop Chair * an estimated number of attendants to the workshop Proposals are expected in ASCII or LaTeX format. All proposals should be submitted to the Workshop Chair by email by January 11, 2004. Workshop Organizers' Tasks: =========================== * Producing a "Call for Papers" for the workshop and posting it on the net and/or other means. Please provide a web page URL which can be linked into the ICLP'04 home page. * Providing a brief description of the workshop for the conference program. * Reviewing/accepting submitted papers. * Scheduling workshop activities in collaboration with the local organizers and the workshop chair. * Sending workshop proceedings in LaTeX format to the workshop chair for printing, by June 13, 2004 (if the proceedings are to be printed by the local organizers) Reviewing Process: ================== Each submitted proposal is reviewed by the Workshops Chair and the Conference Program Chairs. Proposals that appear well-organized and that fit the goals and scope of ICLP will be selected. The decision will be notified by email to the responsible organizer by January 25, 2004. The definitive length of the workshop will be planned according to the number of submissions received by the different workshops. For every accepted workshop, the ICLP local organizers will prepare a meeting place and can print the workshop proceedings, whose LaTeX preparation is however in charge to the workshop organizers. The workshop registration fees will be handled together with the conference fees. Workshop Location: ================== The workshops will be held in parallel with the 20th International Conference on Logic Programming (ICLP04). ICLP04 will be held in Saint-Malo, France. The conference will be held at the Palais du Grand Large located in front of the sea, near the ramparts of the city. Saint-Malo is a historical town on the northern coast of French Brittany. After its mythical foundation during the Middle Ages it became the city of the brave-hearted corsairs who ran the British canal and acquired impressive wealth. The city was totally destroyed during the Second World War, and then reconstructed in its original style. Beautiful beaches surround the city, and small islands. One of them, the Grand-Bé, host the tomb of French writer Chateaubriand. Important Dates: ================ Proposals due: January 11, 2004 Notification of acceptance: January 25, 2004 Camera-ready due: June 13, 2004 Workshop Chair: ===================== Fausto Spoto (Dipartimento di Informatica, Verona, Italy) Email: fausto.spoto@univr.it Phone: +39 3204352527 Fax: +39 0458027068 From smaus@informatik.uni-freiburg.de Fri Oct 31 05:01:34 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id h9VA1YEY027087 for ; Fri, 31 Oct 2003 05:01:34 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9VA1XYu022686 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 31 Oct 2003 05:01:34 -0500 (EST) Received: from avalon.informatik.uni-freiburg.de (avalon.informatik.uni-freiburg.de [132.230.150.1]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id h9VA1W3U003420 for ; Fri, 31 Oct 2003 05:01:32 -0500 (EST) Received: from jordaan.informatik.uni-freiburg.de (jordaan.informatik.uni-freiburg.de [132.230.166.154]) by avalon.informatik.uni-freiburg.de (8.9.3p2/8.9.0) with ESMTP id KAA13052; Fri, 31 Oct 2003 10:58:10 +0100 (MET) Received: from localhost (localhost [127.0.0.1]) by jordaan.informatik.uni-freiburg.de (8.11.7/8.11.6) with ESMTP id h9V9w9706175; Fri, 31 Oct 2003 10:58:09 +0100 (MET) Date: Fri, 31 Oct 2003 10:58:08 +0100 (MET) From: Jan-Georg Smaus To: sicstus-users@sics.se, theorem-provers@ai.mit.edu, theory-logic@cs.cmu.edu, types@cis.upenn.edu, users@mozart-oz.org Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Mailman-Approved-At: Fri, 31 Oct 2003 08:46:11 -0500 Cc: Subject: ICLP03: Call for participation X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 31 Oct 2003 10:01:35 -0000 Status: O X-Status: X-Keywords: X-UID: 30 INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING (ICLP'03) (in conjunction with FSTTCS'03 and ASIAN'03) Call for participation Mumbai (Bombay), INDIA, 9 - 13 Dec, 2003 http://www.tcs.tifr.res.in/~iclp03 ***** NOTE: The satellite events include the workshop Principles and Practice of Semantic Web Reasoning (PPSWR), not advertised in the previous call **** * Programme. The programme includes - 23 presentations of regular papers - 4 invited talks Rolf Backofen: A Constraint-Based Approach to Structure Prediction for Simplified Protein Models that outperforms other existing methods. Maurizio Gabbrielli: Compositional Verification of Infinite State Systems. Olivier Ridoux: Logic Information Systems for Logic Programmers William Winsborough: A Logic Programming View of Authorization in Distributed Systems. - 1 keynote talk by Greg Morriset (in common with ASIAN'03): Achieving Type Safety for Low-Level Code - 4 tutorials Paola Bruscoli: Proof-Theoretic Foundations of Logic Programming Francois Fages: Symbolic Model-Checking for Biochemical Systems, Kung-Kiu Lau: Component-based Software Development and Logic Programming Frank D. Valencia: Concurrency, Time and Constraints - A poster exhibition plus 18 short presentations of posters - The famous Prolog Programming Contest organised by Bart Demoen * Satellite events. Note that the satellite events take place before and after the main conference. - Principles and Practice of Semantic Web Reasoning (PPSWR): 8 Dec 2003 - Whole Day - COnstraint & LOgic Programming in Security (COLOPS): 8 Dec 2003 - Morning - Workshop on Logic Programming Environments (WLPE): 8 Dec 2003 - Afternoon - Implementation of Constraint and LOgic Programming Systems (CICLOPS): 14 Dec 2003 - Whole Day - Software Verification and Validation (SVV): 14 Dec 2003 - Whole Day * Venue. The conference will be held at the Tata Institute of Fundamental Research (TIFR) campus located at the southern tip of Mumbai facing the Arabian Ocean. Mumbai formerly known as Bombay is the financial and commercial capital of India. TIFR (established in 1945) is a premier research Institute (recently it has been conferred the status of Deemed University) in India carrying out research in various areas of Physics, Chemistry, Biology, Computer Science, Technology, and Science Education. The picturesque campus has well equipped conference and lecture halls and a large modern Homi Bhabha Auditorium that will be used for plenary sessions for the conference. * Travel information. A visa is required for travel to India. Participants are advised to enquire about a visa and make travel arrangements as soon as possible. Further information is available on the webpage. * Financial support. Cheap accomodation (in particular for students) is available to a limited extent. Please contact John Barretto (email: "last name"@tifr.res.in) for details. * Organisers. R.K. Shyamasundar (conference chair) Catuscia Palamidessi (programme chair) M.R.K. Krishna Rao (poster chair) N. Raja and Vitor Santos Costa (workshop chairs) Jan-Georg Smaus (publicity chair) Bart Demoen (programming contest chair) From ruy@cin.ufpe.br Mon Nov 3 08:07:12 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hA3D7CEY021380 for ; Mon, 3 Nov 2003 08:07:12 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hA3D7BYu013796 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 3 Nov 2003 08:07:11 -0500 (EST) Received: from noronha.cin.ufpe.br ([150.161.2.100]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hA3D793V024322 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 3 Nov 2003 08:07:11 -0500 (EST) Received: (from root@localhost) by noronha.cin.ufpe.br (8.12.9p1/8.12.9) id hA3D5ucS034242 for types@cis.upenn.edu; Mon, 3 Nov 2003 10:05:56 -0300 (BRT) (envelope-from ruy@cin.ufpe.br) Received: from goiana.cin.ufpe.br (goiana.cin.ufpe.br [172.17.33.28]) by noronha.cin.ufpe.br (8.12.9p1/8.12.9av) with ESMTP id hA3D5pFl034232 for ; Mon, 3 Nov 2003 10:05:56 -0300 (BRT) (envelope-from ruy@cin.ufpe.br) Received: from localhost (ruy@localhost) by goiana.cin.ufpe.br (8.9.3+Sun/8.9.1) with ESMTP id KAA26155 for ; Mon, 3 Nov 2003 10:05:51 -0300 (EST) X-Authentication-Warning: goiana.cin.ufpe.br: ruy owned process doing -bs Date: Mon, 3 Nov 2003 10:05:51 -0300 (EST) From: Ruy de Queiroz X-X-Sender: To: Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=ISO-8895-1 Content-Transfer-Encoding: QUOTED-PRINTABLE X-Virus-Scanned: by AMaViS perl-11 X-Mailman-Approved-At: Mon, 03 Nov 2003 08:59:07 -0500 Cc: Subject: WoLLIC'2004 - Call for Papers X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 03 Nov 2003 13:07:12 -0000 Status: O X-Status: X-Keywords: X-UID: 31 [please post] Call for Papers 11th Workshop on Logic, Language, Information and Computation =09 (WoLLIC'2004) Campus of Universit=E9 Paris 12 July 19-22 2004 Scientific Co-Sponsorship IGPL, FoLLI, ASL, EATCS, SBC, SBL =09=09 (PROCEEDINGS AS A VOLUME OF =09"Electronic Notes in Theoretical Computer Science" (Elsevier)) THE EVENT The "11th Workshop on Logic, Language, Information and Computation" (WoLLIC'2004), the eleventh version of a series of workshops which starte= d in 1994 with the aim of fostering interdisciplinary research in pure and applied logic, will be held in Paris, July 19-22, 2004. SCOPE Contributions are invited in the form of short papers (12 A4 10pt pages) = in all areas related to logic, language, information and computation, includ= ing: . logic and databases . logic programming and algebraic semantics . logic and linguistics . logic and artificial intelligence . logic, arithmetic and complexity . proof complexity, zero-knowledge proofs . proof theory, lambda calculus, categorical logic . model theory, descriptive complexity . real computation, algebraic complexity . logic and verification . natural computing SCIENTIFIC SPONSORSHIP The 11th WoLLIC'2004 has the scientific sponsorship of the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the European Association for Logic, Language and Information (FoL= LI), the European Association for Theoretical Computer Science (EATCS), the Sociedade Brasileira de Computa=E7=E3o (SBC), and the Sociedade Brasileira de L=F3gica (SBL). GUEST SPEAKERS Thomas Ehrhard (Institut de Math=E9matiques de Luminy, Univ Marseille, Fr= ance) Klaus Meer (University of Southern Denmark, Odense, Denmark) Damian Niwinski (Div of Maths, Informatics & Mechanics, Warsaw Univ, Pola= nd) Luke Ong (Computing Laboratory, Oxford University, UK) Gheorghe Paun (Institute of Mathematics, Romanian Academy, Romania) Alexander Rabinovich (School of Computer Science, Tel Aviv Univ, Israel) Stuart Shieber (DEAS, Harvard University, USA) (TO BE CONFIRMED) THE LOCATION Campus of Fontainebleau (Universit=E9 Paris 12), 60 km south of Paris. SUBMISSION Papers (up to 12 pages A4 10pt, sent preferably in postscript format by e-mail to wollic@cin.ufpe.br, or in 5(five) copies to postal address) mus= t be RECEIVED by MARCH 1st, 2004 by one of the Co-Chairs of the Organising Committee. Papers must be ANONYMOUS (a separate identification page must be included= ), written in English and give enough detail to allow the programme committe= e to assess the merits of the work. Papers should start with a brief statement of the issues, a summary of the main results, and a statement of their significance and relevance to the workshop. References and comparisons with related work is also expected. Technical development directed to the specialist should follow. Results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia or workshops. One author of each accepted paper will be expected to attend the conference in order to present it. Authors will be notified of acceptance by APRIL 1st, 2004, and final versions will have to be delivered (in LaTeX format) by MAY 1st, 2004. The abstracts of the papers will be published in a "Conference Report" section of the Logic Journal of the IGPL (ISSN 1367-0751) (Oxford Univ Press, web page: http://www.oup.co.uk/igpl) as part of the meeting report= =2E The proceedings will appear as a volume in the Elsevier series "Electroni= c Notes in Theoretical Computer Science" (http://www.elsevier.nl/locate/ent= cs) Full version of papers will be refereed again for publication in a specia= l issue of the Logic Journal of the IGPL. STUDENT GRANTS ASL sponsorship of WoLLIC'2004 also will permit student ASL members to apply for (limited) ASL travel funds that we hope to make available for sponsored meetings that take place in 2004 (see http://www.aslonline.org/studenttravelawards.html) In addition to that, WoLLIC'2004 will make available modest grants to graduate students in logic and to recent PhDs so that they may attend the meeting in Paris. To be considered for a grant, please (1) send a letter of application, an= d (2) ask your thesis supervisor to send a brief recommendation letter. The application letter should be brief (one page) and should include (1) your name, (2) your home institution, (3) your thesis supervisor's na= me, (4) a one-paragraph description of your studies and work in logic, (5) your estimate of the travel expenses you will incur, (6) (for citizens or residents of EU) citizenship or visa status, and (7) (voluntary) indication of your gender and minority status. Only modes= t grants will be possible, partially covering travel costs and perhaps some= of the living expenses during the meeting. Women and members of minority gro= ups are strongly encouraged to apply. Application by email is encouraged; put "WoLLIC grant application" in the subject line of your message. Applications and recommendations sho= uld be received before the deadline of MARCH 1st, 2004, by one of the Co-Chai= rs of the Organising Committee. IMPORTANT DATES Submission: MARCH 1st, 2004 Notification of acceptance/rejection: APRIL 1st, 2004 Delivery of final (in LaTeX): MAY 1st, 2004 PROGRAMME COMMITTEE Zofia Adamowicz (Mathematics Institute, Polish Academy of Sciences, Polan= d) Dani=E8le Beauquier (LACL, Univ Paris XII, France) Felipe Cucker (City Univ of Hong Kong, Honk Kong) Mariangiola Dezani (Universita` di Torino, Italy) Georg Gottlob (Tech. Univ. Wien, Austria) Erich Graedel (RWTH Aachen, Germany) Etienne Grandjean (Univ de Caen, France) Irene Guessarian (LIAFA et UFR d'Informatique de Paris 6) Gerard Huet (INRIA, France) Martin Hyland (Cambridge University, UK) Gopalan Nadathur (University of Minnesota, USA) Grzegorz Rozenberg (Leiden University, The Netherlands) Anatol Slissenko (LACL, Univ Paris XII, France) Igor Walukiewicz (Bordeaux University, France) ORGANISING COMMITTEE Gianluigi Bellin (Univ di Verona, Italy) Alessandra Carbone (Univ Pierre et Marie Curie, France) Patrick Cegielski (LACL, Univ Paris XII, France) (Co-Chair) Anjolina Grisi de Oliveira (Centro Informatica, Univ Fed Pernambuco, Braz= il) Ruy de Queiroz (Centro Informatica, Univ Fed Pernambuco, Brazil) (Co-Chai= r) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee: Patrick Cegielski, Universit=E9 Paris 12-IUT, D=E9partement Informatique, Route foresti=E8re Hurtault, F-77300 Fontaine= bleau France. Telephone: +33.(0)1.60.74.68.16 (office), Fax: +33.(0)1.60.74.68.= 28, E-mail: cegielski@univ-paris12.fr Ruy de Queiroz, Centro de Informatica, Univ Fed Pernambuco, Av. Prof. Luis Freire, s/n, 50740-540 Recife, PE, Brazil, tel: +55 81 3271 9430, fax: +55 81 3271 9438, E-mail: ruy@cin.ufpe.br WEB PAGE http://www.cin.ufpe.br/~wollic/wollic2004/ ------- From dncr@ivs.tu-berlin.de Mon Nov 3 10:47:37 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hA3FlbEY022173 for ; Mon, 3 Nov 2003 10:47:37 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hA3FlbYu021974 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 3 Nov 2003 10:47:37 -0500 (EST) Received: from mail.zrz.tu-berlin.de (mail.zrz.TU-Berlin.DE [130.149.4.15]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hA3Fla3U022846 for ; Mon, 3 Nov 2003 10:47:36 -0500 (EST) Received: from localhost ([127.0.0.1] helo=mail.zrz.TU-Berlin.DE) by mail.zrz.tu-berlin.de with esmtp (exim-4.24-1) for id 1AGgvX-0001Ph-M4; Mon, 03 Nov 2003 16:47:35 +0100 Received: from mail.zrz.TU-Berlin.DE ([130.149.4.15]) by mail.zrz.TU-Berlin.DE (MailMonitor for SMTP v1.2.2 ) ; Mon, 3 Nov 2003 16:47:35 +0100 (CET) Received: from bruecke.ivs.tu-berlin.de ([130.149.63.134]) by mail.zrz.tu-berlin.de with esmtp (exim-4.24-1) for id 1AGgvX-0001PN-L4; Mon, 03 Nov 2003 16:47:35 +0100 Received: from localhost (localhost [127.0.0.1]) by bruecke.ivs.tu-berlin.de (Postfix) with ESMTP id CE01390F4D for ; Mon, 3 Nov 2003 16:47:34 +0100 (CET) Received: by bruecke.ivs.tu-berlin.de (Postfix, from userid 40218) id 920E490F60; Mon, 3 Nov 2003 16:46:36 +0100 (CET) To: types@cis.upenn.edu Message-Id: <20031103154636.920E490F60@bruecke.ivs.tu-berlin.de> Date: Mon, 3 Nov 2003 16:46:36 +0100 (CET) From: dncr@ivs.tu-berlin.de (dncr) X-Virus-Scanned: Sophos MailMonitor on mail.zrz.tu-berlin.de; Mon, 03 Nov 2003 16:47:35 +0100 X-Mailman-Approved-At: Mon, 03 Nov 2003 10:53:50 -0500 Cc: Subject: DAIS-FMOODS 2003 - Paris 18-21 Nov - 2nd Call for Participation X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 03 Nov 2003 15:47:38 -0000 Status: O X-Status: X-Keywords: X-UID: 32 DAIS-FMOODS'03 - Paris 18-21 Nov - 2nd Call for Participation Pleas Note: The early registration deadline has been extended to November 5th! Dear Colleagues, * DAIS'03 Distributed Applications & Interoperable Systems (4th IFIP Internationl Conference of the series) * FMOODS'03 Formal Methods for Open Object-based Distributed Systems (6th IFIP Internationl Conference of the series) will be held jointly, 18 to 21 November, in Paris - FRANCE. http://fedconf.enst.fr Salient Features: * Complementary domains: foundations & practice of Distributed Systems. * Special focus on: Component based design and reconfiguration issues. * High quality acceptance rates: - 18/63 for FMOODS and - 21/76 (long papers) and 5/12 (short papers) for DAIS. * Five invited talks: - Can concurrency and distribution become easy? by Bertrand Meyer - Java's Integral Types in PVS by Bart Jacobs - Middleware? Muddleware! by Andrew Herbert - Research Challenges of Autonomic Computing by David Chambliss - The Domain Specific Languages: Components in a Semantic Framework by Alan Cameron Wills. * One registration gives access to all sessions and to both proceedings * A rich pre-conferences day (18 Nov) with 4 tutorials and 3 workshops. * Tutorials (half day): - Context-Aware Systems for Pervasive Computing - Developing Security Critical Distributed Systems with UML - Semantic Web enabled Web Services - Action-Based Model Checking * Workshops: - Adaptable Service Provision (one day) - Communication Abstractions for Distributed Systems (half day) - PhD (half day) For more information visit the conferences web site http://fedconf.enst.fr. Please note that early registration (offering substantial savings) has been extended to November 5th. We look forward to seeing you in Paris, The DAIS-FMOODS organizers From sweirich@seas.upenn.edu Tue Nov 4 09:11:47 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from lion.seas.upenn.edu (LION.SEAS.UPENN.EDU [158.130.12.194]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hA4EBlEY032587 for ; Tue, 4 Nov 2003 09:11:47 -0500 Received: from blue.seas.upenn.edu (BLUE.SEAS.UPENN.EDU [158.130.64.177]) by lion.seas.upenn.edu (8.12.10/8.12.10) with ESMTP id hA4EBlfU003250 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NOT) for ; Tue, 4 Nov 2003 09:11:47 -0500 Received: from blue.seas.upenn.edu (localhost [127.0.0.1]) by blue.seas.upenn.edu (8.12.10/8.12.9) with ESMTP id hA4EBkPN001359 for ; Tue, 4 Nov 2003 09:11:47 -0500 (EST) Received: (from sweirich@localhost) by blue.seas.upenn.edu (8.12.10/8.12.9/Submit) id hA4EBkcC001358 for types-list@lists.seas.upenn.edu; Tue, 4 Nov 2003 09:11:46 -0500 (EST) From: "Stephanie C. Weirich" Message-Id: <200311041411.hA4EBkcC001358@blue.seas.upenn.edu> To: types-list@lists.seas.upenn.edu Date: Tue, 4 Nov 2003 09:11:46 -0500 (EST) X-Mailer: ELM [version 2.4 PL23-upenn3.3] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Subject: Forward of moderated message (fwd) X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 04 Nov 2003 14:11:48 -0000 Status: O X-Status: X-Keywords: X-UID: 33 Forwarded message: > From mailman-bounces@lists.seas.upenn.edu Tue Nov 4 09:05:39 2003 > X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ > Subject: Forward of moderated message > From: types-list-bounces@lists.seas.upenn.edu > To: types-list-owner@lists.seas.upenn.edu > MIME-Version: 1.0 > Content-Type: message/rfc822 > Message-ID: > Date: Tue, 04 Nov 2003 09:05:28 -0500 > Precedence: bulk > X-BeenThere: types-list@lists.seas.upenn.edu > X-Mailman-Version: 2.1.2 > List-Id: TYPES forum > X-List-Administrivia: yes > Sender: mailman-bounces@lists.seas.upenn.edu > Errors-To: mailman-bounces@lists.seas.upenn.edu > X-Spam-Status: No, hits=0.8 required=5.0 > tests=NO_REAL_NAME > version=2.55 > X-Spam-Level: > X-Spam-Checker-Version: SpamAssassin 2.55 (1.174.2.19-2003-05-19-exp) > > X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ > Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) > by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hA3KcxEY027618 > for ; Mon, 3 Nov 2003 15:38:59 -0500 > Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) > by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hA3KcvYu012060 > (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) > for ; Mon, 3 Nov 2003 15:38:58 -0500 (EST) > Received: from whale.cs.indiana.edu (whale.cs.indiana.edu [129.79.246.27]) > by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hA3Kcw3U012224 > for ; Mon, 3 Nov 2003 15:38:58 -0500 (EST) > Received: from moose.cs.indiana.edu (moose.cs.indiana.edu [129.79.254.191]) > by whale.cs.indiana.edu (8.12.10/8.12.10/IUCS_2.60) with ESMTP id > hA3Kctcj001520; Mon, 3 Nov 2003 15:38:56 -0500 (EST) > Date: Mon, 3 Nov 2003 15:38:55 -0500 (EST) > From: larry moss > To: categories-request@mta.ca, types@cis.upenn.edu > cc: coalgebra@iti.cs.tu-bs.de, asl@vassar.edu > Subject: Position announcement > In-Reply-To: > Message-ID: > References: > MIME-Version: 1.0 > Content-Type: TEXT/PLAIN; charset=US-ASCII > Resent-To: types-list@lists.seas.upenn.edu > Approved: types-list > > INDIANA UNIVERSITY BLOOMINGTON > SCHOOL OF INFORMATICS > TENURE-TRACK FACULTY POSITIONS IN MATHEMATICS AND LOGIC > STARTING FALL 2004 > > The School of Informatics is the most important academic initiative at > Indiana University in the past 30 years. Informatics is the study of > information and information technology in its applied and social > contexts. The State of Indiana has committed new base funding that will > allow the School to hire in excess of 30 new faculty at the Bloomington > campus over the next few years. > > Tenure-track positions at all ranks are available in the mathematical > foundations of informatics. Areas of possible interest include applied > logic, information theory, mathematics in AI, non-standard models of > computation, computational economics, probabilistic models in expert > systems, and statistical informatics. Candidates whose interests > integrate several aspects of mathematics in informatics will be > considered especially interesting, as will candidates whose interests > complement the school's existing strengths in bioinformatics, chemical > informatics, human-computer informatics and social informatics. In > addition to courses directly related to the candidate's research > expertise, candidates who can teach core areas of the informatics > curriculum are preferred. Senior candidates should have a strong record > of funding. > > The School has strong ties to Indiana University's programs in Computer > Science, Math, Physics, and Cognitive Science, and to reseach centers in > bioinformatics and genomics, biocomplexity, and social informatics, as > well as statistics and pervasive technology laboratories; joint > appointments with units sponsoring these programs may be possible. We > have excellent work conditions including low teaching loads, attractive > salaries, and world-class computing and library facilities. Located on > the rolling wooded hills of southern Indiana, Bloomington is a culturally > thriving college town with moderate cost of living. > > We especially encourage applications from small research teams who wish > to collaborate with one another at IU in the School of Informatics. Each > candidate should apply separately, and include in their statement the > rationale for hiring the entire group. Applicants should submit a > curriculum vitae, a statement of research and teaching emphasizing > informatics, and the names of three references (six for associate and > full professors) online at > > informatics.indiana.edu/positions/faculty > > Review of applications will begin immediately; the search will remain > open until the positions are filled. > > Indiana University is an equal opportunity / affirmative action employer. > We are committed to employing quality faculty who will enhance the rich > diversity of our academic community. > From lsm@cs.indiana.edu Mon Nov 3 15:38:59 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hA3KcxEY027618 for ; Mon, 3 Nov 2003 15:38:59 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hA3KcvYu012060 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 3 Nov 2003 15:38:58 -0500 (EST) Received: from whale.cs.indiana.edu (whale.cs.indiana.edu [129.79.246.27]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hA3Kcw3U012224 for ; Mon, 3 Nov 2003 15:38:58 -0500 (EST) Received: from moose.cs.indiana.edu (moose.cs.indiana.edu [129.79.254.191]) by whale.cs.indiana.edu (8.12.10/8.12.10/IUCS_2.60) with ESMTP id hA3Kctcj001520; Mon, 3 Nov 2003 15:38:56 -0500 (EST) Date: Mon, 3 Nov 2003 15:38:55 -0500 (EST) From: larry moss To: categories-request@mta.ca, types@cis.upenn.edu In-Reply-To: Message-ID: References: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Mailman-Approved-At: Tue, 04 Nov 2003 09:30:34 -0500 Cc: asl@vassar.edu, coalgebra@iti.cs.tu-bs.de Subject: position announcement again (in text form) X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 03 Nov 2003 20:38:59 -0000 Status: O X-Status: X-Keywords: X-UID: 34 INDIANA UNIVERSITY BLOOMINGTON SCHOOL OF INFORMATICS TENURE-TRACK FACULTY POSITIONS IN MATHEMATICS AND LOGIC STARTING FALL 2004 The School of Informatics is the most important academic initiative at Indiana University in the past 30 years. Informatics is the study of information and information technology in its applied and social contexts. The State of Indiana has committed new base funding that will allow the School to hire in excess of 30 new faculty at the Bloomington campus over the next few years. Tenure-track positions at all ranks are available in the mathematical foundations of informatics. Areas of possible interest include applied logic, information theory, mathematics in AI, non-standard models of computation, computational economics, probabilistic models in expert systems, and statistical informatics. Candidates whose interests integrate several aspects of mathematics in informatics will be considered especially interesting, as will candidates whose interests complement the school's existing strengths in bioinformatics, chemical informatics, human-computer informatics and social informatics. In addition to courses directly related to the candidate's research expertise, candidates who can teach core areas of the informatics curriculum are preferred. Senior candidates should have a strong record of funding. The School has strong ties to Indiana University's programs in Computer Science, Math, Physics, and Cognitive Science, and to reseach centers in bioinformatics and genomics, biocomplexity, and social informatics, as well as statistics and pervasive technology laboratories; joint appointments with units sponsoring these programs may be possible. We have excellent work conditions including low teaching loads, attractive salaries, and world-class computing and library facilities. Located on the rolling wooded hills of southern Indiana, Bloomington is a culturally thriving college town with moderate cost of living. We especially encourage applications from small research teams who wish to collaborate with one another at IU in the School of Informatics. Each candidate should apply separately, and include in their statement the rationale for hiring the entire group. Applicants should submit a curriculum vitae, a statement of research and teaching emphasizing informatics, and the names of three references (six for associate and full professors) online at informatics.indiana.edu/positions/faculty Review of applications will begin immediately; the search will remain open until the positions are filled. Indiana University is an equal opportunity / affirmative action employer. We are committed to employing quality faculty who will enhance the rich diversity of our academic community. From kracht@humnet.ucla.edu Tue Nov 4 12:22:26 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hA4HMQEY002370 for ; Tue, 4 Nov 2003 12:22:26 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hA4HMPYu010261 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Tue, 4 Nov 2003 12:22:25 -0500 (EST) Received: from nightshade.noc.ucla.edu (nightshade.noc.ucla.edu [169.232.48.18]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hA4HMOIW001343; Tue, 4 Nov 2003 12:22:24 -0500 (EST) Received: from ts48-42.dialup.bol.ucla.edu (ts48-42.dialup.bol.ucla.edu [169.232.231.151]) by nightshade.noc.ucla.edu (8.12.8p2/8.12.8) with ESMTP id hA4HGkrL021684; Tue, 4 Nov 2003 09:16:47 -0800 From: Marcus Kracht Organization: UCLA To: nasslli04@humnet.ucla.edu Date: Tue, 4 Nov 2003 09:12:28 -0800 User-Agent: KMail/1.5.1 MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Content-Disposition: inline Message-Id: <200311040912.28478.kracht@humnet.ucla.edu> X-Mailman-Approved-At: Tue, 04 Nov 2003 12:55:25 -0500 Cc: Subject: NASSLLI04 Call for Proposals X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list Reply-To: kracht@humnet.ucla.edu List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 04 Nov 2003 17:22:26 -0000 Status: O X-Status: X-Keywords: X-UID: 35 NASSLLI04 June 21-25, UCLA, Los Angeles (North American Summer School in Logic, Language and Information 2004) CALL for PROPOSALS The third NASSLLI (after a successful start with NASSLLI02 in Stanford and NASSLLI03 in Bloomington) will be held at UCLA, June 21 - 25, 2004. The summer school will consist of a number of courses and workshops, selected on the basis of the proposals. Proposals are invited that present interdisciplinary work between the areas of logic, linguistics, computer science, philosophy and artificial intelligence, though work in just one area is within the scope of the summer school if it can be applied in other fields. Submission Details: Submissions should indicate 1) person(s) and affiliation 2) type of event (one week course or workshop, 2 hours a day) 3) an outline of the course up to 500 words 4) an indication of whether special equipment is needed to teach that course (beamer, computer ...) 5) a statement about the instructor's experience in teaching in interdisciplinary settings 6) expected costs (whether you want to be paid hotel and/or travel, or whether you are able to find funding) Final Material: We expect material for the actual courses at least *one month* ahead of the conference if harcopies of any material are to be made available by us. Financial Details: A course may be taught by one or two persons. Conference fees are waived for all instructors. However, we are only able to pay for the full travel and expenses of one instructor per course. If two persons are lecturing, they may share a lump sum paid for both. Workshops are more complicated, and a proposal for a workshop should include a plan to obtain some outside funcing for the speakers. Important Note: To give us an idea about the number of submissions, we would like you to email us within two weeks in case you are interested in submitting a proposal. This will not commit you to actually submit one. Deadline for submission: 31.01.2004 Program Committee: Dominique Sportiche, UCLA, chair Mai Gehrke, New Mexico State University John Horty, University of Maryland Mark Johnson, Brown University Phokion Kolaitis, UC Santa Cruz Marcus Kracht, UCLA Philippe Schlenker, UCLA Ed Stabler, UCLA Website: News will be posted at http://www.linguistics.ucla.edu/nassllli04 If you are interested in NASSLLI03: http://www.linguistics.ucla.edu/nasslli04/2003 Inquiries can be sent to the following email address: nasslli04@humnet.ucla.edu Alternatively, you may send a letter to Marcus Kracht Department of Linguistics, UCLA 3125 Campbell Hall 405 Hilgard Avenue PO Box 951543 Los Angeles, CA 90095-1543 USA kracht@humnet.ucla.edu From Aart.Middeldorp@uibk.ac.at Wed Nov 5 02:43:11 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hA57hBEY005254 for ; Wed, 5 Nov 2003 02:43:11 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hA57hAYu027600 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 5 Nov 2003 02:43:11 -0500 (EST) Received: from smtp.uibk.ac.at (lmr1.uibk.ac.at [138.232.1.142]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hA57h9IX020448 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 5 Nov 2003 02:43:10 -0500 (EST) Received: from uibk.ac.at (pc6133-c703.uibk.ac.at [138.232.66.133]) by smtp.uibk.ac.at (8.12.10/8.12.10/F1) with ESMTP id hA57h8TJ011630 for ; Wed, 5 Nov 2003 08:43:08 +0100 Message-ID: <3FA8B817.4050403@uibk.ac.at> Date: Wed, 05 Nov 2003 08:43:03 +0000 From: Aart Middeldorp User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.4) Gecko/20030624 Netscape/7.1 X-Accept-Language: en-us, en, ja MIME-Version: 1.0 To: types@cis.upenn.edu Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit X-Spam-Score: -3.1 () RCV_UIBK,USER_AGENT_MOZILLA_UA,X_ACCEPT_LANG X-Scanned-By: MIMEDefang 2.35 at uibk.ac.at X-Mailman-Approved-At: Wed, 05 Nov 2003 08:11:40 -0500 Cc: Subject: research position at the University of Innsbruck X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 05 Nov 2003 07:43:11 -0000 Status: O X-Status: X-Keywords: X-UID: 36 The Institute of Computer Science of the University of Innsbruck invites applications for a researcher position ("Wissenschaftliche(r) Mitarbeiter(in)") in the Computational Logic group. Candidates should have a PhD in computer science. A good theoretical background (logic, automata theory, rewriting, type theory) is an asset. So is the ability to implement your ideas. The ideal candidate furthermore enjoys the opportunity of working with students at all levels. Candidates are expected to contribute to research and teaching. We offer the following: + A research position in an internationally oriented research group. + A 4 year contract with the possibility of unlimited extension. + A gross monthly salary of around 2700 euro, which is paid 14 times a year, and augmented by a teaching supplement. The application deadline is November 30, 2003; later applications will be considered until the position is filled. The University of Innsbruck is committed to increase its female staff, so qualified women are especially encouraged to apply. The city of Innsbruck, which hosted the Olympic Winter Games in 1964 and 1976, is superbly located in the beautiful surroundings of the Tyrolean Alps. The combination of the Alpine environment and urban life in this historic town provides a high quality of living. The University of Innsbruck has a long tradition dating back to the 16th century and offers a wide spectrum of research and teaching activities with interesting opportunities for interdisciplinary collaboration. Applications, containing a CV, publication list, and the names of two references, should be send to Ms. Anna Maria Scheiring Institute of Computer Science Technikerstr. 25/7 A-6020, Innsbruck Austria Anna-Maria.Scheiring@uibk.ac.at Further information can be obtained from the head of the group Aart.Middeldorp@uibk.ac.at From ueda@ueda.info.waseda.ac.jp Wed Nov 5 06:36:34 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hA5BaYEY005816 for ; Wed, 5 Nov 2003 06:36:34 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hA5BaTYu005079 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 5 Nov 2003 06:36:29 -0500 (EST) Received: from smtp.ueda.info.waseda.ac.jp (banon.ueda.info.waseda.ac.jp [133.9.237.9]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hA5BaRIW011234 for ; Wed, 5 Nov 2003 06:36:28 -0500 (EST) Received: from localhost (banon [133.9.237.9]) by smtp.ueda.info.waseda.ac.jp (Postfix) with ESMTP id 0F72C3F2A; Wed, 5 Nov 2003 20:36:26 +0900 (JST) Date: Wed, 05 Nov 2003 20:36:25 +0900 (JST) Message-Id: <20031105.203625.74740511.ueda@ueda.info.waseda.ac.jp> To: types@cis.upenn.edu, clp@comp.nus.edu.sg, eapls@jiscmail.ac.uk, ecoop-info@ecoop.org, concurrency@cwi.nl, appsem@cs.chalmers.se, e-lang@eros-os.org, users@mozart-oz.org From: Kazunori UEDA X-Mailer: Mew version 2.2 on Emacs 20.7 / Mule 4.1 (AOI) Mime-Version: 1.0 Content-Type: Text/Plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Mailman-Approved-At: Wed, 05 Nov 2003 08:11:59 -0500 Cc: ueda@ueda.info.waseda.ac.jp Subject: ASIAN'03 -- Call for Participation X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 05 Nov 2003 11:36:35 -0000 Status: O X-Status: X-Keywords: X-UID: 37 Call for Participation ---ASIAN'03 Eighth Asian Computing Science Conference Mumbai, India, December 10-12, 2003 Collocated with ICLP'03 and FSTTCS'03 http://www.cse.psu.edu/asian03/ The Eighth Asian Computing Science Conference, ASIAN'03, will be held at Tata Institute of Fundamental Research, Mumbai, India, collocatied with ICLP'03 (Dec.9-13, workshops Dec.8+14) and FSTTCS'03 (Dec.15-17, workshops Dec.14). The series of Asian Computing Science Conferences was started in 1995 to provide a forum for researchers in computer science from the Asian region and to promote interaction with researchers from other regions. The proceedings have been published as Springer LNCS volumes. The theme of this year's conference is Programming Languages and Distributed Computation. The conference features three invited talks by - Greg Morrisett (Cornell Univ., USA), - Mark Miller (Hewlett Packard Lab. and Johns Hopkins Univ., USA), and - Andrew Birrell (Microsoft Research, USA), as well as sixteen refereed papers selected from 53 submissions. Registration ------------ Travel Information and Registration Details can be found at the collocated ICLP website, namely http://www.tcs.tifr.res.in/~iclp03/travel.htm http://www.tcs.tifr.res.in/~iclp03/RegDetails.htm (also linked from the ASIAN'03 site http://www.cse.psu.edu/asian03/) The early registration deadline is November 15. Please book your flight as soon as possible. Program Committee ----------------- Gul Agha (UIUC, USA) Guruduth Banavar (IBM Research, USA) Gilad Bracha (Sun Microsystems, USA) Luca Cardelli (Microsoft Research, UK) Georges Gonthier (INRIA, France) Seif Haridi (SICS, Sweden / NUS, Singapore) Nevin Heintze (Agere Research, USA) Radha Jagadeesan (DePaul U., USA) Naoki Kobayashi (Tokyo Inst. Tech., Japan) Doug Lea (SUNY Oswego, USA) Sanjiva Prasad (IIT Delhi, India) Padma Raghavan (Penn State U., USA) Vijay Saraswat, CHAIR (Penn State U., USA), CHAIR R. K. Shyamasundar (TIFR, India) Anand Sivasubramaniam (Penn State U., USA) Kazunori Ueda (Waseda U., Japan) Sanjiva Weerawarana (IBM Research, USA / U. Moratuwa, Sri Lanka) Feng Zhao (PARC, USA) General Co-Chairs ----------------- R.K. Shyamasundar and Kazunori Ueda Conference Programme -------------------- Wednesday, Dec. 10 09:00-10:00 INVITED TALK by Greg Morrisett Achieving Type Safety for Low-Level Code G. Morrisett (Cornell University, USA) 10:30-12:30 Kernel Mode Linux: Towards an operating system protected by a type theory T. Maeda, A. Yonezawa Self Configurable Mirror Servers for Automatic Adaptation to Service Demand Fluctuation M. Agetsuma, K. Kono, H. Iwasaki, T. Masuda Information Flow Security for XML Transformations V. Benzaken, M. Burelle, G. Castagna Unreliable Failure Detectors via Operational Semantics U. Nestmann, R. Fuzzati, EPFL Lausanne 14:00-22:00 Social event ( excursion / banquet ) Thursday, Dec. 11 09:00-10:00 INVITED TALK by Andrew Birrell Bankable Postage for Network Servics M. Abadi, A. Birrell, M. Burrows, F. Dabek, T. Wobber 10:00-10:30 Global Predicate Detection under Fine-grained Modalities P. Chandra, A. Kshemkalyani 11:00-12:30 Combining Hierarchical Specification with Hierarchical Implementation N. Zhan, Mannheim University, GERMANY Automatic Generation of Simple Lemmas from Recursive Definitions using Decision Procedures D. Kapur, M. Subramaniam Deaccumulation -- Improving Provability J. Giesl, A. Kuhnemann, J. Voigtlander 14:30-16:00 Incentive Compatible Mechanism Based on Linear Pricing Schemes for Single-Minded Auction N. Chen, H. Zhu Hierarchical structure of 1-safe Petri nets K. Lodaya, D. Ranganayakulu,K. Rangarajan A Calculus for Secure Mobility B. Blanchet, B. Aziz A Calculus of Bounded Capacities F. Barbanera, M. Bugliesi, M. Dezani-Ciancaglini, V. Sassone Friday, Dec. 12 09:00-10:00 INVITED TALK by Mark Miller Paradigm Regained: Abstraction Mechanisms for Access Control M. Miller, J. Shapiro 10:00-10:30 The Design and Evaluation of a Middleware Library for Distribution of Language Entities E. Klintskog, Z. El Banna, P. Brand, S. Haridi 11:00-12:30 Generating optimal Linear Temporal Logic monitors by coinduction K. Sen, G. Rosu, G. Agha Probabilistic Timed Simulation Verification and its application to Stepwise Refinement of Real-Time Systems S. Yamane Model Checking Probabilistic Distributed Systems B. Bollig, M. Leucker ======================================================================== From slind@cs.utah.edu Mon Nov 10 12:50:23 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAAHoNEY005635 for ; Mon, 10 Nov 2003 12:50:23 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAAHoLYu025268 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 10 Nov 2003 12:50:21 -0500 (EST) Received: from mail-svr1.cs.utah.edu (brahma.cs.utah.edu [155.99.198.200]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAAHoKIW007344 for ; Mon, 10 Nov 2003 12:50:20 -0500 (EST) Received: from trust.cs.utah.edu (trust.cs.utah.edu [155.98.65.28]) by mail-svr1.cs.utah.edu (Postfix) with ESMTP id 802F7346E0; Mon, 10 Nov 2003 10:50:19 -0700 (MST) Received: by trust.cs.utah.edu (Postfix, from userid 2794) id 664256C038; Mon, 10 Nov 2003 10:50:19 -0700 (MST) From: Konrad Slind To: hvg@cl.cam.ac.uk, coq-club@pauillac.inria.fr, isabelle-users@cl.cam.ac.uk, hol-info@lists.sourceforge.net, lego-club@dcs.ed.ac.uk, metaprl@metaprl.org, nuprllist@cs.cornell.edu, pvs@csl.sri.com, acl2@lists.cc.utexas.edu, concurrency@cwi.nl, types@cis.upenn.edu, imps@linus.mitre.org, mizar-forum@mizar.uwb.edu.pl, softverf@nist.gov, rewriting@ens-lyon.fr, qed@mcs.anl.gov, dreamers@dai.ed.ac.uk, lfcs-interest@dcs.ed.ac.uk, facs-members@lut.ac.uk, fme@mailbase.ac.uk, fm-info@air16.larc.nasa.gov, formal-methods@cs.uidaho.edu, fsdm@cs.uq.oz.au, uv@cs.utah.edu, Christopher.Okasaki@usma.edu, ald@cs.utah.edu, hales+@pitt.edu Message-Id: <20031110175019.664256C038@trust.cs.utah.edu> Date: Mon, 10 Nov 2003 10:50:19 -0700 (MST) X-Mailman-Approved-At: Mon, 10 Nov 2003 13:12:48 -0500 Cc: tphols2004@cs.utah.edu Subject: TPHOLs: Call for papers X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 10 Nov 2003 17:50:24 -0000 Status: O X-Status: X-Keywords: X-UID: 38 CALL FOR PAPERS: TPHOLs 2004 The 17th International Conference on Theorem Proving in Higher Order Logics Park City, Utah Tuesday 14 September - Friday 17 September 2004 *********************************************** * http://www.cs.utah.edu/tphols2004/ * *********************************************** TOPICS The program committee welcomes submissions on all aspects of theorem proving in higher order logics, on related topics in theorem proving and verification, and on relevant applications. The topics include, but are not limited to, the following: o Specification and verification of: * Hardware: microprocessors, memory systems, buses, pipelines, etc; formal semantics of hardware design languages; synthesis; formal design flows * Software: program verification, refinement, and synthesis for declarative and imperative languages; formal semantics of programming languages; proof carrying code o Industrial application of theorem provers o Advances in theorem prover technology: * Proof automation and decision procedures * Induction * Combination of deductive and algorithmic approaches * Incorporation of theorem provers into larger systems * Combination of theorem provers with other provers and tools o Security algorithms, properties, and policies o Specification and requirements analysis of systems o User interfaces for theorem provers o Development and extension of higher order logics o Formalization of mathematical theories o Proof Pearls: concise and elegant presentations of interesting examples. SUBMISSIONS Submissions are invited in the following categories: "Mature Work" and "Emerging Trends" Mature Work Emerging Trends o Submission deadline: 20 Feb 2004 21 May 2004 o Acceptance notification: 2 Apr 2004 18 June 2004 o Camera-ready copy due: 7 May 2004 16 July 2004 Submissions under "Mature Work" will be fully refereed, and accepted papers will be published in a volume of Springer's Lecture Notes in Computer Science, which will be available at the conference. Authors of accepted papers are expected to present their work at the conference. Submissions under "Emerging Trends" will not be formally refereed, but their content and relevance will be reviewed. Accepted submissions will be published in a University of Utah technical report, which will be available at the conference. Authors of accepted papers are expected to present a brief outline of their work at the conference and to prepare a poster for display at the conference venue. Unless otherwise requested, submissions rejected under "Mature Work" will also be considered for inclusion under "Emerging Trends". Papers should be no more than 16 pages in length and should be written using LaTeX2e and the LNCS style file, which is available from "http://www.springer.de/comp/lncs/authors.html". Submissions should be sent electronically following the instructions on the TPHOLs web page, or emailed directly to the organizers using the email address "tphols2004@cs.utah.edu". This email address can also be used for any inquiries concerning the conference. INVITED SPEAKERS Three distinguished researchers will present their work at TPHOLs: * Al Davis of the University of Utah * Thomas Hales of the University of Pittsburgh * TBA PROGRAM COMMITTEE Mark Aagaard (Waterloo) Clark Barrett (NYU) David Basin (Zurich) Yves Bertot (INRIA) Ching-Tsun Chou (Intel) Thierry Coquand (Chalmers) Peter Dybjer (Chalmers) Amy Felty (Ottawa) Jean-Christophe Filliatre (Paris Sud) Jacques Fleuriot (Edinburgh) Mike Gordon (Cambridge) Jim Grundy (Intel) Elsa Gunter (NJIT) John Harrison (Intel) Jason Hickey (Caltech) Peter Homeier (NSA) Doug Howe (Carleton) Paul Jackson (Edinburgh) Bart Jacobs (Nijmegen) Sara Kalvala (Warwick) Matt Kaufmann (AMD) Thomas Kropf (Bosch) Tom Melham (Oxford) Cesar Munoz (NASA) Tobias Nipkow (Muenchen) Sam Owre (SRI) Christine Paulin-Mohring (Paris Sud) Lawrence Paulson (Cambridge) Frank Pfenning (CMU) Konrad Slind (Utah) (PC Chair) Sofiene Tahar (Concordia) Burkhardt Wolff (Freiburg) CONFERENCE ORGANIZATION The conference organizers are Konrad Slind and Ganesh Gopalakrishnan of the School of Computing at the University of Utah. Please use the address tphols2004@cs.utah.edu to send email to the organizers. RELATED EVENTS There will be a gap of one day between the end of TPHOLs2004 and the start of ICFP, the International Conference on Functional Programming. ICFP will be held at Snowbird, Utah during Sept. 19-22. See http://www.cs.indiana.edu/icfp04/cfp/cfp.html for details. From dpw@CS.Princeton.EDU Mon Nov 10 13:58:41 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAAIwfEY005832 for ; Mon, 10 Nov 2003 13:58:41 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAAIwdYu029293 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 10 Nov 2003 13:58:40 -0500 (EST) Received: from bluebox.CS.Princeton.EDU (bluebox.CS.Princeton.EDU [128.112.136.38]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAAIwcIX002112 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 10 Nov 2003 13:58:39 -0500 (EST) Received: from mats (domi.CS.Princeton.EDU [128.112.95.106]) by bluebox.CS.Princeton.EDU (8.12.10/8.12.10) with ESMTP id hAAIvMi6014233; Mon, 10 Nov 2003 13:57:22 -0500 (EST) From: "David Walker" To: , , , , , , , , , , , , , , "'Types'" , Date: Mon, 10 Nov 2003 13:57:21 -0500 Organization: Princeton University Message-ID: <000001c3a7bc$7d2eb890$6a5f7080@mats> MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook, Build 10.0.4024 Importance: Normal X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2800.1165 X-Mailman-Approved-At: Mon, 10 Nov 2003 15:10:34 -0500 Cc: dpw@CS.Princeton.EDU Subject: POPL 04 Call for Participation X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list Reply-To: dpw@CS.Princeton.EDU List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 10 Nov 2003 18:58:41 -0000 Status: O X-Status: X-Keywords: X-UID: 39 =20 POPL '04 Call for Participation =20 31st Annual ACM SIGPLAN-SIGACT Symposium=20 on =20 Principles of Programming Languages January 14-16, 2003=20 Venice, Italy http://www.cs.princeton.edu/~dpw/popl/04/ =20 Scope of the Conference The annual Symposium on Principles Of Programming Languages is a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, and implementation of programming languages, programming systems, and programming abstractions. Important Dates * Hotel reservation deadline: November 30, 2003 <=3D=3D 3 weeks = left!! * Advance Registration deadline: December 31, 2003=20 * Main Conference: January 14-16, 2004=20 * Affiliated Events: January 11-13 and January 17, 2004 Conference Location & Hotels The 31st Symposium on Principles of Programming Languages will be held in the dramatic Venice, Italy, the Queen of the Adriatic. Venice is world renowned for its stunning architecture and unique series of canals. Thousands of people come to this great city every year to take in its varied art collections, restaurants, entertainment and exciting ambience. The main conference itself will be held in the impressive Auditorium S. Margherita. A banquet is scheduled for January 15, in the Hall of Mirrors of Ca' Zenobio, one of the most fascinating and important examples of Venetian late Baroque style, built at the end of the 17th century. Further information about the conference location may be found off the conference web site. Venice is always busy, so please book your travel arrangements well in advance. Information about reserving rooms in hotels specially booked for POPL attendees may be found at http://www.cs.princeton.edu/~dpw/popl/04/accomodation.htm=20 The deadline for making hotel reservations through the conference is November 30, 2003, so please do not delay. Conference Registration=20 Registration for POPL and affiliated workshops is now available at http://www.regmaster.com/popl2004.html. The advance registration deadline is December 31, 2003. Organization Program Chair: Xavier Leroy, INRIA Rocquencourt General Chair: Neil D. Jones, DIKU=20 Local Arrangements: Agostino Cortesi, Universita' ca' foscari Treasurer: Manuel F=E4hndrich, Microsoft Research Publicity: David Walker, Princeton University Program Committee Mart=EDn Abadi, University of California at Santa Cruz=20 Zena Ariola, University of Oregon=20 David F. Bacon, IBM T.J Watson Research Center=20 Thomas Ball, Microsoft Research=20 Maurizio Gabbrielli, University of Bologna=20 Philippa Gardner, Imperial College=20 Robert Harper, Carnegie Mellon University=20 Atsushi Igarashi, Kyoto University=20 John Launchbury, Galois Connection & Oregon Graduate Institute=20 Xavier Leroy, INRIA Rocquencourt=20 Mooly Sagiv, Tel Aviv University=20 Michael Schwartzbach, BRICS, University of Aarhus=20 Peter Sewell, University of Cambridge=20 Mary Lou Soffa, University of Pittsburgh Affiliated Events * Fifth International Conference on Verification, Model Checking,=20 and Abstract Interpretation (VMCAI'04)=20 o Dates: 11-13 January 2004=20 o Program Chairs: Giorgio Levi, Bernhard Steffen=20 o http://www.dsi.unive.it/~vmcai04 * Semantics, Program Analysis, and Computing Environments for=20 memory management (SPACE 2004)=20 o Date: Jan 12, 2004=20 o General Chairs: Fritz Henglein, Peter O'Hearn=20 o Program Chairs: Richard Jones, Greg Morrisett=20 o http://www.diku.dk/topps/space2004/ * Programming Language Technologies for XML (PLAN-X 2004)=20 o Date: Jan 13, 2004=20 o Program Chair: Michael I. Schwartzbach=20 o General Chair: Erik Meijer=20 o http://www.brics.dk/~mis/planx.html * Foundations of Object-Oriented Languages (FOOL)=20 o Date: Jan 17, 2004=20 o Program Chair: Sophia Drossopolou=20 o General Chair: Benjamin C. Pierce =20 o http://www.cis.upenn.edu/~bcpierce/FOOL * Fourth Continuation Workshop (CW '04)=20 o Date: Jan 17, 2004=20 o Program Chair: Hayo Thielecke=20 o http://www.cs.bham.ac.uk/~hxt/cw04/index.html From martin.odersky@epfl.ch Tue Nov 11 08:36:08 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hABDa8EY009388 for ; Tue, 11 Nov 2003 08:36:08 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hABDa7Yu020592 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Tue, 11 Nov 2003 08:36:08 -0500 (EST) Received: from lamppc34.epfl.ch (lamppc34.epfl.ch [128.178.154.43]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hABDa5IX003154 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Tue, 11 Nov 2003 08:36:07 -0500 (EST) Received: from lamppc34.epfl.ch (localhost.localdomain [127.0.0.1]) by lamppc34.epfl.ch (8.12.8/8.12.5) with ESMTP id hABDa5Kn020809 for ; Tue, 11 Nov 2003 14:36:05 +0100 Received: (from odersky@localhost) by lamppc34.epfl.ch (8.12.8/8.12.8/Submit) id hABDa43l020805; Tue, 11 Nov 2003 14:36:04 +0100 X-Authentication-Warning: lamppc34.epfl.ch: odersky set sender to martin.odersky@epfl.ch using -f Sender: odersky@lamppc34.epfl.ch To: types@cis.upenn.edu From: Martin Odersky Message-ID: Lines: 273 User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.3 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Mailman-Approved-At: Tue, 11 Nov 2003 08:40:27 -0500 Cc: Subject: ECOOP 04 Call for Contributions X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Date: Tue, 11 Nov 2003 13:36:09 -0000 X-Original-Date: 11 Nov 2003 14:36:04 +0100 X-List-Received-Date: Tue, 11 Nov 2003 13:36:09 -0000 Status: O X-Status: X-Keywords: X-UID: 40 [The following is a reminder of the ECOOP 2004 call for contributions and an announcement of a change in submission procedures. The deadline for initial submissions rests as before firm on Dec 1st; however, authors will be allowed to change or modify their electronic submission until and including Dec 7th]. CALL FOR CONTRIBUTIONS ECOOP 2004 18th European Conference on Object-Oriented Programming June 14-18, 2004 University of Oslo, Norway http://www.ifi.uio.no/ecoop2004/ ECOOP is the premier forum in Europe for bringing together practitioners, researchers, and students to share their ideas and experiences in a broad range of disciplines woven with the common thread of object technology. It is a well integrated collage of events, including outstanding invited speakers, carefully refereed technical papers, real world experiences in the form of practitioner reports, exciting panels, topic focused workshops, late-breaking demonstrations, and an interactive posters session. TECHNICAL PAPERS The ECOOP 2004 conference invites high quality papers reporting research results and/or experience related to object technology. Research papers should describe work that advances the current state of the art. Experience papers should be of broad interest and should describe insights gained from practical application of object technology - of use to other researchers and practitioners. The program committee will evaluate each contributed research and experience paper based on its relevance, significance, clarity, originality, and correctness. Suggested topics related to the object oriented paradigm include, but are not limited to: Analysis and design methods Concurrent, real-time, and parallel systems Database and object persistence Design patterns Distributed and mobile systems Frameworks and software architectures Language design and implementation Object testing and metrics Programming environments Reflection, aspects and adaptability Theoretical foundations, formal methods Versioning, compatibility, software evolution The conference will in particular welcome novel contributions based on new ideas or new areas for OO technology. Submission Guidelines Technical papers should be electronically submitted through the ECOOP 2004 online submission system at http://cyberchair.acm.org/ecooppapers/submit Other submissions will not be accepted. For information about formatting your paper please consult the Springer LNCS webpage Papers must be written in English, and be not longer than 10,000 words or 25 pages in Springer LNCS format. Referees will be allowed to ignore any material exceeding that limit for their evaluation. Papers clearly longer than the limit will be rejected immediately by the Program Chair. Please notice that ECOOP, along with other scientific conferences, accepts only original papers that have not been published and are not under review for publication elsewhere. Any double submissions will be rejected without review, and the other forum will be informed of the situation. Important Dates Start of electronic submission: Nov 1, 2003 Deadline for submission: Dec 1, 2003 (23.59 Apia, Samoa time) Notification of acceptance: Feb 9, 2004 Papers arriving later than the indicated deadline will be rejected immediately by the program chair. However, it will be possible for authors to modify or augment their submissions until and including Dec 7th, 2003. For further information about submissions, contact: Martin Odersky ECOOP 2004 Program Chair EPFL - Ecole Polytechnique Federale de Lausanne CH 1015 Lausanne, Switzerland Tel.: +41 21 693 6863 Fax: +41 21 693 6660 E-mail: ecoop2004@lamp.epfl.ch Program Committee Uwe Assmann, Linkopings Universitet, Sweden Don Batory, University of Texas at Austin, USA Gilad Bracha, Sun Microsystems, USA Luca Cardelli, Microsoft Research Cambridge, UK Charles Consel, LaBRI/INRIA, France Giuseppe Castagna, Ecole Normale Superieure, France Peter Dickman, University of Glasgow, UK Sophia Drossopoulou, Imperial College, UK Erik Ernst, University of Aarhus, Denmark Manuel Faehndrich, Microsoft Research, USA Giovanna Guerrini, University of Pisa, Italy Urs Hoelzle, Google, USA Mehdi Jazayeri, Technical University of Vienna, Austria Shriram Krishnamurthi, Brown University, USA Doug Lea, SUNY Oswego, USA Mira Mezini, Darmstadt University of Technology, Germany Oscar Nierstrasz, University of Bern, Switzerland Martin Odersky, EPFL, Switzerland Atushi Ohori, JAIST, Japan Luis Rodrigues, Universidade de Lisboa, Portugal Douglas Schmidt, Vanderbilt University, USA Clemens Szyperski, Microsoft Research, USA Philip Wadler, University of Edinburgh, UK TUTORIALS ECOOP 2004 hosts a two-day tutorial program. Proposals for high-quality tutorials in all areas of object-orientation from academic research to industrial applications are solicited. Tutorials are set up to last a half or full day, and should give a deeper or more covering insight into a particular area of object technology than a conventional lecture would do. Tutorial levels may be introductory, intermediate, or advanced. The main criteria for selecting tutorials will be the intrinsic interest and timeliness of the topic. Topics of broad interest will be preferred. Proposals should be electronically submitted through the ECOOP 2004 online submission system (will be available via http://www.ifi.uio.no/ecoop2004). Deadlines: Proposal submission: December 1, 2003 Notification of acceptance: February 1, 2004 For further information, contact: Arne-Joergen Berre, Sintef, Norway Sintef, Pb. 124 Blindern N-0314 Oslo, Norway Tel.: +47 22 06 74 52 E-mail: Arne.J.Berre@sintef.no or Hanspeter Moessenboeck Institute for Practical Computer Science Johannes Kepler Universitaet, Alterbergerstrasse 69, A-4040 Linz, Austria Tel.: +43 732 2468 7131 E-mail: moessenboeck@ssw.uni-linz.ac.at WORKSHOPS ECOOP 2004 will host a number of workshops addressing different areas of object-oriented technology. Workshops serve as a forum for exchanging late breaking ideas and theories in an evolutionary stage. They typically focus on either in depth analysis or broad-ranging approaches to areas related to object-oriented technology. Proposals should be electronically submitted through the ECOOP 2004 online submission system (will be available via http://www.ifi.uio.no/ecoop2004). Deadlines: Proposal submission: December 1, 2003 Notification of acceptance: February 1, 2001 For further information, contact: Bjarte M. Oestvold Norwegian Computing Center Gaustadalloen 23 P.O. Box 114 Blindern, N-0314 Oslo, Norway Tel. +47 22 85 25 00 E-mail: bjarte@nr.no or Jacques Malenfant Universite Pierre et Marie Curie Laboratoire d'informatique de Paris 6 8 rue du Capitaine Scott, F-75015 Paris, France Tel. +33 1 44 27 88 01 E-mail: Jacques.Malenfant@lip6.fr DEMOS, POSTERS, EXHIBIT AND PRACTITIONERS REPORT Live demonstrations of all kinds of object-oriented software will be presented at the conference. Technical members of the implementation teams are expected to give the demonstrations. Proposals are solicited for both commercial and in-house systems, as well as academic and corporate research. Demonstration will be selected on the basis of technical merit, novelty and relevance to object-oriented technology. Product marketing and sales presentations are inappropriate for this forum. Posters provide authors with a unique opportunity make ongoing work visible and to get feedback. Posters are especially useful for presenting new ideas that have not yet been developed to the point of a regular paper. PhD students in particular are encouraged to submit a poster proposal describing their work. Poster descriptions should be 2-3 pages in the same style as paper submissions and should also have an additional cover page (as a 'separate' first page in your document). At ECOOP there has traditionally been an exhibition of products and services related to object-orientation. The exhibition will be set up next to the main conference area, where participants have the opportunity to visit the stands, even during short breaks. ECOOP also welcomes practitioners reports and plan to set up a separate session of such reports from industry. Typically, a report will describe a project using OO-technology emphasizing some interesting experience. To many participants at ECOOP, these reports give a valuable insight into practical applications of OO technology. Proposals should be electronically submitted through the ECOOP 2004 online submission system (will be available via http://www.ifi.uio.no/ecoop2004). Demo and Poster Deadlines: Proposal submission: April 1, 2004 Notification of acceptance: May 1, 2004 For further information, contact: Ole Smoerdal InterMedia, University of Oslo Forskningsparken II Gaustadalleen 21 N-0349 Oslo Tel.: +47 93 08 04 73 E-mail: ole.smordal@intermedia.uio.no ORGANIZATION ECOOP 2004 is organized by Department of informatics at the University of Oslo in cooperation with Norwegian Computing Center and The Foundation for Scientific and Industrial Research (Sintef), under the auspices of AITO (Association internationale pour les technologies objects). The conference, tutorials and workshops will be held at the campus of University of Oslo. Executive Committee Conference Chair Birger Moeller-Pedersen, University of Oslo, Norway Program Chair Martin Odersky, EPFL - Ecole Polytechnique Federale de Lausanne Organizing Chair Arne Maus, University of Oslo, Norway From Eelco-Visser@xs4all.nl Wed Nov 12 18:06:30 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hACN6UEY018805 for ; Wed, 12 Nov 2003 18:06:30 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hACN6RYu005952 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 12 Nov 2003 18:06:28 -0500 (EST) Received: from smtpzilla3.xs4all.nl (smtpzilla3.xs4all.nl [194.109.127.139]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hACN6QIY015472 for ; Wed, 12 Nov 2003 18:06:27 -0500 (EST) Received: from localhost.localdomain (stratego.xs4all.nl [213.84.8.131]) by smtpzilla3.xs4all.nl (8.12.9/8.12.9) with ESMTP id hACN6Jom020202; Thu, 13 Nov 2003 00:06:19 +0100 (CET) From: Eelco Visser To: rewriting@ens-lyon.fr, types@cis.upenn.edu, users@mozart.oz.org, ipalist@win.tue.nl, plclub@cis.upenn.edu, plt-scheme@fast.cs.utah.edu Content-Type: text/plain; charset=UTF-7 Message-Id: <1068678379.2697.278.camel@localhost.localdomain> Mime-Version: 1.0 X-Mailer: Ximian Evolution 1.4.5 Date: Thu, 13 Nov 2003 00:06:19 +0100 Content-Transfer-Encoding: 7bit X-Mailman-Approved-At: Thu, 13 Nov 2003 08:47:27 -0500 Cc: "gpce-chairs@cs.uu.nl" Subject: Preliminary CFP: GPCE'04 -- Generative Programming and Component Engineering X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list Reply-To: Eelco Visser List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 12 Nov 2003 23:06:30 -0000 Status: O X-Status: X-Keywords: X-UID: 41 PRELIMINARY CALL FOR PAPERS ---------------------------------------------------------------------- Third International Conference on Generative Programming and Component Engineering (GPCE'04) Vancouver, October 24-28, 2004 co-located with OOPSLA 2004 http://gpce04.gpce.org ---------------------------------------------------------------------- ------------------------------------ Scope ------------------------------------ Generative and component approaches have the potential to revolutionize software development in a similar way as automation and components revolutionized manufacturing. Generative Programming (developing programs that synthesize other programs), Component Engineering (raising the level of modularization and analysis in application design), and Domain-Specific Languages (elevating program specifications to compact domain-specific notations that are easier to write and maintain) are key technologies for automating program development. GPCE arose as a joint conference, merging the prior conference on Generative and Component-Based Software Engineering (GCSE) and the Workshop on Semantics, Applications, and Implementation of Program Generation (SAIG). The goal of GPCE is to provide a meeting place for researchers and practitioners interested in cutting edge approaches to software development. We aim to foster further cross-fertilization between the software engineering research community on the one hand, and the programming languages community on the other, in addition to supporting the original research goals of both the GCSE and the SAIG communities. We seek papers both in software engineering and in programming languages, and especially those that bridge the gap and are accessible to both communities at the same time. ------------------------------------ Topics of Interest ------------------------------------ The conference solicits submissions related (but not limited) to: +ACo Generative programming o Reuse, meta-programming, partial evaluation, multi-stage and multi-level languages, step-wise refinement o Semantics, type systems, symbolic computation, linking and explicit substitution, in-lining and macros, templates, program transformation o Runtime code generation, compilation, active libraries, synthesis from specifications, development methods, generation of non-code artifacts, formal methods, reflection +ACo Generative techniques for o Product lines and architectures o Embedded systems o Model-driven architecture +ACo Component-based software engineering o Reuse, distributed platforms, distributed systems, evolution, analysis and design patterns, development methods, formal methods +ACo Integration of generative and component-based approaches +ACo Domain engineering and domain analysis o Domain-specific languages (DSLs) including visual and UML-based DSLs +ACo Separation of concerns o Aspect-oriented programming, feature-oriented programming, o Intentional programming, and multi-dimensional separation of concerns +ACo Industrial applications Reports on applications of these techniques to real-world problems are especially encouraged, as are submissions that relate ideas and concepts from several of these topics, or bridge the gap between theory and practice. The program committee is happy to advise on the appropriateness of a particular subject. ------------------------------------ Important Dates ------------------------------------ +ACo Pre-submission: March 12, 2004 (title +- abstract) +ACo Submission: March 19, 2004 +ACo Conference: 24-28 October 2004 ------------------------------------ Organization ------------------------------------ General chair +ACo Tim Sheard (OGI School of Science +ACY Engineering at OHSU) Program committee chairs +ACo Gabor Karsai (Vanderbilt University) +ACo Eelco Visser (Utrecht University) Program committee +ACo Uwe Assmann (Linkopings Universitet) +ACo Don Batory (University of Texas) +ACo Jan Bosch (Universiteit Groningen) +ACo Jean Bezivin (Universit+AOk de Nantes) +ACo Jim Cordy (Queen's University) +ACo Krzysztof Czarnecki (University of Waterloo) +ACo Mathew Flatt (University of Utah) +ACo Robert Glueck (University of Copenhagen) +ACo George Heineman (Worcester Polytechnic Institute) +ACo Michael Leuschel (University of Southampton) +ACo Karl Lieberherr (Northeastern University) +ACo Simon Peyton Jones (Microsoft Research) +ACo Douglas R. Smith (Kestrel Institute) +ACo Gabriele Taentzer (Technical University of Berlin) +ACo Todd Veldhuizen (Indiana University) +ACo Kris de Volder (University of Britisch Columbia) +ACo Dave Wile (Teknowledge Corp.) +ACo Alexander Wolf (University of Colorado at Boulder) Contact +ACo gpce-chairs+AEA-cs.uu.nl From fairouz@macs.hw.ac.uk Thu Nov 13 06:14:54 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hADBEsEY020425 for ; Thu, 13 Nov 2003 06:14:54 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hADBErYu003327 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 13 Nov 2003 06:14:53 -0500 (EST) Received: from izanami.macs.hw.ac.uk (izanami.macs.hw.ac.uk [137.195.13.6]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hADBEpIX015403 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 13 Nov 2003 06:14:52 -0500 (EST) Received: from surya ([137.195.13.8] helo=surya.macs.hw.ac.uk) by izanami.macs.hw.ac.uk with esmtp (Exim 4.20) id 1AKFRj-0008UI-Qh; Thu, 13 Nov 2003 11:15:31 +0000 Received: from fairouz by surya.macs.hw.ac.uk with local (Exim 4.10) id 1AKFQw-0006Vd-00; Thu, 13 Nov 2003 11:14:42 +0000 To: amast@cs.utwente.nl, EAPLS@JISCMAIL.AC.UK, ipalist@win.tue.nl, meta-announce@cwi.nl, rewriting@ens-lyon.fr, types@cis.upenn.edu, ypes-wg@durham.ac.uk Message-Id: From: Fairouz Kamareddine Date: Thu, 13 Nov 2003 11:14:42 +0000 X-Spam-Status: No, hits=0.5 required=7.0 tests=SPAM_PHRASE_01_02 version=2.43 X-Spam-Level: X-Mailman-Approved-At: Thu, 13 Nov 2003 08:48:01 -0500 Cc: fairouz@macs.hw.ac.uk Subject: Program announcement and call for participation X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 13 Nov 2003 11:14:54 -0000 Status: O X-Status: X-Keywords: X-UID: 42 Mathematical Knowledge Management Symposium 25-29 November 2003 Heriot-Watt University, Edinburgh, Scotland http://www.macs.hw.ac.uk/~fairouz/mkm-symposium03/ http://www.macs.hw.ac.uk/~fairouz/mkm-symposium03/program.html ------------------------------------------------ |Program announcement and call for participation| ------------------------------------------------ The program is now available at the above URL. If you wish to participate, contact Fairouz Kamareddine, email: fairouz@macs.hw.ac.uk From paulegre@magic.fr Thu Nov 13 04:34:32 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAD9YWEY020285 for ; Thu, 13 Nov 2003 04:34:32 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAD9YWYu000255 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 13 Nov 2003 04:34:32 -0500 (EST) Received: from quito.magic.fr (quito.magic.fr [62.210.158.45]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAD9YUIW025331 for ; Thu, 13 Nov 2003 04:34:31 -0500 (EST) Received: from oemtwc (ppp-118.net-101.magic.fr [62.210.208.118]) by quito.magic.fr (8.11.6/8.11.2) with SMTP id hAD9YOv02414 for ; Thu, 13 Nov 2003 10:34:24 +0100 (CET) Message-ID: <011101c3a9d2$0ec195e0$76d0d23e@oemtwc> From: =?iso-8859-1?B?UGF1bCBFZ3Lp?= To: Date: Thu, 13 Nov 2003 10:36:54 -0000 MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="----=_NextPart_000_010C_01C3A9D2.0E08F440" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.2615.200 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2615.200 X-Mailman-Approved-At: Thu, 13 Nov 2003 08:49:16 -0500 Cc: Subject: CfP: ESSLLI'04 Student session X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 13 Nov 2003 09:34:33 -0000 Status: O X-Status: X-Keywords: X-UID: 43 This is a multi-part message in MIME format. ------=_NextPart_000_010C_01C3A9D2.0E08F440 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 8bit Please find enclosed the following Call for Papers for the student session of the next ESSLLI summer school. Thank you for circulating it: the ESSLLI summer school addresses a number of topics of interest for type theorists. Classes at ESSLLI'04, in particular, will include several course on type-logical grammars, and submissions of papers by students on this topic are welcome at the ESSLLI student session. For further information, please consult the ESSLLI'04 programm at http://esslli2004.loria.fr Thank you, Paul Egré ESSLLI'04 Student Session Programme Committee, Chair ------=_NextPart_000_010C_01C3A9D2.0E08F440 Content-Type: text/plain; name="CfP2.txt" Content-Transfer-Encoding: quoted-printable Content-Disposition: attachment; filename="CfP2.txt" CALL FOR PAPERS ESSLLI-2004 STUDENT SESSION 9-20 August, 2004 in Nancy, France Deadline: February 22, 2004 http://esslli2004.loria.fr/ =20 We are pleased to announce the Student Session of the 16th European Summer School in Logic, Language and Information (ESSLLI-2004), which will be held in Nancy from August 9-20, 2004. We invite=20 submission of papers for presentation at the ESSLLI-2004 Student=20 Session and for appearance in the proceedings. PURPOSE: This ninth ESSLLI Student Session will provide, like the previous editions, an opportunity for ESSLLI participants who are students to present their own work in progress and get feedback from senior researchers and fellow-students. The ESSLLI Student Session encourages submissions from students at any level, undergraduates (before completion of the Master Thesis) as well as postgraduates (before completion of the PhD degree). Papers co-authored by non-students will not be accepted. Papers may be accepted for full presentation (30 minutes including 5 to 10 minutes of discussion) or for = a poster presentation. All the accepted papers will be published in=20 the ESSLLI-2004 Student Session proceedings, which will be made=20 available during the summer school. REQUIREMENTS: The Student Session papers should describe original, unpublished=20 work, completed or in progress, that demonstrates insight, creativity,=20 and promise. No previously published papers should be submitted. We=20 welcome submissions with topics within the areas of Logic, Language and=20 Computation. SUBMISSION DETAILS: Student authors are invited to submit a full paper, not to exceed 7 = pages of=20 length exclusive of references. Note that the length of the final=20 version of the accepted papers will not be allowed to exceed 10=20 pages. The submissions will be reviewed by the student session programme = committee and additional reviewers. A plain ASCII text version of the = identification page should be sent separately, using the following format: Title: title of the submission=20 First author: firstname lastname Address: address of the first author=20 ......=20 Last author: firstname lastname=20 Address: address of the last author=20 Short summary: abstract (5 lines)=20 Subject area (one or two of): Logic | Language | Computation In case the paper is being submitted to another conference or=20 workshop, this must be clearly indicated on the identification page. The preferred formats of submissions are PostScript, PDF, or plain text, although other formats will also be accepted. In case of acceptance, the = final version of the paper will have to be submitted in LaTeX format. = The papers must use single column A4 size pages, 11pt or 12pt fonts, and = standard margins. Submissions not in accordance with the specified = formatting and length requirements may be subject to rejection without = review.=20 The paper and separate identification page must be sent electronically = to: paulegre@magic.fr by FEBRUARY 22, 2004. PROGRAMME COMMITTEE: Laura Alonso i Alemany (Universitat de Barcelona, Barcelona) Carlos Areces (LORIA, Nancy) Jaume Baixeries (Universitat Polit=E8cnica de Catalunya, Barcelona) Willem Comradie (Rand Afrikaans University, South Africa) Benoit Crabb=E9 (LORIA, Nancy) Paul Egr=E9 (IHPST, Universit=E9 Paris 1, IJN) Judit Gervain (SISSA, Trieste) Bart Geurts (University of Nijmegen, Nijmegen) Ivana Kruijff-Korbayova (Universit=E4t des Saarlandes, Saarbr=FCcken) Marco Kuhlmann (Universit=E4t des Saarlandes, Saarbr=FCcken) M=AA Magdalena Ortiz de la Fuente (Universidad de las Americas, Puebla) Benjamin Spector (Laboratoire de Linguistique Formelle, Universit=E9 = Paris 7, ENS) IMPORTANT DATES: Deadline for submission of papers : February 22, 2004. Authors notifications : April 19, 2004. ESSLLI early registration : May 1, 2004. Final papers for proceedings : May 15, 2004. ESSLLI-2004 Student Session : August 9-20, 2004. =20 ESSLLI-2004 INFORMATION: In order to present a paper at ESSLLI-2004 Student Session, at least=20 one student author of each accepted paper has to register as a=20 participant at ESSLLI-2004. The authors of accepted papers will be=20 eligible for reduced registration fees even after the deadline for=20 early registration. For all information concerning ESSLLI-2004,=20 please consult the ESSLLI-2004 main website at = http://esslli2004.loria.fr/ For more information about the ESSLLI'04 student session, consult the = ESSLLI'04 student session website at: http: //lingua.fil.ub.es/~lalonso/stusESSLLI04. If you have any further question about the student session, do not = hesitate to contact us: Laura Alonso i Alemany Paul Egr=E9 lalonso@fil.ub.es paulegre@magic.fr Departament de Ling=FC=EDstica General IHPST / Universit=E9 = Paris 1 / Institut Jean-Nicod Gran Via de les Corts Catalanes, 585 Institut d'Histoire et = de Philosophie des Sciences et Techniques Universitat de Barcelona 13, rue du Four Barcelona, SPAIN 75006 Paris, FRANCE telephone number: +34 93 403 56 93 telephone number: + (33) = (0)1 43 54 60 36=20 fax number: +34 93 318 98 22 fax number: + (33) (0)1 = 44 07 16 49=20 =20 =09 ------=_NextPart_000_010C_01C3A9D2.0E08F440-- From zeller@cs.uni-sb.de Fri Nov 14 12:22:16 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAEHMGEY028905 for ; Fri, 14 Nov 2003 12:22:16 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAEHMFYu026157 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 14 Nov 2003 12:22:15 -0500 (EST) Received: from uni-sb.de (uni-sb.de [134.96.252.33]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAEHMEIW025974 for ; Fri, 14 Nov 2003 12:22:14 -0500 (EST) Received: from cs.uni-sb.de (cs.uni-sb.de [134.96.252.31]) by uni-sb.de (8.12.10/2003073000) with ESMTP id hAEHMCXA009407 for ; Fri, 14 Nov 2003 18:22:13 +0100 (CET) Received: from mail.cs.uni-sb.de (mail.cs.uni-sb.de [134.96.254.200]) by cs.uni-sb.de (8.12.10/2003091100) with ESMTP id hAEHLZgx005685 for ; Fri, 14 Nov 2003 18:22:11 +0100 (CET) Received: from mail.st.cs.uni-sb.de (goscinny.cs.uni-sb.de [134.96.235.32]) by mail.cs.uni-sb.de (8.12.10/2003073000) with ESMTP id hAEHGbDj007887 for ; Fri, 14 Nov 2003 18:16:41 +0100 (CET) X-Authentication-Warning: email: Host goscinny.cs.uni-sb.de [134.96.235.32] claimed to be mail.st.cs.uni-sb.de Received: from giraud.cs.uni-sb.de (giraud.cs.uni-sb.de [134.96.235.136]) by mail.st.cs.uni-sb.de (Postfix) with ESMTP id E3DAD34B1AA for ; Fri, 14 Nov 2003 18:16:36 +0100 (CET) Received: by giraud.cs.uni-sb.de (Postfix, from userid 7001) id 9B9D05F711; Fri, 14 Nov 2003 18:16:36 +0100 (CET) From: Andreas Zeller MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <16309.3569.618746.292080@giraud.cs.uni-sb.de> Date: Fri, 14 Nov 2003 18:16:33 +0100 To: Types forum X-Mailer: VM 7.03 under 21.4 (patch 6) "Common Lisp" XEmacs Lucid X-Face: #NChu>5Y'i4]ij,:]2`bIksKEG`Sr_==:yd?K5>QWFX9H]qhG3&2ICCFpTT\@$guG5pN`&G<*h'-uy3NY2r+XPm}5EHDTHZURJ@.'|4'h](=MwHT x[RZ3TI, )>*96Z):z5RR-R#0fT]MkFE41(D?`&\u44g%>>8~on|1Z)W#Yb6Yd|D)H0|CxktK>np, Ue SK% X-Mailman-Approved-At: Fri, 14 Nov 2003 13:34:09 -0500 Cc: Subject: CFP: PASTE 2004 - Program Analysis for Software Tools and Engineering X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 14 Nov 2003 17:22:17 -0000 Status: O X-Status: X-Keywords: X-UID: 44 -------------------------------------------------------------------- ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE 2004) Washington, DC, June 7-8, 2004 co-located with PLDI http://www.st.cs.uni-sb.de/paste/ -------------------------------------------------------------------- CALL FOR PAPERS The goal of PASTE is to bring together members of the program analysis, software tools, and software engineering communities to focus on _applications of program analysis techniques in software tools_. PASTE 2004 will provide a forum for the presentation of exciting new research and empirical results in areas including (but not limited to): * program analysis for program understanding, debugging, testing, and reverse engineering * integration of program analysis into programming environments * user interfaces for software tools and software visualization * applications of program slicing and model checking * analysis of program execution or program evolution * integration of different analysis techniques PASTE 2004, co-located with PLDI (http://www.cs.umd.edu/~pugh/pldi04/), will be a true workshop, with a duration of 1 1/2 to 2 days. As well as discussions on areas of widespread interest, we will have a number of invited talks and presentations of refereed papers to provide a shared context for these discussions. We also plan to allow all attendants to make a short (five minute) presentation of their work. Attendance is open, although enrollment will be capped at 80 people. Students are encouraged to attend and may apply for support from the SIGSOFT Conference Attendance Program (http://www.cs.williams.edu/~lerner/sigsoft/CAPS.html). A proceedings of invited and regular papers will be published by SIGSOFT or SIGPLAN. We are soliciting papers in two distinct categories: SHORT PAPERS. Short papers that discuss controversial issues in the field, or describe interesting or thought-provoking ideas that are not yet fully developed. (3 page limit) LONG PAPERS. Research papers that describe ongoing research or new results. (6 page limit) The program committee will aim to select a program containing a mix of the best submitted papers in each category that may ignite discussion or inspire new research. Long papers will be expected to have a somewhat higher degree of technical rigor than short papers. Papers should be formatted in 10 point type using the ACM SIG templates (http://www.acm.org/sigs/pubs/proceed/template.html), and, including figures and references, should not exceed the page limit. Submission of papers in PDF (preferred) and/or Postscript format will be accepted at the PASTE submission page (http://www.st.cs.uni-sb.de/paste/). DATES Submissions due February 9, 2004 Acceptance notification March 22, 2004 PASTE workshop June 7-8, 2004 WORKSHOP CO-CHAIRS * Cormac Flanagan, UC Santa Cruz * Andreas Zeller, Saarland University PROGRAM COMMITTEE * Michael Ernst, Massachusetts Institute of Technology * John Field, IBM T.J. Watson Research Center * Dan Grossman, University of Washington * Rainer Koschke, University of Stuttgart * Shriram Krishnamurthi, Brown University * Michal Young, University of Oregon Visit the PASTE Web site at http://www.st.cs.uni-sb.de/paste/ PASTE 2004 is sponsored by - the Association for Computing Machinery (ACM), - the ACM Special Interest Group on Programming Languages (SIGPLAN), and - the ACM Special Interest Group on Software Engineering (SIGSOFT). -- Andreas Zeller Universitaet des Saarlandes, Saarbruecken, Germany http://www.st.cs.uni-sb.de/~zeller/ From jhines@haverford.edu Sat Nov 15 12:10:37 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAFHAbEY032659 for ; Sat, 15 Nov 2003 12:10:37 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAFHAaYu020040 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Sat, 15 Nov 2003 12:10:36 -0500 (EST) Received: from ms1.haverford.edu (ms1.haverford.edu [165.82.1.60]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAFHAZIW006951 for ; Sat, 15 Nov 2003 12:10:36 -0500 (EST) Received: from nisc8.haverford.edu (nisc8.haverford.edu [165.82.1.32]) by ms1.haverford.edu (8.12.9/8.12.9) with ESMTP id hAFHDI0w016436 for ; Sat, 15 Nov 2003 12:13:18 -0500 (EST) Message-Id: <200311151713.hAFHDI0w016436@ms1.haverford.edu> Content-Type: text/plain Content-Disposition: inline Content-Transfer-Encoding: binary X-Mailer: EMUmail 5.1 X-Originating-Ip: 165.82.172.79 X-Webmail-User: jhines@pobox.haverford.edu To: types@cis.upenn.edu MIME-Version: 1.0 X-Http_host: webmail.haverford.edu From: jhines@haverford.edu Date: Sat, 15 Nov 2003 12:19:47 EST HC-Host: Scanned by NISC3, Networking & Systems, Haverford College, Haverford, PA 19041. [v002] HC-MailScanner: Found to be clean X-Mailman-Approved-At: Mon, 17 Nov 2003 08:47:38 -0500 Cc: Subject: equational proof checker for lambda calculus? X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list Reply-To: jhines@haverford.edu List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sat, 15 Nov 2003 17:10:37 -0000 Status: O X-Status: X-Keywords: X-UID: 45 Does there exist a simple proof checker for equational proofs with format something like this? ( (\x. (x x)) (\y. (y (\z. z))) ) = beta-reduce ( (\x. (x (\y. y))) (\z. (z (\w. w))) ) = beta-reduce ( (\x. (x (\y. y))) (\z. z) ) = beta-reduce ( (\x. x) (\y.y) ) = beta-expand ( (\x. (x x)) (\y.y) ) The format would be something like a sequence of (closed?) lambda-terms, related one to the next by beta (or eta) reduction/expansion. Am I correct in believing that, (though not usable in general), it could be useful for (the homework for) those few lectures where one talks about programming in the pure lambda calculus (i.e. natural numbers, booleans, pairs)? In reading Paul Hudak's School of Expression, he seemed to imply that this kind of proof (proof-by-calculation) is useful for programming in Haskell, and he does not routinely use a proof checker. I've read a paper by Michael Norrish ("Mechanising Hankin and Barendregt using the Gordon-Melham Axioms"), which discusses mechanising some much more sophisticated lambda-calculus proofs. This makes me think that I could do this kind of proof in HOL, but HOL is scary; I think I could write a checker more quickly than I could become comfortable in HOL. Thanks for any information you could send me. Johnicholas Hines From wadler@inf.ed.ac.uk Wed Nov 19 07:19:22 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAJCJMEY025667 for ; Wed, 19 Nov 2003 07:19:22 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAJCJLYu027760 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 19 Nov 2003 07:19:21 -0500 (EST) Received: from topper.inf.ed.ac.uk (topper.inf.ed.ac.uk [129.215.32.40]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAJCJLIW028641 for ; Wed, 19 Nov 2003 07:19:21 -0500 (EST) Received: from inf.ed.ac.uk (dhcp-199-141.dcs.ed.ac.uk [129.215.199.141]) by topper.inf.ed.ac.uk (8.11.6/8.11.6) with ESMTP id hAJCJJr23090; Wed, 19 Nov 2003 12:19:19 GMT Date: Wed, 19 Nov 2003 13:21:02 +0100 Content-Type: text/plain; charset=US-ASCII; format=flowed Mime-Version: 1.0 (Apple Message framework v552) To: types@cis.upenn.edu From: Philip Wadler Content-Transfer-Encoding: 7bit Message-Id: X-Mailer: Apple Mail (2.552) X-Mailman-Approved-At: Wed, 19 Nov 2003 08:23:51 -0500 Cc: Philip Wadler Subject: (no subject) X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 19 Nov 2003 12:19:22 -0000 Status: O X-Status: X-Keywords: X-UID: 46 I have a basic question about the system LU, as introduced by: J.-Y. Girard, On The Unity of Logic, Annals of Pure and Applied Logic 59:201--217, 1993. I need here only a small fragment of the system, and do not require polarities. Write G for Gamma, D for Delta, L for Lambda, P for Pi. Sequents have the form: G; G' |- D'; D Weakening and contraction apply to G' and D', but not G and D. Here are some of the rules: ------Id A;|-;A G;G'|-D';D,A A,L;G'|-D';P ---------------------------Cut G,L;G'|-D';D,P G,A;G'|-D';D ------------Dereliction G;A,G'|-D';D ;G'|-D';A ----------!R ;G'|-D';!A G;A,G'|-D';D -------------!L G,!A;G'|-D';D Consider the following proof ------Id ------Id B;|-;B B;|-;B ------Dereliction ------Dereliction ;B|-;B ;B|-;B -------!R -------!R ;B|-;!B ;B|-;!B ---------------------------------otimes-R A, A-o!B;|-;!B ;B|-;!B otimes !B ------------------------------------------Cut A, A-o!B;|-;!B How does one eliminate the Cut from this proof? This problem is closely related to one identified in the natural deduction formulation of linear logic by Hyland et al., and also discussed in my paper, "There's no substitute for linear logic". Cheers, -- P Philip Wadler, Professor of Theoretical Computer Science Informatics, University of Edinburgh JCMB, King's Buildings, Mayfield Road Edinburgh EH9 3JZ SCOTLAND +44 131 650 5174 http://homepages.inf.ed.ac.uk/wadler/ From alberto@urano.sip.ucm.es Wed Nov 19 05:02:39 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAJA2dEY025452 for ; Wed, 19 Nov 2003 05:02:39 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAJA2cYu023619 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 19 Nov 2003 05:02:39 -0500 (EST) Received: from urano.sip.ucm.es (urano.sip.ucm.es [147.96.80.61]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAJA2aIX028704 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 19 Nov 2003 05:02:37 -0500 (EST) Received: from urano.sip.ucm.es (urano [127.0.0.1]) by urano.sip.ucm.es (8.12.9/8.12.9/Debian-5) with ESMTP id hAJA0fbo007073 for ; Wed, 19 Nov 2003 11:00:41 +0100 Received: (from alberto@localhost) by urano.sip.ucm.es (8.12.9/8.12.9/Debian-5) id hAJA0f6r007070; Wed, 19 Nov 2003 11:00:41 +0100 Date: Wed, 19 Nov 2003 11:00:41 +0100 Message-Id: <200311191000.hAJA0f6r007070@urano.sip.ucm.es> To: types@cis.upenn.edu From: alberto@sip.ucm.es X-Mailman-Approved-At: Wed, 19 Nov 2003 08:24:30 -0500 Cc: Subject: WRLA 2004 - Last call for papers (EXTENDED DEADLINE) X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 19 Nov 2003 10:02:39 -0000 Status: O X-Status: X-Keywords: X-UID: 47 [[ -- Apologies for multiple copies of this message -- ]] + + + + + WRLA'04 + + + + + LAST CALL FOR PAPERS + + + + + WRLA'04 + + + + + EXTENDED DEADLINE +----------------------------------------------------------+ | | | 5th International Workshop on | | Rewriting Logic and its Applications | | | | W R L A 2004 | | | | Barcelona, Spain, March 27-28, 2004 | | | | http://www.fdi.ucm.es/wrla2004 | +----------------------------------------------------------+ The workshop will be held in conjunction with ETAPS 2004 7th European Joint Conferences on Theory and Practice of Software March 27 - April 4, 2004 http://www.lsi.upc.es/etaps04 IMPORTANT DATES December 1, 2003 Deadline for submission (EXTENDED!) January 15, 2004 Notification of acceptance February 18, 2004 Final version in electronic form March 27-28, 2004 Workshop in Barcelona AIMS AND SCOPE Rewriting logic (RL) is a natural model of computation and an expressive semantic framework for concurrency, parallelism, communication and interaction. It can be used for specifying a wide range of systems and languages in various application fields. It also has good properties as a metalogical framework for representing logics. In recent years, several languages based on RL (ASF+SDF, CafeOBJ, ELAN, Maude) have been designed and implemented. The aim of the workshop is to bring together researchers with a common interest in RL and its applications, and to give them the opportunity to present their recent works, discuss future research directions, and exchange ideas. The topics of the workshop comprise, but are not limited to, * foundations and models of RL; * languages based on RL, including implementation issues; * RL as a logical framework; * RL as a semantic framework, including applications of RL to - object-oriented systems, - concurrent and/or parallel systems, - interactive, distributed, open ended and mobile systems, - specification of languages and systems; * extensions of RL, including - real-time and probabilistic extensions, - tile logic, - rewriting approaches to behavioral specifications; * verification techniques for RL specifications, including - equational and coherence methods, and - verification of properties expressed in modal and temporal logics; * comparisons of RL with existing formalisms having analogous aims, including - rho-calculus, - structural operational semantics, - concurrency calculi, - dynamic algebras. PAST EVENTS Previous WRLA workshops have been organized in - Asilomar, California, September 3-6, 1996, - Pont-a-Mousson, France, September 1-4, 1998, - Kanazawa, Japan, September 18-20, 2000, - Pisa, Italy, September 19-21, 2002. The proceedings of the WRLA workshops have been published as volumes 4, 15, 36, and 71 in the Elsevier ENTCS series, available at http://www.elsevier.nl/locate/entcs Selected papers from WRLA'96 have been published in a special issue of Theoretical Computer Science, Volume 285(2), 2002. LOCATION WRLA 2004 will be held in Barcelona, Spain in March 27-28, 2004. It is a satellite workshop of ETAPS 2004, the European Joint Conferences on Theory and Practice of Software. For venue, registration and suggested accommodation see the ETAPS 2004 web page http://www.lsi.upc.es/etaps04 For information about Barcelona, see among others the city web page http://www.bcn.es/english/ihome.htm PROGRAM COMMITTEE David Basin ETH Zurich Manuel Clavel Universidad Complutense de Madrid Steven Eker SRI International, Menlo Park Kokichi Futatsugi JAIST, Tatsunokuchi Fabio Gadducci Universita di Pisa Alexander Knapp LMU, Muenchen Claude Kirchner INRIA Lorraine & LORIA, Nancy Salvador Lucas Universidad Politecnica de Valencia Narciso Marti-Oliet Universidad Complutense de Madrid (Chair) Jose Meseguer University of Illinois at Urbana-Champaign Ugo Montanari Universita di Pisa Pierre-Etienne Moreau INRIA Lorraine & LORIA, Nancy Grigore Rosu University of Illinois at Urbana-Champaign Carolyn Talcott SRI International, Menlo Park SUBMISSIONS Submissions will be evaluated by the Program Committee for inclusion in the proceedings, which will be available at the time of the workshop and are expected to be published in the Elsevier ENTCS series. Papers must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. They must be unpublished and not submitted simultaneously for publication elsewhere. Papers (of at most 15 pages) should be submitted electronically, preferably as PDF files, to the workshop email address wrla2004@sip.ucm.es providing also a text-only abstract, and detailed contact information of the corresponding author. The final program of the workshop will also include system demonstrations and two invited presentations by Gilles Dowek Ecole Polytechnique & INRIA, Palaiseau Mario Rodriguez-Artalejo Universidad Complutense de Madrid Based on the quality and interest of the accepted papers, the program committee will study the possibility of preparing a special issue of a scientific journal in the field. ORGANIZING COMMITTEE Narciso Marti-Oliet, Manuel Clavel, and Alberto Verdejo Departamento de Sistemas Informaticos y Programacion Universidad Complutense de Madrid, Spain CONTACT INFORMATION For more information, please contact the organizers wrla2004@sip.ucm.es or visit the workshop web page http://www.fdi.ucm.es/wrla2004 IMPORTANT DATES December 1, 2003 Deadline for submission (EXTENDED!) January 15, 2004 Notification of acceptance February 18, 2004 Final version in electronic form March 27-28, 2004 Workshop in Barcelona + + + + + WRLA'04 + + + + + LAST CALL FOR PAPERS + + + + + WRLA'04 + + + + + From Frank_Pfenning@altosax.concert.cs.cmu.edu Wed Nov 19 15:55:19 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAJKtJEY031335 for ; Wed, 19 Nov 2003 15:55:19 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAJKtIYu022034 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 19 Nov 2003 15:55:18 -0500 (EST) Received: from altosax.concert.cs.cmu.edu (ALTOSAX.CONCERT.CS.CMU.EDU [128.2.220.149]) by central.cis.upenn.edu (8.12.10/8.12.9) with SMTP id hAJKtHIW018933 for ; Wed, 19 Nov 2003 15:55:17 -0500 (EST) Received: from altosax.concert.cs.cmu.edu ([127.0.0.1]) by altosax.concert.cs.cmu.edu id aa23894; 19 Nov 2003 15:55 EST To: Philip Wadler From: Frank Pfenning In-reply-to: Your message of Wed, 19 Nov 2003 13:21:02 +0100. <200311191831.hAJIVlRQ004898@saul.cis.upenn.edu> Date: Wed, 19 Nov 2003 15:55:08 -0500 Message-ID: <23892.1069275308@altosax.concert.cs.cmu.edu> Sender: Frank_Pfenning@altosax.concert.cs.cmu.edu X-Mailman-Approved-At: Wed, 19 Nov 2003 15:57:31 -0500 Cc: types@cis.upenn.edu Subject: Re: Cut-Elimination in Linear Logic (was: (no subject)) X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list Reply-To: Frank Pfenning List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 19 Nov 2003 20:55:19 -0000 Status: O X-Status: X-Keywords: X-UID: 48 Hi Phil, the question is addressed in Frank Pfenning. Structural cut elimination in linear logic. Technical Report CMU-CS-94-222, Department of Computer Science, Carnegie Mellon University, December 1994. http://www.cs.cmu.edu/~fp/papers/cutlin94.pdf A newer paper treating the intuitionistic case (and natural deduction): A Judgmental Analysis of Linear Logic Bor-Yuh Evan Chang, Kaustuv Chaudhuri, and Frank Pfenning. Technical Report CMU-CS-03-131, April 2003. http://www.cs.cmu.edu/~fp/papers/jill03.pdf This second paper is currently under revision, but as far as cut-elimination is concerned it is close enough. Literally, what you call "cut" in your example is not an instance of your cut rule, because the formulas "B" and "!B" do not match, but you can see from the above papers how this can be fixed. - Frank > Date: Wed, 19 Nov 2003 13:21:02 +0100 > To: types@cis.upenn.edu > CC: Philip Wadler > From: Philip Wadler > Subject: (no subject) > > [----- The Types Forum, http://www.cis.upenn.edu/~bcpierce/types -----] > > I have a basic question about the system LU, as introduced by: > > J.-Y. Girard, On The Unity of Logic, > Annals of Pure and Applied Logic 59:201--217, 1993. > > I need here only a small fragment of the system, and do not require > polarities. Write G for Gamma, D for Delta, L for Lambda, P for Pi. > > Sequents have the form: > > G; G' |- D'; D > > Weakening and contraction apply to G' and D', but not G and D. > > Here are some of the rules: > > ------Id > A;|-;A > > G;G'|-D';D,A A,L;G'|-D';P > ---------------------------Cut > G,L;G'|-D';D,P > > G,A;G'|-D';D > ------------Dereliction > G;A,G'|-D';D > > ;G'|-D';A > ----------!R > ;G'|-D';!A > > G;A,G'|-D';D > -------------!L > G,!A;G'|-D';D > > Consider the following proof > > ------Id ------Id > B;|-;B B;|-;B > ------Dereliction ------Dereliction > ;B|-;B ;B|-;B > -------!R -------!R > ;B|-;!B ;B|-;!B > ---------------------------------otimes-R > A, A-o!B;|-;!B ;B|-;!B otimes !B > ------------------------------------------Cut > A, A-o!B;|-;!B > > How does one eliminate the Cut from this proof? > > This problem is closely related to one identified in the natural > deduction > formulation of linear logic by Hyland et al., and also discussed in my > paper, > "There's no substitute for linear logic". > > Cheers, -- P > > > Philip Wadler, Professor of Theoretical Computer Science > Informatics, University of Edinburgh > JCMB, King's Buildings, Mayfield Road > Edinburgh EH9 3JZ SCOTLAND > +44 131 650 5174 http://homepages.inf.ed.ac.uk/wadler/ From wand@ccs.neu.edu Wed Nov 19 16:05:47 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAJL5lEY031390 for ; Wed, 19 Nov 2003 16:05:47 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAJL5kYu022739 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 19 Nov 2003 16:05:47 -0500 (EST) Received: from amber.ccs.neu.edu (amber.ccs.neu.edu [129.10.116.51]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAJL5kIW022332 for ; Wed, 19 Nov 2003 16:05:46 -0500 (EST) Received: from alnilam.ccs.neu.edu (alnilam.ccs.neu.edu [129.10.117.107]) by amber.ccs.neu.edu (Postfix) with ESMTP id 603C45427F; Wed, 19 Nov 2003 16:05:46 -0500 (EST) Received: from wand by alnilam.ccs.neu.edu with local (Exim 4.20) id 1AMZWE-0006Qw-6i; Wed, 19 Nov 2003 16:05:46 -0500 From: Mitchell Wand MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <16315.56106.107971.35121@alnilam.ccs.neu.edu> Date: Wed, 19 Nov 2003 16:05:46 -0500 To: jhines@haverford.edu In-Reply-To: <200311192011.hAJKBLaT012435@saul.cis.upenn.edu> References: <200311192011.hAJKBLaT012435@saul.cis.upenn.edu> X-Mailer: VM 6.95 under Emacs 19.34.1 Sender: Mitchell Wand X-Mailman-Approved-At: Wed, 19 Nov 2003 16:08:27 -0500 Cc: "Gregory T. Sullivan" , types@cis.upenn.edu Subject: equational proof checker for lambda calculus? X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 19 Nov 2003 21:05:48 -0000 Status: O X-Status: X-Keywords: X-UID: 49 > Does there exist a simple proof checker for equational proofs > with format something like this? > ( (\x. (x x)) (\y. (y (\z. z))) ) > = beta-reduce > ( (\x. (x (\y. y))) (\z. (z (\w. w))) ) > = beta-reduce > ( (\x. (x (\y. y))) (\z. z) ) > = beta-reduce > ( (\x. x) (\y.y) ) > = beta-expand > ( (\x. (x x)) (\y.y) ) Yes, Greg Sullivan and I wrote something like that around 1993. We called it MSTP (Mitch's Simple Theorem Prover). The basic idea was to allow simple rules, not just beta, and to check a proof using alpha-matching (ie, pattern-matching that is aware of scoping and alpha-conversion). We wrote a short paper about it, which was never published. We managed to prove some simple things with it, but we eventually decided that it was not going to extend to the examples we wanted to do, so we dropped it. I've put up the directory at http://www.ccs.neu.edu/home/wand/research/mstp . It's in Scheme. WYSISWYG. YMMV. No warranties or Guarantees. Good luck, though if you're really interested I can try to help. --Mitch Wand From michaeln@axiom.anu.edu.au Wed Nov 19 17:40:04 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAJMe4EY000446 for ; Wed, 19 Nov 2003 17:40:04 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAJMe3Yu027469 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 19 Nov 2003 17:40:04 -0500 (EST) Received: from axiom.anu.edu.au (axiom.anu.edu.au [150.203.127.200]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAJMe1IX027174 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=FAIL) for ; Wed, 19 Nov 2003 17:40:03 -0500 (EST) Received: from raceme.rsise.anu.edu.au (mail@raceme.rsise.anu.edu.au [150.203.209.223]) by axiom.anu.edu.au (8.12.6/8.12.6/SuSE Linux 0.6) with ESMTP id hAJMdwVD013337; Thu, 20 Nov 2003 09:39:58 +1100 Received: from michaeln by raceme.rsise.anu.edu.au with local (Exim 3.35 #1 (Debian)) id 1AMazO-0001Bs-00; Thu, 20 Nov 2003 09:39:58 +1100 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <16315.61758.304368.803794@raceme.rsise.anu.edu.au> Date: Thu, 20 Nov 2003 09:39:58 +1100 From: Michael Norrish To: jhines@haverford.edu In-Reply-To: <200311192011.hAJKBLaT012435@saul.cis.upenn.edu> References: <200311192011.hAJKBLaT012435@saul.cis.upenn.edu> X-Mailer: VM 7.18 under Emacs 21.2.1 Sender: Michael Norrish X-Mailman-Approved-At: Thu, 20 Nov 2003 10:01:48 -0500 Cc: types@cis.upenn.edu Subject: equational proof checker for lambda calculus? X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list Reply-To: Michael Norrish List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 19 Nov 2003 22:40:05 -0000 Status: O X-Status: X-Keywords: X-UID: 50 jhines@haverford.edu writes: > [----- The Types Forum, http://www.cis.upenn.edu/~bcpierce/types -----] > Does there exist a simple proof checker for equational proofs > with format something like this? > ( (\x. (x x)) (\y. (y (\z. z))) ) > = beta-reduce > ( (\x. (x (\y. y))) (\z. (z (\w. w))) ) > = beta-reduce > ( (\x. (x (\y. y))) (\z. z) ) > = beta-reduce > ( (\x. x) (\y.y) ) > = beta-expand > ( (\x. (x x)) (\y.y) ) > The format would be something like a sequence of (closed?) lambda-terms, > related one to the next by beta (or eta) reduction/expansion. > I've read a paper by Michael Norrish ("Mechanising Hankin and > Barendregt using the Gordon-Melham Axioms"), which discusses > mechanising some much more sophisticated lambda-calculus > proofs. This makes me think that I could do this kind of proof in > HOL, but HOL is scary; I think I could write a checker more quickly > than I could become comfortable in HOL. There are two ways in which you could do this sort of thing with HOL. One way would be to fire up an interactive session and use the general support HOL has for doing interactive proof to get your goal out. For such a specialised application, this is not very desirable as the end-user would have to learn HOL's proof methods. A better solution would be to do some programming, and to create a parser for the proof language you propose, and to then link this front-end to HOL. The developer has to do some proof-programming but the end-user then doesn't need to interact with HOL at all. HOL would be linked as part of a standalone application that checked equational proofs and did nothing else. I admit HOL is scary, but there are two possible advantages to taking this latter approach. 1. Soundess: you could be sure that if your checker said a step was correct, it would be. (Though you still have to trust your parser.) 2. Extensibility: there's a lot else available under HOL's hood, so that if you wanted to extend your reasoning to cover other things, the system should be easy to adjust to allow this. Incidentally, one of the features of the work I describe in the article you mention is that I used a "name-carrying" model of the lambda calculus. If you were implementing the second approach above, you wouldn't need to be translating to name-carrying terms however. You could just as well translate to a model using de Bruijn indices. Nor is HOL the only possible proof assistant for the job. Mechanising the equational theory with de Bruijn indices is not so difficult, so I'd imagine most of the existing proof-assistants / theorem-proving systems out there could do much the same things. If you're interested in having a go at this in HOL, please let me know if I can be any help. Regards, Michael. From jeremy@discus.anu.edu.au Wed Nov 19 18:44:44 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAJNiiEY000543 for ; Wed, 19 Nov 2003 18:44:44 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAJNigYu001212 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 19 Nov 2003 18:44:43 -0500 (EST) Received: from discus.anu.edu.au (discus.anu.edu.au [150.203.126.185]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAJNifIW011397 for ; Wed, 19 Nov 2003 18:44:42 -0500 (EST) Received: (from jeremy@localhost) by discus.anu.edu.au (8.9.3p2/8.9.3) id KAA09855; Thu, 20 Nov 2003 10:44:40 +1100 (EST) Date: Thu, 20 Nov 2003 10:44:40 +1100 (EST) From: Jeremy DAWSON Message-Id: <200311192344.KAA09855@discus.anu.edu.au> To: types@cis.upenn.edu X-Mailman-Approved-At: Thu, 20 Nov 2003 10:01:48 -0500 Cc: Subject: question from Phil Wadler re cut/linear logic X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 19 Nov 2003 23:44:44 -0000 Status: O X-Status: X-Keywords: X-UID: 51 > Consider the following proof A, A-o!B;|-;!B ;B|-;!B otimes !B ------------------------------------------Cut A, A-o!B;|-;!B But how is this an instance of the Cut rule which you define as G;G'|-D';D,A A,L;G'|-D';P ---------------------------Cut G,L;G'|-D';D,P Should this be ;B|-;!B otimes !B ----------------- !L A, A-o!B;|-;!B !B;|-;!B otimes !B ------------------------------------------Cut(a) A, A-o!B;|-;!B otimes !B ? Assuming so, we could obtain ;B|-;!B otimes !B ----------------- !L !B;|-;!B !B;|-;!B otimes !B ------------------------------------Cut(b) !B;|-;!B otimes !B -----------------------------(...) A, A-o!B;|-;!B otimes !B where (...) represents the derivation of A, A-o!B;|-;!B which was left unspecified, and assuming that this (...) derivation could be transformed to a derivation of A, A-o!B;|-;!B otimes !B from !B;|-;!B otimes !B >From here we see that the cut(b) is completely superfluous since its conclusion is the same as its right premise. Thus we can obtain ;B|-;!B otimes !B ----------------- !L !B;|-;!B otimes !B -----------------------------(...) A, A-o!B;|-;!B otimes !B This has now eliminated the cut as long as the moves represented by (...) are legal. Having looked at Girard's paper we cannot see how to fill in the (...) moves for deriving A, A-o!B;|-;!B Jeremy Dawson and Rajeev Gore From Gerard.Huet@inria.fr Wed Nov 19 22:44:14 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAK3iEEY001112 for ; Wed, 19 Nov 2003 22:44:14 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAK3iDYu010510 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 19 Nov 2003 22:44:13 -0500 (EST) Received: from kraid.nerim.net (smtp-104-thursday.nerim.net [62.4.16.104]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAK3iCIW029997 for ; Wed, 19 Nov 2003 22:44:12 -0500 (EST) Received: from inria.fr (gerardh.net1.nerim.net [213.41.153.152]) by kraid.nerim.net (Postfix) with ESMTP id 497AC41056; Thu, 20 Nov 2003 04:44:05 +0100 (CET) Date: Thu, 20 Nov 2003 04:47:01 +0100 Content-Type: text/plain; charset=ISO-8859-1; format=flowed Mime-Version: 1.0 (Apple Message framework v551) To: jhines@haverford.edu From: =?ISO-8859-1?Q?G=E9rard_Huet?= In-Reply-To: <200311192011.hAJKBLaT012435@saul.cis.upenn.edu> Message-Id: <32A8ACEA-1B0C-11D8-A376-0003938819CE@inria.fr> Content-Transfer-Encoding: quoted-printable X-Mailer: Apple Mail (2.551) X-Mailman-Approved-At: Thu, 20 Nov 2003 10:01:48 -0500 Cc: types@cis.upenn.edu, =?ISO-8859-1?Q?G=E9rard_Huet?= Subject: Re: equational proof checker for lambda calculus? X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 20 Nov 2003 03:44:14 -0000 Status: O X-Status: X-Keywords: X-UID: 52 Le samedi, 15 nov 2003, =E0 18:19 Europe/Paris, jhines@haverford.edu a=20= =E9crit : > [----- The Types Forum, http://www.cis.upenn.edu/~bcpierce/types = -----] > > > Does there exist a simple proof checker for equational proofs > with format something like this? > > ( (\x. (x x)) (\y. (y (\z. z))) ) > =3D beta-reduce > ( (\x. (x (\y. y))) (\z. (z (\w. w))) ) > =3D beta-reduce > ( (\x. (x (\y. y))) (\z. z) ) > =3D beta-reduce > ( (\x. x) (\y.y) ) > =3D beta-expand > ( (\x. (x x)) (\y.y) ) > > The format would be something like a sequence of (closed?)=20 > lambda-terms, > related one to the next by beta (or eta) reduction/expansion. The problem with looking at beta-reduction/expansion as a relation over=20= terms is that you lose the residual structure. You have coincidences like: (\x.x (\x.x y)) =3D beta-reduce (\x.x y) indeed, but you lose the crucial information of which redex is reduced. If you keep this information, like in (\x.x (\x.x y)) =3D beta-reduce at occ (with the proper notion of occurrence as a path = in=20 the reduced term) (\x.x y) then you have a non-ambiguous notion, and the advantage is that you do=20= not need a proof checker anymore, it becomes an exercise in deterministic programming. Furthermore, once you have it, you can easily write the iterator on all=20= positions in a term, and thus answer your original problem, which is an existential=20= statement over a finite domain. Thus no proof assistant needed. You will find such programs, written in Objective Caml, at my site http://pauillac.inria.fr/~huet/CCT/ Cheers GH From selinger@mathstat.uottawa.ca Wed Nov 19 23:13:59 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAK4DxEY001192 for ; Wed, 19 Nov 2003 23:13:59 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAK4DxYu011616 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 19 Nov 2003 23:13:59 -0500 (EST) Received: from quasar.mathstat.uottawa.ca (quasar.mathstat.uottawa.ca [137.122.49.150]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAK4DwIW004767 for ; Wed, 19 Nov 2003 23:13:58 -0500 (EST) Received: (from selinger@localhost) by quasar.mathstat.uottawa.ca (8.11.6/8.11.6) id hAK4DxN07192 for types@cis.upenn.edu; Wed, 19 Nov 2003 23:13:59 -0500 From: Peter Selinger Message-Id: <200311200413.hAK4DxN07192@quasar.mathstat.uottawa.ca> To: types@cis.upenn.edu (Types List) Date: Wed, 19 Nov 2003 23:13:59 -0500 (EST) X-Mailer: ELM [version 2.5 PL3] MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Mailman-Approved-At: Thu, 20 Nov 2003 10:01:48 -0500 Cc: Subject: graduate student positions, Ottawa X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 20 Nov 2003 04:14:00 -0000 Status: O X-Status: X-Keywords: X-UID: 53 Dear colleagues, we're seeking applications for graduate students at the University of Ottawa (see ad below). If you know any bright students who might be interested, please encourage them to apply! Note that types are among the areas of interest. Thanks, -- Peter * Graduate Student positions in Logic, Category Theory, and Foundations of Computation, University of Ottawa, Canada The Logic Group in the Department of Mathematics and Statistics at the University of Ottawa is seeking applications from prospective graduate students for the M.Sc. and Ph.D. program, beginning in September 2004. Graduate students will be part of the activities of the Logic and Foundations of Computation Group. This group includes faculty and students from several different Ottawa-area universities. In the Math Department, the Logic Group currently includes 4 faculty members (R. Blute, A. Felty, P. Scott, P. Selinger), 3 postdocs (V. Capretta, P. Hofstra, M. Weber), and 9 graduate students. For more information about our team, see http://www.mathstat.uottawa.ca/lfc/ Members of our logic group work in the following areas: category theory, type theory, linear logic, quantum programming languages, semantics of computation, lambda calculus, proof theory, proof carrying code, theorem proving, monoidal categories in physics and computing, probabilistic concurrent systems, realizability toposes and constructive mathematics, higher-dimensional categories. Ph.D. students receive funding which covers academic fees and living expenses. The funding available for M.Sc. students varies. For further information about our graduate program and how to apply, please see http://www.mathstat.uottawa.ca/grad/. The deadline for applications for international students is January 15. Philip Scott (phil@site.uottawa.ca) Richard Blute (rblute@mathstat.uottawa.ca) Amy Felty (afelty@site.uottawa.ca) Peter Selinger (selinger@mathstat.uottawa.ca) From wadler@inf.ed.ac.uk Thu Nov 20 04:05:50 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAK95oEY002013 for ; Thu, 20 Nov 2003 04:05:50 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAK95nYu023354 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 20 Nov 2003 04:05:49 -0500 (EST) Received: from topper.inf.ed.ac.uk (topper.inf.ed.ac.uk [129.215.32.40]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAK95mIW004916 for ; Thu, 20 Nov 2003 04:05:48 -0500 (EST) Received: from inf.ed.ac.uk (dhcp-96-159.dcs.ed.ac.uk [129.215.96.159]) by topper.inf.ed.ac.uk (8.11.6/8.11.6) with ESMTP id hAK95hr28990; Thu, 20 Nov 2003 09:05:43 GMT Date: Thu, 20 Nov 2003 10:07:26 +0100 Content-Type: text/plain; charset=US-ASCII; format=flowed Mime-Version: 1.0 (Apple Message framework v552) To: Frank Pfenning From: Philip Wadler In-Reply-To: <23892.1069275308@altosax.concert.cs.cmu.edu> Message-Id: Content-Transfer-Encoding: 7bit X-Mailer: Apple Mail (2.552) X-Mailman-Approved-At: Thu, 20 Nov 2003 10:01:48 -0500 Cc: Philip Wadler , types@cis.upenn.edu Subject: Re: Cut-Elimination in Linear Logic X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 20 Nov 2003 09:05:50 -0000 Status: O X-Status: X-Keywords: X-UID: 54 Frank Pfenning wrote: > Literally, what you call "cut" in your example is not an instance of > your cut rule, because the formulas "B" and "!B" do not match, ... Whoops, I forgot to use !L before the cut. I should have written, ------Id ------Id B;|-;B B;|-;B ------Dereliction ------Dereliction ;B|-;B ;B|-;B -------!R -------!R ;B|-;!B ;B|-;!B ---------------------------------otimes-R ;B|-;!B otimes !B ------------------!L A, A-o!B;|-;!B !B;|-;!B otimes !B ------------------------------------------Cut A, A-o!B;|-;!B Thanks for the citations! -- P From grue@diku.dk Thu Nov 20 04:51:51 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAK9ppEY002130 for ; Thu, 20 Nov 2003 04:51:51 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAK9poYu024936 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 20 Nov 2003 04:51:50 -0500 (EST) Received: from nhugin.diku.dk (nhugin.diku.dk [130.225.96.140]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAK9pnIW014200 for ; Thu, 20 Nov 2003 04:51:49 -0500 (EST) Received: by nhugin.diku.dk (Postfix, from userid 754) id F2EC66E107F; Thu, 20 Nov 2003 10:51:47 +0100 (CET) Received: from ask.diku.dk (ask.diku.dk [130.225.96.225]) by nhugin.diku.dk (Postfix) with QMQP id BCE786E0F8A; Thu, 20 Nov 2003 10:51:47 +0100 (CET) Date: Thu, 20 Nov 2003 10:51:48 +0100 (MET) From: Klaus Ebbe Grue To: jhines@haverford.edu In-Reply-To: <200311192011.hAJKBLaT012435@saul.cis.upenn.edu> Message-ID: References: <200311192011.hAJKBLaT012435@saul.cis.upenn.edu> MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Spam-Checker-Version: SpamAssassin 2.60 (1.212-2003-09-23-exp) on nhugin.diku.dk X-Spam-Status: No, hits=-4.9 required=5.0 tests=BAYES_00 autolearn=ham version=2.60 X-Spam-Level: X-Mailman-Approved-At: Thu, 20 Nov 2003 10:01:48 -0500 Cc: types@cis.upenn.edu Subject: Re: equational proof checker for lambda calculus? X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 20 Nov 2003 09:51:51 -0000 Status: O X-Status: X-Keywords: X-UID: 55 On Sat, 15 Nov 2003 jhines@haverford.edu wrote: > Does there exist a simple proof checker for equational proofs > with format something like this? > > ( (\x. (x x)) (\y. (y (\z. z))) ) > = beta-reduce > ( (\x. (x (\y. y))) (\z. (z (\w. w))) ) > = beta-reduce > ( (\x. (x (\y. y))) (\z. z) ) > = beta-reduce > ( (\x. x) (\y.y) ) > = beta-expand > ( (\x. (x x)) (\y.y) ) A system (with the preliminary name "Logiweb") that does just that is currently used by first year students at Diku (Dept.comp.sci/Univ.Copenhagen). A release for a broader audience is due for the beginning of next year, if you can wait for that. The format of the proof would be L lemma A: ( (\x. (x x)) (\y. (y (\z. z))) ) = ( (\x. (x x)) (\y.y) ) L proof of A: L1: Algebra > ( (\x. (x x)) (\y. (y (\z. z))) ) ; L2: beta-reduce > ( (\x. (x (\y. y))) (\z. (z (\w. w))) ) ; L3: beta-reduce > ( (\x. (x (\y. y))) (\z. z) ) ; L4: beta-reduce > ( (\x. x) (\y.y) ) ; L5: beta-reduce > ( (\x. (x x)) (\y.y) ) The lemma and proof may reside on different web pages so that the teacher may formulate the lemma and the students may formulate the proof. The editor is WYSIWYG, syntax directed, and one may choose to use e.g. Greek letters instead of backslash and beta-reduce. TeX may be used for making a high quality print. Above, L is the name of a theory that allows beta-reduction and algebraic proofs. The system also supports Hilbert style proofs. L1..L5 are optional line numbers useful for referencing. Many parentheses could be omitted if one tells the priority and associativity of the operators to the system. For more, see http://www.diku.dk/~grue. In particular, see the "Mathematics and Computation" entry and the "Logiweb" entry on that page. The system itself will appear on that page when matured for external use. Cheers, Klaus Grue From laufer@acm.org Wed Nov 19 16:18:52 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAJLIqEY031652 for ; Wed, 19 Nov 2003 16:18:52 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAJLIpYu023509 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 19 Nov 2003 16:18:52 -0500 (EST) Received: from georg.math.luc.edu ([147.126.2.9]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAJLImIX027606 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 19 Nov 2003 16:18:51 -0500 (EST) Received: from [147.126.2.219] ([147.126.2.219]) by georg.math.luc.edu (8.12.9/8.12.9) with ESMTP id hAJLIWv1002306; Wed, 19 Nov 2003 15:18:37 -0600 (CST) User-Agent: Microsoft-Entourage/10.1.4.030702.0 Date: Wed, 19 Nov 2003 15:18:37 -0600 From: Konstantin L=?ISO-8859-1?B?5A==?=ufer To: , , , Message-ID: Mime-version: 1.0 Content-type: text/plain; charset="US-ASCII" Content-transfer-encoding: 7bit X-Mailman-Approved-At: Thu, 20 Nov 2003 10:03:03 -0500 Cc: Subject: Public release of the Triveni concurrent programming framework for Java X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 19 Nov 2003 21:18:53 -0000 Status: O X-Status: X-Keywords: X-UID: 56 We are pleased to announce the official public release of the Triveni framework for Java. This release has version number 0.54. http://www.cs.luc.edu/triveni/ http://sourceforge.net/projects/triveni Triveni is a framework for concurrent programming with objects, threads, and events. Triveni supports the modular design of event-driven systems from combinators (building blocks) that operate on abstract behaviors. Explicit multithreading is not required but supported for components with autonomous behavior. Triveni components are compliant with the JavaBeans specification. Triveni also includes an XML-based front end. Triveni requires Java 2 Standard Edition (J2SE), preferably J2SE 1.3 or newer. Optionally, to build from source, Triveni also requires Apache Ant 1.5.2 or newer. The Triveni framework for Java is open-source software under an MIT-like license and hosted on SourceForge. The documentation, including installation instructions, are available on the web and included with the distribution. Several demos are available on the web, as well. Triveni has been used in research and teaching since 1997, and unofficial releases were available upon request. Links to related papers and courses are available on the web. Active Triveni research and development focuses on * enhanced support for components with autonomous behavior (Trask project) * support for event-based unit testing (Trunit project) * support for the state machine paradigm (Trull project) * applications in server-based, distributed, and cluster computing (Loyola CPDC Research Group) More information on these projects will be available shortly. We would be interested in any feedback you might have. If you have any feedback, please subscribe to the following list: http://mailman.cs.luc.edu/mailman/listinfo/triveni-users If you have already been using an older version of Triveni, please be sure to upgrade to this release. The Triveni Team triveni-developers@mailman.cs.luc.edu From txa@Cs.Nott.AC.UK Thu Nov 20 16:41:02 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAKLf2EY006575 for ; Thu, 20 Nov 2003 16:41:02 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAKLf1Yu026807 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 20 Nov 2003 16:41:01 -0500 (EST) Received: from Cs.Nott.AC.UK (pat.cs.nott.ac.uk [128.243.20.9]) by central.cis.upenn.edu (8.12.10/8.12.9) with SMTP id hAKLf1IW028227 for ; Thu, 20 Nov 2003 16:41:01 -0500 (EST) Received: from jacob.cs.nott.ac.uk by pat.Cs.Nott.AC.UK id aa23484; 20 Nov 2003 21:39 GMT Received: (from txa@localhost) by cs.nott.ac.uk (8.12.8/8.12.5/Submit) id hAKLdkk1001536; Thu, 20 Nov 2003 21:39:46 GMT From: Thorsten Altenkirch MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <16317.13474.378368.107783@gargle.gargle.HOWL> Date: Thu, 20 Nov 2003 21:39:46 +0000 To: jhines@haverford.edu In-Reply-To: <200311192011.hAJKBLaT012435@saul.cis.upenn.edu> References: <200311192011.hAJKBLaT012435@saul.cis.upenn.edu> X-Mailer: VM 7.07 under 21.4 (patch 8) "Honest Recruiter" XEmacs Lucid X-Mailman-Approved-At: Fri, 21 Nov 2003 08:48:12 -0500 Cc: types@cis.upenn.edu Subject: equational proof checker for lambda calculus? X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 20 Nov 2003 21:41:02 -0000 Status: O X-Status: X-Keywords: X-UID: 57 jhines@haverford.edu writes: > [----- The Types Forum, http://www.cis.upenn.edu/~bcpierce/types -----] > > > Does there exist a simple proof checker for equational proofs > with format something like this? > > ( (\x. (x x)) (\y. (y (\z. z))) ) > = beta-reduce > ( (\x. (x (\y. y))) (\z. (z (\w. w))) ) > = beta-reduce > ( (\x. (x (\y. y))) (\z. z) ) > = beta-reduce > ( (\x. x) (\y.y) ) > = beta-expand > ( (\x. (x x)) (\y.y) ) > > The format would be something like a sequence of (closed?) lambda-terms, > related one to the next by beta (or eta) reduction/expansion. > > Am I correct in believing that, (though not usable in general), it could > be useful for (the homework for) those few lectures where one talks about > programming in the pure lambda calculus (i.e. natural numbers, booleans, > pairs)? > > In reading Paul Hudak's School of Expression, he seemed to imply that > this kind of proof (proof-by-calculation) is useful for programming in > Haskell, and he does not routinely use a proof checker. When reasoning about programs you usually reason about total functions (although frequently the intended domain is not expressible using simple types) and then beta equality is decidable. Indeed proof tools based on type theory such as COQ decide beta-equality automatically and they also unfold functional definitions. I personally find reasoning by induction (and coinduction) more natural than reducing everything to equational reasoning (proof-by calculation). Having said, this equational reasoning certainly has got its place as well. Cheers, Thorsten -- Dr. Thorsten Altenkirch phone : (+44) (0)115 84 66516 Lecturer http://www.cs.nott.ac.uk/~txa/ School of Computer Science & IT University of Nottingham From matthewh@callan.rn.informatics.scitech.susx.ac.uk Fri Nov 21 04:18:24 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAL9IOEY008081 for ; Fri, 21 Nov 2003 04:18:24 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAL9INYu024189 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 21 Nov 2003 04:18:23 -0500 (EST) Received: from rinka.central.susx.ac.uk (rinka.central.susx.ac.uk [139.184.14.19]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAL9IMIW020406 for ; Fri, 21 Nov 2003 04:18:22 -0500 (EST) Received: from callan.rn.informatics.scitech.susx.ac.uk ([139.184.49.76]) by rinka.central.susx.ac.uk with esmtp (TLSv1:DES-CBC3-SHA:168) (Exim 4.10) id 1AN7Qj-0006Wh-00 for types@cis.upenn.edu; Fri, 21 Nov 2003 09:18:21 +0000 Received: from callan.rn.informatics.scitech.susx.ac.uk (localhost.localdomain [127.0.0.1]) by callan.rn.informatics.scitech.susx.ac.uk (8.12.8/8.12.8) with ESMTP id hAL9ILa7011481 for ; Fri, 21 Nov 2003 09:18:21 GMT Received: (from matthewh@localhost) by callan.rn.informatics.scitech.susx.ac.uk (8.12.8/8.12.8/Submit) id hAL9ILtN011477; Fri, 21 Nov 2003 09:18:21 GMT MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <16317.55388.532241.294899@callan.rn.informatics.scitech.susx.ac.uk> Date: Fri, 21 Nov 2003 09:18:20 +0000 From: Matthew Hennessy To: types@cis.upenn.edu X-Mailer: VM 7.07 under 21.4 (patch 12) "Portable Code" XEmacs Lucid X-Mailman-Approved-At: Fri, 21 Nov 2003 08:48:12 -0500 Cc: Subject: New technicl report X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 21 Nov 2003 09:18:24 -0000 Status: O X-Status: X-Keywords: X-UID: 58 The following Technical Report makes extensive use of types to control the behvaiour of mobile code; it should therefore be of interest to the subscribers to this mailing list. It is available from http://cogslib.cogs.susx.ac.uk/csr.php?type=cs =============================================================== Title: SafeDpi: a language for controlling mobile code Author(s): Matthew Hennessy, Julian Rathke, Nobuko Yoshida Report: Computer Science Report 2003:02 Issued: University of Sussex, Brighton BN1 9QH, October 2003 Abstract: SafeDpi is a distributed version of the picalculus, in which processes are located at dynamically created sites. Parametrised code may be sent between sites using so-called ports, which are essentially higher-order versions of picalculus communication channels. A host location may protect itself by only accepting code which conforms to a given type associated to the incoming port. We define a sophisticated static type system for these ports, which restrict the capabilities and access rights of any processes launched by incoming code. Dependent and existential types are used to add flexibility, allowing the behaviour of these launched processes, encoded as process types, to depend on the host's instantiation of the incoming code. We also show that a natural contextually defined behavioural equivalence can be characterised coinductively, using bisimulations based on typed actions. The characterisation is based on the idea of knowledge acquisition by a testing environment and makes explicit some of the subtleties of determining equivalence in this language of highly constrained distributed code. ------- end of forwarded message ------- From wadler@inf.ed.ac.uk Fri Nov 21 05:09:23 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hALA9NEY008195 for ; Fri, 21 Nov 2003 05:09:23 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hALA9MYu025883 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 21 Nov 2003 05:09:22 -0500 (EST) Received: from topper.inf.ed.ac.uk (topper.inf.ed.ac.uk [129.215.32.40]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hALA9LIW028748 for ; Fri, 21 Nov 2003 05:09:22 -0500 (EST) Received: from inf.ed.ac.uk (dhcp-96-159.dcs.ed.ac.uk [129.215.96.159]) by topper.inf.ed.ac.uk (8.11.6/8.11.6) with ESMTP id hALA9Hr27630; Fri, 21 Nov 2003 10:09:17 GMT Date: Fri, 21 Nov 2003 10:11:03 +0000 Content-Type: text/plain; delsp=yes; charset=US-ASCII; format=flowed Mime-Version: 1.0 (Apple Message framework v552) To: sanjiva@cse.iitd.ernet.in From: Philip Wadler In-Reply-To: <1758.10.20.2.48.1069398189.squirrel@www.cse.iitd.ernet.in> Message-Id: <036F4DDE-1C0B-11D8-BB6E-000A95C4B3A0@inf.ed.ac.uk> Content-Transfer-Encoding: 7bit X-Mailer: Apple Mail (2.552) X-Mailman-Approved-At: Fri, 21 Nov 2003 08:48:12 -0500 Cc: Frank Pfenning , Philip Wadler , types@cis.upenn.edu Subject: Re: Cut-Elimination in Linear Logic X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 21 Nov 2003 10:09:23 -0000 Status: O X-Status: X-Keywords: X-UID: 59 Thanks to Frank and Sanjiva for replies. In the example I gave, Cut elimination can be performed by commuting the right-hand tree to the top of the left-hand tree. This is possible because the Cut is against a side-formula in the right-hand tree. (A Cut against a formula of the form !B must be against a side-formula or against the principle formula of !R, and the latter case is easy.) B;|-;B B;|-;B ------------Dereliction ------------Dereliction ;B|-;B ;B|-;B --------------!R --------------!R ;B|-;!B ;B|-;!B ----------------------------------------------------------otimes-R A;|-;A !B;|-;!B ;B|-;!B otimes !B ------------------------------------ -oE ------------------------------------!L A,A-o!B;|-;!B !B;|-;!B otimes !B ------------------------------------------------------------------------ --------------------Cut A,A-o!B;|-;!B becomes B;|-;B B;|-;B ------------Dereliction ------------Dereliction ;B|-;B ;B|-;B --------------!R --------------!R ;B|-;!B ;B|-;!B ----------------------------------------------------------otimes-R ;B|-;!B otimes !B ------------------------------------!L A;|-;A !B;|-;!B otimes !B ------------------------------------------------------------ -oE A,A-o!B;|-;!B otimes !B > I think I understand what LU fragment you're looking at > (Neutral+Positive > Int. Logic), so I think it it somewhat incorrect to say you don't > have polarities -- you have !A, which is positive. > I guess you mean that all atomic formulae are of neutral polarity, > and all positive formulae are obtained by the !-L and !-R rules. What I meant is that I did not include Girard's rules which refer to the polarities: G;G'|-D',N;D ------------------------ G;G'|-D';N,D G;P,G'|-D';D ------------------------ G,P;G'|-D';D where N has negative polarity and P has positive polarity. Frank does not have these in his system LV, which is a variant of LU. So far as I can see, these rules don't allow you to derive more sequents. Instead, their purpose is to allow the classical connective A wedge B, which is roughly the same as !A otimes !B, to be given a definition that is clearly associative. Is that right? Cheers, -- P From sanjiva@cse.iitd.ernet.in Fri Nov 21 06:55:27 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hALBtREY008443 for ; Fri, 21 Nov 2003 06:55:27 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hALBtQYu029204 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 21 Nov 2003 06:55:26 -0500 (EST) Received: from desh.cse.iitd.ernet.in (mailer.cse.iitd.ac.in [202.141.68.3]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hALBtCIX017944 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 21 Nov 2003 06:55:24 -0500 (EST) Received: from www.cse.iitd.ernet.in (bahar.cse.iitd.ernet.in [10.20.3.3]) by desh.cse.iitd.ernet.in (8.12.8/8.12.8) with SMTP id hALC0CTO031515; Fri, 21 Nov 2003 17:30:14 +0530 Received: from 10.200.2.74 (SquirrelMail authenticated user sanjiva) by www.cse.iitd.ernet.in with HTTP; Fri, 21 Nov 2003 17:30:15 +0530 (IST) Message-ID: <1050.10.200.2.74.1069416015.squirrel@www.cse.iitd.ernet.in> In-Reply-To: <036F4DDE-1C0B-11D8-BB6E-000A95C4B3A0@inf.ed.ac.uk> References: <1758.10.20.2.48.1069398189.squirrel@www.cse.iitd.ernet.in> <036F4DDE-1C0B-11D8-BB6E-000A95C4B3A0@inf.ed.ac.uk> Date: Fri, 21 Nov 2003 17:30:15 +0530 (IST) From: sanjiva@cse.iitd.ernet.in To: "Philip Wadler" User-Agent: SquirrelMail/1.4.1 MIME-Version: 1.0 Content-Type: text/plain;charset=iso-8859-1 Content-Transfer-Encoding: 8bit X-Priority: 3 Importance: Normal X-Mailman-Approved-At: Fri, 21 Nov 2003 08:48:12 -0500 Cc: Frank Pfenning , Philip Wadler , sanjiva@cse.iitd.ernet.in, types@cis.upenn.edu Subject: Re: Cut-Elimination in Linear Logic X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 21 Nov 2003 11:55:27 -0000 Status: O X-Status: X-Keywords: X-UID: 60 The out rules on +ve (L) and -ve (R) do not increase increase the class of *equivalent Linear Logic sequents* provable, but provide (as you noted) nicer encodings for various conectives (chimeric, Girard calls them), with nice properties -- you've noted associativity -- arising from idempotence of ! or ? etc. The semantics is consequently nicer, and more in line with the requirements you've noted in some of your earlier papers. - S. > >> I think I understand what LU fragment you're looking at >> (Neutral+Positive >> Int. Logic), so I think it it somewhat incorrect to say you don't >> have polarities -- you have !A, which is positive. >> I guess you mean that all atomic formulae are of neutral polarity, >> and all positive formulae are obtained by the !-L and !-R rules. > > What I meant is that I did not include Girard's rules which refer to > the polarities: > > G;G'|-D',N;D > ------------------------ > G;G'|-D';N,D > > G;P,G'|-D';D > ------------------------ > G,P;G'|-D';D > > where N has negative polarity and P has positive polarity. > Frank does not have these in his system LV, which is a variant of LU. > So far as I can see, these rules don't allow you to derive more > sequents. > Instead, their purpose is to allow the classical connective A wedge B, > which is roughly the same as !A otimes !B, to be given a definition that > is clearly associative. Is that right? > > Cheers, -- P > > > From sanjiva@cse.iitd.ernet.in Fri Nov 21 01:58:18 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAL6wIEY007584 for ; Fri, 21 Nov 2003 01:58:18 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAL6wHYu019052 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 21 Nov 2003 01:58:17 -0500 (EST) Received: from desh.cse.iitd.ernet.in (mailer.cse.iitd.ac.in [202.141.68.3]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAL6w6IX024995 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 21 Nov 2003 01:58:16 -0500 (EST) Received: from www.cse.iitd.ernet.in (bahar.cse.iitd.ernet.in [10.20.3.3]) by desh.cse.iitd.ernet.in (8.12.8/8.12.8) with SMTP id hAL72wTO014712; Fri, 21 Nov 2003 12:33:05 +0530 Received: from 10.20.2.48 (SquirrelMail authenticated user sanjiva) by www.cse.iitd.ernet.in with HTTP; Fri, 21 Nov 2003 12:33:09 +0530 (IST) Message-ID: <1758.10.20.2.48.1069398189.squirrel@www.cse.iitd.ernet.in> In-Reply-To: <200311201824.hAKIO4nZ020672@saul.cis.upenn.edu> References: <23892.1069275308@altosax.concert.cs.cmu.edu> <200311201824.hAKIO4nZ020672@saul.cis.upenn.edu> Date: Fri, 21 Nov 2003 12:33:09 +0530 (IST) From: sanjiva@cse.iitd.ernet.in To: "Philip Wadler" User-Agent: SquirrelMail/1.4.1 MIME-Version: 1.0 Content-Type: text/plain;charset=iso-8859-1 Content-Transfer-Encoding: 8bit X-Priority: 3 Importance: Normal X-Mailman-Approved-At: Fri, 21 Nov 2003 08:49:13 -0500 Cc: Frank Pfenning , Philip Wadler , types@cis.upenn.edu Subject: Re: Cut-Elimination in Linear Logic X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 21 Nov 2003 06:58:19 -0000 Status: O X-Status: X-Keywords: X-UID: 61 [I'm not sure my earlier attempts to reply got through, and I don't have a copy saved. Please excuse. -S. ] Phil: If you are interested in working exactly within LU, and not with an equivalent variant system like Frank's, then the canonical reference for cut elim in LU is Jacqueline Vauzeille's paper in Annals of Pure and Applied Logic 62:1-16, 1993. It has some minor (fixable) typos in some of the definitions but is otherwise an excellently detailed paper. The paper contains some crucial lemmas (regarding proofs with a positive [dually negative] formula on the right [dually left] of a sequent), that cover the case to which your example refers (i.e., the proof for A, A -o !B; |- ; !B). The lemmas allow replacing a proof of the sequent of this shape by another proof, on which the cut elimination process can proceed. What is shown is that if there is a proof of a sequent in LU, there is a proof in LU-{cuts}. This is a bit weaker than saying that if t is a term decorating a LU proof with cuts, then the cut free proof can be obtained by reducing t. It's worthwhile checking out whether the stronger statement holds for *closed* terms. What (I believe -- see * below) these lemmas CAN be made to do is to replace a proof of the sequent of this shape by an "equivalent" one. The transformation, if I recall correctly (I worked this out some 9-10 years ago) involves eta-expansions, rearrangements involving explicit substitutions etc. (*) In the decoration I was examining, linearly maintained assumptions were decorated by "addresses", whereas classically maintained ones by variables. !-L and out-L involved building skeletons for using explicit substitutions "let z = [ ] in t", whereas !-R and out-R had no explicit constructors (!? not an issue since there is only one formula on the right). Your example, assuming f:A -o !B, y: A would be decorated as let z = [f y] in , which ought not to reduce to . I think I understand what LU fragment you're looking at (Neutral+Positive Int. Logic), so I think it it somewhat incorrect to say you don't have polarities -- you have !A, which is positive. I guess you mean that all atomic formulae are of neutral polarity, and all positive formulae are obtained by the !-L and !-R rules. Will be happy to discuss further. Best, Sanjiva > [----- The Types Forum, http://www.cis.upenn.edu/~bcpierce/types -----] > > Frank Pfenning wrote: > >> Literally, what you call "cut" in your example is not an instance of >> your cut rule, because the formulas "B" and "!B" do not match, ... > > Whoops, I forgot to use !L before the cut. I should have written, > > ------Id ------Id > B;|-;B B;|-;B > ------Dereliction ------Dereliction > ;B|-;B ;B|-;B > -------!R -------!R > ;B|-;!B ;B|-;!B > ---------------------------------otimes-R > ;B|-;!B otimes !B > ------------------!L > A, A-o!B;|-;!B !B;|-;!B otimes !B > ------------------------------------------Cut > A, A-o!B;|-;!B > > Thanks for the citations! -- P > From levy@macaron.inria.fr Fri Nov 21 16:07:17 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hALL7HEY010485 for ; Fri, 21 Nov 2003 16:07:17 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hALL7HYu026436 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 21 Nov 2003 16:07:17 -0500 (EST) Received: from smtp.noos.fr (nan-smtp-21.noos.net [212.198.2.116]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hALL7EIX020422 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=OK) for ; Fri, 21 Nov 2003 16:07:16 -0500 (EST) Received: (qmail 12449 invoked by uid 0); 21 Nov 2003 21:02:28 -0000 Received: from unknown (HELO macaron.inria.fr) ([212.198.19.93]) (envelope-sender ) by 212.198.2.116 (qmail-ldap-1.03) with SMTP for ; 21 Nov 2003 21:02:28 -0000 Received: (from levy@localhost) by macaron.inria.fr (8.9.3/8.9.3) id WAA07087; Fri, 21 Nov 2003 22:02:39 +0100 Date: Fri, 21 Nov 2003 22:02:39 +0100 Message-Id: <200311212102.WAA07087@macaron.inria.fr> From: Jean-Jacques Levy To: types@cis.upenn.edu MIME-version: 1.0 Content-type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit X-Mailman-Approved-At: Sat, 22 Nov 2003 10:07:23 -0500 Cc: Subject: TCS 2004 X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list Reply-To: Jean-Jacques.Levy@inria.fr List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 21 Nov 2003 21:07:18 -0000 Status: O X-Status: X-Keywords: X-UID: 62 CALL FOR PAPERS - TCS 2004 3rd IFIP International Conference on Theoretical Computer Science (Foundations of Global Computing) August 23-26, 2004, Toulouse, France URL: http://jeanjacqueslevy.net/TCS2004 TCS2004 will be held as part of the IFIP 2004 World Computer Congress. TCS 2004 will be composed of two distinct, but interrelated tracks: Track 1 Algorithms, Complexity and Models of Computation, Track 2 Logic, Semantics, Specification and Verification. Submissions are limited to 14 A4 pages, in 11 point or larger font, LNCS style. The Proceedings will be published by Kluwer, the official publisher of IFIP. For detailed information, please visit the web site. IMPORTANT DATES Submission: January 15, 2004 Notification: March 30, 2004 The IFIP TCS2004 conference is sponsored by IFIP TC1 on Foundations of Computer Science in cooperation with SIGACT and EATCS. PROGRAM COMMITTEE Track 1: ------- Farid Ablayev, State University, Kazan Hagit Attiya, The Technion Sorin Istrail, Celera Genomics Stefano Leonardi, Universita di Roma Maurice Margenstern, Université de Metz Ernt Mayr, Technische Universität München (chair) Satoru Miyano, Tokyo University Jean-Eric Pin, LIAFA, CNRS Nicola Santoro, Carleton University Thomas Schwentick, Philipps-Universität Marburg Sandeep Sen, Indian Institute of Technology Delhi Subhash Suri, University of California Santa Barbara Osamu Watanabe, Tokyo Institute of Technology Track 2: ------- Roberto Amadio, Université de Provence Luca Cardelli, Microsoft Research Cambridge Giuseppe Castagna, École Normale Supérieure Hubert Comon-Lundh, École Normale Supérieure de Cachan Adriana Compagnoni, Stevens Institute of Technology Drew Dean, SRI Marcelo Fiore, University of Cambridge Giorgio Ghelli, Università di Pisa Martin Hofmann, Universität München Alan Jeffrey, DePaul University Bruce Kapron, University of Victoria Orna Kupferman, Hebrew University John Mitchell, Stanford University, (chair) George Necula, University of California Berkeley Catuscia Palamidessi, INRIA Futurs Martin Rinard, MIT Davide Sangiorgi, University of Bologna Vladimiro Sassone, University of Sussex Vitaly Shmatikov, SRI Martin Wirsing, Ludwig-Maximilians-Universität LIST OF AREAS Track 1 (Algorithms, Complexity and Models of Computation): Analysis and design of algorithms, Automata and formal languages, Cellular automata and systems, Combinatorial, graph and optimization algorithms, Computational and mathematical finance, Computational learning theory, Continuous algorithms and complexity, Computational complexity, Computational geometry, Cryptography, Distributed computing, Descriptional complexity, Evolutionary and genetic computing, Experimental algorithms, Mobile computing, Molecular computing and algorithmic aspects of bioinformatics, Network computing, Neural computing, Parallel and distributed algorithms, Probabilistic and randomized algorithms, Quantum computing, Structural information and communication complexity Track 2 (Logic, Semantics, Specification and Verification): Concurrency theory, Constructive and non-standard logics in computer science, Foundations of global computing, Foundations of mobile computing, Foundations of security, Foundations of system specification, Foundations of wide area programming, Logic and semantics for programs and languages, Logic, specification and verification of hybrid and real-time systems, Proofs and specifications in computer science, Term rewriting systems, Theoretical aspects of software concepts, Theoretical aspects of specification, and verification of hardware and software, Theoretical foundations of databases, Theoretical foundations of open systems, Theory of Internet languages and systems, Theory of parallel and distributed systems, Type and category theory in computer science. CONTACT Jean-Jacques Levy INRIA Rocquencourt 78153 Le Chesnay Cedex France email: jean-jacques.levy@inria.fr Tel: +33 1 39 63 56 89 From Siva.Anantharaman@lifo.univ-orleans.fr Mon Nov 24 03:16:32 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAO8GWEY025401 for ; Mon, 24 Nov 2003 03:16:32 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAO8GWYu004993 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 24 Nov 2003 03:16:32 -0500 (EST) Received: from lifo.univ-orleans.fr (lifo.univ-orleans.fr [193.49.80.149]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAO8GVIW007615 for ; Mon, 24 Nov 2003 03:16:31 -0500 (EST) Received: from lifo.univ-orleans.fr (pcd-siva [192.168.80.46]) by lifo.univ-orleans.fr (8.12.9/jtpda-5.4) with ESMTP id hAO8GAQ7001978 ; Mon, 24 Nov 2003 09:16:10 +0100 (MET) Message-ID: <3FC1BE8D.3020909@lifo.univ-orleans.fr> Date: Mon, 24 Nov 2003 09:17:17 +0100 From: Siva Anantharaman Organization: LIFO, University of =?ISO-8859-1?Q?Orl=E9ans_=28France=29?= User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.0.2) Gecko/20021120 Netscape/7.01 X-Accept-Language: en-us, en MIME-Version: 1.0 To: siva , rewriting@ens-lyon.fr, ccl@ps.uni-sb.de, concurrency@cwi.nl References: <3F97D9C3.50502@informatik.rwth-aachen.de> Content-Type: multipart/mixed; boundary="------------030602070407050109090806" X-Mailman-Approved-At: Mon, 24 Nov 2003 08:44:01 -0500 Cc: Subject: Re: Call for submissions - SASYFT2004 X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list Reply-To: Siva.Anantharaman@lifo.univ-orleans.fr List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 24 Nov 2003 08:16:33 -0000 Status: O X-Status: X-Keywords: X-UID: 63 This is a multi-part message in MIME format. --------------030602070407050109090806 Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit --------------030602070407050109090806 Content-Type: text/plain; name="cfp.txt" Content-Transfer-Encoding: 8bit Content-Disposition: inline; filename="cfp.txt" -------------------------------------------------------------------------------------- ... Apologies for multiple copies ... Apologies for multiple copies ... -------------------------------------------------------------------------------------- Call for papers: SASYFT2004 International Workshop on Security Analysis of Systems: Formalisms and Tools ("Sécurité des systèmes: formalismes et outils d'analyse") 21-22 June 2004, Orléans, France. Hosted by LIFO (Laboratoire d'informatique fondamentale d'Orléans). Supported by: Université d'Orléans, Conseil Régional du Centre, GDR-ALP (CNRS, Paris), Le STUDIUM, Orléans, Ministère des Affaires Etrangères (projects: France-Québec Securypto, France-Japan Sakura) Programme committee: Siva Anantharaman (LIFO, Orléans) Paul Gastin (LIAFA, Paris) Gaétan Hains (LIFO, Orléans) Huimin Lin (Academy of Science, Beijing) John Mullins (Ecole Polytechnique, Montréal) Michael Rusinowitch (LORIA, Nancy) Invited Lectures: Catherine Meadows (Naval Research Lab, Washington-DC, USA) Jean Goubault-Larrecq (ENS, Cachan, France) The security of computer systems is a highly complex research topic, becoming economically more and more important. The widespread use of internet and electronic commerce requires that properties such as strong confidentiality, authentification and availability, are satisfied by the underlying distributed information systems and protocols. Theories, algorithms, and software tools are being developed by several researchers in Computer Science to verify such security criteria from formal descriptions of protocols and communicating programs. The aim of SASYFT2004 is to offer them an occasion to get together and discuss the latest developments in the research areas concerned. These include, in particular: - modeling information flow analysis on (infinite-state) systems - modeling and analyzing cryptographic protocols - verification of security properties - case studies in security analysis - security in the context of real-time and mobility - formal models for electronic commerce protocols - software tools for security analysis We welcome original unpublished papers (in English) on any of the above topics or any related research direction. Enhanced versions of work presented at earlier conferences/workshops will also be considered, provided they are as yet unpublished. Papers should be no longer than 18 pages including bibliography and appendices, and should be submitted in Postscript or PDF format. A special issue of the international journal JALC ("Journal of Languages, Automata and Combinatorics", http://www.jalc.de ) is intended comprising those of the papers accepted at SASYFT2004 and judged most relevant to its scope by the programme committee. All practical informations related to SASYFT2004 will be available progessively at: http://www.univ-orleans.fr/SCIENCES/LIFO/Manifestations/SASYFT2004/ Important dates: Submission deadline: 5 March 2004. Notification of acceptance: 15 April 2004. Deadline for the workshop version of paper: 7 Mai 2004. Workshop: Monday 21 - Tuesday 22, June 2004 --------------030602070407050109090806-- From jhines@haverford.edu Tue Nov 25 14:46:29 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAPJkTEY031678 for ; Tue, 25 Nov 2003 14:46:29 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAPJkSYu007963 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Tue, 25 Nov 2003 14:46:28 -0500 (EST) Received: from ms1.haverford.edu (ms1.haverford.edu [165.82.1.60]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAPJkRIW007852 for ; Tue, 25 Nov 2003 14:46:27 -0500 (EST) Received: from nisc8.haverford.edu (nisc8.haverford.edu [165.82.1.32]) by ms1.haverford.edu (8.12.9/8.12.9) with ESMTP id hAPJmm0w026684 for ; Tue, 25 Nov 2003 14:48:48 -0500 (EST) Message-Id: <200311251948.hAPJmm0w026684@ms1.haverford.edu> Content-Type: text/plain Content-Disposition: inline Content-Transfer-Encoding: binary X-Mailer: EMUmail 5.1 X-Originating-Ip: 165.82.156.88 X-Webmail-User: jhines@pobox.haverford.edu To: types@cis.upenn.edu MIME-Version: 1.0 X-Http_host: webmail.haverford.edu From: jhines@haverford.edu Date: Tue, 25 Nov 2003 14:56:23 EST HC-Host: Scanned by NISC3, Networking & Systems, Haverford College, Haverford, PA 19041. [v002] HC-MailScanner: Found to be clean X-Mailman-Approved-At: Wed, 26 Nov 2003 08:48:11 -0500 Cc: Subject: thanks, and generating simply-typed terms X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list Reply-To: jhines@haverford.edu List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 25 Nov 2003 19:46:29 -0000 Status: O X-Status: X-Keywords: X-UID: 64 Thank you very much for all of your many answers to my previous question. I suspect that it was inappropriately simple, because I was asking about a proof checker, and people responded with provers; as Dr. Huet said, it would be an exercise in deterministic programming. I am still digesting the various answers, but I'd like to ask another question. I would like to generate (all) small simply-typed lambda-terms of a given type. Is there a system or technique which would make this easy? An "application" of this might be to approximate Kolmogorov complexity of numbers; instead of "the length of the smallest turing-machine program that outputs the number", you could have "the length of the smallest simply-typed lambda-term that reduces to the number", which, unlike Kolmogorov complexity, would be computable. (and having a list of numbers ordered simplest to more complex would be cool.) If you are about to write a function, and have already written its type and some test cases, possibly this enumeration procedure could generate a decent guess for what function you are about to write. I have read a paper "Fixpoint Technique For Counting Terms In Typed lambda Calculus" by Marek Zaionc, which talks about counting normal-form terms of a given type. Unfortunately, that paper does not help with generating non-normal terms. I can encode the concept of "well-formed lambda-term" into MACE4 (an automatic finite model finder for first-order logic), and generate lambda-terms. Encoding "simply-typed lambda-term" into MACE4 is probably possible, but there must be a better way. If I understand the Curry-Howard Isomorphism correctly, I would be looking for a brute-force enumeration of Fitch-style proofs in the implicational fragment of intuitionistic logic, i.e. FH_{->}. Thanks very much. Johnicholas Hines From martinb@dcs.qmul.ac.uk Wed Nov 26 08:39:53 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAQDdrEY002480 for ; Wed, 26 Nov 2003 08:39:53 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAQDdqYu020209 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 26 Nov 2003 08:39:53 -0500 (EST) Received: from mail.dcs.qmul.ac.uk (vicar.dcs.qmul.ac.uk [138.37.88.163]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAQDdpIX016544 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 26 Nov 2003 08:39:52 -0500 (EST) Received: from xenografia.plus.com ([212.159.85.26] helo=dcs.qmul.ac.uk) by mail.dcs.qmul.ac.uk with asmtp (TLSv1:DHE-RSA-AES256-SHA:256) (Exim 4.24) id 1AOztW-0005MW-IZ; Wed, 26 Nov 2003 13:39:50 +0000 Message-ID: <3FC4AD08.8020807@dcs.qmul.ac.uk> Date: Wed, 26 Nov 2003 13:39:20 +0000 From: Martin Berger User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.4.1) Gecko/20031009 X-Accept-Language: en-us, en MIME-Version: 1.0 To: moca@sophia.inria.fr, types@cis.upenn.edu Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit X-Auth-User: martinb X-clamav-result: clean (1AOztW-0005MW-IZ) X-uvscan-result: clean (1AOztW-0005MW-IZ) X-Mailman-Approved-At: Wed, 26 Nov 2003 08:48:21 -0500 Cc: Subject: interview with Robin Milner X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 26 Nov 2003 13:39:53 -0000 Status: O X-Status: X-Keywords: X-UID: 65 a couple of weeks ago i interviewed Robin Milner. the transscript can be found here: http://nick.dcs.qmul.ac.uk/~martinb/interviews/milner/ i hope you'll enjoy reading it! martin From mis@brics.dk Wed Nov 26 07:26:53 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hAQCQrEY002186 for ; Wed, 26 Nov 2003 07:26:53 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAQCQqYu017443 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 26 Nov 2003 07:26:52 -0500 (EST) Received: from brics.dk (harald.daimi.au.dk [130.225.16.17]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hAQCQpIW027818 for ; Wed, 26 Nov 2003 07:26:51 -0500 (EST) Received: (from mis@localhost) by brics.dk (8.11.7/8.11.7) id hAQCQoC00447 for types@cis.upenn.edu; Wed, 26 Nov 2003 13:26:50 +0100 (MET) From: "Michael I. Schwartzbach" Message-Id: <200311261226.hAQCQoC00447@brics.dk> To: types@cis.upenn.edu Date: Wed, 26 Nov 2003 13:26:50 +0100 (MET) X-Mailer: ELM [version 2.4ME+ PL60 (25)] MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit X-Mailman-Approved-At: Wed, 26 Nov 2003 08:48:53 -0500 Cc: Subject: PLAN-X 2004 Call for Participation X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 26 Nov 2003 12:26:53 -0000 Status: O X-Status: X-Keywords: X-UID: 66 Call for Participation PLAN-X 2004 Programming Language Technologies for XML A workshop colocated with POPL 2004 13 January 2004 Venice, Italy The workshop aims at providing a meeting ground for researchers from the XML, programming language, and database communities. XML is already a de-facto industry standard for data exchange, it has from an early stage been embraced by database researchers, and it is gaining increasing interest from programming language researchers. Accepted papers: "Greedy regular expression matching" Alain Frisch and Luca Cardell "Regular expression filters for XML" Haruo Hosoya "Regular tree language recognition with static information" Alain Frisch "UpdateX - An XQuery-Based Language for Processing Updates in XML" Gargi Sur, Joachim Hammer, and Jérôme Siméon "Efficient XPath Axis Evaluation for DOM Data Structures" Jan Hidders and Philippe Michiels "STAX: A binding compiler for event-based XML data binding APIs" Florian Reuter and Norbert Luttenberger "Mixing XML/Relational Data Processing" Yana Kadiyska and Dan Suciu "A Language for Bi-Directional Tree Transformations" Michael Greenwald, Jonathan Moore, Benjamin Pierce, and Alan Schmitt Registration jointly with POPL'04: . Further information at . -- Michael I. Schwartzbach Email: mis@brics.dk BRICS, University of Aarhus WWW: http://www.brics.dk/~mis Ny Munkegade Phone: +45 8942 3374 8000 Aarhus C, DENMARK Fax: +45 8942 3255 From apostolo@obelix.ee.duth.gr Fri Nov 28 14:36:01 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hASJa1EY010431 for ; Fri, 28 Nov 2003 14:36:01 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hASJa0Yu018407 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 28 Nov 2003 14:36:00 -0500 (EST) Received: from obelix.ee.duth.gr (asterix.ee.duth.gr [193.92.243.98]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hASJZxIW021289 for ; Fri, 28 Nov 2003 14:35:59 -0500 (EST) Received: from obelix.ee.duth.gr (localhost [127.0.0.1]) by obelix.ee.duth.gr (8.12.9+Sun/8.12.5) with ESMTP id hASJagSw004459 for ; Fri, 28 Nov 2003 21:36:42 +0200 (EET) Received: from localhost (apostolo@localhost) by obelix.ee.duth.gr (8.12.9+Sun/8.12.5/Submit) with ESMTP id hASJafYK004456 for ; Fri, 28 Nov 2003 21:36:42 +0200 (EET) Date: Fri, 28 Nov 2003 21:36:41 +0200 (EET) From: Apostolos Syropoulos To: types@cis.upenn.edu In-Reply-To: <200311261406.hAQE6C9f017636@saul.cis.upenn.edu> Message-ID: References: <200311261406.hAQE6C9f017636@saul.cis.upenn.edu> MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Mailman-Approved-At: Sun, 30 Nov 2003 12:42:54 -0500 Cc: Subject: Conference on TeX, XML and Digital Typopography X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 28 Nov 2003 19:36:01 -0000 Dear Types readers, With this message I would like to let you know that December 10, 2003, the last day for submissions to TUG2004: An International Conference on TeX, XML and Digital Typography, is approaching. Every one who has done some work in the field of Digital Typography, TeX that is related to TeX and/or XML is very welcome to submit an abstract of his/her work to tug2004@ocean1.ee.duth.gr. Note that the proceedings of the conference will be published in Springer's Lecture Notes in Computer Science. All the best, Apostolos Syropoulos PS Information about the conference are available from http://obelix.ee.duth.gr/tug2004 **************************************************************** *Apostolos Syropoulos * *snail mail: 366, 28th October Str., GR-671 00 Xanthi, HELLAS * *email : apostolo@ocean1.ee.duth.gr * *phone num.: +30-(0)5410-28704 * *home page : http://obelix.ee.duth.gr/~apostolo * **************************************************************** From h.thielecke@cs.bham.ac.uk Thu Nov 27 11:18:50 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hARGIoEY008161 for ; Thu, 27 Nov 2003 11:18:50 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hARGInYu023464 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 27 Nov 2003 11:18:50 -0500 (EST) Received: from sun13.bham.ac.uk (sun13.bham.ac.uk [147.188.128.145]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hARGInIW029418 for ; Thu, 27 Nov 2003 11:18:49 -0500 (EST) Received: from [147.188.128.127] (helo=bham.ac.uk) by sun13.bham.ac.uk with esmtp (Exim 4.10) id 1APOqu-0005Tr-00 for types@cis.upenn.edu; Thu, 27 Nov 2003 16:18:48 +0000 Received: from emily.cs.bham.ac.uk ([147.188.192.10]) by bham.ac.uk with esmtp (Exim 4.24) id 1APOqu-0007jq-KE for types@cis.upenn.edu; Thu, 27 Nov 2003 16:18:48 +0000 Received: from acws-0066.cs.bham.ac.uk by emily.cs.bham.ac.uk (Exim 3.11 #1) with esmtp id 1APOqF-0007ST-00 ; Thu, 27 Nov 2003 16:18:07 +0000 Received: from localhost by acws-0066.cs.bham.ac.uk (8.12.5/submit/1.0) with ESMTP id hARGIlc8025595; Thu, 27 Nov 2003 16:18:48 GMT Date: Thu, 27 Nov 2003 16:18:47 +0000 (GMT) From: Hayo Thielecke To: types@cis.upenn.edu Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Mailman-Approved-At: Sun, 30 Nov 2003 12:44:40 -0500 Cc: Hayo Thielecke Subject: CW'04 Call for Participation X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 27 Nov 2003 16:18:50 -0000 The Fourth ACM-SIGPLAN Continuations Workshop (CW'04) Venice, Italy, 17 January 2004 co-located with POPL'04 (14--16 January 2004) http://www.cs.bham.ac.uk/~hxt/cw04/index.html Invited talks ------------- * Olivier Danvy (Aarhus, Denmark) On Evaluation Contexts, Continuations, and the Rest of the Computation * Chris Barker (Department of Linguistics, University of California) Continuations and Natural Language Accepted papers --------------- * Magorzata Biernacka, Dariusz Biernacki, and Olivier Danvy An Operational Foundation for Delimited Continuations * Kohei Honda, Nobuko Yoshida and Martin Berger A Definability Result for the lambda-mu-Calculus in the pi-Calculus * Martin Hyland, Paul Blain Levy, Gordon Plotkin and John Power Combining continuations with other effects * Yukiyoshi Kameyama Axiomatizing Higher Level Delimited Continuations * Chung-chieh Shan Delimited continuations in natural language: Quantification and polarity sensitivity Registration ------------ Please register at the POPL registration page: http://www.regmaster.com/popl2004.html From scd@doc.ic.ac.uk Thu Nov 27 05:22:53 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hARAMrEY007528 for ; Thu, 27 Nov 2003 05:22:53 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hARAMqYu011184 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 27 Nov 2003 05:22:52 -0500 (EST) Received: from diver.doc.ic.ac.uk (diver.doc.ic.ac.uk [146.169.1.47]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hARAMpIW014061 for ; Thu, 27 Nov 2003 05:22:51 -0500 (EST) Received: from kiwi.doc.ic.ac.uk ([146.169.2.59] ident=exim) by diver.doc.ic.ac.uk with esmtp (Exim 3.16 #7) id 1APJIQ-0004Op-00 for types@cis.upenn.edu; Thu, 27 Nov 2003 10:22:50 +0000 Received: from scd by kiwi.doc.ic.ac.uk with local (Exim 3.32 #1) id 1APJIP-0002VR-00 for types@cis.upenn.edu; Thu, 27 Nov 2003 10:22:49 +0000 To: types@cis.upenn.edu Message-Id: From: Sophia Drossopoulou Date: Thu, 27 Nov 2003 10:22:49 +0000 X-Mailman-Approved-At: Sun, 30 Nov 2003 12:45:08 -0500 Cc: Subject: === FOOL 2004 - Call for Participation X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 27 Nov 2003 10:22:53 -0000 Call for Participation FOOL 2004 Foundations of Object-Oriented Languages A workshop co-located with POPL 2004 17 January 2004 Venice, Italy The FOOL workshops bring together researchers who work on the sound principles for object-oriented languages, leading to a better understanding of the key concepts of object-oriented languages, and to important developments in type theory, semantics, and program verification. Invited Speakers: Martin Odersky: Title to be announced Alan Schmitt: Native XML Processing in Object Oriented Languages Accepted papers: Kathleen Fisher and John Reppy: A typed calculus of traits Tetsuo Kamina and Tetsuo Tamai: A Core Calculus for Mixin-Types Lorenzo Bettini, Viviana Bono, Silvia Likavec: A Calculus of Mixin-Based Incomplete Objects Thomas VanDrunen and Jens Palsberg: Visitor-Oriented Programming Alex Potanin, James Noble, Dave Clarke, Robert Biddle: Featherweight Generic Confinement Paritosh Shroff and Scott Smith: Type Inference for First_Class Messages with Match-Functions Barry Jay: Methods for Pattern Matching Functions Registration jointly with POPL'04: . Further information at From Pierre-Louis.Curien@pps.jussieu.fr Wed Dec 3 03:50:53 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hB38orEY008564 for ; Wed, 3 Dec 2003 03:50:53 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hB38oqBx025264 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 3 Dec 2003 03:50:52 -0500 (EST) Received: from shiva.jussieu.fr (shiva.jussieu.fr [134.157.0.129]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hB38opnp001201 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 3 Dec 2003 03:50:51 -0500 (EST) Received: from helium.pps.jussieu.fr (helium.pps.jussieu.fr [134.157.168.2]) by shiva.jussieu.fr (8.12.10/jtpda-5.4) with ESMTP id hB38ooqY029608 for ; Wed, 3 Dec 2003 09:50:50 +0100 (CET) Received: from [134.157.168.64] (gadolinium.pps.jussieu.fr [134.157.168.64]) by helium.pps.jussieu.fr (8.11.6/jtpda-5.3.2) with ESMTP id hB38onL46799 ; Wed, 3 Dec 2003 09:50:49 +0100 (CET) Date: Wed, 3 Dec 2003 09:57:09 +0100 Content-Type: text/plain; charset=US-ASCII; format=flowed Mime-Version: 1.0 (Apple Message framework v552) To: types@cis.upenn.edu From: Pierre-Louis Curien Content-Transfer-Encoding: 7bit Message-Id: X-Mailer: Apple Mail (2.552) X-Antivirus: scanned by sophie at shiva.jussieu.fr X-Mailman-Approved-At: Wed, 03 Dec 2003 08:39:02 -0500 Cc: Pierre-Louis Curien Subject: nominations for Goedel Prize 2004 X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 03 Dec 2003 08:50:53 -0000 This message is to draw your attention on the Goedel Prize http://www.math.utu.fi/ICALP04/godel2004.html which is probably still not well-enough known in the communities of programming languages, global computing, semantics, and logical / categorical / probabilistic foundations. The deadline for nominations is Januuary 10, 2004 As a newly appointed member of the jury, I encourage submissions in this general area of researchy! Please do not hesitate to forward this message to other relevant mailing lists. Best regards, Pierre-Louis Curien From Jeremy.Gibbons@comlab.ox.ac.uk Thu Dec 4 12:21:52 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hB4HLqEY016526 for ; Thu, 4 Dec 2003 12:21:52 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hB4HLpBx015142 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 4 Dec 2003 12:21:51 -0500 (EST) Received: from tx1.oucs.ox.ac.uk (tx1.oucs.ox.ac.uk [129.67.1.167]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hB4HLono008541 for ; Thu, 4 Dec 2003 12:21:51 -0500 (EST) Received: from scan1.oucs.ox.ac.uk ([129.67.1.166] helo=localhost) by tx1.oucs.ox.ac.uk with esmtp (Exim 4.20) id 1ARxAk-0001A0-HN for types@cis.upenn.edu; Thu, 04 Dec 2003 17:21:50 +0000 Received: from rx1.oucs.ox.ac.uk ([129.67.1.165]) by localhost (scan1.oucs.ox.ac.uk [129.67.1.166]) (amavisd-new, port 25) with ESMTP id 04295-06 for ; Thu, 4 Dec 2003 17:21:50 +0000 (GMT) Received: from mail.comlab.ox.ac.uk ([163.1.27.1]) by rx1.oucs.ox.ac.uk with esmtp (Exim 4.20) id 1ARxAk-00019p-3y for types@cis.upenn.edu; Thu, 04 Dec 2003 17:21:50 +0000 Received: from mercury.comlab ([163.1.27.18]:38771 helo=comlab.ox.ac.uk) by mail.comlab.ox.ac.uk with esmtp (Exim 4.24) id 1ARxAj-0001Th-6C for types@cis.upenn.edu; Thu, 04 Dec 2003 17:21:49 +0000 Received: (from jg@localhost) by mercury.comlab.ox.ac.uk (comlab5.0/8.12.9+Sun) id hB4HLnQS009565 for types@cis.upenn.edu; Thu, 4 Dec 2003 17:21:49 GMT Date: Thu, 4 Dec 2003 17:21:49 GMT From: Jeremy.Gibbons@comlab.ox.ac.uk Message-Id: <200312041721.hB4HLnQS009565@mercury.comlab.ox.ac.uk> To: types@cis.upenn.edu X-Mailman-Approved-At: Sun, 14 Dec 2003 12:35:48 -0500 Cc: Subject: Mathematics of Program Construction X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 04 Dec 2003 17:21:52 -0000 [We apologize if you receive multiple copies of this announcement.] MPC 2004 7th International Conference on MATHEMATICS OF PROGRAM CONSTRUCTION ----------------------------------- http://www.cs.cornell.edu/Projects/MPC2004 Organised in conjunction with AMAST '04 12--14 July, 2004 Stirling, Scotland, UK CALL FOR PAPERS This conference aims to promote the development of mathematical principles and techniques that are demonstrably useful in the process of constructing computer programs, whether implemented in hardware or software. The focus of the conference is on techniques that combine precision with conciseness, enabling programs to be constructed by formal calculation. Within this theme, the scope of the conference is very diverse. We welcome contributions to programming methodology (for example, formal methods for program specification and transformation), to programming paradigms (for example, generic programming techniques and type systems) and to language design (for example, programming calculi and programming language semantics). Theoretical contributions are welcome provided their relevance to program construction is evident; discussion of applications is welcome provided the mathematical basis is evident. The conference will be organized in conjunction with the AMAST '04 Conference. There will also be a number of co-located workshops, including CMPP. Proceedings will be published in a volume of Springer-Verlag Lecture Notes in Computer Science. IMPORTANT DATES Deadline for submission of papers: 31st January, 2004 Notification of acceptance/rejection: 5th March, 2004 Final papers due: 26th April, 2004 Full papers should be submitted in Postscript or pdf format by e-mail to patwell@cs.cornell.edu by 31st January, 2004. PROGRAM COMMITTEE Roland Backhouse, Stephen Bloom, Eerke Boiten, Jules Desharnais, Thorsten Ehm, Jeremy Gibbons, Ian Hayes, Eric Hehner, Johan Jeuring, Dexter Kozen (chair), Rustan Leino, Hans Leiss, Christian Lengauer, Lambert Meertens, Bernhard Moeller, David Naumann, Alberto Pardo, Georg Struth, Jerzy Tiuryn, Mark Utting FURTHER INFORMATION Please refer to the web page for further details. http://www.cs.cornell.edu/Projects/MPC2004 From carlo.combi@univr.it Fri Dec 5 06:35:07 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hB5BZ7EY019637 for ; Fri, 5 Dec 2003 06:35:07 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hB5BZ6Bx000580 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 5 Dec 2003 06:35:06 -0500 (EST) Received: from mailgw.univr.it (mailgw.univr.it [157.27.6.150]) by central.cis.upenn.edu (8.12.10/8.12.9) with SMTP id hB5BZ4no026555 for ; Fri, 5 Dec 2003 06:35:05 -0500 (EST) Received: (qmail 25581 invoked from network); 5 Dec 2003 11:23:49 -0000 Received: from unknown (HELO profs.sci.univr.it) (157.27.252.10) by mailgw.univr.it with SMTP; 5 Dec 2003 11:23:49 -0000 Received: from univr.it (batadrums.sci.univr.it [157.27.252.32]) by profs.sci.univr.it (8.9.3/8.9.3) with ESMTP id MAA13336 for ; Fri, 5 Dec 2003 12:35:03 +0100 (MET) Message-ID: <3FD06DD1.2010908@univr.it> Date: Fri, 05 Dec 2003 12:36:49 +0100 From: Carlo Combi User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.0; en-US; rv:1.1) Gecko/20020826 X-Accept-Language: en,it MIME-Version: 1.0 To: types Content-Type: text/plain; charset=ISO-8859-15; format=flowed Content-Transfer-Encoding: 8bit X-Mailman-Approved-At: Sun, 14 Dec 2003 12:35:48 -0500 Cc: Subject: TIME 2004 Symposium - call for papers X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 05 Dec 2003 11:35:07 -0000 Prolog: papers are solicited from different research areas, dealing with time-related issues. Several topics could be of interest for the TYPES community. Among them, I mention here: temporal logics for dynamic data types; types for temporal data; type evolution; programming languages for temporal representation and reasoning. ------------------------------------------------ The 11th International Symposium on TEMPORAL REPRESENTATION AND REASONING (TIME 2004) http://www.greyc.unicaen.fr/time2004 Tatihou, Basse Normandie, France 1-3 July, 2004 The purpose of this symposium is to bring together active researchers from distinct research areas involving the representation of, or reasoning with, time. As with previous meetings in this respected series, one of the main goals of the TIME symposium will be to bridge the gap between theoretical and applied research in temporal representation and reasoning. Thus, we especially encourage submissions concerning temporal aspects within areas such as Artificial Intelligence, Temporal/Spatial Databases and Applications of Temporal Logic in Computer Science in order to achieve a multi-disciplinary perspective on the topic and to benefit from cross-fertilisation of ideas. There are three tracks in the symposium with separate program committees, all overseen by the program chairs. The conference is planned as a three-day event, and will be organised as a combination of technical paper presentations, an extended poster session, and four keynote talks. INVITED SPEAKERS Invited Speakers: Michael Bohlen, Free University of Bozen-Bolzano, Italy Manolis Koubarakis, University of Crete, Greece Ian Pratt-Hartmann, University of Manchester, UK Thierry Vidal, ENI Tarbes France TOPICS Submission of high quality papers describing mature results or on-going work are welcome. Submitted papers should describe original, previously unpublished, research, should be written in English, and should not be simultaneously submitted for publication elsewhere. Topics of interest within the scope of each track include, but are not restricted to: Track1: Temporal Representation and Reasoning in AI - temporal aspects of agent-based systems - temporal constraint reasoning - reasoning about actions and change - temporal languages for planning - temporal languages and architectures - ontologies of time - expressive power versus tractability - belief and uncertainty in temporal knowledge - temporal learning and discovery - time and nonmonotonicity - time in problem solving (e.g. diagnosis, scheduling,...) - time in human-machine interaction - spatio-temporal reasoning Track 2: Time Management in Databases - temporal data models - temporal database design - temporal query languages - indexing of temporal data - temporal database systems - spatio-temporal databases - constraint databases - temporal data mining - time in multimedia databases - time in web applications - time in federated and heterogeneous systems - time in workflow systems - querying time series databases - querying data streams Track 3: Temporal Logic in Computer Science - specification and verification - synthesis and execution - model checking algorithms - temporal architectures - temporal logics for distributed systems - temporal logics of knowledge - hybrid systems - tools and practical systems PAPER SUBMISSION Submissions must not exceed the length of 11 pages; font size must be 11pt or larger. The submission should describe original, previously unpublished research. It is strongly suggested the use of the LaTeX article style at 11pt. Overlength submissions will be rejected without review. Please, indicate the category, track, and topic(s) on the first page. Accepted papers will be invited for full presentation or a poster presentation. Papers should be electronically submitted via the form available at the TIME 2004 web site (http://www.greyc.unicaen.Fr/time2004). All submissions must be received by Thursday 5 February, 2004. PROCEEDINGS As usual within the TIME series, proceedings will be published by IEEE Computer Society Press and will be subject to IEEE Copyright. Camera ready papers are expected to be produced with the author kits sent by IEEE Computer Society Press. It is also our intention to organise a special issue of a respected journal, containing extended versions of selected papers from the symposium. PROGRAM COMMITTEE -Track 1: Temporal Representation and Reasoning in AI Peter van Beek, University of Waterloo, Canada Maroua Bouzid, University of Caen, France Jean-François Condotta, University of Artois, France Alfonso Gerevini, Universita' di Brescia, Italy Scott Goodwin, University of Windsor, Canada Howard Hamilton, University of Regina, Canada Peter Jonsson, Linköping University, Sweden Lina Khatib, NASA Ames Research Center, USA Carsten Lutz, Technical University Dresden, Germany Roque Marin, University of Murcia, Spain Debasis Mitra, Florida Institute of Technology, USA Angelo Montanari, University of Udine, Italy Bernhard Nebel, Albert-Ludwigs-Universitat Freiburg, Germany Ian Pratt-Hartmann, University of Manchester, UK Mark Steedman, University of Edinburgh, UK Paolo Terenziani, Universita' del Piemonte Orientale, Italy Andre Trudel, Acadia University, Canada Thierry Vidal, ENIT, France -Track 2: Time Management in Databases Alessandro Artale, Free University of Bozen-Bolzano, Italy Elisa Bertino, Universita' di Milano, Italy Claudio Bettini, Universita' di Milano, Italy Johann Eder, University of Klagenfurt, Austria Enrico Franconi, Free University of Bozen-Bolzano, Italy Christian Jensen, Aalborg University, Denmark Manolis Koubarakis, Technical University of Crete, Greece Bart Kuijpers, University of Limburg, Belgium Maria Orlowska, University of Queensland, Australia Peter Revesz, University of Nebraska-Lincoln, USA David Toman, University of Waterloo, Canada Xiaoyang Sean Wang, University of Vermont, Burlington, USA Jef Wijsen, Universite' de Mons-Hainaut, Belgium Carlo Zaniolo, UCLA, USA -Track 3: Temporal Logic in Computer Science Howard Barringer, Univ. of Manchester, UK Dennis Dams, Bell Labs, USA Clare Dixon, The University of Liverpool, UK Michael Fisher, The University of Liverpool, UK Ullrich Hustadt, The University of Liverpool, UK Yonit Kesten, Ben Gurion University, Israel Alberto Policriti, Universita' di Udine, Italy Hans Juergen Ohlbach, Institut für Informatik, Munich, Germany Mehmet Orgun, Macquarie University, Australia Alexander Rabinovich, Tel Aviv University, Israel Bernd-Holger Schlingloff, University of Bremen, Germany Philippe Schnoebelen, CNRS, Framce A. Prasad Sistla, The University of Illinois at Chicago, USA Colin Stirling, Edinburgh University, UK Pierre Wolper, Universite de Liege, Belgium CONFERENCE OFFICERS General Chair: Michael Fisher, The University of Liverpool, UK Program Committee Chairs: Carlo Combi, University of Verona, Italy Gérard Ligozat, University of Paris-Sud, France Organisation Chair: Maroua Bouzid, University of Caen, France IMPORTANT DATES Paper Submission Deadline: 5 February, 2004 Notification of Acceptance: 29 March, 2004 Camera Ready Copy Due: 16 April, 2004 TIME 2004 Symposium: 1-3 July, 2004 FURTHER INFORMATION: http://www.greyc.unicaen.fr/time2004 -- ======================================== Carlo Combi, Ph.D. Dipartimento di Informatica Universita' degli Studi di Verona Ca' Vignal 2 strada le Grazie 15 I-37134 Verona - VR - Italy phone: ++39 045 802 7985 mobile: ++39 328 8606227 fax: ++39 045 802 7068 email: combi@sci.univr.it http://profs.sci.univr.it/~combi ======================================== From andrews@csd.uwo.ca Fri Dec 5 16:27:38 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hB5LRcEY021531 for ; Fri, 5 Dec 2003 16:27:38 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hB5LRbBx001274 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 5 Dec 2003 16:27:38 -0500 (EST) Received: from chaplin.csd.uwo.ca (chaplin.csd.uwo.ca [129.100.10.252]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hB5LRbno028175 for ; Fri, 5 Dec 2003 16:27:37 -0500 (EST) X-Client-Addr: 129.100.17.19 Received: from localhost (andrews@localhost) by temperance.csd.uwo.ca (8.11.7+Sun/8.11.6) with ESMTP id hB5LS3R10857; Fri, 5 Dec 2003 16:28:04 -0500 (EST) X-Authentication-Warning: temperance.csd.uwo.ca: andrews owned process doing -bs Date: Fri, 5 Dec 2003 16:28:03 -0500 (EST) From: Jamie Andrews To: types@cis.upenn.edu, Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Mailman-Approved-At: Sun, 14 Dec 2003 12:35:48 -0500 Cc: Subject: Tech report: "Cut Elimination for a Weakly Typed Higher Order Logic" X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 05 Dec 2003 21:27:39 -0000 Readers might be interested in the following technical report, now available on http://www.csd.uwo.ca/faculty/andrews/papers/ James H. Andrews. "Cut Elimination for a Weakly Typed Higher Order Logic." Technical Report No. 611, Department of Computer Science, University of Western Ontario, December 2003. Abstract: Cut-elimination is proved for a weakly-typed higher order logic based on those presented by Gilmore. The logic allows lambda-abstraction over terms and formulas, permitting all terms of the untyped lambda calculus including the Y combinator, and providing various methods of expressing recursive functions and predicates. Consistency is achieved in the logic via a nominalist distinction between use and mention of terms. This report is intended as a companion to Andrews, "A Weakly-Typed Logic with General Lambda Terms and Y-Combinator", Works in Progress Track, TPHOLs 2002, which presented the syntax, semantics and consistency of the logic. cheers --Jamie. From cclifton@cs.iastate.edu Mon Dec 8 12:07:54 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hB8H7rEY003082 for ; Mon, 8 Dec 2003 12:07:54 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hB8H7iBx019446 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 8 Dec 2003 12:07:44 -0500 (EST) Received: from mail.cs.iastate.edu (mail.cs.iastate.edu [129.186.3.8]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hB8H7hnp025448 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 8 Dec 2003 12:07:43 -0500 (EST) Received: from cs.iastate.edu (pvs.cs.iastate.edu [129.186.3.45]) (authenticated bits=0) by mail.cs.iastate.edu (8.12.8/8.12.8) with ESMTP id hB8H7Y90012181; Mon, 8 Dec 2003 11:07:35 -0600 Message-ID: <3FD4AFC5.9090202@cs.iastate.edu> Date: Mon, 08 Dec 2003 11:07:17 -0600 From: Curtis Clifton User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.4) Gecko/20030624 X-Accept-Language: en-us, en MIME-Version: 1.0 To: types@cis.upenn.edu, prog-lang@diku.dk, acl2@cs.utexas.edu, behavior@cs.ucsd.edu, formal-methods@cs.uidaho.edu, fsdm@it.uq.edu.au, isabelle-users@cl.cam.ac.uk, lfcs-interest@dcs.ed.ac.uk, members@fmeurope.org, pvs@csl.sri.com, stochver@cs.bham.ac.uk, theorem-provers@ai.mit.edu, zeves@ora.on.ca, zforum@prg.ox.ac.uk, mfps_mail@linus.math.tulane.edu, mspls@cis.ohio-state.edu Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit X-Mailman-Approved-At: Sun, 14 Dec 2003 12:35:48 -0500 Cc: Subject: CFP FOAL 2004: Foundations of Aspect-Oriented Languages X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 08 Dec 2003 17:07:54 -0000 FOAL: Foundations of Aspect-Oriented Languages A one day workshop affiliated with AOSD 2004 in Lancaster, UK, on March 23, 2003. Themes and Goals FOAL is a forum for research in foundations of aspect-oriented programming languages. Areas of interest include but are not limited to: * Semantics of aspect-oriented languages * Specification and verification for such languages * Type systems * Static analysis * Theory of testing * Theory of aspect composition * Theory of aspect translation (compilation) and rewriting The workshop aims to foster work in foundations, including formal studies, promote the exchange of ideas, and encourage workers in the semantics and formal methods communities to do research in the area of aspect-oriented programming languages. All theoretical and foundational studies of this topic are welcome. The goals of FOAL are to: * Make progress on the foundations of aspect-oriented programming languages. * Exchange ideas about semantics and formal methods for aspect-oriented programming languages. * Foster interest within the programming language theory and types communities in aspect-oriented programming languages. * Foster interest within the formal methods community in aspect-oriented programming and the problems of reasoning about aspect-oriented programs. Workshop Format The planned workshop format is primarily presentation of papers and group discussion. Talks will come in three categories: long (30 minutes plus 15 minutes of discussion), short (20 minutes plus 5 minutes of discussion) and very short (7 minutes plus 3 minutes of discussion). The very short talks will allow for short presentations of topics for which results are not yet available, perhaps for researchers who are seeking feedback on ideas or seek collaborations. We also plan to ensure sufficient time for discussion of each presentation by limiting the number of long talks and having only a few short talks. Submissions Invitation to the workshop will be based on papers selected by the program committee; those wishing to attend but not having a paper to submit should contact the organizers directly to see if there is sufficient space in the workshop. FOAL solicits papers on all areas of formal foundations of AOP languages. Submissions will be read by the program committee and designated reviewers. Papers will be selected for long, short, and very short presentation at the workshop based on their length, scientific merit, innovation, readability and relevance. Papers previously published or already being reviewed by another conference are not eligible. We will limit the length of paper presentations and the number of papers presented to make sure that there is enough time for discussion. Papers presented at the workshop will be included in a technical report (from Iowa State University). Authors will retain their own copyright to the papers. Publication of papers at other venues will thus remain possible. We will also investigate having a special issue of a journal for revisions of selected papers after the workshop. Authors should note the following details: * Submissions are due no later than 23:00 GMT, Monday, 19 January 2004. (This is a firm deadline.) * Authors must indicate whether they wish to be considered for a long, short, or very short presentation. * Papers for long presentations must not exceed 10 pages in length; those for short presentations must not exceed 5 pages in length, and those for very short presentations must not exceed 3 pages in length. * Some papers may not be selected for presentation, and some may be selected for presentation in shorter talks than requested. * We encourage use of the ACM Conference format for submissions, as this will be required for accepted papers. You must add page numbers (which are not part of the standard format) to your submissions, to make adding comments easier. * Submissions are to be sent as PDF (preferred) or postscript attachments in an email to Curtis Clifton, cclifton -at- cs -dot- iastate -dot- edu. We will notify the corresponding author of papers that are selected for presentation at the workshop by 9 February 2004. The early registration deadline for AOSD is 13 February 2004. FOAL attendees must be registered for AOSD. Final versions of papers for the proceedings will be due on 1 March 2004. For more information, visit the FOAL Workshop home page at http://www.cs.iastate.edu/FOAL. Important Dates Submission Deadline 23:00 GMT, 19 January 2004 Notification of Acceptance 9 February 2004 Final Versions of Papers Due 1 March 2004 Workshop 23 March 2004 From als+lics-junk@inf.ed.ac.uk Fri Dec 12 06:54:01 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hBCBs1EY016725 for ; Fri, 12 Dec 2003 06:54:01 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hBCBrxBx003409 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 12 Dec 2003 06:54:00 -0500 (EST) Received: from topper.inf.ed.ac.uk (topper.inf.ed.ac.uk [129.215.32.40]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hBCBrwno004913 for ; Fri, 12 Dec 2003 06:53:59 -0500 (EST) Received: from cuillin.inf.ed.ac.uk (IDENT:root@cuillin.inf.ed.ac.uk [129.215.32.61]) by topper.inf.ed.ac.uk (8.11.6/8.11.6) with ESMTP id hBCBrIr21907; Fri, 12 Dec 2003 11:53:18 GMT Received: (from als@localhost) by cuillin.inf.ed.ac.uk (8.11.6/8.11.6) id hBCBrIe05879; Fri, 12 Dec 2003 11:53:18 GMT Date: Fri, 12 Dec 2003 11:53:18 GMT Message-Id: <200312121153.hBCBrIe05879@cuillin.inf.ed.ac.uk> X-Authentication-Warning: cuillin.inf.ed.ac.uk: als set sender to als+lics-junk@inf.ed.ac.uk using -f To: LICS List From: Alex Simpson Errors-To: als+lics-junk@inf.ed.ac.uk X-Mailman-Approved-At: Sun, 14 Dec 2003 12:35:48 -0500 Cc: theorem-provers@mc.lcs.mit.edu, unification@sics.se, sigparse-list@cs.cmu.edu, theory-logic@cs.cmu.edu, types@cis.upenn.edu, theorem-provers@ai.mit.edu Subject: LICS 2004: 2nd CFP X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list Reply-To: als+lics-junk@dcs.ed.ac.uk List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 12 Dec 2003 11:54:01 -0000 CALL FOR PAPERS Nineteenth Annual IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS 2004) July 14th - 17th, 2004, Turku, Finland http://www.lfcs.informatics.ed.ac.uk/lics/ The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic in a broad sense. We invite submissions on that theme. Suggested, but not exclusive, topics of interest for submissions include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, domain theory, finite model theory, proof theory, formal aspects of program analysis, formal methods, hybrid systems, lambda and combinatory calculi, linear logic, logical aspects of computational complexity, logics in artificial intelligence, logical representation of knowledge, logics of programs, logic programming, modal and temporal logics, model checking, programming language semantics, reasoning about security, rewriting, specifications, type systems and type theory, and verification. Important Dates: Authors are required to submit electronically a paper title and a short abstract of about 100 words before submitting the extended abstract of the paper. Titles & Short Abstracts Due : January 26, 2004 Extended Abstracts Due : February 2, 2004 Author Notification : March 27, 2004 Camera-ready Papers Due : April 25, 2004 All deadlines are firm; late submissions will not be considered. Detailed information about electronic paper submission will be posted at the LICS website. Submission Instructions: Extended abstracts must be submitted electronically in the IEEE Proceedings two-column camera-ready format. Each abstract must be in English and provide sufficient detail to allow the program committee to assess the merits of the paper. It should begin with a succinct statement of the issues, a summary of the main results, and a brief explanation of their significance and relevance to the conference and to computer science, all phrased for the non-specialist. Technical development directed to the specialist should follow. References and comparisons with related work should be included. Extended abstracts may be no longer than 10 pages including references, and must be formatted in the IEEE Proceedings two-column camera-ready style (IEEE style files will be accessible from the LICS website). If necessary, detailed proofs of technical results can be included in a clearly-labelled appendix in the same two-column format following the 10-page extended abstract. This material may be read at the discretion of the program committee. Extended abstracts not conforming to the above requirements concerning format and length may be rejected without further consideration. The results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia or workshops. All authors of accepted papers will be expected to sign copyright release forms. One author of each accepted paper will be expected to present it at the conference. Short Presentations: LICS 2004 will have a session of short (5--10 minutes) presentations. This session is intended for descriptions of work in progress, student projects, and relevant research being published elsewhere; other brief communications may be acceptable. Submissions for these presentations, in the form of short abstracts (1 or 2 pages long), should be entered at the LICS 2004 submission site between March 27th and April 4th, 2004. Authors will be notified of acceptance or rejection by April 17th, 2004. Kleene Award for Best Student Paper: An award in honor of the late S.C. Kleene will be given for the best student paper, as judged by the program committee. For a submission to be eligible, the research presented in the paper must have been carried out while all authors were full-time students. The program committee may decline to make the award or may split it among several papers. Affiliated Workshops: As in previous years, there will be a number of workshops affiliated with LICS 2004; information will be posted at the LICS website. Program Chair: Harald Ganzinger MPI Informatik, Saarbruecken, Germany http://www.mpi-sb.mpg.de/~hg/ Program Committee: Rajeev Alur, U. of Pennsylvania Andrew Appel, Princeton U. Albert Atserias, UPC, Barcelona Franz Baader, Dresden U. Samuel Buss, U. of California, San Diego Roberto Di Cosmo, U. de Paris VII Gilles Dowek, Ecole Polytechnique, Paris Harald Ganzinger, MPI, Saarbruecken (chair) Martin Hofmann, LMU Muenchen Achim Jung, U. of Birmingham Kim Larsen, Aalborg U. Leonid Libkin, U. of Toronto Rocco de Nicola, U. di Firenze Damian Niwinski, Warsaw U. Prakash Panangaden, McGill U., Montreal Albert Rubio, UPC, Barcelona Vitaly Shmatikov, SRI International Moshe Vardi, Rice U., Houston Helmut Veith, TU Wien Andrei Voronkov, U. of Manchester Conference Chair: Lauri Hella Department of Math., Stat., and Phil. Kanslerinrinne 1 33014 University of Tampere, Finland Email: lauri.hella@uta.fi Workshops Chair: Phil Scott, U. of Ottawa Email: phil@site.uottawa.ca Publicity Chair: Alex Simpson, U. of Edinburgh Email: Alex.Simpson@ed.ac.uk General Chair: Phokion G. Kolaitis, UC Santa Cruz Email: kolaitis@cse.ucsc.edu Organizing Committee: S. Abramsky, A. Broder, E. Clarke, A. Felty, H. Ganzinger, H. Gabow, J. Halpern, L. Hella, U. Kohlenbach, P. Kolaitis (chair), D. Leivant, G. Longo, H. Mairson, A. Middeldorp, J. Mitchell, M. Nielsen, P. Panangaden, G. Plotkin, F. Pfenning, P. Scott, R. Shore, A. Simpson, I.A. Stewart. Advisory Board: Y. Gurevich, C. Kirchner, D. Kozen, U. Martin, L. Pacholski, V. Pratt, A. Scedrov, M.Y. Vardi, G. Winskel. Sponsorship: 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 for Theoretical Computer Science. Invited Speakers: The following distinguished speakers have agreed to give invited talks at LICS 2004 : Samson Abramsky (Oxford U.), Robert Harper (Carnegie Mellon University), Alexander Razborov (IAS, Princeton, and Steklov Math. Inst., Moscow), Davide Sangiorgi (U. di Bologna), Igor Walukiewicz (U. Bordeaux), and Mihalis Yannakakis (Stanford U.). Collocated events: ICALP'04 will be collocated with LICS'04; for details see http://www.math.utu.fi/ICALP04/. From fausto.spoto@univr.it Wed Dec 17 09:02:34 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hBHE2YEY004543 for ; Wed, 17 Dec 2003 09:02:34 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hBHE2WBx006339 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 17 Dec 2003 09:02:32 -0500 (EST) Received: from mailgw.univr.it (mailgw.univr.it [157.27.6.150]) by central.cis.upenn.edu (8.12.10/8.12.9) with SMTP id hBHE2Vno026616 for ; Wed, 17 Dec 2003 09:02:31 -0500 (EST) Received: (qmail 75825 invoked from network); 17 Dec 2003 13:51:52 -0000 Received: from unknown (HELO profs.sci.univr.it) (157.27.252.10) by mailgw.univr.it with SMTP; 17 Dec 2003 13:51:52 -0000 Received: from [157.27.242.214] ([157.27.242.214]) by profs.sci.univr.it (8.9.3/8.9.3) with ESMTP id PAA15110; Wed, 17 Dec 2003 15:02:24 +0100 (MET) From: Fausto Spoto To: concurrency@cwi.nl, types@cis.upenn.edu, rewriting@loria.fr, theorem-provers@ai.mit.edu, lprolog@cs.umn.edu, prog-lang@diku.dk, eapls@jiscmail.ac.uk, theory@brics.dk, gulp@di.unipi.it, seworld@cs.colorado.edu, types@cis.upenn.edu, clp@comp.nus.edu.sg, benelog@cs.kuleuven.ac.be, clean-list@cs.kun.nl, curry@informatik.rwth-aachen.de, glp@first.gmd.de, mercury-ads@cs.mu.oz.au, practical-applications@pap.com, sicstus-users@sics.se, users@mozart-oz.org Content-Type: text/plain Content-Transfer-Encoding: 7bit X-Mailer: Ximian Evolution 1.0.8 (1.0.8-10) Message-Id: <1071669539.1269.37.camel@localhost.localdomain> Mime-Version: 1.0 X-Mailman-Approved-At: Wed, 17 Dec 2003 09:09:17 -0500 Cc: Subject: PPDP 2004: 1st Call for Papers X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Date: Wed, 17 Dec 2003 14:02:34 -0000 X-Original-Date: 17 Dec 2003 14:58:54 +0100 X-List-Received-Date: Wed, 17 Dec 2003 14:02:34 -0000 Preliminary Call for Papers PPDP'04 Sixth ACM-SIGPLAN Symposium on Principles and Practice of Declarative Programming http://www.sci.univr.it/~ppdp04 Verona, Italy, 24-26 August 2004 (co-located with LOPSTR'04, PEPM'04 and SAS'04) IMPORTANT DATES Intent to Submit 28 March 2004 Submission 4 April 2004 Notification 2 May 2004 Final Version 20 June 2004 SCOPE OF THE CONFERENCE: PPDP 2004 aims to provide a forum that brings together those in the declarative programming communities, including those working in the logic, constraint and functional programming paradigms. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analyzing computations, and to stimulate cross-fertilization by including work from one community that could be of particular interest and relevance to the others. Topics of more specific interest are enhancements to such formalisms with mechanisms for mobility, modularity, concurrency, object-orientation, and static analysis, as well as the fuller exploitation of the programming-as-proof-search framework through new designs and improved implementation methods. At the level of methodology, the use of logic-based principles in the design of tools for program development, analysis, and verification relative to all declarative paradigms is of interest. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. This list is not exhaustive: submissions related to new and interesting ideas relating broadly to declarative programming are encouraged. Prospective authors are encouraged to communicate with the Program Chair about the suitability of a specific topic. TOPICS (Non-exhaustive): Logic, Constraint, and Functional Programming; Applications of Declarative Programming; Methodologies for Program Design and Development; Declarative aspects of Object-Oriented Programming; Concurrent Extensions to declarative languages; Declarative Mobile Computing; Integration of Paradigms; Proof Theoretic and Semantic Foundations; Type and Module Systems; Program Analysis and Verification; Program Transformation; Abstract Machines and Compilation; and Programming Environments. CONFERENCE VENUE AND RELATED EVENTS: PPDP'04 will take place in a centrally located facility provided by Univ.of Verona, and is scheduled in co-location with 3 other conferences. Tue 24 Wed 25 Thu 26 Fri 27 Sat 28 PPDP PPDP PPDP PEPM PEPM LOPSTR LOPSTR LOPSTR SAS SAS SAS Verona is among the most important historical and artistic town in Italy, with more than two thousand years of history. During the Roman Empire it was a political and commercial centre, whose magnificent traces can still be seen in the Arena and the Roman Theatre. The city has always been synonymous with culture, nowadays it attracts people from everywhere thanks to the Arena, the myth of Romeo and Juliet and its precious beauty. PPDP'04 has been scheduled at the end of August 2004, so that participants may also appreciate the cultural events in town, such as the opera at the Arena and other open air concerts and happenings. Verona has an international airport, and can be reached also from Venice and from Milan in less than 2 hours. SUBMISSION GUIDELINES: You are asked to indicate by 28 March 2004 an intention to submit, consisting of Title, Author(s). Papers should be submitted electronically by 4 April 2004 via the symposium's Web page. Acceptable formats are PostScript or PDF, viewable by gv. Submissions should not exceed 12 pages (including bibliography and appendices) in standard ACM conference format. They must be written in English, must have a cover page with an abstract of up to 200 words, keywords, postal and electronic mailing addresses, and phone and fax numbers of the corresponding author. EVALUATION OF SUBMISSIONS: Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. They must describe original, previously unpublished work that has not been simultaneously submitted for publication elsewhere. Authors who wish to provide additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices: reviewers are not required to read such appendices. Submissions that do not meet these guidelines may not be considered. PROCEEDINGS: Proceedings will be published by ACM Press. ACM formatting guidelines are available at http://www.acm.org/sigs/pubs/proceed/template.html, along with formatting templates or style files for LaTeX, Word Perfect, and Word. Authors of accepted papers will be required to sign the ACM copyright form. PC CHAIR: David S. Warren, Univ. of New York at Stony Brook & XSB Inc. email: warren@cs.sunysb.edu web: http://www.cs.sunysb.edu/~warren/ PROGRAM COMMITTEE: To be determined CONF. CHAIR: E.Moggi, Univ. of Genova. LOCAL CHAIRS: R.Giacobazzi and F.Spoto, Univ. of Verona. PREVIOUS PPDP CONFERENCES: Paris (1999), Montreal (2000), Firenze (2001), Pittsburgh (2002), Uppsala (2003). From fausto.spoto@univr.it Wed Dec 17 11:34:07 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hBHGY7EY005040 for ; Wed, 17 Dec 2003 11:34:07 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hBHGY5Bx012954 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 17 Dec 2003 11:34:06 -0500 (EST) Received: from mailgw.univr.it (mailgw.univr.it [157.27.6.150]) by central.cis.upenn.edu (8.12.10/8.12.9) with SMTP id hBHGY4no017711 for ; Wed, 17 Dec 2003 11:34:05 -0500 (EST) Received: (qmail 91519 invoked from network); 17 Dec 2003 16:23:27 -0000 Received: from unknown (HELO profs.sci.univr.it) (157.27.252.10) by mailgw.univr.it with SMTP; 17 Dec 2003 16:23:27 -0000 Received: from [157.27.242.214] ([157.27.242.214]) by profs.sci.univr.it (8.9.3/8.9.3) with ESMTP id RAA19212; Wed, 17 Dec 2003 17:33:57 +0100 (MET) From: Fausto Spoto To: concurrency@cwi.nl, types@cis.upenn.edu, rewriting@loria.fr, theorem-provers@ai.mit.edu, lprolog@cs.umn.edu, prog-lang@diku.dk, eapls@jiscmail.ac.uk, theory@brics.dk, gulp@di.unipi.it, seworld@cs.colorado.edu, types@cis.upenn.edu, clp@comp.nus.edu.sg, benelog@cs.kuleuven.ac.be, clean-list@cs.kun.nl, curry@informatik.rwth-aachen.de, glp@first.gmd.de, mercury-ads@cs.mu.oz.au, practical-applications@pap.com, sicstus-users@sics.se, users@mozart-oz.org Content-Type: text/plain Content-Transfer-Encoding: 7bit X-Mailer: Ximian Evolution 1.0.8 (1.0.8-10) Message-Id: <1071678634.1231.46.camel@localhost.localdomain> Mime-Version: 1.0 X-Mailman-Approved-At: Wed, 17 Dec 2003 11:42:20 -0500 Cc: Subject: SAS 2004: 1st Call for Papers X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Date: Wed, 17 Dec 2003 16:34:07 -0000 X-Original-Date: 17 Dec 2003 17:30:28 +0100 X-List-Received-Date: Wed, 17 Dec 2003 16:34:07 -0000 ***************************************************** * SAS'04 Call for Papers * * The 11th International Static Analysis Symposium * * August 26 - 28 2004, Verona, Italy * * www.sci.univr.it/~sas04 * * (co located with LOPSTR'04, PEPM'04, and PPDP'04) * ***************************************************** Static Analysis is increasingly recognized as a fundamental tool for high performance implementations and verification of programming languages and systems. The series of Static Analysis Symposia has served as the primary venue for presentation of theoretical, practical, and application advances in the area. The eleventh International Static Analysis Symposium (SAS'04) will be held in Verona, Italy, co-located with LOPSTR 2004 - International Symposium on Logic-based Program Synthesis and Transformation, PEPM 2004 - ACM SIGPLAN 2004 Workshop on Partial Evaluation and Semantics Based Program Manipulation, and PPDP 2004 - 6th ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming. Previous symposia were held in San Diego, Madrid, Paris, Santa Barbara, Venice, Pisa, Paris, Aachen, Glasgow and Namur. The technical program for SAS'04 will consist of invited lectures, tutorials, panels, presentations of refereed papers, and software demonstrations. Contributions are welcome on all aspects of Static Analysis, including, but not limited to: abstract domains, abstract interpretation, abstract testing, complexity analysis, data flow analysis, model checking, optimizing compilers, program specialization, security analysis, theoretical frameworks, type inference, verification systems. Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic and object-oriented programming. Survey papers that present some aspect of the above topics with a new coherence are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings. *Submission instructions:* All submissions must be performed electronically from the conference web site: http://profs.sci.univr.it/~sas04. Submitted papers should be at most 15 pages excluding bibliography and well-marked appendices. Program committee members are not required to read the appendices, and thus papers should be intelligible without them. The proceedings will be published by Springer-Verlag in the Lecture Notes in Computer Science series (see http://www.springer.de/comp/lncs/authors.html for the LNCS author instructions). Thus, adhering to that style already in the submission is strongly encouraged. Papers should be submitted either in PostScript or PDF format and they should be interpretable by Ghostscript or Acrobat Reader. Papers must be printable on either A4 paper or US letter, and preferably on both. *Best paper award:* This year there will be an award (500 euros) for the best among the accepted papers, as judged by the program committee. The program committee reserves the right not to give the award or to split the award among several papers. Papers authored or co-authored by PC members are not eligible for the award. This is a new award started at SAS 2004. *Important dates:* Submission: *April 4, 2004*. Notification: *May 2, 2004*. Camera-ready: *May 30, 2004*. Conference: *August 26-28, 2004*. *Program Committee:* * Thomas Ball (Microsoft, USA) * Radhia Cousot (Ecole Polytechnique, FR) * Roberto Giacobazzi (U. Verona, IT -- PC Chair) * Chris Hankin (Imperial College, UK) * Thomas Jensen (IRISA/CNRS Rennes, FR) * Jens Knoop (TU Wien, AT) * Giorgio Levi (U. Pisa, IT) * Laurent Mauborgne (ENS, FR) * Andreas Podelski (MPI, DE) * German Puebla (UPM, ES) * Ganesan Ramalingam (IBM, USA) * Francesco Ranzato (U. Padova, IT) * Martin Rinard (MIT, USA) * Andrei Sabelfeld (CUT, SE) * Mary Lou Soffa (Pittsburgh U., USA) * Harald Sondergaard (U. Melbourne, AU) * Reinhard Wilhelm (Saarland U., DE) *Contact address:* Roberto Giacobazzi, SAS'04 PC Chair Dipartimento di Informatica Universita' di Verona Strada Le Grazie 15, Ca' Vignal 2, 37134 Verona, Italy E-mail: roberto.giacobazzi@univr.it *Organizing Committee:* * Fausto Spoto (Chair, E-mail: fausto.spoto@univr.it) * Mila Dalla Preda * Samir Genaim * Isabella Mastroeni * Massimo Merro * Giovanni Scardoni * Damiano Zanardini *Venue:* Verona is among the most important historical and artistic town in Italy, with more than two thousand years of history. During the Roman Empire it was a political and commercial centre, whose magnificent traces can still be seen in the Arena and the Roman Theatre. Verona has always been synonymous with culture, nowadays it attracts people from everywhere thanks to the Arena, the myth of Romeo and Juliet and its precious beauty. SAS'04 has been scheduled at the end of August 2004, so that participants may also appreciate the cultural events in town, such as the opera at the Arena and other open air concerts and happenings. *Workshops:* Those intending to organize a workshop at LOPSTR'04 + PEPM'04 + PPDP'04 + SAS'04 are invited to submit a workshop proposal to the workshop chair: Fausto Spoto (fausto.spoto@univr.it). Proposals should be in English and about two pages in length. They should contain: * the title of the workshop * a brief technical description of the topics covered by the workshop * a discussion of the timeliness and relevance of the workshop * the names, affiliation and contact details (email, web page, phone, fax) of the workshop organizing committee together with a designated contact person as the workshop coordinator * a preliminary plan/schedule for organizing the workshop, including the required number of half-days allotted to the workshop * a list of previously-organized related workshops by any of the workshop organizing committee. Although previous experience with organizing similar workshops is not required, this information will be helpful to the Workshop Chair * an estimated number of attendants to the workshop Proposals are expected in ASCII or LaTeX format. All proposals should be submitted to the Workshop Chair by email by January 18, 2004. From fausto.spoto@univr.it Wed Dec 17 12:47:23 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hBHHlNEY005409 for ; Wed, 17 Dec 2003 12:47:23 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hBHHlLBx016635 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 17 Dec 2003 12:47:22 -0500 (EST) Received: from mailgw.univr.it (mailgw.univr.it [157.27.6.150]) by central.cis.upenn.edu (8.12.10/8.12.9) with SMTP id hBHHlKno012970 for ; Wed, 17 Dec 2003 12:47:20 -0500 (EST) Received: (qmail 98181 invoked from network); 17 Dec 2003 17:36:43 -0000 Received: from unknown (HELO profs.sci.univr.it) (157.27.252.10) by mailgw.univr.it with SMTP; 17 Dec 2003 17:36:43 -0000 Received: from [157.27.242.214] ([157.27.242.214]) by profs.sci.univr.it (8.9.3/8.9.3) with ESMTP id SAA19729; Wed, 17 Dec 2003 18:47:18 +0100 (MET) From: Fausto Spoto To: concurrency@cwi.nl, types@cis.upenn.edu, rewriting@loria.fr, theorem-provers@ai.mit.edu, lprolog@cs.umn.edu, prog-lang@diku.dk, eapls@jiscmail.ac.uk, theory@brics.dk, gulp@di.unipi.it, seworld@cs.colorado.edu, types@cis.upenn.edu, clp@comp.nus.edu.sg, benelog@cs.kuleuven.ac.be, curry@informatik.rwth-aachen.de, glp@first.gmd.de, mercury-ads@cs.mu.oz.au, practical-applications@pap.com, sicstus-users@sics.se, users@mozart-oz.org Content-Type: multipart/mixed; boundary="=-n0Deo5MzbYIDPvLgKKpl" X-Mailer: Ximian Evolution 1.0.8 (1.0.8-10) Message-Id: <1071683031.2596.61.camel@localhost.localdomain> Mime-Version: 1.0 X-Mailman-Approved-At: Thu, 18 Dec 2003 08:38:39 -0500 X-Content-Filtered-By: Mailman/MimeDel 2.1.2 Cc: Subject: PEPM 2004: 1st Call for Papers X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Date: Wed, 17 Dec 2003 17:47:23 -0000 X-Original-Date: 17 Dec 2003 18:43:50 +0100 X-List-Received-Date: Wed, 17 Dec 2003 17:47:23 -0000 --=-n0Deo5MzbYIDPvLgKKpl Content-Type: text/plain Content-Transfer-Encoding: 7bit Call For Papers (Preliminary) ACM SIGPLAN 2004 Symposium on Partial Evaluation and Program Manipulation (PEPM'04) Verona, Italy, August 24-25, 2004 (Co-located with LOPSTR'04, SAS'04 and PPDP'04) The scope of the 2004 PEPM symposium will be based on a very broad interpretation of semantics-based program manipulation. This includes not only traditional partial evaluation and specialization areas, but any research topic that fundamentally relies upon program manipulation driven by program meaning. Examples include security mechanisms based on systematic program transformation (e.g. introduction of stack-protection checks, execution monitoring, obfuscation), automatic differentiation methods and techniques for program generation. Topics of interest for PEPM'04 include, but are not limited to: * Applications: domain-specific applications, systems programming, scientific computing, algorithmics, graphics, security checking, simulation, compiler generation, compiler optimization, decompilation, obfuscation, prototyping, profiling, debugging, and industrial applications. * Techniques: program generation and generative programming, specialization, normalization, reflection, run-time code generation, multi-level programming, meta-programming, program analysis and types. * Assessment: applicability of program manipulation techniques to particular architectures and language paradigms, scalability, benchmarking, portability. We especially encourage papers that break new ground, including new techniques, new ways of thinking about established approaches, and new areas of application such as mobile code, and security (e.g. intrusion prevention/detection, design and implementation of secure systems). Submission guidelines: Papers should be submitted electronically via the symposium's Web page. Exceptionally, submissions may be emailed to the program chairs: nch@agere.com and sestoft@dina.kvl.dk. Acceptable formats are PostScript or PDF, viewable by gv. Submissions should not exceed 5000 words, excluding bibliography and figures. Excessively long submissions may be rejected outright. Evaluation of Submissions: Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. They must describe work that has not previously been published in a major forum. Authors must indicate if a closely related paper is also being considered for another conference or journal. The conference proceedings will be published by ACM Press. Venue: Verona in northern Italy was a major city in Roman times. Its famous and well-preserved Roman Arena (amphitheatre) is around 1900 years old, yet you can still attend theatre and opera performances there. Verona has an international airport but can also be reached from Venice in 1 hour and a half and from Milan in 2 hours. Symposium Web page: http://www.sci.univr.it/~pepm04/ PEPM'04 Dates Submission 11:59pm GMT, Wednesday May 5, 2004 Notification Wednesday May 26, 2004 Early reg. Wednesday June 16, 2004 Camera-ready Wednesday June 16, 2004 Symposium Tuesday-Wednesday August 24-25, 2004 Co-located events, August 2004 Tue 24 PPDP + PEPM Wed 25 PPDP + PEPM Thu 26 PPDP + SAS + LOPSTR Fri 27 SAS + LOPSTR Sat 28 SAS + LOPSTR Symposium Chairs: Nevin Heintze Agere Systems E-mail: nch@agere.com Peter Sestoft Royal Veterinary and Agricultural University, Denmark and IT University of Copenhagen, Denmark E-mail: sestoft@dina.kvl.dk --=-n0Deo5MzbYIDPvLgKKpl-- From fausto.spoto@univr.it Thu Dec 18 05:32:56 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hBIAWuEY007572 for ; Thu, 18 Dec 2003 05:32:56 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hBIAWtBx025180 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 18 Dec 2003 05:32:55 -0500 (EST) Received: from mailgw.univr.it (mailgw.univr.it [157.27.6.150]) by central.cis.upenn.edu (8.12.10/8.12.9) with SMTP id hBIAWrno026021 for ; Thu, 18 Dec 2003 05:32:54 -0500 (EST) Received: (qmail 74267 invoked from network); 18 Dec 2003 10:22:19 -0000 Received: from unknown (HELO profs.sci.univr.it) (157.27.252.10) by mailgw.univr.it with SMTP; 18 Dec 2003 10:22:19 -0000 Received: from [157.27.242.214] ([157.27.242.214]) by profs.sci.univr.it (8.9.3/8.9.3) with ESMTP id LAA08316; Thu, 18 Dec 2003 11:32:46 +0100 (MET) From: Fausto Spoto To: concurrency@cwi.nl, types@cis.upenn.edu, rewriting@loria.fr, theorem-provers@ai.mit.edu, lprolog@cs.umn.edu, prog-lang@diku.dk, eapls@jiscmail.ac.uk, theory@brics.dk, gulp@di.unipi.it, seworld@cs.colorado.edu, types@cis.upenn.edu, clp@comp.nus.edu.sg, benelog@cs.kuleuven.ac.be, curry@informatik.rwth-aachen.de, glp@first.gmd.de, mercury-ads@cs.mu.oz.au, practical-applications@pap.com, sicstus-users@sics.se, users@mozart-oz.org Content-Type: text/plain Content-Transfer-Encoding: 7bit X-Mailer: Ximian Evolution 1.0.8 (1.0.8-10) Message-Id: <1071743334.1988.5.camel@localhost.localdomain> Mime-Version: 1.0 X-Mailman-Approved-At: Thu, 18 Dec 2003 08:38:45 -0500 Cc: Subject: LOPSTR+PEPM+PPDP+SAS 2004: Call for Workshop Proposals X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Date: Thu, 18 Dec 2003 10:32:57 -0000 X-Original-Date: 18 Dec 2003 11:28:48 +0100 X-List-Received-Date: Thu, 18 Dec 2003 10:32:57 -0000 PLEASE ACCEPT MY APOLOGIES IF YOU RECEIVE THIS MESSAGE MORE THAN ONCE. LOPSTR'04 + PEPM'04 + PPDP'04 + SAS'04 Verona, Italy, August 24-28, 2004 *** CALL FOR WORKSHOP PROPOSALS *** International Symposium on Logic-based Program Synthesis and Transformation URL: http://www.sci.univr.it/~lopstr04 ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation URL: http://www.sci.univr.it/~pepm04 ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming URL: http://www.sci.univr.it/~ppdp04 International Static Analysis Symposium URL: http://www.sci.univr.it/~sas04 LOPSTR'04, the International Symposium on Logic-based Program Synthesis and Transformation, PEPM'04, the ACM SIGPLAN 2004 Symposium on Partial Evaluation and Semantics Based Program Manipulation, PPDP'04, the 6th ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming, and SAS'04, the 11th International Static Analysis Symposium, will be held in Verona, Italy, from August 24 to August 28, 2004. We plan to have several workshops in parallel with the conferences. Workshops have a key role. They provide an ideal platform for the presentation of preliminary work or novel ideas in a less formal way than the conferences themselves. They also are an opportunity to disseminate work in progress, particularly for new researchers. Workshops also provide a venue for presenting more specialized topics and opportunities for more intensive discussions, exchange of ideas, and project collaboration. The topics of the workshops can cover any areas related to software specification, analysis, transformation and verification, and to declarative programming, including cross-disciplinary areas. The format of the workshop will be determined by the organizer(s) proposing the workshop, but ample time must be allowed for general discussion. Workshops can vary in length, but the optimal duration will be half a day or a full day. Having two or three co-organizers for a workshop is strongly advised. Workshop Proposal: ================== The persons intending to organize a workshop at LOPSTR'04 + PEPM'04 + PPDP'04 + SAS'04 are invited to submit a workshop proposal. Proposals should be in English and about two pages in length. They should contain: * the title of the workshop * a brief technical description of the topics covered by the workshop * a discussion of the timeliness and relevance of the workshop * the names, affiliation and contact details (email, web page, phone, fax) of the workshop organizing committee together with a designated contact person as the workshop coordinator * a preliminary plan/schedule for organizing the workshop, including the required number of half-days allotted to the workshop * a list of previously-organized related workshops by any of the workshop organizers. Although previous experience with organizing similar workshops is not required, this information will be helpful to the Workshop Chair * an estimated number of attendants to the workshop Proposals are expected in ASCII or LaTeX format. All proposals should be submitted to the Workshop Chair by email by January 18, 2004. Workshop Organizers' Tasks: =========================== * Producing a "Call for Papers" for the workshop and posting it on the net and/or other means. Please provide a web page URL which can be linked into the LOPSTR'04 + PEPM'04 + PPDP'04 + SAS'04 home pages. * Providing a brief description of the workshop for the conference program. * Reviewing/accepting submitted papers. * Scheduling workshop activities in collaboration with the local organizers and the workshop chair. * Printing and providing workshop proceedings to the workshop attendants. Reviewing Process: ================== Each submitted proposal is reviewed by the Workshops Chair and the Conferences Program Chairs. Proposals that appear well-organized and that fit the goals and scope of LOPSTR'04 + PEPM'04 + PPDP'04 + SAS'04 will be selected. The decision will be notified by email to the responsible organizer by February 1st, 2004. The definitive length of the workshop will be planned according to the number of submissions received by the different workshops. For every accepted workshop, the LOPSTR'04 + PEPM'04 + PPDP'04 + SAS'04 Organizing Committee will prepare a meeting place. Workshop Location: ================== The workshops will be held in parallel with LOPSTR'04 + PEPM'04 + PPDP'04 + SAS'04, which will be held in Verona, Italy, from August 24 to August 28, 2004. The conference will be held in the city centre. Verona is among the most important historical and artistic town in Italy, with more than two thousand years of history. During the Roman Empire it was a political and commercial centre, whose magnificent traces can still be seen in the Arena and the Roman Theatre. Verona has always been synonymous with culture, nowadays it attracts people from everywhere thanks to the Arena, the myth of Romeo and Juliet and its precious beauty. LOPSTR'04 + PEPM'04 + PPDP'04 + SAS'04 have been scheduled at the end of August 2004, so that participants may also appreciate the cultural events in town, such as the opera at the Arena and other open air concerts and happenings. Important Dates: ================ Proposals due: January 18, 2004 Notification of acceptance: February 1st, 2004 Workshops: August 24 to August 28, 2004 Workshop Chair: ===================== Fausto Spoto (Dipartimento di Informatica, Verona, Italy) Email: fausto.spoto@univr.it Phone: +39 3204352527 Fax: +39 0458027068 From Lutz.Strassburger@loria.fr Thu Dec 18 12:02:59 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hBIH2xEY008360 for ; Thu, 18 Dec 2003 12:02:59 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hBIH2vBx010609 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 18 Dec 2003 12:02:57 -0500 (EST) Received: from macker.loria.fr (macker.loria.fr [152.81.1.70]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hBIH2uno014997 for ; Thu, 18 Dec 2003 12:02:57 -0500 (EST) Received: from localhost.loria.fr (localhost.loria.fr [127.0.0.1]) by localhost (Postfix) with ESMTP id 256ED85B0; Thu, 18 Dec 2003 18:02:56 +0100 (MET) X-Amavix: Anti-virus check done by McAfee X-Amavix: Scanned by Amavix Received: from hagen.loria.fr (hagen.loria.fr [152.81.3.136]) by macker.loria.fr (Postfix) with ESMTP id 68DAE859F; Thu, 18 Dec 2003 18:02:54 +0100 (MET) Received: from there (localhost [127.0.0.1]) by hagen.loria.fr (8.11.6/8.9.3/8.9.3-client/JCG) with SMTP id hBIH2sW27147; Thu, 18 Dec 2003 18:02:54 +0100 Message-Id: <200312181702.hBIH2sW27147@hagen.loria.fr> Content-Type: text/plain; charset="iso-8859-15" From: Lutz Strassburger To: types@cis.upenn.edu, list@prooftheory.org Date: Thu, 18 Dec 2003 18:02:52 +0100 X-Mailer: KMail [version 1.3.1] MIME-Version: 1.0 Content-Transfer-Encoding: 8bit X-Mailman-Approved-At: Fri, 19 Dec 2003 08:57:46 -0500 Cc: Subject: Linear Logic and Noncommutativity in the Calculus of Structures X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 18 Dec 2003 17:02:59 -0000 Hello, I would like to announce my PhD-thesis (defended on 24 July 2003) which might be interesting for people in the types and proof theory lists. Feedback is very welcome. The pdf-file is available from http://www.loria.fr/~strassbu/ as well as from http://alessio.guglielmi.name/res/cos/index.html Best wishes for Christmas and the new year, Lutz Title: Linear Logic and Noncommutativity in the Calculus of Structures Abstract: In this thesis I study several deductive systems for linear logic, its fragments, and some noncommutative extensions. All systems will be designed within the calculus of structures, which is a proof theoretical formalism for specifying logical systems, in the tradition of Hilbert's formalism, natural deduction, and the sequent calculus. Systems in the calculus of structures are based on two simple principles: deep inference and top-down symmetry. Together they have remarkable consequences for the properties of the logical systems. For example, for linear logic it is possible to design a deductive system, in which all rules are local. In particular, the contraction rule is reduced to an atomic version, and there is no global promotion rule. I will also show an extension of multiplicative exponential linear logic by a noncommutative, self-dual connective which is not representable in the sequent calculus. All systems enjoy the cut elimination property. Moreover, this can be proved independently from the sequent calculus via techniques that are based on the new top-down symmetry. Furthermore, for all systems, I will present several decomposition theorems which constitute a new type of normal form for derivations. From scd@doc.ic.ac.uk Fri Dec 19 12:43:36 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hBJHhaEY011468 for ; Fri, 19 Dec 2003 12:43:36 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hBJHhaBx000118 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 19 Dec 2003 12:43:36 -0500 (EST) Received: from duck.doc.ic.ac.uk (duck.doc.ic.ac.uk [146.169.1.46]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hBJHhYno028283 for ; Fri, 19 Dec 2003 12:43:35 -0500 (EST) Received: from userfriendly.doc.ic.ac.uk ([146.169.14.67] helo=doc.ic.ac.uk) by duck.doc.ic.ac.uk with esmtp (Exim 3.16 #7) id 1AXOex-000090-00; Fri, 19 Dec 2003 17:43:31 +0000 Message-ID: <3FE33A54.1050506@doc.ic.ac.uk> Date: Fri, 19 Dec 2003 17:50:12 +0000 From: Sophia Drossopoulou User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.4) Gecko/20030624 Netscape/7.1 (ax) X-Accept-Language: en-us, en MIME-Version: 1.0 To: Sophia Drossopoulou References: <200311301931.hAUJVCR9003564@saul.cis.upenn.edu> In-Reply-To: <200311301931.hAUJVCR9003564@saul.cis.upenn.edu> Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit X-Mailman-Approved-At: Fri, 19 Dec 2003 14:30:14 -0500 Cc: types@cis.upenn.edu Subject: FOOL 2004 Preliminary Program X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 19 Dec 2003 17:43:37 -0000 Preliminary program and papers accepted for FOOL 2004 can be found at www.doc.ic.ac.uk/~scd/FOOL11_Prelim_program FOOL 2004 Foundations of Object-Oriented Languages co-located with POPL 2004, 17 January 2004 Venice, Italy 9:00 - 10:00 Invited Talk Martin Odersky: Title to be announced 10:30 - 12:30 Session I Kathleen Fisher and John Reppy: A typed calculus of traits Tetsuo Kamina and Tetsuo Tamai: A Core Calculus for Mixin-Types Lorenzo Bettini, Viviana Bono, Silvia Likavec: A Calculus of Mixin-Based Incomplete Objects Thomas VanDrunen and Jens Palsberg: Visitor-Oriented Programming 14:00 - 15:00 Alan Schmitt: Native XML Processing in Objects oriented languages 15:30 - 17:00 Alex Potanin, James Noble, Dave Clarke, Robert Biddle: Featherweight Generic Confinement Paritosh Shroff and Scott Smith: Type Inference for First_Class Messages with Match-Functions Barry Jay: Methods for Pattern Matching Functions Registration jointly with POPL'04: www.cs.princeton.edu/~dpw/popl/04/ -- =================================================================== Sophia Drossopoulou Department of Computing, http://www.doc.ic.ac.uk/~scd/index.html Imperial College fax: (+44) 20 7581 8024 London, UK From Eelco-Visser@xs4all.nl Tue Dec 23 09:34:54 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hBNEYsEY003566 for ; Tue, 23 Dec 2003 09:34:54 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hBNEYhdp024505 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Tue, 23 Dec 2003 09:34:43 -0500 (EST) Received: from smtpzilla1.xs4all.nl (smtpzilla1.xs4all.nl [194.109.127.137]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hBNEYgx2022289 for ; Tue, 23 Dec 2003 09:34:42 -0500 (EST) Received: from localhost.localdomain (stratego.xs4all.nl [213.84.8.131]) by smtpzilla1.xs4all.nl (8.12.9/8.12.9) with ESMTP id hBNEYe9L012684; Tue, 23 Dec 2003 15:34:40 +0100 (CET) From: Eelco Visser To: fme@mailbase.ac.uk, ipalist@win.tue.nl, types@cis.upenn.edu Content-Type: text/plain; charset=UTF-7 Message-Id: <1072190079.28314.133.camel@localhost.localdomain> Mime-Version: 1.0 X-Mailer: Ximian Evolution 1.4.5 Date: Tue, 23 Dec 2003 15:34:39 +0100 Content-Transfer-Encoding: 7bit X-Mailman-Approved-At: Mon, 29 Dec 2003 19:41:24 -0500 Cc: Subject: First CFP: GPCE'04 -- Generative Programming and Component Engineering X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list Reply-To: Eelco Visser List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 23 Dec 2003 14:34:54 -0000 FIRST CALL FOR PAPERS ---------------------------------------------------------------------- Third International Conference on Generative Programming and Component Engineering (GPCE'04) Vancouver, October 24-28, 2004 co-located with OOPSLA 2004 http://gpce04.gpce.org ---------------------------------------------------------------------- ------------------------------------ Important Dates ------------------------------------ +ACo Pre-submission: March 12, 2004 +ACo Submission: March 19, 2004 ------------------------------------ Scope ------------------------------------ Generative and component approaches have the potential to revolutionize software development in a similar way as automation and components revolutionized manufacturing. Generative Programming (developing programs that synthesize other programs), Component Engineering (raising the level of modularization and analysis in application design), and Domain-Specific Languages (elevating program specifications to compact domain-specific notations that are easier to write and maintain) are key technologies for automating program development. GPCE arose as a joint conference, merging the prior conference on Generative and Component-Based Software Engineering (GCSE) and the Workshop on Semantics, Applications, and Implementation of Program Generation (SAIG). The goal of GPCE is to provide a meeting place for researchers and practitioners interested in cutting edge approaches to software development. We aim to foster further cross-fertilization between the software engineering research community on the one hand, and the programming languages community on the other, in addition to supporting the original research goals of both the GCSE and the SAIG communities. We seek papers both in software engineering and in programming languages, and especially those that bridge the gap and are accessible to both communities at the same time. ------------------------------------ Topics of Interest ------------------------------------ The conference solicits submissions related (but not limited) to: +ACo Generative programming o Reuse, meta-programming, partial evaluation, multi-stage and multi-level languages, step-wise refinement o Semantics, type systems, symbolic computation, linking and explicit substitution, in-lining and macros, templates, program transformation o Runtime code generation, compilation, active libraries, synthesis from specifications, development methods, generation of non-code artifacts, formal methods, reflection +ACo Generative techniques for o Product lines and architectures o Embedded systems o Model-driven architecture +ACo Component-based software engineering o Reuse, distributed platforms, distributed systems, evolution, analysis and design patterns, development methods, formal methods +ACo Integration of generative and component-based approaches +ACo Domain engineering and domain analysis o Domain-specific languages (DSLs) including visual and UML-based DSLs +ACo Separation of concerns o Aspect-oriented programming, feature-oriented programming, o Intentional programming, and multi-dimensional separation of concerns +ACo Industrial applications Reports on applications of these techniques to real-world problems are especially encouraged, as are submissions that relate ideas and concepts from several of these topics, or bridge the gap between theory and practice. The program committee is happy to advise on the appropriateness of a particular subject. ------------------------------------ Paper Submission ------------------------------------ Authors are invited to submit a title and abstract by March 12, 2004, and a full paper by March 19, 2004. These deadlines are firm. Simultaneous submission to other venues and submission of previously published material are not allowed. Electronic submission will be required, except by special arrangement with the program chairs. Authors will be notified of acceptance by May 17, 2004. Final versions of accepted papers must be submitted by July 25, 2004. Accepted papers will appear in the conference proceedings published in the Springer-Verlag Lecture Notes in Computer Science (LNCS) series http://www.springer.de/comp/lncs/index.html. Submissions must be in PDF, must conform to the LNCS style, and be no longer than 15 pages. For the formatting details see http://www.springer.de/comp/lncs/authors.html. ------------------------------------ Other Contributions ------------------------------------ Work related to generative programming and component engineering can also be presented in other forms than papers. GPCE has separate days for tutorials and workshops. During the conference there are sessions for tool demonstrations and poster presentations. If you want to organize a workshop, present a tutorial, demonstration, or poster, see the information on the conference website for details about format and submission. Contact the relevant chair for more information. ------------------------------------ Important Dates ------------------------------------ Technical papers +ACo Pre-submission: March 12, 2004 +ACo Submission: March 19, 2004 +ACo Notification: May 17, 2004 +ACo Final version: July 25, 2004 Submissions of proposals +ACo Workshops: March 19, 2004 +ACo Practitioners: April 30, 2004 +ACo Tutorials: April 30, 2004 +ACo Demonstrations: July 2, 2004 Conference +ACo Tutorials: October 24, 2004 +ACo Workshops: October 25, 2004 +ACo Papers: October 26-28, 2004 ------------------------------------ Organization ------------------------------------ General chair +ACo Tim Sheard (OGI School of Science +ACY Engineering at OHSU) Program committee chairs +ACo Gabor Karsai (Vanderbilt University) +ACo Eelco Visser (Utrecht University) Program committee +ACo Uwe Assmann (Linkopings Universitet) +ACo Don Batory (University of Texas) +ACo Jan Bosch (Universiteit Groningen) +ACo Jean Bezivin (Universit+AOk de Nantes) +ACo Jim Cordy (Queen's University) +ACo Krzysztof Czarnecki (University of Waterloo) +ACo Mathew Flatt (University of Utah) +ACo Robert Glueck (University of Copenhagen) +ACo George Heineman (Worcester Polytechnic Institute) +ACo Michael Leuschel (University of Southampton) +ACo Karl Lieberherr (Northeastern University) +ACo Simon Peyton Jones (Microsoft Research) +ACo Douglas R. Smith (Kestrel Institute) +ACo Gabriele Taentzer (Technical University of Berlin) +ACo Todd Veldhuizen (Indiana University) +ACo Kris de Volder (University of Britisch Columbia) +ACo Dave Wile (Teknowledge Corp.) +ACo Alexander Wolf (University of Colorado at Boulder) Workshop Chair +ACo Zino Benaissa (Intel) Tutorial Chair +ACo Jeff Gray (University of Alabama at Birmingham) Demonstrations Chair +ACo Simon Helsen (University of Waterloo) Contact +ACo gpce-chairs+AEA-cs.uu.nl From andru@balm.cs.cornell.edu Mon Dec 29 14:34:20 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hBTJYKEY024371 for ; Mon, 29 Dec 2003 14:34:20 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hBTJYJdp013852 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 29 Dec 2003 14:34:19 -0500 (EST) Received: from balm.cs.cornell.edu (balm.cs.cornell.edu [128.84.96.80]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hBTJYIx3029208 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 29 Dec 2003 14:34:18 -0500 (EST) Received: from balm.cs.cornell.edu (localhost.localdomain [127.0.0.1]) by balm.cs.cornell.edu (8.12.8/8.12.8) with ESMTP id hBTJYIiw009184 for ; Mon, 29 Dec 2003 14:34:18 -0500 Received: (from andru@localhost) by balm.cs.cornell.edu (8.12.8/8.12.8/Submit) id hBTJYIiJ009182 for types@cis.upenn.edu; Mon, 29 Dec 2003 14:34:18 -0500 Date: Mon, 29 Dec 2003 14:34:18 -0500 From: Andrew Myers To: types@cis.upenn.edu Message-ID: <20031229193418.GA9140@balm.cs.cornell.edu> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline User-Agent: Mutt/1.4i X-Mailman-Approved-At: Mon, 29 Dec 2003 19:41:24 -0500 Cc: Subject: Polyglot extensible compiler framework release 1.1.1 X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 29 Dec 2003 19:34:20 -0000 We are pleased to announce the availability of version 1.1.1 of the Polyglot extensible compiler framework for Java. Polyglot is a complete Java 1.4 compiler front end, implemented as a Java class library that is easily extended through inheritance to create a modified compiler. Polyglot is useful for implementing domain-specific languages, for exploring language design ideas, and for adding new optimizations or analyses to a Java compiler. Polyglot offers some advantages beyond a cleanly written Java front end. Extension code can be kept entirely separate from the (unmodified) Polyglot library, and the amount of extension code tends to scale well with the degree of modification to Java. Extension languages can be cleanly extended further using the same methodology. The design features that make this possible are described in the following paper: Nathaniel Nystrom, Michael R. Clarkson, Andrew C. Myers. Polyglot: An Extensible Compiler Framework for Java. 12th Int'l Conference on Compiler Construction, Apr. 2003. LNCS 2622, pp.138-152. http://www.cs.cornell.edu/andru/papers/polyglot.pdf This is the fifth release of Polyglot, incorporating many bug fixes and extensions based on user feedback and testing. It is released under LGPL, which is relatively permissive. Polyglot is currently being developed and maintained by Nate Nystrom and Stephen Chong. The Polyglot framework has been used to implement more than a dozen major and minor extensions to Java. These extensions include new expression forms, new type system features, new compiler passes, and new static analyses. Major extensions include the Jif language, which adds types for information flow to Java; the PolyJ language, which adds parameterized types; and the JMatch language, which adds pattern matching and iterators. The Polyglot web site is located at http://www.cs.cornell.edu/projects/polyglot -- Andrew Myers From ginzburg@dcs.kcl.ac.uk Mon Dec 29 21:00:23 2003 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id hBU20NEY024998 for ; Mon, 29 Dec 2003 21:00:23 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hBU20Mdp025998 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 29 Dec 2003 21:00:22 -0500 (EST) Received: from ptb-relay03.plus.net (ptb-relay03.plus.net [212.159.14.214]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id hBU20Kx3029007 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 29 Dec 2003 21:00:22 -0500 (EST) Received: from [81.174.183.85] (helo=dcs.kcl.ac.uk) by ptb-relay03.plus.net with esmtp (Exim) id 1Ab9BD-000Bvv-So; Tue, 30 Dec 2003 02:00:20 +0000 Message-ID: <3FF0DCBB.7020704@dcs.kcl.ac.uk> Date: Tue, 30 Dec 2003 02:02:35 +0000 From: Jonathan Ginzburg User-Agent: Mozilla/5.0 (Macintosh; U; PPC Mac OS X Mach-O; en-US; rv:1.4) Gecko/20030624 X-Accept-Language: en-us, en MIME-Version: 1.0 To: types@cis.upenn.edu X-Mailman-Approved-At: Tue, 30 Dec 2003 10:07:02 -0500 Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 8bit X-Content-Filtered-By: Mailman/MimeDel 2.1.2 Cc: catalog04@upf.edu Subject: CATALOG'04: first CFP X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 30 Dec 2003 02:00:23 -0000 There has recently been increasing interest in applying type theoretic techniques to problems of natural language semantics, specifically dialogue [see e.g. the Swedish Science Council's project "Records, types and computational dialogue semantics" involving Cooper, Coquand et al]. We would welcome submissions on related topics. First Call for Papers CATALOG'04 EIGHTH WORKSHOP ON THE SEMANTICS AND PRAGMATICS OF DIALOGUE (SEMDIAL) Pompeu Fabra University Barcelona July 19-21 2004 (Apologies for Multiple Postings) Workshop URL: http://www.upf.edu/catalog04 --------------------------------------------------------------------- Catalog'04 will be the eighth in a series of workshops that aims to bring together researchers working on the semantics and pragmatics of dialogues in fields such as artificial intelligence, formal semantics and pragmatics, computational linguistics, philosophy, and psychology. The Dial/Log conferences are always stimulating and fun and Barcelona, which will host ACL 2004 immediately following Catalog'04, is a great place to visit. Barcelona will also host, during the summer of 2004, its 'Forum 2004', a huge cultural fair full of events, exhibits, and performances (http://www.barcelona2004.org/eng/). So mark your calendar now. INVITED SPEAKERS: Massimo Poesio (University of Essex), Michael Tannenhaus (University of Rochester), Two other speakers to be announced We invite abstracts on all topics related to the semantics and pragmatics of dialogues, including, but not limited to: - models of common ground/mutual belief in communication - modelling agents' information states and how they get updated - multi-agent models and turn-taking - goals, intentions and commitments in communication - semantic interpretation in dialogues - reference in dialogues - ellipsis resolution in dialogues - dialogue and discourse structure - interpretation of questions and answers - nonlinguistic interaction in communication - natural language understanding and reasoning in spoken dialogue systems - multimodal dialogue systems - dialogue management in practical implementations - categorisation of dialogue moves or speech acts in corpora - designing and evaluating dialogue systems SUBMISSION PROCEDURE: Authors should submit an anonymous extended abstract of at most 5 single-column pages (for talks with a duration of 25' plus 10' discussion) together with a separate page specifying the authors' names, affiliation, address, and e-mail address. The abstracts should be submitted electronically (in postscript, html, ascii, or pdf format) to: Submissions have to be in English, which is the workshop language. For the accepted talks, a LaTeX style will be made available for the preparation of the final version. IMPORTANT DATES: Abstracts due: March 12, 2004 Acceptance notice: May 5, 2004 Final version due: June 5, 2004 Conference: July 19-21, 2004 PROGRAM COMMITTEE: Anton Benz (Syddansk Universitet), Johan Bos (University of Edinburgh), Justine Cassell (Northwestern University) Lawrence Cavedon (CSLI, Stanford), Robin Cooper (Göteborgs Universitet), Paul Dekker, (University of Amsterdam) Claire Gardent (CNRS, Loria) Simon Garrod (University of Glasgow), Jonathan Ginzburg (King's College, London, Chair) Pat Healey (Queen Mary, University of London), Ivana Kruijff Korbayova (Universität des Saarlandes), Staffan Larsson (Göteborgs Universitet), Colin Matheson (University of Edinburgh), David Milward (Linguamatics, Cambridge), Massimo Poesio (University of Essex), Hannes Reiser (Universität Bielefeld), David Traum (USC) ORGANIZATION: The workshop will take place at Universitat Pompeu Fabra in the city of Barcelona (exact venue to be announced). The local committee is chaired by Enric Vallduví. Previous workshops in the SEMDIAL series include: (see also http://cswww.essex.ac.uk/semdial/ ) MunDial'97 (Munich) (http://www.cis.uni-muenchen.de/sil/workshop/dialogwsh.html) Twendial'98 (Twente) (http://parlevink.cs.utwente.nl/Conferences/twlt13.html) Amstelogue'99 (Amsterdam) (http://cf.hum.uva.nl/computerlinguistiek/amstelog/) Gotalog'00 (Gothenburg) (http://www.ling.gu.se/gotalog) Bidialog'01 (Bielefeld) (http://www.uni-bielefeld.de/BIDIALOG) EDILOG'02 (Edinburgh) (http://www.ltg.ed.ac.uk/edilog/) DIABRUCK 2003 http://www.coli.uni-sb.de/diabruck/ -- Dept of Computer Science King's College, London The Strand, London WC2R 2LS UK phone: +44-20-7848-2752 fax: +44-20-7848-2851 ginzburg@dcs.kcl.ac.uk http://www.dcs.kcl.ac.uk/staff/ginzburg From danwang@CS.Princeton.EDU Thu Jan 1 00:45:21 2004 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id i015jLEY030285 for ; Thu, 1 Jan 2004 00:45:21 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i015jKdp028664 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 1 Jan 2004 00:45:21 -0500 (EST) Received: from bluebox.CS.Princeton.EDU (bluebox.CS.Princeton.EDU [128.112.136.38]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i015jKx3027680 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 1 Jan 2004 00:45:20 -0500 (EST) Received: from cs.princeton.edu (pool-141-150-75-223.mad.east.verizon.net [141.150.75.223]) (authenticated bits=0) by bluebox.CS.Princeton.EDU (8.12.10/8.12.10) with ESMTP id i015jJWe011053 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=NOT) for ; Thu, 1 Jan 2004 00:45:20 -0500 (EST) Message-ID: <3FF3B3EE.90602@cs.princeton.edu> Date: Thu, 01 Jan 2004 00:45:18 -0500 From: "Daniel C. Wang" User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.6b) Gecko/20031205 Thunderbird/0.4 X-Accept-Language: en-us, en MIME-Version: 1.0 To: types@cis.upenn.edu Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit X-Mailman-Approved-At: Thu, 01 Jan 2004 12:37:23 -0500 Cc: Subject: Sequent calculus and ANF X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 01 Jan 2004 05:45:22 -0000 Just wondering, but does anyone have pointers to literature that explicitly connect typed variants of Sabry and Felleisen's A-normal-form with sequent calculus style proof systems? The connection seems pretty direct and obvious, but I can't seem to find any reference that make this observation. Is this a case of the compiler writers and logician's simply not being aware of each others work? From danwang@CS.Princeton.EDU Thu Jan 1 15:47:15 2004 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id i01KlFEY004746 for ; Thu, 1 Jan 2004 15:47:15 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i01KlEdp022945 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 1 Jan 2004 15:47:14 -0500 (EST) Received: from bluebox.CS.Princeton.EDU (bluebox.CS.Princeton.EDU [128.112.136.38]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i01KlDx3013886 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 1 Jan 2004 15:47:13 -0500 (EST) Received: from cs.princeton.edu (adsl-138-89-23-214.nnj.adsl.bellatlantic.net [138.89.23.214] (may be forged)) (authenticated bits=0) by bluebox.CS.Princeton.EDU (8.12.10/8.12.10) with ESMTP id i01KlCWe002537 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=NOT) for ; Thu, 1 Jan 2004 15:47:13 -0500 (EST) Message-ID: <3FF48750.9020108@cs.princeton.edu> Date: Thu, 01 Jan 2004 15:47:12 -0500 From: "Daniel C. Wang" User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.6b) Gecko/20031205 Thunderbird/0.4 X-Accept-Language: en-us, en MIME-Version: 1.0 To: types@cis.upenn.edu References: <3FF3B3EE.90602@cs.princeton.edu> In-Reply-To: <3FF3B3EE.90602@cs.princeton.edu> Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit X-Mailman-Approved-At: Thu, 01 Jan 2004 17:27:41 -0500 Cc: Subject: Re: Sequent calculus and ANF X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 01 Jan 2004 20:47:15 -0000 Ahh thanks to Matthias Blume for point me to the work by Ohori Atsushi Ohori. A Curry-Howard isomorphism for compilation and program execution. Proc. TLCA Conference, Springer LNCS 1581, 258-179, April 1999. http://www.jaist.ac.jp/~ohori/research/anormal.pdf From Frank_Pfenning@altosax.concert.cs.cmu.edu Fri Jan 2 11:43:04 2004 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id i02Gh4EY006839 for ; Fri, 2 Jan 2004 11:43:04 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i02Gh3dp027300 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Fri, 2 Jan 2004 11:43:04 -0500 (EST) Received: from altosax.concert.cs.cmu.edu (ALTOSAX.CONCERT.CS.CMU.EDU [128.2.220.149]) by central.cis.upenn.edu (8.12.10/8.12.9) with SMTP id i02Gh3x2024867 for ; Fri, 2 Jan 2004 11:43:03 -0500 (EST) Received: from altosax.concert.cs.cmu.edu ([127.0.0.1]) by altosax.concert.cs.cmu.edu id aa03997; 2 Jan 2004 11:42 EST To: "Daniel C. Wang" From: Frank Pfenning In-reply-to: Your message of Thu, 01 Jan 2004 15:47:12 -0500. <200401012344.i01NiFR3025969@saul.cis.upenn.edu> Date: Fri, 02 Jan 2004 11:42:48 -0500 Message-ID: <3995.1073061768@altosax.concert.cs.cmu.edu> Sender: Frank_Pfenning@altosax.concert.cs.cmu.edu X-Mailman-Approved-At: Fri, 02 Jan 2004 13:05:10 -0500 Cc: types@cis.upenn.edu Subject: Re: Sequent calculus and ANF X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list Reply-To: Frank Pfenning List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 02 Jan 2004 16:43:04 -0000 Hi Dan, as mentioned in the conclusion of Ohori's paper, it does not tell the whole story. There is also a connection between A-normal form, Moggi's monadic meta-language, and lax logic. This goes back to work by [Benton, Biermann, and de Paiva'98], [Kobayashi'97] and, of course, [Moggi'88,'89,'91]. You can read about that in: Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511-540, 2001. http://www.cs.cmu.edu/~fp/papers/mscs00.pdf - Frank > Ahh thanks to Matthias Blume for point me to the work by Ohori > > Atsushi Ohori. A Curry-Howard isomorphism for compilation and program > execution. Proc. TLCA Conference, Springer LNCS 1581, 258-179, April 1999. > > http://www.jaist.ac.jp/~ohori/research/anormal.pdf From adamek@iti.cs.tu-bs.de Mon Jan 5 08:10:21 2004 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id i05DAKEY021683 for ; Mon, 5 Jan 2004 08:10:21 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i05DAJSO010663 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 5 Jan 2004 08:10:20 -0500 (EST) Received: from George.iti.cs.tu-bs.de (george.iti.cs.tu-bs.de [134.169.39.8]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i05DAGm3024630; Mon, 5 Jan 2004 08:10:16 -0500 (EST) Received: from lxt7.iti.cs.tu-bs.de (lxt7 [134.169.39.56]) by George.iti.cs.tu-bs.de (8.12.10/8.12.10) with ESMTP id i05D0NFJ006488 for ; Mon, 5 Jan 2004 14:00:24 +0100 (MET) Received: from localhost (adamek@localhost) by lxt7.iti.cs.tu-bs.de (8.11.3/8.11.3/SuSE Linux 8.11.1-0.5) with ESMTP id i05D0N504074 for ; Mon, 5 Jan 2004 14:00:23 +0100 Date: Mon, 5 Jan 2004 14:00:23 +0100 (CET) From: Jiri Adamek To: Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Scanned-By: MIMEDefang 2.37 X-Mailman-Approved-At: Mon, 05 Jan 2004 09:30:32 -0500 Cc: Subject: CMCS'04: deadline prolongation X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 05 Jan 2004 13:10:21 -0000 Excuse multiple copies The deadline for submissions to CMCS 2004 has been prolonged to January 12. A copy of the second announcement follows: +++++++++++++++++ SUBMISSION DEADLINE: JANUARY 12, 2004 +++++++++++++++ +----------------------------------------------------------+ | | | | | 7th International Workshop on | | Coalgebraic Methods in Computer Science | | | | C M C S 2004 | | | | | | Barcelona, March 27-29, 2004 | | http://www.iti.cs.tu-bs.de/~cmcs/ | | | +----------------------------------------------------------+ The workshop is held in conjunction with ETAPS 2004 (7th European Joint Conferences on Theory Theory and Practice of Software, March 27- April 4,2004) http://www.lsi.upc.es/etaps04/ AIMS AND SCOPE During the last few years, it is becoming increasingly clear that a great variety of state-based dynamical systems, like transition systems, automata, process calculi and class-based systems can be captured uniformly as coalgebras. Coalgebra is developing into a field of its own interest presenting a deep mathematical foundation, a growing field of applications and interactions with various other fields such as reactive and interactive system theory, object oriented and concurrent programming, formal system specification, modal logic, dynamical systems, control systems, category theory, algebra, analysis, etc. The aim of the workshop is to bring together researchers with a common interest in the theory of coalgebras and its applications. The topics of the workshop include, but are not limited to: - the theory of coalgebras (including set theoretic and categorical approaches); - coalgebras as computational and semantical models (for programming languages, dynamical systems, etc.); - coalgebras in (functional, object-oriented, concurrent) programming; - coalgebras and data types; - (coinductive) definition and proof principles for coalgebras (with bisimulations or invariants); - coalgebras and algebras; - coalgebraic specification and verification; - coalgebras and (modal) logic; - coalgebra and control theory (notably of discrete event and hybrid systems). The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends. Previous workshops of the same series have been organized in Lisbon, Amsterdam, Berlin, Genova, Grenoble, and Warsaw. The proceedings appeared as "Electronic Notes in Theoretical Computer Science (ENTCS)", Volumes 11, 19, 33, 41, 65.1 and 82.1. Selected papers have been/are being published in Theoretical Computer Science, Theoretical Informatics and Applications, and Mathematical Structures in Computer Science. You can get an idea of the types of papers presented at previous meetings by looking at the tables of content of the above ENTCS volumes from these meetings. They are available via the ENTCS page http://www.elsevier.nl/gej-ng/31/29/23/show/Products/notes/contents.htt PROGRAM COMMITTEE Jiri Adamek, chair (Braunschweig), Corina Cirstea (Southampton), H. Peter Gumm (Marburg), Alexander Kurz (Leicester), Ugo Montanari (Pisa), Larry Moss (Bloomington, IN), Ataru T. Nakagawa (Tokyo), Dirk Pattinson (Muenchen) Grigore Rosu (Urbana, ILL), Jan Rutten (Amsterdam), James Worrell (New Orleans). LOCATION CMCS 2004 will be held in Barcelona on March 27-29, 2004. It is a satellite workshop of ETAPS 20034, the European Joint Conferences on Theory and Practice of Software. For venue, registration and suggested accommodation see the ETAPS 2004 Web page: http://www.lsi.upc.es/etaps04/ INVITED SEPAKERS Prakash Panangaden (McGill University, Montreal) Alex Simpson (University of Edinburgh) SUBMISSIONS Submissions will be evaluated by the Program Committee for inclusion in the proceedings, which will be published in the ENTCS series. Papers must contain original contribution, be clearly written, and include appropriate reference to and comparison with related work. Papers (of at most 15 pages) should be submitted electronically as PostScript files at the address J.Adamek@tu-bs.de. A separate message should also be sent, with a text-only one-page abstract and with mailing addresses (both postal and electronic), telephone number and fax number of the corresponding author. IMPORTANT DATES Deadline for submission: January 12, 2004 Notification of acceptance: February 16, 2004 Final version due: February 30, 2004 Workshop dates: March 27-29, 2004 For more information, please contact: Jiri Adamek, Technical University of Braunschweig phone: (0049) 5319521 fax: (0049) 5319529 e-mail: J.Adamek@tu-bs.de + + + CMCS '04 + + + SECOND ANNOUNCEMENT + + + CALL FOR PAPERS + + From carsten@cs.yale.edu Mon Jan 5 14:22:52 2004 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id i05JMqEY022537 for ; Mon, 5 Jan 2004 14:22:52 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i05JMoSO004307 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 5 Jan 2004 14:22:51 -0500 (EST) Received: from rome.cs.yale.edu (rome.cs.yale.edu [128.36.229.162]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i05JMom3011701 for ; Mon, 5 Jan 2004 14:22:50 -0500 (EST) Received: by rome.cs.yale.edu (Postfix, from userid 29010) id AD1BD475CEC; Mon, 5 Jan 2004 14:22:48 -0500 (EST) From: Carsten Schuermann To: lics-request@dcs.ed.ac.uk, bra-types@cs.chalmers.se, types-wg@durham.ac.uk, appsem@cs.chalmers.se, logic@theory.lcs.mit.edu, logic@CS.Cornell.EDU, types@cis.upenn.edu, types@cs.indiana.edu, concurrency@cwi.nl, theorynt@listserv.nodak.edu, linear@cs.stanford.edu, rewriting@ens-lyon.fr, qed@mcs.anl.gov, coq-club@pauillac.inria.fr, info-hol@jaguar.cs.byu.edu, isabelle-users@cl.cam.ac.uk, pvs@csl.sri.com, theorem-provers@ai.mit.edu, lprolog@cs.umn.edu Content-Type: text/plain Content-Transfer-Encoding: 7bit Message-Id: <1073330568.26332.62.camel@rome.cs.yale.edu> Mime-Version: 1.0 X-Mailer: Ximian Evolution 1.4.4 Date: Mon, 05 Jan 2004 14:22:48 -0500 X-Mailman-Approved-At: Mon, 05 Jan 2004 14:28:49 -0500 Cc: Subject: CFP: LFM'04 - Logical Frameworks and Meta-languages X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 05 Jan 2004 19:22:52 -0000 Fourth International Workshop on Logical Frameworks and Meta-Languages (LFM'04) http://www.cs.yale.edu/~carsten/lfm04 A IJCAR'04 affiliated workshop Cork, Ireland, July 04 - 08, 2004 http://4c.ucc.ie/ijcar/index.html Logical frameworks and meta-languages form a common substrate for representing, implementing, and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design and implementation has been the focus of considerable research over the last two decades, using competing and sometimes incompatible basic principles. This workshop will bring together designers, implementors, and practitioners to discuss all aspects of logical frameworks. Topics include, but are not limited to: - logical framework design - meta-theoretic analyses - applications and comparative studies - implementation techniques - efficient proof representation and validation - proof-generating decision procedures and theorem provers - proof-carrying code - substructural frameworks - semantic foundations - methods for reasoning about logics We solicit submissions on work in progress and on more mature results. Submissions should be extended abstracts of 5-10 pages sent in PostScript or PDF format to the program chair at carsten@cs.yale.edu IMPORTANT DATES: Submission: Mon, Apr 12, 2004 Notification: Mon, May 10, 2004 Final Versions: Mon, May 31, 2004 The workshop will be held on Sunday, July 4, 2004 or Monday, Jul 5 2004, as part of IJCAR'04 to be announced by the IJCAR workshop chair. Informal proceedings will be published as a Yale-CS technical report and will be available to participants at the workshop. A special issue with invited papers from this workshop in a major journal is under consideration. PROGRAM COMMITTEE: Thierry Coquand Amy Felty Christoph Kreitz Jose Meseguer Dale Miller Frank Pfenning Randy Pollack Carsten Schuermann (chair) CONTACT Carsten Schuermann Department of Computer Science Yale University carsten@cs.yale.edu http://www.cs.yale.edu/~carsten/lfm04 From bcpierce@saul.cis.upenn.edu Wed Jan 7 11:14:38 2004 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id i07GEcEY030977 for ; Wed, 7 Jan 2004 11:14:38 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i07GEcSO022021 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 7 Jan 2004 11:14:38 -0500 (EST) Received: from saul.cis.upenn.edu (SAUL.CIS.UPENN.EDU [158.130.12.4]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i07GEbm4026889 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 7 Jan 2004 11:14:37 -0500 (EST) Received: from localhost (localhost [127.0.0.1]) by saul.cis.upenn.edu (8.12.10/8.12.9) with SMTP id i07GEbWZ025615 for ; Wed, 7 Jan 2004 11:14:37 -0500 (EST) To: types@cis.upenn.edu Date: Wed, 07 Jan 2004 11:14:36 EST Message-ID: <25614.1073492076@saul.cis.upenn.edu> From: "Benjamin C. Pierce" X-Mailman-Approved-At: Wed, 07 Jan 2004 11:20:11 -0500 Cc: Subject: TYPES: Changing of the guard X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list Reply-To: bcpierce@cis.upenn.edu List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 07 Jan 2004 16:14:39 -0000 Dear Types readers, The Types Forum is now more than a decade and a half old. Begun by Albert Meyer, it was carried through the early 1990s by Philip Wadler. I've served as moderator since 1996. It's been a great time: the field of type systems (and programming languages more generally) has matured and expanded in amazing ways, and the Types list has helped provided cohesion and communication within the community as it grew; list membership has ballooned from a couple hundred to over a thousand. I've had great fun and learned an enormous amount myself during these years. However, all things must change, and it is time now for me to hand the baton to a new moderator. It gives me great pleasure to introduce your new moderator, Stephanie Weirich. Stephanie is known to many of you already from her many research contributions over the past several years, in particular her elegant work on intensional type analysis. I'm delighted to be leaving the list in such capable and knowledgeable hands. Though I won't be moderating Types, I will certainly still be reading it! Good luck and best wishes to Stephanie. Thank you all for your contributions to Types, past and future, and I look forward to continuing our work together in this most excellent area. - Benjamin P.S. The handover of moderation will be accompanied by some modernization of infrastructure: Stephanie will be moving to a MailMan-based list management scheme. We *hope* that this transition will be invisible (it's been mostly working for some weeks already), but you may notice some glitches as we get all the subscribed addresses moved over to MailMan. New instructions for managing subscriptions, address changes, etc., will be posted by Stephanie in due course. From sweirich@cis.upenn.edu Wed Jan 7 14:38:30 2004 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id i07JcUEY011562 for ; Wed, 7 Jan 2004 14:38:30 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i07JcASO002264 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 7 Jan 2004 14:38:10 -0500 (EST) Received: from lion.seas.upenn.edu (LION.SEAS.UPENN.EDU [158.130.12.194]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i07Jc7m4015799 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 7 Jan 2004 14:38:10 -0500 (EST) Received: from cis.upenn.edu (LVN510PC1.CIS.UPENN.EDU [158.130.50.237]) (authenticated bits=0) by lion.seas.upenn.edu (8.12.10/8.12.10) with ESMTP id i07Jc4E9029890 for ; Wed, 7 Jan 2004 14:38:05 -0500 Message-ID: <3FFC6012.2020709@cis.upenn.edu> Date: Wed, 07 Jan 2004 14:37:54 -0500 From: Stephanie Weirich Organization: University of Pennsylvania User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.5) Gecko/20031013 Thunderbird/0.3 X-Accept-Language: en-us, en MIME-Version: 1.0 To: types@cis.upenn.edu References: <25614.1073492076@saul.cis.upenn.edu> In-Reply-To: <25614.1073492076@saul.cis.upenn.edu> Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit X-Mailman-Approved-At: Wed, 07 Jan 2004 14:39:07 -0500 Cc: Subject: [TYPES] Re: TYPES: Changing of the guard X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list Reply-To: sweirich@cis.upenn.edu List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 07 Jan 2004 19:38:30 -0000 First, I'm sure I speak for the whole community in thanking Benjamin for the excellent job he has done as TYPES moderator. As Benjamin mentioned in the last email, we have switched the management of the TYPES list to Mailman. **** If you are currently subscribed and want to continue ****** **** reading and posting to TYPES, you do not need to ****** **** change anything. In particular, submission to TYPES is still the same, by sending email to types@cis.upenn.edu. More information about submitting to TYPES can be found at the new web page: http://lists.seas.upenn.edu/mailman/listinfo/types-list However, there are a few, hopefully positive, changes that have resulted from the switch to Mailman: * New headers for filtering types messages All email from TYPES will contain the string "[TYPES]" in the Subject header. Also, some of the headers may change with the new system, so if you are filtering TYPES email, you may have to update your rules. In particular, the first line of every TYPES email (see above) reflects the new address for the web pages. * New subscription options and a new method to subscribe/unsubscribe If you reading this message, you are currently subscribed to TYPES. You may view your subscription options by going to the following web site: http://lists.seas.upenn.edu/mailman/options/types-list/ You will first have to type in the email address that you are subscribed with and request a password reminder. (Everyone has received random passwords.) Once you authenticate, you will be able to: - Set delivery to digest mode - Pause delivery - Change your email address - Unsubscribe - Change your password * New archive location The current TYPES archives are now maintained by Mailman, and can be found at http://lists.seas.upenn.edu/pipermail/types-list/ Older messages are stored at: http://www.seas.upenn.edu/~sweirich/types/archive/ If you have any trouble with this new system or have any suggestions, please send email to me at sweirich@cis.upenn.edu. Thanks, Stephanie Weirich TYPES Moderator From paulegre@magic.fr Wed Jan 7 17:46:28 2004 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id i07MkSEY017742 for ; Wed, 7 Jan 2004 17:46:28 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i07MkRSO011625 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 7 Jan 2004 17:46:27 -0500 (EST) Received: from quito.magic.fr (quito.magic.fr [62.210.158.45]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i07MkQm3015873 for ; Wed, 7 Jan 2004 17:46:26 -0500 (EST) Received: from oemtwc (ppp-16.net-101.magic.fr [62.210.208.16]) by quito.magic.fr (8.11.6/8.11.2) with SMTP id i07MggI29775; Wed, 7 Jan 2004 23:42:42 +0100 (CET) Message-ID: <02d901c3d578$7abe75c0$10d0d23e@oemtwc> From: =?iso-8859-1?B?UGF1bCBFZ3Lp?= To: "Esslli'04 StuS" Date: Wed, 7 Jan 2004 23:46:23 -0000 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 8bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.2615.200 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2615.200 X-Mailman-Approved-At: Wed, 07 Jan 2004 19:07:10 -0500 Cc: Subject: [TYPES] Second Call for papers : ESSLLI'04 Student Session X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 07 Jan 2004 22:46:28 -0000 !! We apologize for multiple copies of this message !! SECOND CALL FOR PAPERS ESSLLI-2004 STUDENT SESSION 9-20 August, 2004 in Nancy, France Deadline: February 22, 2004 http://esslli2004.loria.fr/ We are pleased to announce the Student Session of the 16th European Summer School in Logic, Language and Information (ESSLLI-2004), which will be held in Nancy from August 9-20, 2004. We invite submission of papers for presentation at the ESSLLI-2004 Student Session and for appearance in the proceedings. PURPOSE: This ninth ESSLLI Student Session will provide, like the previous editions, an opportunity for ESSLLI participants who are students to present their own work in progress and get feedback from senior researchers and fellow-students. The ESSLLI Student Session encourages submissions from students at any level, undergraduates (before completion of the Master Thesis) as well as postgraduates (before completion of the PhD degree). Papers co-authored by non-students will not be accepted. Papers may be accepted for full presentation (30 minutes including 5 to 10 minutes of discussion) or for a poster presentation. All the accepted papers will be published in the ESSLLI-2004 Student Session proceedings, which will be made available during the summer school. REQUIREMENTS: The Student Session papers should describe original, unpublished work, completed or in progress, that demonstrates insight, creativity, and promise. No previously published papers should be submitted. We welcome submissions with topics within the areas of Logic, Language and Computation. SUBMISSION DETAILS: Student authors are invited to submit a full paper, not to exceed 7 pages of length exclusive of references. Note that the length of the final version of the accepted papers will not be allowed to exceed 10 pages. The submissions will be reviewed by the student session programme committee and additional reviewers. A plain ASCII text version of the identification page should be sent separately, using the following format: Title: title of the submission First author: firstname lastname Address: address of the first author ...... Last author: firstname lastname Address: address of the last author Short summary: abstract (5 lines) Subject area (one or two of): Logic | Language | Computation In case the paper is being submitted to another conference or workshop, this must be clearly indicated on the identification page. The preferred formats of submissions are PostScript, PDF, or plain text, although other formats will also be accepted. In case of acceptance, the final version of the paper will have to be submitted in LaTeX format. The papers must use single column A4 size pages, 11pt or 12pt fonts, and standard margins. Submissions not in accordance with the specified formatting and length requirements may be subject to rejection without review. The paper and separate identification page must be sent electronically to: paulegre@magic.fr by FEBRUARY 22, 2004. PROGRAMME COMMITTEE: Laura Alonso i Alemany (Universitat de Barcelona, Barcelona) Carlos Areces (LORIA, Nancy) Jaume Baixeries (Universitat Politècnica de Catalunya, Barcelona) Willem Comradie (Rand Afrikaans University, South Africa) Benoit Crabbé (LORIA, Nancy) Paul Egré (IHPST, Université Paris 1, IJN) Judit Gervain (SISSA, Trieste) Bart Geurts (University of Nijmegen, Nijmegen) Ivana Kruijff-Korbayova (Universität des Saarlandes, Saarbrücken) Marco Kuhlmann (Universität des Saarlandes, Saarbrücken) Mª Magdalena Ortiz de la Fuente (Universidad de las Americas, Puebla) Benjamin Spector (Laboratoire de Linguistique Formelle, Université Paris 7, ENS) IMPORTANT DATES: Deadline for submission of papers : February 22, 2004. Authors notifications : April 19, 2004. ESSLLI early registration : May 1, 2004. Final papers for proceedings : May 15, 2004. ESSLLI-2004 Student Session : August 9-20, 2004. ESSLLI-2004 INFORMATION: In order to present a paper at ESSLLI-2004 Student Session, at least one student author of each accepted paper has to register as a participant at ESSLLI-2004. The authors of accepted papers will be eligible for reduced registration fees even after the deadline for early registration. For all information concerning ESSLLI-2004, please consult the ESSLLI-2004 main website at http://esslli2004.loria.fr/ For more information about the ESSLLI'04 student session, consult the ESSLLI'04 student session website at: http://lingua.fil.ub.es/~lalonso/stusESSLLI04/ If you have any further question about the student session, do not hesitate to contact us: Laura Alonso i Alemany Paul Egré lalonso@fil.ub.es paulegre@magic.fr Departament de Lingüística General IHPST / Université Paris 1 / Institut Nicod Gran Via de les Corts Catalanes, 585 Institut d'Histoire et Philosophie des Sciences et Techniques Universitat de Barcelona 13, rue du Four Barcelona, SPAIN 75006 Paris, FRANCE telephone number: +34 93 403 56 93 telephone number: + (33) (0)1 43 54 60 36 fax number: +34 93 318 98 22 fax number: + (33) (0)1 44 07 16 49 From pieter@cs.utwente.nl Sun Jan 11 08:53:45 2004 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id i0BDrjEY007428 for ; Sun, 11 Jan 2004 08:53:45 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i0BDrhSO011834 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Sun, 11 Jan 2004 08:53:44 -0500 (EST) Received: from netlx050.vf.utwente.nl (netlx050.vf.utwente.nl [192.87.17.19]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i0BDrgm3012618 for ; Sun, 11 Jan 2004 08:53:43 -0500 (EST) Received: from utiw32 (kabel212208.kabel.utwente.nl [130.89.202.72]) by netlx050.vf.utwente.nl (8.11.7/HKD) with ESMTP id i0BDref16119 for ; Sun, 11 Jan 2004 14:53:40 +0100 From: "Pieter Hartel" To: Date: Sun, 11 Jan 2004 15:00:22 +0100 Message-ID: <837ED66D4414D411A6D0204C4F4F5020030F636F@eiger.cs.utwente.nl> X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook, Build 10.0.3416 Importance: Normal X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2800.1165 X-UTwente-MailScanner-Information: Scanned by MailScanner. Contact helpdesk@ITBE.utwente.nl for more information. X-UTwente-MailScanner: Found to be clean X-Mailman-Approved-At: Sun, 11 Jan 2004 10:14:16 -0500 Cc: Subject: [TYPES] Vacancies Twente, The Netherlands X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sun, 11 Jan 2004 13:53:45 -0000 VACANCY NOTICE TWO POSTDOCS SECURITY The Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) at the University of Twente in the Netherlands offers courses in Electrical Engineering, Applied Mathematics, Computer Science, Telematics, and Business Information Technology. The Centre for Telematics and Information Technology (CTIT) is a multi-disciplinary research institute of the University. CTIT coordinates the research activities in all the areas relevant to the development, the introduction and the usage of telematics and information technology systems. The Distributed and Embedded Systems Research (DIES) Group of EEMCS/CTIT leads a multidisciplinary interest group in security research with important contributions from the Faculty of Behavioural Sciences and the Faculty of Business, Public Administration and Technology. DIES has vacancies for two PostDocs: 1 PostDoc design and verification of cryptographic protocols In the NWO project Account, which develops methods and tools to analyse accountability in e-commerce protocols (see http://dies.cs.utwente.nl/research/#account) 2 PostDoc security policies In the European INSPIRED project, which develops the next generation secure personal devices (see http://dies.cs.utwente.nl/research/#inspired) . What we ask and what we offer You have completed a PhD in Mathematics or Computer Science. You like working in a team and have knowledge of security. Your main task will be to do research, but you will be given the opportunity to acquire some teaching experience. We offer you an interesting temporary research-position in a dynamic and international environment. You will be appointed for a period of two years. The salary starts at about EURO 34000,- gross per year and depends on your experience. . Information and application More information may be obtained from Prof. Pieter Hartel (email pieter.hartel@utwente.nl) or Dr. Sandro Etalle (email etalle@cs.utwente.nl). You are invited to send your application together with curriculum vitae and the names and addresses of two referees by email to the addresses above, or by normal post to Ing. Harm van Egmond, Director of EEMCS, University of Twente, P.O.Box 217, 7500 AE Enschede, the Netherlands. From kam@is.tsukuba.ac.jp Mon Jan 12 10:38:42 2004 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id i0CFcgEY018645 for ; Mon, 12 Jan 2004 10:38:42 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i0CFceSO016237 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 12 Jan 2004 10:38:41 -0500 (EST) Received: from gentzen.is.tsukuba.ac.jp (gentzen.is.tsukuba.ac.jp [130.158.81.68]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i0CFcdm3002739 for ; Mon, 12 Jan 2004 10:38:39 -0500 (EST) Received: from localhost (gentzen [130.158.81.68]) by gentzen.is.tsukuba.ac.jp (8.11.6/8.11.6) with ESMTP id i0CFcXh21141; Tue, 13 Jan 2004 00:38:33 +0900 To: types@cis.upenn.edu From: Yukiyoshi Kameyama X-Mailer: Mew version 1.94.2 on Emacs 21.2 / Mule 5.0 (SAKAKI) Mime-Version: 1.0 Content-Type: Text/Plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-Id: <20040113003833F.kam@is.tsukuba.ac.jp> Date: Tue, 13 Jan 2004 00:38:33 +0900 Sender: Yukiyoshi Kameyama X-Dispatcher: imput version 20021213(IM143) Lines: 188 X-Mailman-Approved-At: Mon, 12 Jan 2004 10:44:04 -0500 Cc: Subject: [TYPES] FLOPS 2004 Call for Participation X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 12 Jan 2004 15:38:42 -0000 --------------------------------------------------------------------- Call for Participation The Seventh International Symposium on Functional and Logic Programming (FLOPS 2004) Nara, Japan, April 7-9, 2004 ================================ Information ================================ FLOPS Home http://logic.is.tsukuba.ac.jp/flops2004/ FLOPS local organization http://wwwfun.kurims.kyoto-u.ac.jp/flops2004/ Sattelite Workshop: Workshop on Algebra and Logic on Programming Systems (ALPS) April 10, 2004, Kyoto http://www.kurims.kyoto-u.ac.jp/~hassei/ALPS.html ================================ Registration and Accommodation ================================ Detailed information of registration and accommodation can be found at the local organization page: http://wwwfun.kurims.kyoto-u.ac.jp/flops2004/ The early registration deadline is February 29th, 2004. ================== Invited Speakers ================== Masami Hagiya University of Tokyo Carsten Schuermann Yale University Peter Selinger University of Ottawa =============================== Symposium Program (tentative) =============================== Wednesday, April 7 13:00--14:00 Invited Talk 1 On the Design of Quantum Programming Languages Peter Selinger (University of Ottawa) 14:30--16:00 Online Justification for Tabled Logic Programs Giridhar Pemmasani (State University of New York) Hai-feng Guo (University of Nebraska) Yifei Dong (University of Oklahoma) Norman C.R. Ramakrishnan (State University of New York) I.V. Ramakrishnan (State University of New York) Constructive Intensional Negation Susana Munoz (Universidad Politecnica de Madrid) Julio Marino (Universidad Politecnica de Madrid) Juan Jose Moreno-Navarro (Universidad Politecnica de Madrid) Analysing Definitional Trees: Looking for Determinism Pascual Julian-Iranzo (Universidad de Castilla -La Mancha) Christian Villamizar-Lamus (Universidad de Castilla -La Mancha) 16:30--17:30 DDT: A Declarative Debugging Tool for Functional-Logic Languages Rafael Caballero (Universidad Complutense de Madrid) Mario Rodriguez-Artalejo (Universidad Complutense de Madrid) LIX: An Effective Self-Applicable Partial Evaluator for Prolog Stephen-John Craig (University of Southampton) Michael Leuschel (University of Southampton) Thursday, April 8 9:00--10:00 Invited Talk 2 Analysis of Synchronous and Asynchronous Cellular Automata Using Abstraction by Temporal Logic Masami Hagiya (University of Tokyo) Koichi Takahashi (AIST) Mitsuharu Yamamoto (Chiba University) Takahiro Sato (University of Tokyo) 10:30--12:00 Multivariant Non-Failure Analysis via Standard Abstract Interpretation Francisco Bueno (Universidad Politecnica de Madrid) Pedro Lopez-Garcia (Universidad Politecnica de Madrid) Manuel Hermenegildo (Universidad Politecnica de Madrid) Set-Sharing is not Redundant for Pair-Sharing Francisco Bueno (Monash University) Maria Garcia de la Banda (Monash University) Backward Pair Sharing Analysis Lunjin Lu (Oakland University) Andy King (University of Kent) 13:30--15:00 Implementing Natural Rewriting and Narrowing Efficiently Santiago Escobar (Universidad Politecnica de Valencia) Complete Axiomatization of an Algebraic Construction of Graphs Mizuhito Ogawa (Japan Advanced Institute of Science and Technology) Sub-Birkhoff Vincent van Oostrom (Universiteit Utrecht) 15:30--17:30 Relaxing the Value Restriction Jacques Garrigue (Kyoto University) Rigid mixin modules Tom Hirschowitz (ENS Lyon) Semantics of Linear Continuation-Passing in Call-by-Name Masahito Hasegawa (Kyoto University) A Direct Proof of Strong Normalization for an Extended Herbelin's Calculus Kentaro Kikuchi (Chiba University) Friday, April 9 9:00--10:00 Invited Talk 3 Twelf -- a Meta-Logical Framework Carsten Schuermann (Yale University) 10:30--12:00 Normalization by evaluation for lambda^2 Thorsten Altenkirch (University of Nottingham) Basic Pattern Matching Calculi: A Fresh View on Matching Failure Wolfram Kahl (McMaster University) Derivation of Deterministic Inverse Programs based on LR Parsing Robert Glueck (Waseda University) Masahiko Kawabe (Waseda University) =================== Program Committee =================== Francois Fages INRIA Rocquencourt Herman Geuvers Nijmegen University Michael Hanus University of Kiel Martin Hofmann LMU Muenchen Haruo Hosoya University of Tokyo Yukiyoshi Kameyama University of Tsukuba, Co-Chair Naoki Kobayashi Tokyo Institute of Technology John Lloyd Australian National University Aart Middeldorp University of Innsbruck Atsushi Ohori JAIST German Puebla Technical University of Madrid Morten Rhiger IT-University of Copenhagen Amr Sabry Indiana University Peter Stuckey University of Melbourne, Co-Chair Martin Sulzmann National University of Singapore Kazunori Ueda Waseda University Philip Wadler University of Edinburgh ========================== Local Arrangements Chair ========================== Jacques Garrigue Kyoto University ========== Sponsors ========== Asian Association for Foundation of Software Association for Logic Programming Japan Society of Software Science and Technology Kayamori Foundation of Information Science Advancement, Japan --------------------------------------------------------------------- From fausto.spoto@univr.it Mon Jan 12 13:21:34 2004 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id i0CILYEY024660 for ; Mon, 12 Jan 2004 13:21:34 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i0CILSSO026890 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Mon, 12 Jan 2004 13:21:28 -0500 (EST) Received: from linus.math.tulane.edu (linus.math.tulane.edu [129.81.170.40]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i0CILRm3004373 for ; Mon, 12 Jan 2004 13:21:27 -0500 (EST) Received: from linus.math.tulane.edu (localhost [127.0.0.1]) by localhost (Postfix) with ESMTP id BC26A13CC6; Mon, 12 Jan 2004 12:18:17 -0600 (CST) Received: by linus.math.tulane.edu (Postfix, from userid 3005) id 71A5213B69; Mon, 12 Jan 2004 12:18:17 -0600 (CST) Received: from mailgw.univr.it (mailgw.univr.it [157.27.6.150]) by linus.math.tulane.edu (Postfix) with SMTP id D326713B69 for ; Mon, 12 Jan 2004 12:18:01 -0600 (CST) Received: (qmail 73135 invoked from network); 12 Jan 2004 18:03:59 -0000 Received: from unknown (HELO profs.sci.univr.it) (157.27.252.10) by mailgw.univr.it with SMTP; 12 Jan 2004 18:03:59 -0000 Received: from [157.27.242.173] ([157.27.242.173]) by profs.sci.univr.it (8.9.3/8.9.3) with ESMTP id TAA26342; Mon, 12 Jan 2004 19:20:29 +0100 (MET) From: Fausto Spoto To: concurrency@cwi.nl, types@cis.upenn.edu, rewriting@loria.fr, theorem-provers@ai.mit.edu, lprolog@cs.umn.edu, prog-lang@diku.dk, eapls@jiscmail.ac.uk, theory@brics.dk, seworld@cs.colorado.edu, types@cis.upenn.edu, clp@comp.nus.edu.sg, benelog@cs.kuleuven.ac.be, curry@informatik.rwth-aachen.de, glp@first.gmd.de, mercury-ads@cs.mu.oz.au, practical-applications@pap.com, sicstus-users@sics.se, users@mozart-oz.org, gulp@dimi.uniud.it, eacsl@dimi.uniud.it, gulp@dimi.uniud.it, ipa@tue.nl, prog-logique@irisa.fr, theory-logic@cs.cmu.edu, aiia@di.unito.it, alp@doc.ic.ac.uk, amast@cs.utwente.nl, compulog@doc.imperial.ac.uk, compulognet-parimp@dia.fi.upm.es, compunode@compulog.org, cphc-conf@jiscmail.ac.uk, cs-logic@cs.indiana.edu, dbworld@cs.wisc.edu, dreamers@dai.ed.ac.uk, fm-info@air16.larc.nasa.gov, formal-methods@cs.uidaho.edu, info-hol@jaguar.cs.byu.edu, isabelle-users@cl.cam.ac.uk, kgs@logic.tuwien.ac.at, logic-announce@uclink4.berkeley.edu, nuprllist@cs.cornell.edu, prolia@tlxf.geomail.org, quintus-users@quintus.com, pvs@csl.sri.com, theorynt@listserv.nodak.edu, mfpsmail4@linus.math.tulane.edu, appiar@ncc.up.pt Content-Type: text/plain Content-Transfer-Encoding: 7bit X-Mailer: Ximian Evolution 1.0.8 (1.0.8-10) Message-Id: <1073930941.1249.78.camel@localhost.localdomain> Mime-Version: 1.0 X-Spam-DCC: : X-Spam-Checker-Version: SpamAssassin 2.61 (1.212.2.1-2003-12-09-exp) on linus.math.tulane.edu X-Spam-Level: X-Spam-Status: No, hits=0.0 required=5.0 tests=LINES_OF_YELLING autolearn=no version=2.61 X-Mailman-Approved-At: Mon, 12 Jan 2004 13:36:18 -0500 Cc: Subject: [TYPES] LOPSTR+PEPM+PPDP+SAS 2004: Last Call for Workshop Proposals X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Date: Mon, 12 Jan 2004 18:21:36 -0000 X-Original-Date: 12 Jan 2004 19:08:35 +0100 X-List-Received-Date: Mon, 12 Jan 2004 18:21:36 -0000 PLEASE ACCEPT MY APOLOGIES IF YOU RECEIVE THIS MESSAGE MORE THAN ONCE. LOPSTR'04 + PEPM'04 + PPDP'04 + SAS'04 *** CALL FOR WORKSHOP PROPOSALS *** *** DEADLINE: January 18, 2004 *** International Symposium on Logic-based Program Synthesis and Transformation URL: http://www.sci.univr.it/~lopstr04 ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation URL: http://www.sci.univr.it/~pepm04 ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming URL: http://www.sci.univr.it/~ppdp04 International Static Analysis Symposium URL: http://www.sci.univr.it/~sas04 LOPSTR'04, the International Symposium on Logic-based Program Synthesis and Transformation, PEPM'04, the ACM SIGPLAN 2004 Symposium on Partial Evaluation and Semantics Based Program Manipulation, PPDP'04, the 6th ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming, and SAS'04, the 11th International Static Analysis Symposium, will be held in Verona, Italy, from August 24 to August 28, 2004. We plan to have several workshops in parallel with the conferences. Workshops have a key role. They provide an ideal platform for the presentation of preliminary work or novel ideas in a less formal way than the conferences themselves. They also are an opportunity to disseminate work in progress, particularly for new researchers. Workshops also provide a venue for presenting more specialized topics and opportunities for more intensive discussions, exchange of ideas, and project collaboration. The topics of the workshops can cover any areas related to software specification, analysis, transformation and verification, and to declarative programming, including cross-disciplinary areas. The format of the workshop will be determined by the organizer(s) proposing the workshop, but ample time must be allowed for general discussion. Workshops can vary in length, but the optimal duration will be half a day or a full day. Having two or three co-organizers for a workshop is strongly advised. Workshop Proposal: ================== The persons intending to organize a workshop at LOPSTR'04 + PEPM'04 + PPDP'04 + SAS'04 are invited to submit a workshop proposal. Proposals should be in English and about two pages in length. They should contain: * the title of the workshop * a brief technical description of the topics covered by the workshop * a discussion of the timeliness and relevance of the workshop * the names, affiliation and contact details (email, web page, phone, fax) of the workshop organizing committee together with a designated contact person as the workshop coordinator * a preliminary plan/schedule for organizing the workshop, including the required number of half-days allotted to the workshop * a list of previously-organized related workshops by any of the workshop organizers. Although previous experience with organizing similar workshops is not required, this information will be helpful to the Workshop Chair * an estimated number of attendants to the workshop Proposals are expected in ASCII or LaTeX format. All proposals should be submitted to the Workshop Chair by email by January 18, 2004. Workshop Organizers' Tasks: =========================== * Producing a "Call for Papers" for the workshop and posting it on the net and/or other means. Please provide a web page URL which can be linked into the LOPSTR'04 + PEPM'04 + PPDP'04 + SAS'04 home pages. * Providing a brief description of the workshop for the conference program. * Reviewing/accepting submitted papers. * Scheduling workshop activities in collaboration with the local organizers and the workshop chair. * Printing and providing workshop proceedings to the workshop attendants. Reviewing Process: ================== Each submitted proposal is reviewed by the Workshops Chair and the Conferences Program Chairs. Proposals that appear well-organized and that fit the goals and scope of LOPSTR'04 + PEPM'04 + PPDP'04 + SAS'04 will be selected. The decision will be notified by email to the responsible organizer by February 1st, 2004. The definitive length of the workshop will be planned according to the number of submissions received by the different workshops. For every accepted workshop, the LOPSTR'04 + PEPM'04 + PPDP'04 + SAS'04 Organizing Committee will prepare a meeting place. Workshop Location: ================== The workshops will be held in parallel with LOPSTR'04 + PEPM'04 + PPDP'04 + SAS'04, which will be held in Verona, Italy, from August 24 to August 28, 2004. The conference will be held in the city centre. Verona is among the most important historical and artistic town in Italy, with more than two thousand years of history. During the Roman Empire it was a political and commercial centre, whose magnificent traces can still be seen in the Arena and the Roman Theatre. Verona has always been synonymous with culture, nowadays it attracts people from everywhere thanks to the Arena, the myth of Romeo and Juliet and its precious beauty. LOPSTR'04 + PEPM'04 + PPDP'04 + SAS'04 have been scheduled at the end of August 2004, so that participants may also appreciate the cultural events in town, such as the opera at the Arena and other open air concerts and happenings. Important Dates: ================ Proposals due: January 18, 2004 Notification of acceptance: February 1st, 2004 Workshops: August 24 to August 28, 2004 Workshop Chair: ===================== Fausto Spoto (Dipartimento di Informatica, Verona, Italy) Email: fausto.spoto@univr.it Phone: +39 3204352527 Fax: +39 0458027068 From wmfarmer@mcmaster.ca Wed Jan 14 12:03:58 2004 X-Mailman-Handler: $Id: mm-handler,v 1.2 2002/04/05 19:41:09 bwarsaw Exp $ Received: from linc.cis.upenn.edu (LINC2.CIS.UPENN.EDU [158.130.67.2]) by rhizome.seas.upenn.edu (8.12.9/8.12.8) with ESMTP id i0EH3vEY011634 for ; Wed, 14 Jan 2004 12:03:58 -0500 Received: from central.cis.upenn.edu (CENTRAL.CIS.UPENN.EDU [158.130.12.2]) by linc.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i0EH3uSO003950 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Wed, 14 Jan 2004 12:03:56 -0500 (EST) Received: from wiglaf.cas.mcmaster.ca (wiglaf.cas.mcmaster.ca [130.113.68.52]) by central.cis.upenn.edu (8.12.10/8.12.9) with ESMTP id i0EH3tVN004954 for ; Wed, 14 Jan 2004 12:03:55 -0500 (EST) Received: (from wmfarmer@localhost) by wiglaf.cas.mcmaster.ca (8.9.3/8.9.3) id MAA25706; Wed, 14 Jan 2004 12:00:44 -0500 Date: Wed, 14 Jan 2004 12:00:44 -0500 Message-Id: <200401141700.MAA25706@wiglaf.cas.mcmaster.ca> X-Authentication-Warning: wiglaf.cas.mcmaster.ca: wmfarmer set sender to wmfarmer@mcmaster.ca using -f From: "William M. Farmer" To: wmfarmer@wiglaf.cas.mcmaster.ca X-Mailman-Approved-At: Wed, 14 Jan 2004 12:05:52 -0500 Cc: Subject: [TYPES] Tutorial proposals for IJCAR 2004 due February 1, 2004 X-BeenThere: types-list@lists.seas.upenn.edu X-Mailman-Version: 2.1.2 Precedence: list Reply-To: wmfarmer@mcmaster.ca List-Id: TYPES forum List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 14 Jan 2004 17:03:58 -0000 ------------------------------------------------------------ IJCAR 2004 Second International Joint Conference on Automated Reasoning 04 July - 08 July, 2004 University College Cork Cork, County Cork, Ireland http://4c.ucc.ie/ijcar/ ------------------------------------------------------------ CALL FOR TUTORIAL PROPOSALS Tutorials will be held on July 4-5, 2004. They may run a half or full day. General ------- IJCAR 2004 is the Second International Joint Conference on Automated Reasoning (IJCAR) and will be held in Cork, Ireland from July 4th to 8th, 2004. The first IJCAR was held in Siena, Italy, in late June 2001, merging CADE (Conference on Automated Deduction), FTP (Workshop on First-order Theorem Proving), and TABLEAUX (Conference on Analytic Tableaux and Related Methods). The second IJCAR will merge CADE, FTP, TABLEAUX, FroCoS (Workshop on Frontiers of Combining Syst