From kai at iam.unibe.ch Mon Jan 4 08:35:30 2010 From: kai at iam.unibe.ch (=?ISO-8859-1?Q?Kai_Br=FCnnler?=) Date: Mon, 4 Jan 2010 14:35:30 +0100 Subject: [TYPES/announce] PCC 2010 -- Call for Papers Message-ID: <3e96a78f1001040535te1491c3u3ad6e7edd3be2935@mail.gmail.com> =============================== CALL FOR PAPERS 9th Proof, Computation and Complexity PCC 2010 June 18-19, 2010 Bern, Switzerland http://pcc2010.unibe.ch/ =============================== Aim and scope -------------------- The aim of PCC is to stimulate research in proof theory, computation, and complexity, focusing on issues which combine logical and computational aspects. Topics may include applications of formal inference systems in computer science, as well as new developments in proof theory motivated by computer science demands. Specific areas of interest are (non-exhaustively listed) foundations for specification and programming languages, logical methods in specification and program development including program extraction from proofs, type theory, new developments in structural proof theory, and implicit computational complexity. Organisers ---------------- * Kai Br?nnler, Bern (co-chair) * Alessio Guglielmi, Loria * Reinhard Kahle, Coimbra * Thomas Studer, Bern (co-chair) Invited Speakers (provisional list) ---------------------------------------------- * Agata Ciabattoni (Wien) Contributions ------------------ PCC is intended to be a lively forum for presenting and discussing recent work. Participants who want to contribute a talk are asked to submit an abstract (Pdf, 1-2 pages) to pcc2010.workshop at gmail.com. The collection of abstracts will be available at the meeting. Important Dates ---------------------- Submission deadline : May 1, 2010 Notification to authors : May 15, 2010 Workshop: June 18-19, 2010 =============================== From mwh at cs.umd.edu Mon Jan 4 10:26:15 2010 From: mwh at cs.umd.edu (Michael Hicks) Date: Mon, 4 Jan 2010 10:26:15 -0500 Subject: [TYPES/announce] PLDI 2010: Call for Tutorials Message-ID: <84A6EB42-A8BE-4BDD-8719-C7327A166512@cs.umd.edu> Many of the tools announced on this list would make interesting tutorial topics at PLDI; please consider submitting your idea! -Mike ACM SIGPLAN 2010 Conference on Programming Language Design and Implementation (PLDI'10) Toronto, Canada June 5 - 10, 2010 http://cs.stanford.edu/pldi10/ Second Call for Tutorials http://www.cs.umd.edu/~mwh/pldi10tutorials/cfp.html Submission deadline: Friday, January 22, 2010 (just under three weeks away) PLDI is a forum where researchers, developers, educators, and practitioners exchange information on the latest practical and experimental work in the design and implementation of programming languages. The tutorial program enhances the technical program by providing a day of half-day tutorials offered in parallel tracks. Tutorials for PLDI 2010 are solicited on any topic relevant to the PLDI audience. In particular, tutorials that strive to do one of the following have been particularly successful in the past: * Describe an important piece of research infrastructure * Educate the community on an emerging topic For examples of past tutorials, see (among others) the websites of PLDI 2009, 2008, and 2007 (at http://www.cs.virginia.edu/kim/publicity/pldi09tutorials, http://www.research.ibm.com/people/h/hind/pldi08-tutorial-program.htm and http://ties.ucsd.edu/PLDI/tutorials.shtml, respectively). Submission Procedures Submissions should be in text or pdf form, sent via email to Michael Hicks (mwh at cs.umd.edu, with subject line PLDI tutorial proposal) with the following information: * Tutorial title * Presenter(s), affiliation(s), and contact information * 1-3 page description (for evaluation). This should include the objectives, topics to be covered, presentation philosophy (if any), target audience, prerequisite knowledge, and if the tutorial was previously held, the location (i.e. which conference), date, and number of attendees * 1-2 paragraph abstract suitable for tutorial publicity * 1 paragraph biography suitable for tutorial publicity Important Dates Submission deadline: Friday, January 22, 2010 Notification: Friday, February 19, 2010 From selinger at mathstat.dal.ca Mon Jan 4 19:08:19 2010 From: selinger at mathstat.dal.ca (Peter Selinger) Date: Mon, 4 Jan 2010 20:08:19 -0400 (AST) Subject: [TYPES/announce] MFPS 26 - call for papers Message-ID: <20100105000819.5B2445C285@chase.mathstat.dal.ca> Second CALL FOR PAPERS MFPS XXVI http://www.math.tulane.edu/~mfps/mfps26 Twenty-sixth Conference on the Mathematical Foundations of Programming Semantics University of Ottawa Ottawa, Ontario, Canada May 6 - 10, 2010 Partially Supported by US Office of Naval Research The Twenty-sixth Conference on the Mathematical Foundations of Programming Semantics will take place on the campus of the University of Ottawa, Ontario, Canada UK from May 6 - 10, 2010. MFPS conferences are devoted to those areas of mathematics, logic, and computer science that are related to models of computation, in general, and to the semantics of programming languages, in particular. The series has particularly stressed providing a forum where researchers in mathematics and computer science can meet and exchange ideas about problems of common interest. As the series also strives to maintain breadth in its scope, the conference strongly encourages participation by researchers in neighboring areas. TOPICS include, but are not limited to: biocomputation, concurrent and distributed computation, constructive mathematics, domain theory and categorical models, formal languages, formal methods, game semantics, lambda calculus, logic, probabilistic systems, process calculi, programming language theory, quantum computation, security, topological models, type systems, type theory. INVITED SPEAKERS: Amal Ahmed, Indiana Martin Escardo, Birmingham Cedric Fournet, Microsoft, Paris Pieter Hofstra, Ottawa Jean Krivine, PPS, Paris 7 Keye Martin, NRL SPECIAL SESSIONS: * Domain Theory (organized by Martin Escardo) * Logic and Category Theory (organized by Rick Blute and Phil Scott) * Security (organized by Catherine Meadows) * Systems Biology (organized by Jean Krivine) TUTORIAL LECTURES: There will be daily tutorial lectures on Model Checking and Verification, given by Stephen Brookes (Carnegie Mellon), Amy Felty (Ottawa), Joel Ouaknine (Oxford), and Prakash Panangaden (McGill, organizer), and James Worrell (Oxford). PROGRAM COMMITTEE: Ulrich Berger, Swansea Stephen Brookes, Carnegie Mellon Venanzio Capretta, Nottingham Vincent Danos, Edinburgh Thomas Hildebrandt, ITU Copenhagen Achim Jung, Birmingham Guy McCusker, Bath Catherine Meadows, NRL Paul-Andre Mellies, Paris 7 Michael Mislove, Tulane Peter O'Hearn, Queen Mary Prakash Panangaden, McGill Catuscia Palamidessi, INRIA Brigitte Pientka, McGill Benjamin Pierce, U. Pennsylvania Davide Sangiorgi, INRIA and Bologna Vladimiro Sassone, Southampton Andrea Schalk, Manchester Philip Scott, Ottawa Peter Selinger, Chair, Dalhousie Benoit Valiron, LIG Grenoble IMPORTANT DATES: - February 5, 2010 Title and Short Abstract submission deadline - February 12, 2010 Paper submission deadline - March 15, 2010 Notification to authors - April 2, 2010 Preliminary proceedings version due SUBMISSIONS should be prepared using ENTCS Macros, available from http://www.entcs.org. Submissions should be in the form of a PDF file not exceeding 15 pages in length. Submissions are now open on the following EasyChair website: https://www.easychair.org/login.cgi?conf=mfps2010 PROCEEDINGS: There will be a preliminary proceedings of the conference papers that will be distributed at the meeting, with a final proceedings published in ENTCS after the meeting. ORGANIZERS: MFPS is organized by Stephen Brookes (CMU), Achim Jung (Birmingham), Catherine Meadows (NRL), Michael Mislove (Tulane) and Prakash Panangaden (McGill). The local organizers for MFPS 26 are Rick Blute and Phil Scott (Ottawa). For more information, please see the conference web site: http://www.math.tulane.edu/~mfps/mfps26, or contact mfps at math.tulane.edu. * * * From sacerdot at cs.unibo.it Tue Jan 5 06:15:07 2010 From: sacerdot at cs.unibo.it (Claudio Sacerdoti Coen) Date: Tue, 05 Jan 2010 12:15:07 +0100 Subject: [TYPES/announce] Post-Doc position in the CerCo FET-Open EU Project Message-ID: <1262690107.5919.57.camel@zenone> Job description: We are currently looking for a Post-Doc position at the Department of Computer Science, University of Bologna, to work on the CerCo FET-Open EU Project (see description below). The gross salary is 36000 euros per year. The University of Bologna is the oldest western university and the Department of Computer Science (http://www.cs.unibo.it/en/), located in the historic city center, has strong expertise in theoretical computer science and logic and it participates to several national and international projects. The Post-Doc will join the HELM team, leaded by Prof. Asperti, whose members work in the domains of Type Theory and Mathematical Knowledge Management. The CerCo project is headed by Dr. Sacerdoti Coen. The candidate will benefit from exchange opportunity with the other project participants (University Paris-Diderot, Paris, and University of Edinburgh, Edinburgh). The candidate will not have any teaching duties. Requirements: Candidates should have a Ph.D. in Computer Science and previous experience in either Type Theory (in particular Interactive Theorem Proving) or Compiler Development, and being proficient in functional programming languages. Starting date: The starting date will be decided together with the candidate and could not be before March. The contract is for two years. The candidate should contact sacerdot at cs.unibo.it for further information. Project description: The CerCo FET-Open EU Project is aimed at producing the first _formally_ _verified_ _complexity_preserving_ compiler for a subset of C to the object code for a microprocessor used in embedded systems. The output of the compilation process will be the object code and a copy of the source code annotated with _exact_ computational complexities for each program slice in O(1). The exact computational complexities (expressed in clock cycles and parametric in the program input) can then be used to formally reason on the overall code complexity. The source code of the compiler will be formally verified using the Matita Interactive Theorem Prover (http://matita.cs.unibo.it), based on a variant of the Calculus of (Co)Inductive Constructions. -- ---------------------------------------------------------------- Real name: Claudio Sacerdoti Coen Doctor in Computer Science, University of Bologna E-mail: sacerdot at cs.unibo.it http://www.cs.unibo.it/~sacerdot ---------------------------------------------------------------- From lp15 at cam.ac.uk Wed Jan 6 03:18:14 2010 From: lp15 at cam.ac.uk (Lawrence Paulson) Date: Wed, 6 Jan 2010 08:18:14 +0000 Subject: [TYPES/announce] Call for Bids (ITP 2011) Message-ID: We received no bids for hosting ITP 2011. Therefore, we will also entertain bids to host ITP 2011 in Europe, in spite of our previous restriction against that. If you might be interested in hosting (whether in Europe or not), please send a reply only to itp10 at easychair.org, no later than Wednesday of next week, January 13, just to let us know that you are considering it. Matt Kaufmann and Larry Paulson -------- Start of forwarded message ------- From: Lawrence Paulson Subject: Call for Bids (ITP 2011) Date: Wed, 11 Nov 2009 15:28:08 +0000 It is time to begin the process of selecting a host for ITP 2011, the International Conference on Interactive Theorem Proving. Following tradition from TPHOLs, the hosts of the previous conference (ITP 2010) are running the process. There are two phases: solicitation of bids and voting. This message concerns the first phase. A long-standing TPHOLs convention is that the conference should be held in a continent different from the location of the previous meeting, and therefore no bids to host ITP 2011 in Europe will be accepted. Based on ITP and TPHOLs history, ITP 2011 will likely be held in July, August or September. (The ACL2 Workshop has taken place at various times of year.) Bids should be sent to itp10 at easychair.org and should include at least the following information: - name and email address of a contact person - names of other people involved - address of website for the bid - approximate dates of the conference - structure (e.g., k workshop days and n days of presentations followed by excursion...) - advantages of the proposed venue An example of a previous winning bid is here:http://web2.comlab.ox.ac.uk/oucl/conferences/TPHOLs2005/bid.html Deadline for all bids is Monday, 4 January 2010. Shortly after that, the bids will be made public and the voting phase will take place. The people eligible to vote are those who are seriously thinking of attending ITP 2011. The voting system used will be Single Transferable Vote between all received bids. (Note: ACL2 papers will be welcome at ITP 2011, regardless of whether or not there is a separate ACL2 workshop in 2011.) Matt Kaufmann and Larry Paulson -------- End of forwarded message ------- From herman at cs.ru.nl Wed Jan 6 10:11:55 2010 From: herman at cs.ru.nl (Herman Geuvers) Date: Wed, 06 Jan 2010 16:11:55 +0100 Subject: [TYPES/announce] PhD student in the FormMath project In-Reply-To: <1262690107.5919.57.camel@zenone> References: <1262690107.5919.57.camel@zenone> Message-ID: <4B44A83B.9000506@cs.ru.nl> Job description The aim of the FORMATH project(http://www.formath.cs.ru.nl) is to develop libraries of formalized mathematics concerning algebra, linear algebra, real number computation, and algebraic topology: These libraries will be structured as software components, relying on Ssreflect, which has proved its worth in the formal proof of the four colour theorem, and to address topics that were mostly left untouched by previous research in formal proofs or formal methods. This work concerns formally proved algorithms for solving problems in real arithmetics, solving problems in ordinary differential equations, or solving problems in algebraic topology. Our methodology is a combination of theoretical research and technological development. The main tools will be provided by the Mathematical Components project, for instance the Ssreflect library for Coq proof assistants. The four partners in the EU ForMath project are: - Goteborg; - INRIA; - Nijmegen; - La Roja. More specifically, as a PhD student at the Nijmegen location you will work on Work package 4; - Real number computation and basic numerical analysis; - The use of exact real number computation to prove inequalities. The objective is specification and implementation of a simple ODE solver. Potential fields of applications include robotics and hybrid systems. Requirements You should meet the following requirements: - A master's degree (or equivalent) in Computer Science, Mathematics or a related field, with a strong interest in proof assistants, type theory, functional programming, constructive analysis and numerical analysis; - Commitment and a cooperative attitude; - Excellent proficiency in written and spoken English. Organization The Radboud University Nijmegen is one of the leading academic communities in the Netherlands. Renowned for its green campus, modern buildings, and state-of-the-art equipment, it has nine faculties and enrols over 17.500 students in approximately 90 study programmes. The university is situated in the oldest Dutch city, close to the German border, on the banks of the river Waal (a branch of the Rhine). The city has a rich history and one of the liveliest city centres in the Netherlands. The section Intelligent Systems of the Institute for Computing and Information Sciences (ICIS) at the Radboud University Nijmegen studies mathematical theories concerned with computability, provability and complexity. Notably, the group studies type theory, lambda calculus and logic and also applies these theories in the area of theorem proving and formalizing mathematics. The group has an excellent international reputation which was supported by the last national research assessment. Website: http://www.cs.ru.nl Conditions of employment Employment: 1,0 fte Maximum salary per month, based on a fulltime employment: ? 2,612 gross/month Starting at ? 2,042 per month, the salary will increase to ? 2,612 per month in the fourth year. PhD scale. Additional conditions of employment You will be appointed as a PhD student for a period of four years. Your performance will be evaluated after 18 months. If the evaluation is positive, the contract will be extended by 2.5 years. Additional Information Bas Spitters Telephone: +31 24 3652611 E-mail: spitters at cs.ru.nl Telephone: +31 24 3652104 Application You can apply for the job (mention the vacancy number 62.52.09) before 1 February 2010 by sending your application -preferably by email- to: RU Nijmegen, FNWI, P&O, mrs. D. Reinders P.O. Box 9010, 6500 GL Nijmegen, NL Telephone: +31 24 3652027 E-mail: pz at science.ru.nl http://www.ru.nl/vacaturedetails?recid=497982 From adamc at hcoop.net Wed Jan 6 10:20:01 2010 From: adamc at hcoop.net (Adam Chlipala) Date: Wed, 06 Jan 2010 10:20:01 -0500 Subject: [TYPES/announce] New draft textbook on practical Coq Message-ID: <4B44AA21.5070502@hcoop.net> I would like to announce the first complete beta version of a draft textbook that I'm working on, available online under a Creative Commons license: http://adam.chlipala.net/cpdt/ This text deals with practical engineering with the Coq proof assistant (http://coq.inria.fr/), a tool for building machine-checked mathematical proofs. The focus is on building programs with proofs of correctness, using dependent types and scripted proof automation. I'm following an unusual philosophy in this book, so it may be of interest even to long-time Coq users. At the same time, I hope that it provides an easier introduction for newcomers, since short and automated proofs are the starting point, rather than an advanced topic. If you've been waiting for a little push to learn how to machine-check your proofs about languages and logics, this book may provide part of that push. :) The final part of the book applies the earlier parts' tools to examples in programming languages and compilers. I'm very interested in hearing from people who might like to beta test this book in courses that they're teaching. There are a few exercises already in the book, with more probably to come, and I have a non-public set of sample solutions to those that are already included. From scaladays2010 at cunei.com Wed Jan 6 10:33:12 2010 From: scaladays2010 at cunei.com (Antonio Cunei) Date: Wed, 06 Jan 2010 16:33:12 +0100 Subject: [TYPES/announce] Call for Papers Reminder: The First Scala Workshop - Scala Days 2010 Message-ID: <4B44AD38.8090502@cunei.com> The First Scala Workshop ======================== Call for Papers --------------- Scala is a general purpose programming language designed to express common programming patterns in a concise, elegant, and type-safe way. It smoothly integrates features of object-oriented and functional languages. This workshop is a forum for researchers and practitioners to share new ideas and results of interest to the Scala community. The first workshop will be held at EPFL in Lausanne, Switzerland, on Thursday 15 April 2010, co-located with Scala Days 2010 (15-16 April). We seek papers on topics related to Scala, including (but not limited to): 1. Language design and implementation -- language extensions, optimization, and performance evaluation. 2. Library design and implementation patterns for extending Scala -- embedded domain-specific languages, combining language features, generic and meta-programming. 3.Formal techniques for Scala-like programs -- formalizations of the language, type system, and semantics, formalizing proposed language extensions and variants, dependent object types, type and effect systems. 4. Concurrent and distributed programming -- libraries, frameworks, language extensions, programming paradigms: (Actors, STM, ...), performance evaluation, experimental results. 5. Safety and reliability -- pluggable type systems, contracts, static analysis and verification, runtime monitoring. 6. Tools -- development environments, debuggers, refactoring tools, testing frameworks. 7. Case studies, experience reports, and pearls Important Dates --------------- Submission: Friday, Jan 15, 2010 (24:00 in Apia, Samoa) Notification: Monday, Feb 15, 2010 Final revision: Monday, Mar 15, 2010 Workshop: Thursday, Apr 15, 2010 Submission Guidelines --------------------- Submitted papers should describe new ideas, experimental results, or projects related to Scala. In order to encourage lively discussion, submitted papers may describe work in progress. All papers will be judged on a combination of correctness, significance, novelty, clarity, and interest to the community. Submissions must be in English and at most 12 pages total length in the standard ACM SIGPLAN two-column conference format (10pt). No formal proceedings will be published, but there will be a webpage linking to all accepted papers. The workshop also welcomes short papers. The papers can be submitted at the Scala Workshop EasyChair website, http://www.easychair.org/conferences/?conf=days2010 Details about the Scala Days 2010 event will be available shortly after the submission deadline at http://www.scala-lang.org/days2010 Program Committee ----------------- Ian Clarke, Uprizer Labs William Cook, UT Austin Adriaan Moors, KU Leuven Martin Odersky, EPFL (chair) Kunle Olukotun, Stanford University David Pollak, Liftweb Lex Spoon, Google From swarat at cse.psu.edu Wed Jan 6 11:02:37 2010 From: swarat at cse.psu.edu (swarat@cse.psu.edu) Date: Wed, 6 Jan 2010 11:02:37 -0500 (EST) Subject: [TYPES/announce] Request for comments: Two-phase reviewing for POPL Message-ID: <1995.121.246.189.113.1262793757.squirrel@mail.cse.psu.edu> Request for comments: Two-phase reviewing for POPL ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Though program chairs and committee members work hard to get things right, no decision process is perfect. Given the role that major conferences such as POPL play in promotion and tenure, the system is coming under increasing pressure and discussion. (For instance, see 'Conferences vs journals in computing research', Moshe Vardi, CACM, May 2009.) The POPL Steering Committee has formulated the following proposal, which we are circulating for discussion and feedback from the community. The proposal aims to improve the decision process for POPL while still working in a fixed time frame and with bounded resources. We propose to use a two-phase reviewing process, broken up approximately as follows: (a) 8 weeks: Reviewers submit first-phase reviews (b) 2 weeks: On-line discussion (c) 2 days: Physical PC meeting *** Decide for each paper: accept, resubmit, or reject *** (d) 2 weeks: Author revise papers (for each accept or resubmit) *** Authors resubmit paper with cover letter describing changes *** (e) 4 weeks: Reviewers submit second-phase reviews (f) 1 week: On-line discussion *** Decide for each paper: accept or reject *** The times may require tuning. It is proposed to omit author response, as two-phase reviewing serves a similar purpose. Resubmitted papers should include a cover letter describing what has changed and responding to concerns raised in the reviews. We also propose that the program committee should have two co-chairs. Two co-chairs provides additional effort to ensure that papers receive expert reviews and to manage the extended review process. As the team for POPL 2011 is already in place, we expect to first try two-phase reviewing for POPL 2012. We envision that the new, earlier submission date for POPL should come, if possible, about two weeks after the ICFP notification date. We plan to survey author satisfaction, starting with POPL 2010, to provide some feedback on the process. Advantages of this proposal include: * Revision is likely to improve the quality of the papers, and in particular may improve readability of the final result. * Revision provides a sounder footing than author response for dealing with papers about which there is doubt. * Some argue that POPL receives more high-quality papers than it can accept. Improving the review process may provide a better basis for deciding whether to increase the number of accepted papers. * Other conferences are moving to a year-round refereeing process closer to that used by journals; for instance VLDB is now linked to a journal PVLDB. The two-phase proposal yields similar benefits, while ensuring focus and a bound on effort. We seek your comments! Please speak or write to any member of the POPL Steering Committee. There will be a community meeting at POPL, 5:15-6:30pm Wednesday 20 January 2010, to discuss this plan. * Philip Wadler, current SIGPLAN Chair and 2008 Program Chair * Kathleen Fisher, past SIGPLAN Chair * Graham Hutton, current SIGPLAN Vice Chair * Chandra Krintz, past SIGPLAN Vice Chair * Tom Ball, 2011 General Chair * Mooly Sagiv, 2011 Program Chair * Manuel Hermenegildo, 2010 General Chair * Jens Palsberg, 2010 Program Chair * Zhong Shao, 2009 General Chair * Benjamin Pierce, 2009 Program Chair * George Necula, 2008 General Chair * Martin Hofman, 2007 General Chair * Matthias Felleisen, 2007 Program Chair From venneri at dsi.unifi.it Fri Jan 8 08:34:15 2010 From: venneri at dsi.unifi.it (Betti Venneri) Date: Fri, 08 Jan 2010 14:34:15 +0100 Subject: [TYPES/announce] ITRS 2010: Call for papers Message-ID: <4B473457.1010903@dsi.unifi.it> ========================================================================== CALL FOR PAPERS (Deadline: March 31, 2010) **ITRS 2010** Fifth Workshop on Intersection Types and Related Systems (A FLoC workshop affiliated with LICS 2010) July 9, 2010, Edinburgh, UK http://gdn.dsi.unifi.it/itrs/ ========================================================================== Intersection types were introduced near the end of the 1970s to overcome the limitations of Curry's type assignment system and to provide a characterization of the strongly normalizing terms of the Lambda Calculus. They have been one of the first examples of behavioural type theory: namely, they provide an abstract specification of computational properties, by expressing a finer and more precise input/output relation than standard, commonly used, type systems can do. Although intersection types were initially intended for use in analysing and/or synthesizing lambda models as well as in analysing normalization properties, over the last twenty years the scope of the research on intersection types and related systems has broadened in many directions. Restricted (and more manageable) forms have been investigated, such as refinement types. Type systems based on intersection type theory have been extensively studied for practical purposes, such as program analysis. The dual notion of union types turned out to be quite useful for programming languages. Finally, the behavioural approach to types, which can give a static specification of computational properties, has become central in the most recent research on type theory. The ITRS 2010 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. TOPICS Possible topics for submitted papers include, but are not limited to: * Formal properties of systems with intersection types. * Results for related systems, such as union types, refinement types, or singleton types. * Applications to lambda calculus and similar systems. * Applications to pi-calculus and similar systems. * Applications for programming languages. * Applications for other areas, such as database query languages and program extraction from proofs. * Related approaches using behavioural types to characterize computational properties. SUBMISSIONS The submission is in two stages. (1) Before the workshop, authors are invited to submit an extended abstract (max. 10 pages) in PDF format, using the Easychair submission site http://www.easychair.org/conferences/?conf=itrs2010. Accepted papers will be presented at the workshop and included in the preliminary proceedings, which will made available in electronic form. (2) After the workshop, authors of accepted papers will be invited to submit full versions, which will be referred for inclusion in final post-proceedings. The post-proceedings will be published as a special issue of Electronic Proceedings in Theoretical Computer Science (EPTCS). Submissions must be prepared in LaTeX using the EPTCS macro package (http://style.eptcs.org/). IMPORTANT DATES Submission of extended abstracts: March 31, 2010 Author notification: April 30, 2010 Final version for preliminary proceedings: May 26, 2010 Workshop: July 9, 2010 Submission for EPTC Post-Proceedings: September 30, 2010 (TBC) PROGRAM COMMITTEE Mariangiola Dezani-Ciancaglini (Univ.di Torino) Joshua Dunfield (McGill Univ. Montreal) Silvia Ghilezan (Univ. of Novi Sad) Atsushi Igarashi (Kyoto Univ.) Elaine Pimentel (Belo Horizonte Univ.) Betti Venneri (Univ. di Firenze) Chair Joe Wells (Heriot-Watt Univ.Edinburgh). ______________________________________________ From pmt6sbc at maths.leeds.ac.uk Fri Jan 8 08:56:31 2010 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Fri, 8 Jan 2010 13:56:31 GMT Subject: [TYPES/announce] CiE 2010 - Final Call for Papers Message-ID: <201001081356.o08DuUgm021182@amsta.leeds.ac.uk> Final call for papers --------------------------------------------------------------------------- COMPUTABILITY IN EUROPE 2010: Programs, Proofs, Processes Ponta Delgada (Azores), Portugal June 30 to July 4, 2010 http://www.cie2010.uac.pt/ Deadline for submissions: 20 JANUARY 2010 --------------------------------------------------------------------------- Computability in Europe provides the largest international conference dealing with the full spectrum of computability-related research. CiE 2010 in the Azores is the sixth conference of the Series, held in a geographically unique and dramatic location, Europe's most Westerly outpost. The theme of CiE 2010 - "Programs, Proofs, Processes" - points to the usual CiE synergy of Computer Science, Mathematics and Logic, with important computability-theoretic connections to science and the real universe. TUTORIALS: Jeffrey Bub (Information, Computation and Physics), Bruno Codenotti (Computational Game Theory). INVITED SPEAKERS: Eric Allender, Jose L. Balcazar, Shafi Goldwasser, Denis Hirschfeldt, Seth Lloyd, Sara Negri, Toniann Pitassi, and Ronald de Wolf. SPECIAL SESSIONS on: Biological Computing, organizers: Paola Bonizzoni, Krishna Narayanan Invited speakers: Giancarlo Mauri, Natasha Jonoska, Stephane Vialette, Yasubumi Sakakibara Computational Complexity, organizers: Luis Antunes, Alan Selman Invited speakers: Eric Allender, Christian Glasser, John Hitchcock, Rahul Santhanam Computability of the Physical, organizers: Barry Cooper, Cris Calude Invited speakers: Giuseppe Longo, Yuri Manin, Cris Moore, David Wolpert Proof Theory and Computation, organizers: Martin Hyland, Fernando Ferreira Invited speakers: Thorsten Altenkirch, Samuel Mimram, Paulo Oliva, Lutz Strassburger Reasoning and Computation from Leibniz to Boole, organizers: Benedikt Loewe, Guglielmo Tamburrini Confirmed speakers: Volker Peckhaus, Olga Pombo, Sara Uckelman Web Algorithms and Computation, organizers: Martin Olsen, Thomas Erlebach Confirmed speaker: Debora Donato SPECIAL TRIBUTE TO MARIAN POUR-EL: Ning Zhong. CiE serves as an interdisciplinary forum for research in all aspects of computability and foundations of computer science, as well as the interplay of these theoretical areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics. Formal systems, attendant proofs, and the possibility of their computer generation and manipulation (for instance, into programs) have been changing a whole spectrum of disciplines. The conference will address not only the more established lines of research of Computational Complexity and the interplay between Proofs and Computation, but also novel views that rely on physical and biological processes and models to find new ways of tackling computations and improving their efficiency. We particularly invite papers that build bridges between different parts of the research community. Since women are underrepresented in mathematics and computer science, we emphatically encourage submissions by female authors. The Elsevier Foundation is supporting the CiE conference series in the programme "Increasing representation of female researchers in the computability community". This programme will allow us to fund child-care support, a mentoring system for young female researchers, and also a small number of grants for junior female researchers (see below). The dates around the submission process are as follows: Submission Deadline: 20 January 2010 Notification to Authors: 18 March 2010 Deadline for Final Version: 8 April 2010 CiE 2010 conference topics include, but not exclusively: * Admissible sets * Analog computation * Artificial intelligence * Automata theory * Classical computability and degree structures * Computability theoretic aspects of programs * Computable analysis and real computation * Computable structures and models * Computational and proof complexity * Computational complexity * Computational learning and complexity * Concurrency and distributed computation * Constructive mathematics * Cryptographic complexity * Decidability of theories * Derandomization * Domain theory and computability * Dynamical systems and computational models * Effective descriptive set theory * Finite model theory * Formal aspects of program analysis * Formal methods * Foundations of computer science * Games * Generalized recursion theory * History of Computing * Hybrid systems * Higher type computability * Hypercomputational models * Infinite time Turing machines * Kolmogorov complexity * Lambda and combinatory calculi * L-systems and membrane computation * Mathematical models of emergence * Molecular computation * Natural computing * Neural nets and connectionist models * Philosophy of science and computation * Physics and computability * Probabilistic systems * Process algebra * Programming language semantics * Proof mining * Proof theory and computability * Quantum computing and complexity * Randomness * Reducibilities and relative computation * Relativistic computation * Reverse mathematics * Swarm intelligence * Type systems and type theory * Uncertain reasoning * Weak arithmetics and applications Contributed papers will be selected from submissions received by the PROGRAMME COMMITTEE consisting of: Klaus Ambos-Spies (Heidelberg), Luis Antunes (Porto), Arnold Beckmann (Swansea), Paola Bonizzoni (Milano), Alessandra Carbone (Paris), Steve Cook (Toronto ON), Barry Cooper (Leeds), Erzsebet Csuhaj-Varju (Budapest), Fernando Ferreira (Lisbon, co-chair), Nicola Galesi (Rome), Luis Mendes Gomes (Ponta Delgada), Rosalie Iemhoff (Utrecht), Achim Jung (Birmingham), Michael Kaminski (Haifa), Jarkko Kari (Turku), Viv Kendon (Leeds), James Ladyman (Bristol), Kamal Lodaya (Chennai), Giuseppe Longo (Paris), Benedikt Loewe (Amsterdam), Elvira Mayordomo (Zaragoza, co-chair), Wolfgang Merkle (Heidelberg), Russell Miller (New York NY), Dag Normann (Oslo), Isabel Oitavem (Lisbon), Joao Rasga (Lisbon), Nicole Schweikardt (Frankfurt), Alan Selman (Buffalo NY), Peter van Emde Boas (Amsterdam), Albert Visser (Utrecht) The Programme Committee cordially invites all researchers in the area of the conference to submit their papers (in PDF-format, at most 10 pages) for presentation at CiE 2010. The best of the accepted papers will be published in the conference proceedings within the Lecture Notes in Computer Science (LNCS) series of Springer, which will be available at the conference. Authors of accepted papers are expected to present their work at the conference. Submitted papers must describe work not previously published, and they must neither be accepted nor under review at a journal or at another conference with refereed proceedings. All papers need to be prepared in LNCS-style LaTeX. Papers must not exceed 10 pages. Full proofs may appear in a technical appendix which will be read at the reviewers' discretion. Submissions authored or co-authored by members of the Programme Committee are not allowed. Papers that have only student authors are eligible for the "CiE 2010 Best Student Paper Award." If your submission satisfies the requirements, please submit your paper in the category "Regular paper (eligible for Best Student Paper Award)." The Programme Committee will select the best submission among these after acceptance. The recipient of the Best Student Paper Award will get a fee waiver of the registration fee, a certificate, and a small symbolic cash prize. Funded by the Elsevier Foundation's programme 'Women in Computability' we shall offer five travel grants (covering registration fee and up to 300 EUR in reimbursement for travel and accomodation expenses) for junior female researchers. More information will become available in March 2010. Funded by the Elsevier journal Annals of Pure and Applied Logic (APAL), the organizers are offering a number of travel grants (including fee waivers and a modest reimbursement of travel and accommodation expenses) for students to attend CiE 2010. Student authors of accepted papers will have priority for these grants. The Association for Symbolic Logic (ASL) sponsors modest student member travel grants. See http://www.aslonline.org/studenttravelawards.html New funding opportunities are expected to be offered. For more details concerning funding and up to date information, please consult regularly the web page of the conference http://www.cie2010.uac.pt/ _________________________________________________________________________ ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk CiE Conference Series http://www.illc.uva.nl/CiE CiE 2010 http://www.cie2010.uac.pt/ CiE Membership Application Form http://www.cs.swan.ac.uk/acie CiE on Twitter http://twitter.com/AssociationCiE __________________________________________________________________________ From bruni at di.unipi.it Fri Jan 8 11:41:12 2010 From: bruni at di.unipi.it (Roberto Bruni) Date: Fri, 08 Jan 2010 17:41:12 +0100 Subject: [TYPES/announce] Last CfP for TGC 2010: EXTENDED deadline Jan. 20th, 2010 In-Reply-To: <4B2D1A70.6000507@di.unipi.it> References: <4B2D1A70.6000507@di.unipi.it> Message-ID: <4B476028.2040506@di.unipi.it> [Apologies for multiple postings] Due to several requests, the TGC'10 chairs have decided to extend the deadline for submsissions to January 20th ================================================================ Call for Papers TGC 2010 Fifth International Symposium on TRUSTWORTHY GLOBAL COMPUTING http://www.pst.ifi.lmu.de/tgc2010 LMU, Munich, February 26-26, 2010 ---------------------------------------------------------------- co-located with the review of FP6 GCII projects AEOLUS and SENSORIA ================================================================ IMPORTANT DATES --------------- Paper submissions: January 20, 2010 EXTENDED Final version (pre-proc.): February, 2010 Conference: February 24-26, 2010 Final version (post-proc.): March 22, 2010 SCOPE ------ The Symposium on Trustworthy Global Computing is an international annual venue dedicated to safe and reliable computation in global computers. It focuses on providing frameworks, tools, and protocols for constructing well-behaved applications and on reasoning rigorously about their behaviour and properties. The related models of computation incorporate code and data mobility over distributed networks with highly dynamic topologies and heterogeneous devices. We solicit papers in all areas of global computing, including (but not limited to): * theories, models and algorithms for global computing and service oriented computing * language concepts and abstraction mechanisms * security through verifiable evidence * resource usage and information flow policies * game-theoretic approaches to selfishness * verification of cryptographic protocols and their use * trust, access control and security enforcement mechanisms * sharing information and computation * efficient communication * self configuration, adaptation, and dynamic components management * software principles to support debugging and verification * test generators, symbolic interpreters, type checkers * model checkers, theorem provers, static analyzers * approximation algorithms, impossibility results, and structural properties * privacy, reliability and business integrity SUBMISSION DETAILS ------------------ Papers can be submitted online through the EASYCHAIR website http://www.easychair.org/conferences/?conf=tgc2010 Contributions must be in Postscript or PDF and consist of no more than 15 pages in the Springer LNCS style. Additional details and proofs omitted due to space limitations may be included in a clearly marked appendix. Submitted papers must describe work unpublished in refereed venues, and not submitted for publication elsewhere. PROCEEDINGS ----------- We plan to publish Springer LNCS post-proceedings shortly after the conference, to give the authors the opportunity to take into account discussions and suggestions at the conference. Pre-proceedings with the accepted papers will be made available at the conference. ORIGINS & PLANS --------------- In 2010, the symposium is co-located with the reviews of the following FP6 GCII projects: AEOLUS - Algorithmic Principles for Building Efficient Overlay Computers SENSORIA - Software Engineering for Service-Oriented Overlay Computers TGC 2008, the fourth Symposium on Trustworthy Global Computing, was held in Barcelona (Spain), on November 3 - 4, 2008. The symposium was co-located with the reviews of the FP6 GCII projects AEOLUS, MOBIUS and SENSORIA. TGC 2007 was held on November 5-6, 2007 in Sophia-Antipolis, France and it was followed by the Workshop on the Interplay of Programming Languages and Cryptography on November 7, 2007. The symposium was co-located with the reviews of the FP6 GCII projects AEOLUS, MOBIUS and SENSORIA. TGC 2006 was held in Lucca (Italy), on November 7 - 9, 2006 and it was co-located with the reviews of EU FET-IST FP6 Projects AEOLUS, MOBIUS, SENSORIA and CATNETS. The first TGC event took place in Edinburgh on April 7-9, 2005 with the co-sponsorship of IFIP TC-2, as part of ETAPS 2005. TGC 2005 was the evolution of the previous Global Computing I Workshops held in Rovereto in 2003 and 2004 (see e.g. LNCS 2874) and the workshops on Foundation of Global Computing held as satellite events of ICALP and Concur (see e.g. ENTCS Vol. 85). STEERING COMMITTE ----------------- Gilles Barthe (IMDEA Software, Madrid) Rocco De Nicola (University of Florence) Christos Kaklamanis (University of Patras) Ugo Montanari (University of Pisa) Davide Sangiorgi (University of Bologna) Don Sannella (University of Edinburgh) Vladimiro Sassone (University of Southampton) Martin Wirsing (University of Munich) PROGRAM CHAIRS -------------- Martin Hofmann - hofmann at tcs.ifi.lmu.de Institut fur Informatik, LMU Munich Martin Wirsing - wirsing at lmu.de Institut fur Informatik, LMU Munich PROGRAM COMMITTEE (to be invited!) ----------------- * Gilles Barthe (IMDEA Software, Madrid) * Roberto Bruni (University of Pisa) * Rocco De Nicola (University of Florence) * Howard Foster (Imperial College) * Samir Genaim (Universidad Complutense de Madrid) * Stefania Gnesi (ISTI, Pisa) * Martin Hofmann (LMU Munich) (co-chair) * Thomas Jensen (IRISA, Rennes) * Christos Kaklamanis (University of Patras) * Alberto Marchetti-Spaccamela (University of Roma "La Sapienza") * Paddy Nixon (University College Dublin) * Giuseppe Persiano (University of Salerno) * Geppino Pucci (University of Padova) * Paola Quaglia (University of Trento) * Don Sannella (University of Edinburgh) * Vladimiro Sassone (University of Southampton) * Maria J. Serna (Universitat Polit?cnica de Catalunya) * Carolyn Talcott (SRI International) * Emilio Tuosto (University of Leicester) * Nobuko Yoshida (Imperial College London) * Martin Wirsing (LMU Munich) (co-chair) * Franco Zambonelli (University of Modena) LOCAL ORGANIZATION ------------------ * Nora Koch (chair) * Axel Rauschmayer * Gefei Zhang ================================================================ -- ===================================================================== Dr. Roberto Bruni Computer Science Department Phone: +39 050 2212785 University of Pisa Fax: +39 050 2212726 Largo B. Pontecorvo, 3 Email: bruni at di.unipi.it I-56127 Pisa - ITALY WWW: http://www.di.unipi.it/~bruni ===================================================================== "We think in generalities, but we live in detail" Alfred N. Whitehead ===================================================================== From kaufmann at cs.utexas.edu Sat Jan 9 12:23:20 2010 From: kaufmann at cs.utexas.edu (Matt Kaufmann) Date: Sat, 9 Jan 2010 11:23:20 -0600 Subject: [TYPES/announce] Final Call for Bids (ITP 2011) Message-ID: <201001091723.o09HNKDB017592@sundance.cs.utexas.edu> Hello -- In the last few days we have received several expressions of interest in submitting a bid to host ITP 2011. We now invite the community to submit formal bids by following the instructions on the following web page, which is a slightly edited version of the original call for bids, in particular to allow submissions from Europe. http://www.cs.utexas.edu/users/kaufmann/itp-2011-bids.html As we receive bids, we will post information about them on the above web page. The last day for receipt of bids will be Wednesday, February 17. We will then issue a call for votes, as described on the above page. Regards, Matt Kaufmann and Larry Paulson (ITP 2010 co-chairs) From pmt6sbc at maths.leeds.ac.uk Mon Jan 11 10:17:27 2010 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Mon, 11 Jan 2010 15:17:27 GMT Subject: [TYPES/announce] DCM 2010 in Edinburgh - First Call for Papers Message-ID: <201001111517.o0BFHRvZ002934@amsta.leeds.ac.uk> ========================================================================= First Call for Papers DCM 2010 6th International Workshop on Developments in Computational Models ** Causality, Computation, and Physics ** http://www.amsta.leeds.ac.uk/~pmt6sbc/DCM10/ Edinburgh, Scotland 9-10 July 2010 Deadline for abstracts: 01 April, 2010 A satellite event of FLoC - http://www.floc-conference.org/ ========================================================================= DCM 2010 is the sixth in a series of international workshops focusing on new computational models. It aims to bring together researchers who are currently developing new computational models or new features of a traditional one. And to foster interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. DCM 2010 will be a two-day satellite event of FLoC 2010, with a special focus on the theme 'Causality, Computation, and Physics'. Day 2 of the Workshop will have an emphasis on quantum computation and physics, held as Quantum Information Science Scotland (QUISCO), and is co-sponsored by Scottish Universities Physics Alliance (SUPA) and Scottish Informatics and Computer Science Alliance (SICSA). Topics of interest include all abstract models of computation and their properties, and their applications to the development of programming languages and systems: - quantum computation, including implementations and formal methods in quantum protocols; - probabilistic computation and verification in modelling situations; - chemical, biological and bio-inspired computation, including spatial models, self-assembly, growth models; - general concurrent models including the treatment of mobility, trust, and security; - information-theoretic ideas in computing. PLEASE SUBMIT an extended abstract (of around 12 pages or less) in PDF format to the conference EasyChair submission page: https://www.easychair.org/login.cgi?conf=dcm2010 by the deadline: 01 April, 2010. Accepted contributions will appear in a pre-proceedings special issue of the EPTCS (Electronic Proceedings in Theoretical Computer Science). After the workshop, full versions of selected papers will be invited for a special issue of the internationally leading journal Mathematical Structures in Computer Science (MSCS). IMPORTANT DATES: Submission deadline for abstracts: 01 April, 2010 Notification: 26 April Workshop: 9-10 July, 2010 CONFIRMED INVITED SPEAKERS: Cristian Calude (Auckland, New Zealand) Russ Harmer (Paris/Harvard) Gordon Plotkin (Edinburgh) Vlatko Vedral (Oxford) PROGRAMME COMMITTEE: S Barry Cooper (Leeds, Co-chair) Prakash Panangaden (McGill, Co-chair) Elham Kashefi (Edinburgh, Chair QUISCO 2010) Paola Bonizzoni (Milan) Olivier Bournez (Paris) Vincent Danos (Edinburgh, CNRS) Mariangiola Dezani (Torino) Andreas Doering (Oxford) Maribel FernC!ndez (London) Joseph Fitzsimons (Oxford) Ivette Fuentes-Schuller (Nottingham) Simon Gay (Glasgow) Jean Krivine (Paris) Ian Mackie (Ecole Polytechnique) Damian Markham (Paris) Daniel Oi (Strathclyde) Simon Perdrix (Edinburgh and Paris) Susan Stepney (York) John Tucker (Swansea) ========================================================================= Further information: Barry Cooper, pmt6sbc at leeds.ac.uk, Prakash Panangaden prakash at cs.mcgill.ca ========================================================================= From simonpj at microsoft.com Mon Jan 11 17:46:33 2010 From: simonpj at microsoft.com (Simon Peyton-Jones) Date: Mon, 11 Jan 2010 22:46:33 +0000 Subject: [TYPES/announce] Two phase reviewing for POPL; a response Message-ID: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Colleagues | Request for comments: Two-phase reviewing for POPL ... | The POPL Steering Committee has formulated the following proposal, | which we are circulating for discussion and feedback from the | community. The proposal aims to improve the decision process for POPL | while still working in a fixed time frame and with bounded resources. Thank you for broadcasting the proposal, and offering the opportunity for feedback. I can't come to POPL this year, but I do have opinions about this proposal, so I thought I would put them in writing. I'm sending this response only to the TYPES mailing list. Many people are concerned about the publication norms that have developed in our field [1,2,3,4]. In particular, we have evolved a somewhat bizarre system in which we place tremendous weight on publication in premier conferences with extremely low acceptance rates. Promotion and tenure can depend on publication in these venues. Yet anyone who has served on a program committee knows that (a) the evaluation is fairly rough and ready, and (b) it is hard to avoid a tendency to pick well-executed but incremental papers over more adventurous but flawed work. The current proposal for POPL is presumably a direct response to this situation. But I believe its main thrust, to invest yet more effort in the selection process, is addressing the wrong problem. The problem is not that program committees are selecting the *wrong* papers. The problem is that they are selecting too *few* papers. Before developing these claims, I want to mention some real advantages of the current conference system. * It is quick -- and *predictably* quick. There is a delay of only a few months between submission and presentation; and there is never any slippage, because the conference itself is immoveable. * It is a *fantastic* deal for authors. The most precious commodity for any author is the focused attention of other experts in the field. When I began my academic career an author would be lucky to get three scrawled sentences of review, on physical scraps of paper. Nowadays authors get between three and six substantial, thoughtful reviews. That is gold dust. * Reviewing is recognised to be rough and ready. Everyone knows that there is no time to hunt for the perfect reviewer. The reviewers know they have limited time for their work, and cut their cloth accordingly. For that very reason they are more inclined to agree to write a review than if they are asked to review a 60-page journal paper when they are supposed to do a bang-up thorough job. Program committee members review 20-30 papers, and simply cannot spend days on each; and the universal acceptance of this fact is what makes people willing to serve on PCs I regard this limited time-budget for each review as a major advantage. 80% of the benefit of a review comes from the first 20% of investment. Yes, individual injustices are sometimes done, and all of us have been on the receiving end, but in the aggregate it is a very efficient evaluation mechanism. That is, it is not perfectly accurate, but it is a *very effective use of reviewing bandwidth*. * Much has been written about the evils of banging out papers to meet conference deadlines, and no one would defend salami-slicing incremental papers instead of working in a sustained way on adventurous research. Less has been written about the intellectual *advantages* of writing frequently. My own experience is that the act of writing a paper is tremendously enlightening. I learn that I do not understand what I though I understood. The act of putting ideas onto paper forces clarity, or at least exposes muddy thinking. It puts thoughts into a form when they can be shared with others. Since I am a weak mortal, the incentive of a conference deadline is often just what I need to force me to action. In short, there are really good things about our current system that we do not want to lose. All that said, clearly something is wrong at the moment. POPL is getting 250 submissions, and accepting 30-40. That means that many fine papers are being rejected, and among the best 60 papers there is a strong element of chance about which ones end up being accepted. The same is true of PLDI, and perhaps to a lesser extent, of ICFP. (I don't have personal experience of the OOPSLA program committee.) We cannot fix this, as some would wish, by changing the culture to make journal publications be regarded as more valuable than conference ones. If this happened, the spotlight would just shift to journals, which would be overwhelmed with submissions; and we would lose many of the advantages I outline above. But in any case it's a non-starter. No one can wave such a magic wand: cultures are *hard* to shift. Nor can we fix the problem by investing more effort in the review process, as the POPL committee is apparently suggesting. We are already investing quite enough! I'm all for careful reviewing. Double-blind reviewing (if done with a light touch, so that it does not cramp the authors style), and the opportunity for authors to rebut factual errors in reviews, both seem to have a good power-to-weight ratio. But adding a whole new round of reviewing would represent an enormous new investment on the part of both authors and reviewer, and to what end? Perhaps the published papers would be a little bit better, and the decisions would be a little bit more just. But the costs are heavy, the benefits are marginal, and it addresses none of the fundamental problems. I for one would think three times about agreeing to serve on such a PC. (I already think twice.) No, the trouble is that POPL and conferences like it simply rejects too many fine, publishable papers. This is bad because - Authors are badly served, obviously - Readers are badly served, because they don't get to read those papers - The papers get recycled at other conferences and workshops, where they increase reviewing load (by being reviewed a second time), and crowd out the truly workshop-y work in progress that should be showing up at workshops In short, we should just accept more papers at all our premier conferences, using a *quality* bar (is this paper good enough?) not a *quantity* bar (is it one of the best 30?). How can we do this? The "fat proceedings" problem is getting less and less important as we increasingly use digital media. Really the only difficulty is how to accommodate the presentations at the physical meeting itself. But this is a problem that could be dealt with in many ways. One straightforward one is to have parallel tracks. Another is to have more days. Still another, which I am rather fond of, is to accept (say) 60 papers, and then hold a lottery for 20 presentation slots. [That's fewer than usual, so there'd be longer breaks for mingling, which is actually the real reason most people go to conferences in the first place.] I would argue *against* choosing the "best" papers for presentation, because that will just re-introduce the ills we are currently struggling with. Make it clearly a matter of luck, then no one will read anything into the "chosen for presentation" badge. The lottery selection could even done at the conference itself. I'm only half joking; that way, no one could be denied travel funding on the grounds that his or her paper had not been chosen for presentation. Or perhaps participants registering for the conference could vote in advance for which accepted papers they'd like to see presented, so the programme is partly created by those attending the conference? A big advantage of this approach (simply accepting more papers) is that it is something we can simply choose to do. It does not require every conference to make the same choice simultaneously, and it doesn't require a magical cultural change. However, if we did take this path, then a significant cultural change would follow, over time. If publication at POPL was no longer an extraordinary achievement, but rather a recognition for a fine piece of work, appointment committees would in due course adjust their evaluation criteria. And that in turn might actually reduce the overwhelming number of submissions to top-drawer conferences. Simon Peyton Jones [1] J Wing, "CS woes: deadline-driven research, academic inequality", CACM 52(12) Dec 2009, p8 [2] J Crowcroft, S Keshav and N McKeown, "Scaling the academic publication process to internet scale", CACM 52(1), Jan 2009, pp27-30. [3] M Vardi, "Conferences vs journals", CACM 52(5), May 2009, p5 [4] K Bierman, FB Schneider "Program committee overload in systems", CACM 52(5), May 2009 From blume at tti-c.org Mon Jan 11 18:10:00 2010 From: blume at tti-c.org (Matthias Blume) Date: Mon, 11 Jan 2010 17:10:00 -0600 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <3525ED91-AEF1-48F3-9212-F42D2B83BC8D@tti-c.org> I would like to thank Simon for his extremely thoughtful response! I agree with him 100% and hope that many others will as well. Matthias PS: As I am also unable to attend POPL this year, I follow Simon in posting to the mailing list instead. On Jan 11, 2010, at 4:46 PM, Simon Peyton-Jones wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > Colleagues > > | Request for comments: Two-phase reviewing for POPL > ... > | The POPL Steering Committee has formulated the following proposal, > | which we are circulating for discussion and feedback from the > | community. The proposal aims to improve the decision process for > POPL > | while still working in a fixed time frame and with bounded > resources. > > Thank you for broadcasting the proposal, and offering the opportunity > for feedback. I can't come to POPL this year, but I do have opinions > about this proposal, so I thought I would put them in writing. I'm > sending this response only to the TYPES mailing list. ... From kim at cs.pomona.edu Mon Jan 11 18:47:10 2010 From: kim at cs.pomona.edu (Kim Bruce) Date: Mon, 11 Jan 2010 15:47:10 -0800 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: I also would like to agree with Simon's general thrust. POPL and PLDI are so competitive that it is difficult for the program committee to take a chance on a speculative paper when it would squeeze out a clearly very good paper that is less speculative. Thus I agree that we need to accept more papers at these conferences. Serving on a program committee is very time-consuming. If the POPL proposal were accepted as it stands, I would hope that only a few papers would be in the resubmit pile so that the workload is not overwhelming for the committee (and I agree that it is useful to have a method for authors to respond to referee comments that might reflect misunderstandings -- though a paper that was not well written could more appropriately be resubmitted to a later conference). While I'm not a big fan of Simon's proposal of a lottery to decide which papers will be presented, I have fantasized over the years of having a mechanism where each speaker starts off by giving a 15 minute version of their talk. The audience then votes to see if they continue for another 15 minutes. It is completely unworkable, of course, but it would help in those cases that you decide to attend a talk and then decide after the first few minutes that it is either very different from what you expected or is not well presented. Instead these days we simply flip open our laptops and catch up on our e-mail. My choice would be to increase the acceptance rate and schedule all or some of the submitted papers in parallel sessions. I know there are losses to this (we all become narrower -- we might also have less time to talk in the hallways if there are more papers that are personally interesting), but it will allow more high quality papers to be presented. (Extending conferences is less useful as it is hard for many of us to be away for an extended time during classes.) It also makes sense to do this if we as a profession are going to encourage more use of journals for archival publications. Conference program committees are forced to referee based on interest and likely correctness, while journals can have more detailed proofs, explanations, and data that can be verified by referees. While, as Simon says, it is useful to write often about one's research, it is also useful to put together what one has learned in several successive conference papers to make an up-to-date and comprehensive report on one's research. Kim Bruce .. also not going to POPL this year ... On Jan 11, 2010, at 2:46 PM, Simon Peyton-Jones wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > Colleagues > > | Request for comments: Two-phase reviewing for POPL > ... > | The POPL Steering Committee has formulated the following proposal, > | which we are circulating for discussion and feedback from the > | community. The proposal aims to improve the decision process for POPL > | while still working in a fixed time frame and with bounded resources. > > Thank you for broadcasting the proposal, and offering the opportunity > for feedback. I can't come to POPL this year, but I do have opinions > about this proposal, so I thought I would put them in writing. I'm > sending this response only to the TYPES mailing list. > > Many people are concerned about the publication norms that have > developed in our field [1,2,3,4]. In particular, we have evolved a > somewhat bizarre system in which we place tremendous weight on > publication in premier conferences with extremely low acceptance > rates. Promotion and tenure can depend on publication in these > venues. Yet anyone who has served on a program committee knows that > (a) the evaluation is fairly rough and ready, and (b) it is hard to > avoid a tendency to pick well-executed but incremental papers over > more adventurous but flawed work. > > The current proposal for POPL is presumably a direct response to this > situation. But I believe its main thrust, to invest yet more effort in > the selection process, is addressing the wrong problem. The problem is > not that program committees are selecting the *wrong* papers. The > problem is that they are selecting too *few* papers. > > Before developing these claims, I want to mention some real advantages of > the current conference system. > > * It is quick -- and *predictably* quick. There is a delay of only a > few months between submission and presentation; and there is never > any slippage, because the conference itself is immoveable. > > * It is a *fantastic* deal for authors. The most precious commodity for > any author is the focused attention of other experts in the field. > When I began my academic career an author would be lucky to get > three scrawled sentences of review, on physical scraps of paper. > Nowadays authors get between three and six substantial, thoughtful > reviews. That is gold dust. > > * Reviewing is recognised to be rough and ready. Everyone knows that > there is no time to hunt for the perfect reviewer. The reviewers > know they have limited time for their work, and cut their cloth > accordingly. For that very reason they are more inclined to agree > to write a review than if they are asked to review a 60-page journal > paper when they are supposed to do a bang-up thorough job. Program > committee members review 20-30 papers, and simply cannot spend days > on each; and the universal acceptance of this fact is what makes > people willing to serve on PCs > > I regard this limited time-budget for each review as a major > advantage. 80% of the benefit of a review comes from the first 20% > of investment. Yes, individual injustices are sometimes done, and > all of us have been on the receiving end, but in the aggregate it is > a very efficient evaluation mechanism. That is, it is not > perfectly accurate, but it is a *very effective use of reviewing > bandwidth*. > > * Much has been written about the evils of banging out papers to meet > conference deadlines, and no one would defend salami-slicing > incremental papers instead of working in a sustained way on > adventurous research. > > Less has been written about the intellectual *advantages* of writing > frequently. My own experience is that the act of writing a paper is > tremendously enlightening. I learn that I do not understand what I > though I understood. The act of putting ideas onto paper forces > clarity, or at least exposes muddy thinking. It puts thoughts into > a form when they can be shared with others. > > Since I am a weak mortal, the incentive of a conference deadline is > often just what I need to force me to action. > > In short, there are really good things about our current system that we > do not want to lose. > > All that said, clearly something is wrong at the moment. POPL is > getting 250 submissions, and accepting 30-40. That means that many > fine papers are being rejected, and among the best 60 papers there is > a strong element of chance about which ones end up being accepted. > The same is true of PLDI, and perhaps to a lesser extent, of ICFP. > (I don't have personal experience of the OOPSLA program committee.) > > We cannot fix this, as some would wish, by changing the culture to make > journal publications be regarded as more valuable than conference > ones. If this happened, the spotlight would just shift to journals, > which would be overwhelmed with submissions; and we would lose many > of the advantages I outline above. But in any case it's a > non-starter. No one can wave such a magic wand: cultures are *hard* to > shift. > > Nor can we fix the problem by investing more effort in the review > process, as the POPL committee is apparently suggesting. We are > already investing quite enough! I'm all for careful reviewing. > Double-blind reviewing (if done with a light touch, so that it does > not cramp the authors style), and the opportunity for authors to rebut > factual errors in reviews, both seem to have a good power-to-weight > ratio. But adding a whole new round of reviewing would represent an > enormous new investment on the part of both authors and reviewer, and > to what end? Perhaps the published papers would be a little bit > better, and the decisions would be a little bit more just. But the > costs are heavy, the benefits are marginal, and it addresses none of > the fundamental problems. I for one would think three times about > agreeing to serve on such a PC. (I already think twice.) > > > No, the trouble is that POPL and conferences like it simply rejects > too many fine, publishable papers. This is bad because > > - Authors are badly served, obviously > > - Readers are badly served, because they don't get to read > those papers > > - The papers get recycled at other conferences and workshops, where > they increase reviewing load (by being reviewed a second time), > and crowd out the truly workshop-y work in progress that should be > showing up at workshops > > In short, we should just accept more papers at all our premier > conferences, using a *quality* bar (is this paper good enough?) not a > *quantity* bar (is it one of the best 30?). How can we do this? The > "fat proceedings" problem is getting less and less important as we > increasingly use digital media. Really the only difficulty is how to > accommodate the presentations at the physical meeting itself. But this > is a problem that could be dealt with in many ways. > > One straightforward one is to have parallel tracks. Another is to > have more days. Still another, which I am rather fond of, is to > accept (say) 60 papers, and then hold a lottery for 20 presentation > slots. [That's fewer than usual, so there'd be longer breaks for > mingling, which is actually the real reason most people go to > conferences in the first place.] I would argue *against* choosing the > "best" papers for presentation, because that will just re-introduce > the ills we are currently struggling with. Make it clearly a matter > of luck, then no one will read anything into the "chosen for > presentation" badge. > > The lottery selection could even done at the conference itself. I'm > only half joking; that way, no one could be denied travel funding on > the grounds that his or her paper had not been chosen for > presentation. Or perhaps participants registering for the conference > could vote in advance for which accepted papers they'd like to see > presented, so the programme is partly created by those attending the > conference? > > > A big advantage of this approach (simply accepting more papers) is > that it is something we can simply choose to do. It does not require > every conference to make the same choice simultaneously, and it > doesn't require a magical cultural change. However, if we did take > this path, then a significant cultural change would follow, over time. > If publication at POPL was no longer an extraordinary achievement, but > rather a recognition for a fine piece of work, appointment committees > would in due course adjust their evaluation criteria. And that in > turn might actually reduce the overwhelming number of submissions to > top-drawer conferences. > Simon Peyton Jones > > [1] J Wing, "CS woes: deadline-driven research, academic > inequality", CACM 52(12) Dec 2009, p8 > > [2] J Crowcroft, S Keshav and N McKeown, "Scaling the academic > publication process to internet scale", CACM 52(1), Jan 2009, > pp27-30. > > [3] M Vardi, "Conferences vs journals", CACM 52(5), May 2009, p5 > > [4] K Bierman, FB Schneider "Program committee overload in systems", > CACM 52(5), May 2009 From Michael.Johnson at mq.edu.au Mon Jan 11 19:40:03 2010 From: Michael.Johnson at mq.edu.au (Michael Johnson) Date: Tue, 12 Jan 2010 11:40:03 +1100 Subject: [TYPES/announce] AMAST (Algebraic Methodology and Software Technology) CFP In-Reply-To: References: Message-ID: [Although this announcement doesn't specifically mention "types", it is of interest to the Types community. AMAST is largely about the interaction of mathematical analyis and software technology, and type theory and the many discussions on Types are very much part of that. Certainly AMAST has attracted many Types subscribers (including myself) in the past.] Please distribute this announcement to your colleagues. --------------------------------------------- CALL FOR PAPERS AMAST 2010: 13th International Conference on Algebraic Methodology And Software Technology http://mpc-amast2010.fsg.ulaval.ca/ Paper Submissions: 26th February 2010 --------------------------------------------- AMAST 2010 June 23th - 26th, 2010 Manoir St-Castin, Quebec City, Canada. The major goal of the AMAST Conferences is to promote research that may lead to the setting of software technology on a firm, mathematical basis. This goal is achieved by a large international community with contributions from both academia and industry. The virtues of a software technology developed on a mathematical basis include the provision of software that is (a) correct, and the correctness can be proved mathematically, (b) safe, so that it can be used in the implementation of critical systems, (c) portable, i.e., independent of computing platforms and language generations, and (d) evolutionary, i.e., it can be self-adaptable and evolves with the problem domain. All previous editions of the AMAST Conference, which were held at Iowa City (1989,1991), Twente (1993), Montreal (1995), Munich (1996), Sydney (1997), Manaus (1999), Iowa City (2000), Reunion Island (2002), Stirling (2004), Saaremaa (2006) and Urbana-Champaign (2008), made contributions to the AMAST goals by reporting and disseminating academic and industrial achievements within the AMAST area of interest. During these meetings, AMAST attracted an international following among researchers and practitioners interested in software technology, programming methodology and their algebraic and logical foundations. TOPICS ------ As in previous years, we invite papers reporting original research on setting software technology on a firm mathematical basis. We expect two kinds of submissions: technical papers and system demonstrations. Of particular interest is research on using algebraic, logic, and other formalisms suitable as foundations for software technology, as well as software technologies developed by means of logic and algebraic methodologies. Topics of interest include, but are not limited to, the following: SOFTWARE TECHNOLOGY: * systems software technology * application software technology * concurrent and reactive systems * formal methods in industrial software development * formal techniques for software requirements, design * evolutionary software/adaptive systems PROGRAMMING METHODOLOGY: * logic programming, functional programming, object paradigms * constraint programming and concurrency * program verification and transformation * programming calculi * web programming * specification languages and tools * formal specification and development case studies ALGEBRAIC AND LOGICAL FOUNDATIONS: * logic, category theory, relation algebra, computational algebra * algebraic foundations for languages and systems * logical frameworks for reasoning * logics of programs * algebra and coalgebra SYSTEMS AND TOOLS (for system demonstrations or ordinary papers): * software development environments * support for correct software development * system support for reuse * tools for prototyping * component based software development tools * validation and verification * computer algebra systems * theorem proving systems PUBLICATION ----------- As in the past, the proceedings of AMAST 2010 will be published by Springer in the Lecture Notes in Computer Science series. We invite prospective authors to submit electronically previously unpublished papers of high quality. Submissions should not have been published and should not be under consideration for publication elsewhere. Papers must be no longer than 15 pages (6 pages for system demonstrations) and should be prepared using LaTeX and the LNCS style that can be downloaded from http://www.springer.de/comp/lncs/authors.html. Papers should be received by February 26, 2010. Submission will be electronic, and further details will be available at the website soon. IMPORTANT DATES --------------- * Paper submissions: February 26, 2010, (23:59 Pacific (UTC-8)) * Notification of paper acceptance: March 19, 2010 * Camera ready papers due: April 5, 2010 * AMAST'2010 Conference: June 23-26, 2010 LOCATION -------- The conference will be held at the Manoir St-Castin, Quebec City, Canada http://mpc-amast2010.fsg.ulaval.ca/ CONTACT ------- For further information, consult the webiste or send email to mike at ics.mq.edu.au From rwh at cs.cmu.edu Mon Jan 11 20:26:24 2010 From: rwh at cs.cmu.edu (Robert Harper) Date: Mon, 11 Jan 2010 20:26:24 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <66B0D6D9-BB82-47A6-A49C-358D3F3D6782@cs.cmu.edu> I am in complete agreement with Simon, and strongly opposed to the proposed plan to change the POPL reviewing process. Bob Harper On Jan 11, 2010, at 5:46 PM, Simon Peyton-Jones wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > Colleagues > > | Request for comments: Two-phase reviewing for POPL > ... > | The POPL Steering Committee has formulated the following proposal, > | which we are circulating for discussion and feedback from the > | community. The proposal aims to improve the decision process for > POPL > | while still working in a fixed time frame and with bounded > resources. > > Thank you for broadcasting the proposal, and offering the opportunity > for feedback. I can't come to POPL this year, but I do have opinions > about this proposal, so I thought I would put them in writing. I'm > sending this response only to the TYPES mailing list. > > Many people are concerned about the publication norms that have > developed in our field [1,2,3,4]. In particular, we have evolved a > somewhat bizarre system in which we place tremendous weight on > publication in premier conferences with extremely low acceptance > rates. Promotion and tenure can depend on publication in these > venues. Yet anyone who has served on a program committee knows that > (a) the evaluation is fairly rough and ready, and (b) it is hard to > avoid a tendency to pick well-executed but incremental papers over > more adventurous but flawed work. > > The current proposal for POPL is presumably a direct response to this > situation. But I believe its main thrust, to invest yet more effort in > the selection process, is addressing the wrong problem. The problem > is > not that program committees are selecting the *wrong* papers. The > problem is that they are selecting too *few* papers. > > Before developing these claims, I want to mention some real > advantages of > the current conference system. > > * It is quick -- and *predictably* quick. There is a delay of only a > few months between submission and presentation; and there is never > any slippage, because the conference itself is immoveable. > > * It is a *fantastic* deal for authors. The most precious commodity > for > any author is the focused attention of other experts in the field. > When I began my academic career an author would be lucky to get > three scrawled sentences of review, on physical scraps of paper. > Nowadays authors get between three and six substantial, thoughtful > reviews. That is gold dust. > > * Reviewing is recognised to be rough and ready. Everyone knows that > there is no time to hunt for the perfect reviewer. The reviewers > know they have limited time for their work, and cut their cloth > accordingly. For that very reason they are more inclined to agree > to write a review than if they are asked to review a 60-page journal > paper when they are supposed to do a bang-up thorough job. Program > committee members review 20-30 papers, and simply cannot spend days > on each; and the universal acceptance of this fact is what makes > people willing to serve on PCs > > I regard this limited time-budget for each review as a major > advantage. 80% of the benefit of a review comes from the first 20% > of investment. Yes, individual injustices are sometimes done, and > all of us have been on the receiving end, but in the aggregate it is > a very efficient evaluation mechanism. That is, it is not > perfectly accurate, but it is a *very effective use of reviewing > bandwidth*. > > * Much has been written about the evils of banging out papers to meet > conference deadlines, and no one would defend salami-slicing > incremental papers instead of working in a sustained way on > adventurous research. > > Less has been written about the intellectual *advantages* of writing > frequently. My own experience is that the act of writing a paper is > tremendously enlightening. I learn that I do not understand what I > though I understood. The act of putting ideas onto paper forces > clarity, or at least exposes muddy thinking. It puts thoughts into > a form when they can be shared with others. > > Since I am a weak mortal, the incentive of a conference deadline is > often just what I need to force me to action. > > In short, there are really good things about our current system that > we > do not want to lose. > > All that said, clearly something is wrong at the moment. POPL is > getting 250 submissions, and accepting 30-40. That means that many > fine papers are being rejected, and among the best 60 papers there is > a strong element of chance about which ones end up being accepted. > The same is true of PLDI, and perhaps to a lesser extent, of ICFP. > (I don't have personal experience of the OOPSLA program committee.) > > We cannot fix this, as some would wish, by changing the culture to > make > journal publications be regarded as more valuable than conference > ones. If this happened, the spotlight would just shift to journals, > which would be overwhelmed with submissions; and we would lose many > of the advantages I outline above. But in any case it's a > non-starter. No one can wave such a magic wand: cultures are *hard* to > shift. > > Nor can we fix the problem by investing more effort in the review > process, as the POPL committee is apparently suggesting. We are > already investing quite enough! I'm all for careful reviewing. > Double-blind reviewing (if done with a light touch, so that it does > not cramp the authors style), and the opportunity for authors to rebut > factual errors in reviews, both seem to have a good power-to-weight > ratio. But adding a whole new round of reviewing would represent an > enormous new investment on the part of both authors and reviewer, and > to what end? Perhaps the published papers would be a little bit > better, and the decisions would be a little bit more just. But the > costs are heavy, the benefits are marginal, and it addresses none of > the fundamental problems. I for one would think three times about > agreeing to serve on such a PC. (I already think twice.) > > > No, the trouble is that POPL and conferences like it simply rejects > too many fine, publishable papers. This is bad because > > - Authors are badly served, obviously > > - Readers are badly served, because they don't get to read > those papers > > - The papers get recycled at other conferences and workshops, where > they increase reviewing load (by being reviewed a second time), > and crowd out the truly workshop-y work in progress that should be > showing up at workshops > > In short, we should just accept more papers at all our premier > conferences, using a *quality* bar (is this paper good enough?) not a > *quantity* bar (is it one of the best 30?). How can we do this? The > "fat proceedings" problem is getting less and less important as we > increasingly use digital media. Really the only difficulty is how to > accommodate the presentations at the physical meeting itself. But this > is a problem that could be dealt with in many ways. > > One straightforward one is to have parallel tracks. Another is to > have more days. Still another, which I am rather fond of, is to > accept (say) 60 papers, and then hold a lottery for 20 presentation > slots. [That's fewer than usual, so there'd be longer breaks for > mingling, which is actually the real reason most people go to > conferences in the first place.] I would argue *against* choosing the > "best" papers for presentation, because that will just re-introduce > the ills we are currently struggling with. Make it clearly a matter > of luck, then no one will read anything into the "chosen for > presentation" badge. > > The lottery selection could even done at the conference itself. I'm > only half joking; that way, no one could be denied travel funding on > the grounds that his or her paper had not been chosen for > presentation. Or perhaps participants registering for the conference > could vote in advance for which accepted papers they'd like to see > presented, so the programme is partly created by those attending the > conference? > > > A big advantage of this approach (simply accepting more papers) is > that it is something we can simply choose to do. It does not require > every conference to make the same choice simultaneously, and it > doesn't require a magical cultural change. However, if we did take > this path, then a significant cultural change would follow, over time. > If publication at POPL was no longer an extraordinary achievement, but > rather a recognition for a fine piece of work, appointment committees > would in due course adjust their evaluation criteria. And that in > turn might actually reduce the overwhelming number of submissions to > top-drawer conferences. > Simon Peyton Jones > > [1] J Wing, "CS woes: deadline-driven research, academic > inequality", CACM 52(12) Dec 2009, p8 > > [2] J Crowcroft, S Keshav and N McKeown, "Scaling the academic > publication process to internet scale", CACM 52(1), Jan 2009, > pp27-30. > > [3] M Vardi, "Conferences vs journals", CACM 52(5), May 2009, p5 > > [4] K Bierman, FB Schneider "Program committee overload in systems", > CACM 52(5), May 2009 > -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 2108 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100111/6d995185/smime-0001.p7s From matthias at ccs.neu.edu Mon Jan 11 22:23:33 2010 From: matthias at ccs.neu.edu (Matthias Felleisen) Date: Mon, 11 Jan 2010 22:23:33 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> Simon and others, thanks for the feedback. While I am a member of the POPL SC until January, this email is my personal opinion and is not to be construed as something anyone else on the SC may subscribe to. 1. I like the idea of accepting more papers. It is a part of every year's SC discussion. And as you probably recall from your chairman role, the SC is quite encouraging about accepting more papers. I tried to get more papers into my POPL. This year again the SC is encouraging the PC to broaden the acceptance range. In my own experience, though, the PC tends to block attempts to, say, double the number of papers. The idea is discussed, potential papers are brought up, and eventually the faction that disapproves of a larger program wears out those who are on the 'more papers' side. If you wish to achieve this numeric enlargement, I am afraid you will need to set a target number, say 60 papers. 2. I strongly disagree with your description of the state of affairs: > When I began my academic career an author would be lucky to get > three scrawled sentences of review, on physical scraps of paper. > Nowadays authors get between three and six substantial, thoughtful > reviews. That is gold dust. I started with the same kind of paper reviews. I do not see much of the improvement you see. On some occasion, you get fantastic reviews (even for rejected papers). On many occasions, you get feedback from non-experts that is nearly random. I won't blame the committee members here: they are under time pressure, they have their own preferences, and they have the backgrounds they have. We are all weak, and we do what we can do. Over the past few years, I have collected informal statistics that basically suggests that submissions get about one expert review per submission but that may mean two for one submission and none for another. Yes, a good number of papers are rejected without knowledgeable review. The expectation with a two-phase review is this: -- At the first, physical meeting papers w/o expert reviews are discovered. They get to respond to their preliminary reviews and the PC will figure out how to get appropriate reviewers for these papers. No more 'over night, after dinner' expert reviews. -- Papers with a fixable weakness are sent back to authors so that they can demonstrate clearly how to overcome this weakness. Hopefully this will help get some less-finished ideas into the conference and turn the 'oral journal' that POPL currently is into a real conference again. 3. The two-tier proposal is a compromise that a dozen or so representative POPL community members have worked out. Like all compromises they don't make people 100% happy. I can only speak for myself; I am in the not-100% happy camp. But after discussing this issue for the entire fall, I believe that the (once again) suggested increase of acceptances and this proposal may get POPL moving in the right direction. I do consider it an experiment -- as I am sure others on the SC do, too -- that should be evaluated in a few years. If it moves in the wrong direction, we go back to the status quo or we try a different change. It it turns out to be an improvement, we can still try other modifications. -- Matthias From scd at doc.ic.ac.uk Tue Jan 12 04:28:04 2010 From: scd at doc.ic.ac.uk (Sophia Drossopoulou) Date: Tue, 12 Jan 2010 09:28:04 +0000 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> Message-ID: <3CC4AFA4-CDD7-433C-B90A-EECBF9E20846@doc.ic.ac.uk> It seems to me that the two phase reviewing proposal is meant to address the problem that PCs are over-conservative, and they reject quirky ideas, that are not so well worked out. If so, I have two questions: 1) We already have the shepherding mechanism for such cases: what will we achieve by enhancing it into the "two-phase" review? (BTW, Jan Vitek, as ECOOP PC chair, has strengthened shepherding, so that there was a "shepherd" who would communicate with the authors, and a "controller" would would give the final "go ahead" to the paper). 2) I suppose we all have some examples of quirky ideas that did not make it to a conference. What has happened afterwards? Did the authors give up, disheartened, or did they take the comments into account, improve the work, and get it accepted somewhere else? Also, so we think that such quirky but maybe flawed papers could be sufficiently improved over the restricted available time period? Sophia If I was asked to vote, I would be against the two-phase reviewing process, but then, I may very well be wring: I was initially against the rebuttal process, but then, when I saw it working, I was absolutely convinced. From coquand at chalmers.se Tue Jan 12 04:22:40 2010 From: coquand at chalmers.se (Thierry Coquand) Date: Tue, 12 Jan 2010 10:22:40 +0100 Subject: [TYPES/announce] 4 PhD positions in Formalization of Mathematics in Type Theory Message-ID: 4 PhD positions in Formalization of Mathematics in Type Theory We are looking for students with a strong interest in functional programming and mathematics for two projects in formalization of mathematics in type theory. Among the theme of research are: constructive representation of algebraic numbers (in particular applied to computations on algebraic curves), homological algebra, category theory in type theory, as well as metatheory of types systems. Three positions are funded by an ERC Advanced Grant from the European Union. One position is within a Strep Open, 7th framework, which involves, as other sites, INRIA, INRIA-microsoft, Nijmegen and La Roja. The monthly salary is around 2350 euros. For more informations see http://www.gu.se/omuniversitetet/ledigaanstallningar From martin.odersky at epfl.ch Tue Jan 12 04:50:46 2010 From: martin.odersky at epfl.ch (martin odersky) Date: Tue, 12 Jan 2010 10:50:46 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <3CC4AFA4-CDD7-433C-B90A-EECBF9E20846@doc.ic.ac.uk> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> <3CC4AFA4-CDD7-433C-B90A-EECBF9E20846@doc.ic.ac.uk> Message-ID: <9461d7d01001120150n6c528a9ft707bffa5e1c6ef58@mail.gmail.com> I am very much in favor of strongly encouraging the PC to increase the number of accepted papers. I'd tend to go to parallel sessions to accommodate the increased number of talks. In addition, I would start the conference off with a poster session where every accepted paper is presented. This would counter-balance the danger of fragmentation of the conference otherwise posed by parallel sessions. It would also help the attendees to pick the talks of interest to them. Cheers -- Martin From peterd at chalmers.se Tue Jan 12 05:01:45 2010 From: peterd at chalmers.se (Peter Dybjer) Date: Tue, 12 Jan 2010 11:01:45 +0100 Subject: [TYPES/announce] tenure track assistant professorships at Chalmers Message-ID: <994D40AD62B42647972DD232E960C85518A6D998@MAPI01.ita.chalmers.se> We invite theoretical computer scientists (with a PhD degree no more than 5 years old) to apply for two tenure-track assistant professorships in "basic science" at Chalmers University of Technology (deadline 1 February 2001): http://www.chalmers.se/en/sections/about_chalmers/advance/job-positions-in/positions/two-assistant-professors From dreyer at mpi-sws.org Tue Jan 12 05:14:56 2010 From: dreyer at mpi-sws.org (Derek Dreyer) Date: Tue, 12 Jan 2010 11:14:56 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> Message-ID: <7fa251b71001120214s9ff1439jc87ead6bf8c08129@mail.gmail.com> Hi, Matthias. Thanks for the clarification about the motivation behind the rather significant proposed change to the POPL review process. There seem to be three major concerns: (1) rejecting papers without at least one expert review, (2) rejecting papers just because of a (presumably fixable) weakness, and (3) rejecting papers because they are "quirky". Let's consider each in turn. 1. I completely understand the concern about papers receiving no expert reviews. This has happened to everyone on occasion, I'm sure. However, at least based on my (perhaps confused) understanding of the proposal at hand, I fail to see how it actually addresses that concern. Let's say I submit a paper to POPL and it gets no expert reviews. The PC discovers this at the PC meeting, and thus they can't make a serious decision and they return my paper "resubmit". Since I have not received an expert review, I get little serious feedback at this point, so I can't make any serious changes to my paper that would help reviewers understand it. In the meantime, the PC seeks out some external reviews. What is the point of this protracted process? The problem in this case is that the PC goofed up by not procuring an external expert review in time for the PC meeting. Why is the poor author punished by having to wait an extra 6 weeks to get an acceptance or rejection? A simpler solution, it seems to me, is for the PC chair (and if there are co-chairs, this will hopefully be easier) to make sure there are expert reviews for all papers, including at least one external expert review, preferably prior to the author response. 2. Regarding papers with a fixable weakness, I tend to agree with Sophia. Why is this not already handled by shepherding? Although I am not a big fan of shepherding, I think it is appropriate to use in the case that a paper contains clear technical flaws that seem easily fixable. Are there really that many papers that fall into this category that it's worth making such a big change to the POPL reviewing process? 3. Regarding "quirky" papers: I have always interpreted "quirky" to mean that some people think the paper is "really cool" and others think it's "not there yet" and/or "rubbish". Again, I agree with Sophia: I'm not sure how the new reviewing process is supposed to help make decisions about such papers. Generally, I think, with these sorts of papers, it's not necessarily the presentation of the work that's at fault; in fact, the offbeat presentation may be why some people like it. Rather, it's a question of whether the work is solid enough for POPL, and that's unlikely to be something that can be addressed in a 2-week revision period. *** To echo Simon and the others, I'm happy to see the POPL acceptance rate go up to 25-30%. If the policy is that we accept more good papers up to that acceptance rate, then I don't see what is difficult about implementing it. It is a simple fix, and does not affect the conference calendar. I am not in favor of a lottery for talks, but parallel sessions seem like a reasonable price to pay. Best regards, Derek On Tue, Jan 12, 2010 at 4:23 AM, Matthias Felleisen wrote: > [ The Types Forum (announcements only), > ? ? http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > > Simon and others, > > thanks for the feedback. While I am a member of the POPL SC until > January, this email is my personal opinion and is not to be > construed as something anyone else on the SC may subscribe to. > > > 1. I like the idea of accepting more papers. It is a part of > every year's SC discussion. And as you probably recall from your > chairman role, the SC is quite encouraging about accepting > more papers. I tried to get more papers into my POPL. This > year again the SC is encouraging the PC to broaden the > acceptance range. > > In my own experience, though, the PC tends to block attempts > to, say, double the number of papers. The idea is discussed, > potential papers are brought up, and eventually the faction > that disapproves of a larger program wears out those who are > on the 'more papers' side. > > If you wish to achieve this numeric enlargement, I am afraid > you will need to set a target number, say 60 papers. > > 2. I strongly disagree with your description of the state of > affairs: > >> When I began my academic career an author would be lucky to get >> ?three scrawled sentences of review, on physical scraps of paper. >> ?Nowadays authors get between three and six substantial, thoughtful >> ?reviews. ?That is gold dust. > > I started with the same kind of paper reviews. I do not see > much of the improvement you see. > > On some occasion, you get fantastic reviews (even for rejected > papers). > > On many occasions, you get feedback from non-experts that is > nearly random. I won't blame the committee members here: they > are under time pressure, they have their own preferences, > and they have the backgrounds they have. We are all weak, and > we do what we can do. > > Over the past few years, I have collected informal statistics > that basically suggests that submissions get about one expert > review per submission but that may mean two for one submission > and none for another. Yes, a good number of papers are rejected > without knowledgeable review. > > The expectation with a two-phase review is this: > > -- At the first, physical meeting papers w/o expert reviews > are discovered. They get to respond to their preliminary reviews > and the PC will figure out how to get appropriate reviewers > for these papers. No more 'over night, after dinner' > expert reviews. > > -- Papers with a fixable weakness are sent back to authors so > that they can demonstrate clearly how to overcome this weakness. > Hopefully this will help get some less-finished ideas > into the conference and turn the 'oral journal' that POPL currently > is into a real conference again. > > 3. The two-tier proposal is a compromise that a dozen or so > representative POPL community members have worked out. Like all > compromises they don't make people 100% happy. I can only speak > for myself; I am in the not-100% happy camp. > > But after discussing this issue for the entire fall, I believe that > the (once again) suggested increase of acceptances and this > proposal may get POPL moving in the right direction. I do consider it > an experiment -- as I am sure others on the SC do, too -- that should > be evaluated in a few years. If it moves in the wrong direction, > we go back to the status quo or we try a different change. > It it turns out to be an improvement, we can still try other > modifications. > > -- Matthias > > > > > > > > > From kapur at cs.unm.edu Tue Jan 12 07:38:45 2010 From: kapur at cs.unm.edu (Deepak Kapur) Date: Tue, 12 Jan 2010 05:38:45 -0700 Subject: [TYPES/announce] reviewing, conference presentations, conference vs journal publications Message-ID: <4B4C6D55.9040603@cs.unm.edu> I applaud the POPL SC for making a proposal to make reviewing fairer, which I support. I am also supportive of increasing the number of accepted papers. But that is not the reason for making my first post on this list. How about the seemingly radical idea of allowing almost all submissions/abstracts to be presented at prestigious CS conferences including POPL, a tradition that has been successfully practiced (I hope) by almost all other disciplines including physics, mathematics, economics, etc., but appears to be so foreign and unacceptable to most of us? Everything else ---- rebuttals, resubmissions, quality, quantity, and what not, can be left for journals, where of course, the reviewing process has to be expedited much like the conference reviewing for which we all are (perhaps reluctantly) willing to abide by deadlines. My 2 cents. Deepak From james.cheney at gmail.com Tue Jan 12 08:32:57 2010 From: james.cheney at gmail.com (James Cheney) Date: Tue, 12 Jan 2010 10:32:57 -0300 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <7fa251b71001120214s9ff1439jc87ead6bf8c08129@mail.gmail.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> <7fa251b71001120214s9ff1439jc87ead6bf8c08129@mail.gmail.com> Message-ID: <814253dd1001120532n24d993aq176f4b5874751c2c@mail.gmail.com> Hi, Quoting from the proposal: | * Other conferences are moving to a year-round refereeing process | closer to that used by journals; for instance VLDB is now linked to | a journal PVLDB. The two-phase proposal yields similar benefits, | while ensuring focus and a bound on effort. Though I don't have direct experience with the "journal track" of PVLDB, I have heard positive experiences from others and know some of the people who set it up. I think the above description is inaccurate and it's unclear that the POPL SC proposal has the claimed advantages. So I'd like to describe how the VLDB/PVLDB system currently works. At present, VLDB retains an ordinary conference organization. All papers accepted to VLDB are published in "Proceedings of VLDB", a journal, and all authors of such papers are given a slot to present. In addition, there is a "journal track": a paper can be submitted anytime during the year. It is supposed to be reviewed within a set period (similar to the time for conference review) with a hard decision after the second round - very similar to the 2-round proposal for POPL, but not anchored to the conference deadline. All accepted papers, whether submitted via the traditional conference review process or journal track, can be presented at the next suitable instance of the conference. (I believe for journal track papers this is optional). The PVLDB folks anticipate that other conferences might participate in the system, so eventually there might be a choice of venues for accepted journal-track papers. Also, all papers have the same length and are cited as journal papers in PVLDB. I believe both proposals have the properties that are claimed as advantages only for the POPL proposal: 1. the ordinary conference submission process is preserved, providing focused deadlines for the majority of papers (and authors who prefer deadlines and predictability) 2. the additional journal track provides reasonable bounds on PC member and external reviewer effort Indeed, the PVLDB process may be less effort for PC members, since the reviewing process for the conference track is unchanged. The additional effort is needed from journal track reviewers and editors, who are not necessarily PC members. On the other hand, the VLDB system was a response to a different problem: VLDB and other major DB conferences have already grown large (3-4 parallel research tracks, PCs with > 100 members) and the reviewing process is perceived as random; DB systems researchers have co-evolved with this system to submit many papers every year with lots of roll-over (of both good and bad papers). So I'm not claiming the VLDB approach is a solution to the problem identified here. I do think it avoids many of the problems Simon perceives with the proposed change, though. It also has the advantage that it's relatively incremental - instead of moving everyone's deadlines and giving the whole PC (potentially) more work, it is up to the author to decide whether to submit early via the journal track or through the traditional, more predictable conference process. --James -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100112/035d9233/attachment.htm From greg at eecs.harvard.edu Tue Jan 12 09:05:44 2010 From: greg at eecs.harvard.edu (Greg Morrisett) Date: Tue, 12 Jan 2010 09:05:44 -0500 Subject: [TYPES/announce] reviewing, conference presentations, conference vs journal publications In-Reply-To: <4B4C6D55.9040603@cs.unm.edu> References: <4B4C6D55.9040603@cs.unm.edu> Message-ID: <4B4C81B8.3080604@eecs.harvard.edu> Deepak Kapur wrote: > How about the seemingly radical idea of allowing almost all > submissions/abstracts to be presented at prestigious CS conferences > including POPL, a tradition that has been successfully practiced (I > hope) by almost all other disciplines including physics, mathematics, > economics, etc., but appears to be so foreign and unacceptable to most > of us? I was going to suggest something similar -- the next time you write a letter of recommendation for person X, just say that all of X's papers should've been accepted into POPL. That way, everyone will get a job with tenure! Or, we could just rename all SIGPLAN conferences and workshops to "POPL"! To distinguish them and make sure there's no bias in the title, we could just name them after the month they are in (POPL-Jan, POPL-Feb, etc.) Seriously, let me suggest that the community has already adapted to the "POPL does not admit enough papers" problem. Authors send their revised papers to the next conference (e.g., ICFP, OOPSLA, ESOP, SAS, VMCAI, etc.) This has helped to raise the quality of these other venues to the point where I'm seriously impressed by people who have papers in these settings. So what's happened is that the field has grown, there are more good papers, and so there are more good venues. IMHO, POPL retains such influence in part for historical reasons, and in part because there is still a quality gap. If there weren't, then someone who only has papers at ICFP or only OOPSLA wouldn't have trouble getting a position, compared to someone who has POPL papers. So again, I'm confused about what is broken and what we're trying to fix. -Greg From prakash at cs.mcgill.ca Tue Jan 12 09:18:25 2010 From: prakash at cs.mcgill.ca (Prakash Panangaden) Date: Tue, 12 Jan 2010 09:18:25 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <4B4C84B1.2070002@cs.mcgill.ca> Thanks to Simon Peyton-Jones for sharing his articulate and well-reasoned thoughts with us. I agree that there are too few papers accepted at the best conferences and that the problem is not quality of reviewing. I would like to push for the idea that we accept many more papers (perhaps double the present number) and present them at poster sessions and have them appear in the proceedings as is done at most of the big AI conferences. Then we could have a smaller number presented as conference presentations. The other point I would like to make is that we as reviewers are far too obsessed with polished but incremental papers and in the theory conferences (STOC/FOCS/LICS/ICALP) with "hard but boring" problems. It is indeed hard to change the culture, but conferences are where we should get the chance to throw out ideas rather than participate in a lek. Cheers Prakash From troina at di.unito.it Tue Jan 12 10:52:14 2010 From: troina at di.unito.it (Angelo Troina) Date: Tue, 12 Jan 2010 16:52:14 +0100 Subject: [TYPES/announce] CS2Bio'10 - First Call for Papers Message-ID: <4B4C9AAE.6010801@di.unito.it> ====================================================================== First call for papers CS2Bio'10 1st International Workshop on Interactions between Computer Science and Biology Affiliated to DisCoTec'10 10th of June 2010 Amsterdam, Netherlands http://cs2bio10.di.unito.it/ ====================================================================== Systems Biology is a stimulating field of application for computer scientists and a promising resource for biologists. The scope of this workshop is to gather researchers in formal methods that are interested at the convergence between Computer Science with Biology and life sciences. In particular, we solicit contribution of original results that address on both theoretical (modelling, analysis, and validation techniques) and applied aspects of biological behaviour: from the representation of biological scenarios to the validation and testing of relevant biological properties and the related simulations and development tools. *** SCOPE *** The scope is to include theoretical and applied aspects of concurrent and distributed systems in the modelling, analysis, simulation and validation of biological properties. The workshop intends to attract researchers interested in models, verification, tools, and programming primitives concerning such complex interactions. We strongly encourage the submission of works carried on in collaboration between computer scientists and biologists. Topics of interest include, but shall not be limited to: Formal Biological Modelling: - Formal methods for the representation of biological systems (rewrite systems, process calculi, graph grammars, hybrid systems, etc.); - Theoretical links and comparisons between different formal models for the modelling of biological processes; - Quantitative (probabilistic, timed, stochastic, etc.) languages and calculi; - Spatial (geometrical, topological) languages and calculi. Formal Testing and Validation of Biological Properties: - Prediction of biological behaviour from incomplete information; - Model Checking, Abstract Interpretation, Type Systems, etc. Tools and Simulations: - Modelling, analysis and simulation tools for systems biology; - Emergence of properties in complex biological systems; - Tools for parallel, distributed, and multi-resolution simulation methods; - Detailed biological case-studies. *** INVITED SPEAKERS *** - J?r?me Feret (INRIA and ?cole Normale Sup?rieure - Paris, France) - TBA *** SUBMISSION GUIDELINES *** Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Authors should submit their papers via EasyChair (http://www.easychair.org/conferences/?conf=cs2bio10). Papers should take the form of a pdf file in ENTCS style and should not exceed 12 pages. If necessary, detailed proofs or other additional material can be added in an appendix (referees might review it at their discretion). We also encourage the submission of short papers, limited to 7 pages, presenting new tools or platforms for the modelling of biological systems. *** DISSEMINATION *** The post-proceedings of the workshop will be published in a volume of the Electronic Notes on Theoretical Computer Science series (Elsevier ENTCS). If the quality of the received papers deserves it, the publication in a special issue of Mathematical Structures in Computer Science, with a second round of reviews, could be considered. *** IMPORTANT DATES *** - Submission deadline: 19 March 2010 - Reviews due: 23 April 2010 - Notification to authors: 30 April 2010 - Workshop: 10 June 2010 *** PROGRAM COMMITTEE *** - Luca Cardelli - Gabriel Ciobanu - Mario Coppo - Ferruccio Damiani - Vincent Danos - Erik de Vink - Mariangiola Dezani - Fran?ois Fages - J?r?me Feret - Walter Fontana - Russ Harmer - Jane Hillston - Giancarlo Mauri - Emanuela Merelli - Paolo Milazzo - Gethin Norman - Ion Petre - Verena Wolf - Gianluigi Zavattaro *** ORGANISERS *** - Jean Krivine - Angelo Troina From andru at cs.cornell.edu Tue Jan 12 10:57:33 2010 From: andru at cs.cornell.edu (Andrew Myers) Date: Tue, 12 Jan 2010 10:57:33 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> Message-ID: <4B4C9BED.6020209@cs.cornell.edu> The current two-phase proposal sounds to me as if it will significantly increase the amount of reviewing work without significantly increasing the quality of the reviewing process, for the reasons Derek has argued. Why not look at the approaches other communities have taken? Several major conferences in the networking, systems and security communities have changed to a different two- or three-phase reviewing process in which papers are rejected early in the process if they have enough confident negative reviews. Only the best papers and papers with low confidence continue on. I've seen this both as a PC member and as a PC chair, and in my experience, it's great. The reviewing load is increased only slightly, and both the quality of the reviews and the quality of the decision process is improved. It's also more fun and educational to be a PC member, because the average quality of the papers you review is higher. And the accepted papers get more reviews, which also improves the product. I believe Tom Anderson first introduced this idea for SIGCOMM 2006; I have more detailed notes on how this worked for IEEE Security and Privacy (Oakland) 2009. Cheers, -- Andrew From mairson at brandeis.edu Tue Jan 12 11:30:06 2010 From: mairson at brandeis.edu (Harry Mairson) Date: Tue, 12 Jan 2010 11:30:06 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <5458EABA-1958-4F79-B9F6-5C209901D64F@brandeis.edu> 1. Regarding the proposal of Simon Peyton-Jones to choose papers randomly from a list of papers judged worthy by a program committee: Last year I was talking to a college president in the Boston area (not mine) who told me exactly the same thing about prospective freshmen---the university should just select those who are above threshold, and then choose randomly. College admission is an increasingly crazy business in the US. And for sheer size, it's a bigger problem than POPL. Similarly, a close colleague of mine at another institution said to me about faculty searches: once the list gets down to 10 or 15 for a single position, it's a game of chance, even though there nominally continues to be a rational process. What Simon is suggesting is that we just put up front the meritocratically random endgame that we may already have. 2. Regarding the proposed increase in number accepted papers: I fully understand and appreciate the rationale, especially as it relates to tenure and promotion. The acceptance of a paper at POPL (among other conferences) is a valued achievement in those decisions, significant to institutions and crucial to individuals. In what way is the needed achievement devalued when the number of accepted papers is increased? Will promotion committees say, "That's a POPL paper from 201x, when they increased the size of the conference, and is not as significant as papers from 200x"? That likely analysis suggests that the number of accepted papers be increased slowly---doubling is probably not a good idea. Recognize that people on committees count because they do not understand. I ran a promotion committee (for someone outside CS) where I began the meeting by saying to its members (also outside the field), "What did this person do? Maybe we should try talking about that first." The discussion was a bit awkward---we all sounded like freshmen. As long as there is a nominally meritocratic process for tenure and promotion, it will involve scaling some sort of pyramid. The scaling and selectivity is what has defined the success: these conferences, grants, editorships, etc. It may be that we have created, instead, an obelisk. Are senior researchers who publish serially in these conferences conferring the value, or unduly increasing the pyramid's slope? What's needed is moderation. 3. Regarding the two-tier review process and the quality of reviews: I agree with Matthias Felleisen---I've not seen much of Simon's "gold dust". The quality of mercy is not strain'd, but the quality of reviewing is not improv'd. We've all received (and probably written...) reviews where we immediately recognize, "they didn't get it", and we all know the boilerplate that comprises these reviews. (I've found myself wishing that these reviews simply said, instead, "I didn't understand it and I didn't like it and I'm not interested.") The best critical reviews I've received are from colleagues who were trying to solve the same problems I was working on. Getting boxed by people who know their stuff is an educational experience in itself. When the solution of such challenging problems is a prize, then the local experts weigh in, sometimes even grudgingly, with their careful assessments---almost like sociologists of science---with their precise knowledge of what qualifies as a solution, what's winning, what's losing, what's cheating, and what's the canonical toy problem that needs solving to demonstrate that the solution is the right one. They really know (and sometimes covet) those square centimeters of the intellectual territory---most reviewers don't. The best compliment I've given colleagues is, "I wish I'd done that---and I tried." Harry Mairson -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100112/96ba9868/attachment.htm From scd at doc.ic.ac.uk Tue Jan 12 12:17:06 2010 From: scd at doc.ic.ac.uk (Sophia Drossopoulou) Date: Tue, 12 Jan 2010 17:17:06 +0000 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <9461d7d01001120150n6c528a9ft707bffa5e1c6ef58@mail.gmail.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> <3CC4AFA4-CDD7-433C-B90A-EECBF9E20846@doc.ic.ac.uk> <9461d7d01001120150n6c528a9ft707bffa5e1c6ef58@mail.gmail.com> Message-ID: On 12 Jan 2010, at 09:50, martin odersky wrote: > .... I would start > the conference off with a poster session where every accepted paper is > presented. I think this is a great idea, and should be adopted irrespective of whether we adopt parallel sessions, and/or increase the number of papers accepted. Sophia From wand at ccs.neu.edu Tue Jan 12 12:23:50 2010 From: wand at ccs.neu.edu (Mitchell Wand) Date: Tue, 12 Jan 2010 12:23:50 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <4B4C84B1.2070002@cs.mcgill.ca> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <4B4C84B1.2070002@cs.mcgill.ca> Message-ID: <1bd18ad51001120923g2f301d25r590ae7a848022a8f@mail.gmail.com> "lek"-- what a wonderful word! Thank you, Prakash, for bringing it to our attention. Now on to more serious comments: I agree with most of the commenters here that the POPL proposal goes in the wrong direction. The fact that conference acceptances is so stochastic leads to a variety of bad outcomes: 1. People submit more papers. Some of these papers are recycled rejections looking for a different PC. Sometimes the comments of the first PC improve the paper for the second go-round, but my impression is that this is the exception. I suspect that the low acceptance rates lead to finer bologna-slicing, though I don't have any data to back this up. NSF observed this phenomenon when their acceptance rates got too low. (Their solution was draconian: only have a call for proposals every other year, and restrict PIs to one submission per competition. Not desirable.) 2. There is inversion of quality. I recall when PPDP was co-located with ICFP that some people would send their better papers to PPDP rather than risk rejection at ICFP. 3. There are second-order effects: For example, we require our PhD students to get an accepted paper as part of our qualifying process. We've seen perfectly good papers rejected multiple times, and we've had to create a whole structure to work around this bug. Predictable conference acceptances would avoid this problem. People on this thread have already mentioned this problem with respect to hiring. For tenure and promotion, it is probably diminished due to the longer time frame, but I'd bet it's still there. I believe that we need to get our acceptance ratio up to about 40%. I think this would drastically increase the predictability of the process. >From my time on POPL and ICFP PC's I suspect that we could reach this goal without substantial loss of quality. 1. I now think that having parallel tracks is a good idea. I used to think otherwise, but I have found it exciting to bounce around, as we do on workshop days, from one workshop to another. It also leads me to interact with more sub-communities than I would otherwise. 2. I remain dubious about poster sessions. These make it difficult for presenters to see others' presentations. It's also harder to tune out when a presentation turns out not to be of interest-- it's hard to walk away. 3. I would support a system of multiple durations, in which the PC would assign different-length time slots to different papers based on perceived quality of work, likely interest in the presentation, etc. If we adopt such a system, however, it is important that all accepted papers receive the same allocation of pages in the printed proceedings. 4. Getting good reviews is a problem, but this is a separate problem and should be dealt with separately. I suspect that the quality of the reviews is less of a problem at a 40% acceptance ratio than it is at 20%: a poor-quality review is less likely to sway the outcome. What would happen if we announced that we were doubling the number of accepted papers to POPL? In the first year, at least, I suspect that we would get many more submissions than in the past. (I'd therefore publicly state the goal in terms of number of acceptances, not in terms of acceptance ratio). Other conferences, eg ICFP and PLDI, might be forced to follow suit in order to keep their submission levels up. So we might be initiating a virtuous cycle, in which the number of good papers and the number of slots in conferences were more in balance. The additional submissions would be something of a burden to the PC committee, but probably many of the "extra" submissions would be of poor quality, and would not require much effort. I hope these thoughts are useful. --Mitch On Tue, Jan 12, 2010 at 9:18 AM, Prakash Panangaden wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > Thanks to Simon Peyton-Jones for sharing his articulate and > well-reasoned thoughts with us. I agree that there are too few papers > accepted at the best conferences and that the problem is not quality of > reviewing. I would like to push for the idea that we accept many more > papers (perhaps double the present number) and present them at poster > sessions and have them appear in the proceedings as is done at most of > the big AI conferences. Then we could have a smaller number presented > as conference presentations. The other point I would like to make is > that we as reviewers are far too obsessed with polished but incremental > papers and in the theory conferences (STOC/FOCS/LICS/ICALP) with "hard > but boring" problems. It is indeed hard to change the culture, but > conferences are where we should get the chance to throw out ideas rather > than participate in a lek. > Cheers > Prakash > > > -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100112/611d88d0/attachment-0001.htm From mislove at tulane.edu Tue Jan 12 14:22:41 2010 From: mislove at tulane.edu (Michael Mislove) Date: Tue, 12 Jan 2010 13:22:41 -0600 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <4B4C84B1.2070002@cs.mcgill.ca> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <4B4C84B1.2070002@cs.mcgill.ca> Message-ID: <2e0980f31001121122s3866a338k9f1f21d2027a8189@mail.gmail.com> Along the lines of Prakash's comments, I'd like to offer a different proposal. I take as a starting point the "conventional wisdom" that the papers accepted at the leading conferences are not the 40 best papers, but perhaps 40 of the best 80 papers. No reviewing process is perfect and most select some proportion of the best submissions. I don't have confidence that changing the reviewing process will cure this - it's inherent in any subjective process that "human factors" will affect the outcome. This can range from personal preferences of PC members and their referees to biases reflected in the composition of the PC. Given this disparity, the number of papers accepted could be increased by holding poster sessions, as Prakash suggests, but I have concerns about the effectiveness of such a venue for communicating new results even to those who may be interested in them. I also believe poster session papers would not receive the same regard in promotions and tenure considerations those selected for full presentation at the meeting. I believe a better approach would be to make better use of the satellite workshops around the main conference. I suggest that an effort be made to see what proportion of the papers in these workshops were originally submitted to POPL itself. If most of the 40 "best 80" papers that were not accepted at POPL find their way into these workshops, then I would assert the real problem - if there is one - is the disparity between the quality of POPL versus that of its workshops. I'm not as familiar with POPL as I am with other series, but I'd point out that the mega conference ETAPS has a large number of satellite events, some of which are regarded as being of a quality rivaling that of the main conferences. If the same is true of POPL and if there are enough satellite workshops to accommodate the overflow from POPL, then perhaps there is no problem. If this is not the case, then POPL could found some new satellite workshops, directly sanctioned and bearing its imprimatur, and work to make sure their quality rivals that of the main meeting. It remains to determine whether papers submitted to POPL but not accepted actually ended up in one of the satellite events. A first estimate could be obtained by having the PC chair (or an interested PC member) simply look at the accepted papers for the satellite events and see how many of the top 80 submissions that were not accepted for POPL found their way onto the program of one of the workshops. This wouldn't tell the whole story (some papers that were rated highly but not accepted for POPL might have been found wanting by a satellite event, and others might not have had an appropriate venue among the satellites), but it could give some information about how many papers submitted to POPL actually were orphans. In any case, I think making better use of the satellite events would result in a better outcome than tweaking the reviewing process or expanding the number of papers accepted only to relegate the additional papers to posters at the main meeting. Best regards, Mike Mislove On Tue, Jan 12, 2010 at 8:18 AM, Prakash Panangaden wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > Thanks to Simon Peyton-Jones for sharing his articulate and > well-reasoned thoughts with us. I agree that there are too few papers > accepted at the best conferences and that the problem is not quality of > reviewing. I would like to push for the idea that we accept many more > papers (perhaps double the present number) and present them at poster > sessions and have them appear in the proceedings as is done at most of > the big AI conferences. Then we could have a smaller number presented > as conference presentations. The other point I would like to make is > that we as reviewers are far too obsessed with polished but incremental > papers and in the theory conferences (STOC/FOCS/LICS/ICALP) with "hard > but boring" problems. It is indeed hard to change the culture, but > conferences are where we should get the chance to throw out ideas rather > than participate in a lek. > Cheers > Prakash > > -- =============================================== Professor Michael Mislove Phone: +1 504 862-3441 Department of Mathematics FAX: +1 504 865-5063 Tulane University URL: http://www.math.tulane.edu/~mwm New Orleans, LA 70118 USA =============================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100112/39099535/attachment.htm From Manuela.Bujorianu at manchester.ac.uk Tue Jan 12 15:42:03 2010 From: Manuela.Bujorianu at manchester.ac.uk (Manuela Bujorianu) Date: Tue, 12 Jan 2010 20:42:03 +0000 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <4B4C84B1.2070002@cs.mcgill.ca> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <4B4C84B1.2070002@cs.mcgill.ca> Message-ID: <20100112204203.67214yky8pc21k7v@webmail.manchester.ac.uk> > I would like to push for the idea that we accept many more > papers (perhaps double the present number) and present them at poster > sessions and have them appear in the proceedings as is done at most of > the big AI conferences. I would like to complete this with the practise of submission acceptance at control engineering conferences: 40% acceptance rate for the soundness of reviewing process and parallel sessions plus interactive presentations (i.e. posters) to accommodate all accepted papers. > The other point I would like to make is > that we as reviewers are far too obsessed with polished but incremental > papers and in the theory conferences (STOC/FOCS/LICS/ICALP) with "hard > but boring" problems. Perhaps it will be worthy to remember at this point the practise at conferences in mathematics: no reviewing, abstract publication only - people meet to socialise and team up for writing journal articles. Apologies for intruding, I never attended POPL! With best seasonal wishes, Manuela From nr at cs.tufts.edu Tue Jan 12 20:03:11 2010 From: nr at cs.tufts.edu (Norman Ramsey) Date: Tue, 12 Jan 2010 20:03:11 -0500 Subject: [TYPES/announce] Request for comments: Two-phase reviewing for POPL In-Reply-To: <1995.121.246.189.113.1262793757.squirrel@mail.cse.psu.edu> (sfid-c-20100106-113704-+12.79-1@multi.osbf.lua) References: <1995.121.246.189.113.1262793757.squirrel@mail.cse.psu.edu> (sfid-c-20100106-113704-+12.79-1@multi.osbf.lua) Message-ID: <20100113010311.9FA5C60A26C77@labrador.cs.tufts.edu> > Request for comments: Two-phase reviewing for POPL > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ > > ... no decision process is perfect.... The POPL Steering Committee > has formulated the following proposal, which ... aims to improve > the decision process for POPL. I have followed the discussion on the types mailing list with much interest. I am afraid I am still having problems understanding what the POPL Steering Committee believes will be improved: - Will a different set of papers be accepted? Do we expect this will be a better set than is accepted by the current process? - Will reviews be improved? The proposal seems quite costly, but I would not wish to comment on the costs without better understanding the perceived benefits. Could a member of the steering committee perhaps elaborate on what problem or problems this proposal is intended to solve? Norman From riccardo at ccs.neu.edu Tue Jan 12 22:08:28 2010 From: riccardo at ccs.neu.edu (Riccardo Pucella) Date: Tue, 12 Jan 2010 22:08:28 -0500 (EST) Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <2e0980f31001121122s3866a338k9f1f21d2027a8189@mail.gmail.com> Message-ID: <4916024.65521263352108687.JavaMail.root@zimbra> A quick 2 cents on one of Mike Mislove's comments: > Given this disparity, the number of papers accepted could be increased > by holding poster sessions, as Prakash suggests, but I have concerns > about the effectiveness of such a venue for communicating new results > even to those who may be interested in them. I also believe poster > session papers would not receive the same regard in promotions and > tenure considerations those selected for full presentation at the > meeting. My experience with poster papers is mainly from AI conferences. There, there is no distinction between poster papers and presented papers: same number of pages in the proceedings (8,10,whatever), and no indication in the proceedings which papers were posters and which were presented. The poster/presented distinction is purely in terms of which papers get talks, and which get, well, posters. The choice of which is mostly done using a "what would make the most interesting talk" type of question, as opposed to "what's the most important result?" Cheers, Riccardo From Lists at Alessio.Guglielmi.name Wed Jan 13 02:18:27 2010 From: Lists at Alessio.Guglielmi.name (Alessio Guglielmi) Date: Wed, 13 Jan 2010 08:18:27 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response Message-ID: <20100113071830.9607414CD93@janeway.inf.tu-dresden.de> Hello, At 09:18 -0500 12/1/10, Prakash Panangaden wrote: >It is indeed hard to change the culture, but >conferences are where we should get the chance to throw out ideas rather >than participate in a lek. Precisely: the key word is IDEAS, not papers. The hiring and tenure committees should look for, and perhaps count, IDEAS, not papers, especially if at conferences. And the conferences should serve the purpose of disseminating new ideas, not of distributing medals. There are so many `papers' produced, that, right now, in computer `science', not even the authors read their own work. Thanks to cut & paste we have now a ratio of reads/writes < 1. Ciao, -Alessio From dreyer at mpi-sws.org Wed Jan 13 05:55:26 2010 From: dreyer at mpi-sws.org (Derek Dreyer) Date: Wed, 13 Jan 2010 11:55:26 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <20100113071830.9607414CD93@janeway.inf.tu-dresden.de> References: <20100113071830.9607414CD93@janeway.inf.tu-dresden.de> Message-ID: <7fa251b71001130255h2261c89cp41f4215e56328243@mail.gmail.com> > Precisely: the key word is IDEAS, not papers. > > The hiring and tenure committees should look for, and perhaps count, > IDEAS, not papers, especially if at conferences. And the conferences > should serve the purpose of disseminating new ideas, not of > distributing medals. Given that there have been several posts with something approaching this sentiment, I would like to respectfully, and strongly, disagree. POPL and other top conferences have been a place where many great *ideas* in programming languages have been first set forth. Yes, there are definitely ways it can be improved---we can accept a larger set of good papers, and we can ensure all papers are reviewed by experts---but *fundamentally* the current system seems to me to work amazingly well. Conference papers are one of *the most effective* ways of transmitting ideas that I know. Their limited size forces the author(s) to be concise, but at least in the case of POPL the size is large enough that one has space to convey a significant contribution, with only some of the technical details left to a tech report. And the serious, *selective* peer review forces authors to communicate their ideas clearly. Furthermore, conferences' regular frequency and deadlines ensure that the ideas presented in conferences are often *not* in their final stages of fruition. They are not the final "polished" word on subject X, but a well-explained intermediate result, which may prove to be an important stepping stone to future results. That is why a good conference paper will clearly explain its limitations and suggest ways of improving the results in future work. So this claim that conference emphasize boring, polished papers over good, novel ideas is rather mind-boggling to me. It is true that conferences do favor good ideas that are well-explained and can be justified in the short term over good ideas that are somewhat sketchy or can only be justified in the long term. But this is a systemic problem with research in general---i.e. nearly everything about the "academic-industrial complex" favors concrete, short-term research over fuzzy, long-term research---and turning conferences into free-for-alls will not solve it. Of course, journals provide an important, complementary, archival role, but journal articles are not a good way of disseminating ideas quickly. They cannot scale to handle the number of submissions that conferences handle, and journal articles give more information about a piece of work than most people need to know in order to understand the main ideas. Journals do not replace conferences or vice versa. So I agree with Harry Mairson that, while change may be in order, what's needed is moderation. > There are so many `papers' produced, that, right now, in computer > `science', not even the authors read their own work. Thanks to cut & > paste we have now a ratio of reads/writes < 1. I don't know what you're talking about: I read way more papers than I write, and I read way more conference papers than journal articles in a given year, often because I am asked to review them! Most of what I learn about new ideas in PL is from reading conference papers. Best, Derek From wadler at inf.ed.ac.uk Wed Jan 13 14:25:03 2010 From: wadler at inf.ed.ac.uk (Philip Wadler) Date: Wed, 13 Jan 2010 19:25:03 +0000 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: Many thanks to Simon and everyone else who has posted in this thread for their thoughtful comments. The POPL Steering Committee has considered whether to increase the number of papers accepted, and indeed there is slow growth in the numbers accepted. The two-phase proposal is largely orthogonal to this. I initiated discussion in the POPL Steering Committee, and now the wider community, because after serving as program chair for POPL 2008, I felt that the system was carrying more weight than it could bear. We all know that refereeing is rough and ready, and decisions are not perfect. But my experience in 2008 suggested that under the increasing level of submissions that the quality of decisions was going down, while their impact on tenure and careers was going up. Anyone who's sat in a pc meeting knows there will be papers where expert reviews are lacking, and someone volunteers to read the paper overnight and provide an opinion. They will also know that innovative papers often have flaws, and the dynamics of pc meetings is that the detractors usually win out over the champions. These are the issues that two-phase reviewing is intended to address. That said, if the sense of the POPL community is similar to the sense expressed by the Types readership to date, I doubt the two-phase proposal will be adopted. If you want two-phase, speak up. If you want something else, please contact a member of the POPL Steering Committee and work with them to formulate an alternative proposal. It would be great to have a number of constructive alternatives to consider at the community meeting next week. Yours, -- P REMINDERS, FOR YOUR INFORMATION: POPL community meeting: 5:15-6:30pm Wednesday 20 January 2010. POPL Steering Committee: * Philip Wadler, current SIGPLAN Chair and 2008 Program Chair * Kathleen Fisher, past SIGPLAN Chair * Graham Hutton, current SIGPLAN Vice Chair * Chandra Krintz, past SIGPLAN Vice Chair * Thomas Ball, 2011 General Chair * Mooly Sagiv, 2011 Program Chair * Manuel Hermenegildo, 2010 General Chair * Jens Palsberg, 2010 Program Chair * Zhong Shao, 2009 General Chair * Benjamin Pierce, 2009 Program Chair * George Necula, 2008 General Chair * Martin Hofman, 2007 General Chair * Matthias Felleisen, 2007 Program Chair -- .\ Philip Wadler, Professor of Theoretical Computer Science ./\ School of Informatics, University of Edinburgh / \ http://homepages.inf.ed.ac.uk/wadler/ The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From rwh at cs.cmu.edu Wed Jan 13 16:14:38 2010 From: rwh at cs.cmu.edu (Robert Harper) Date: Wed, 13 Jan 2010 16:14:38 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <7fa251b71001130255h2261c89cp41f4215e56328243@mail.gmail.com> References: <20100113071830.9607414CD93@janeway.inf.tu-dresden.de> <7fa251b71001130255h2261c89cp41f4215e56328243@mail.gmail.com> Message-ID: <2587037B-04D8-489F-AEC0-842D08B19CBB@cs.cmu.edu> After reading many of the thoughtful responses, I thought it might be worthwhile to add a few further remarks: 1. Mostly, I am against the ever-increasing officiousness of the conference reviewing process: double-blind reviews, author response period, two-stage review process, absurd conflict of interest rules, program committee make-up restrictions, etc, etc, etc. It's all totally unnecessary and in many cases counterproductive. For example, the outlandish conflict of interest rules have ensured in many cases that no competent person can review a submission, because anyone with any expertise may well have had a beer with the author within the last fifteen years (or whatever the current rule may be). 2. I am somewhat sympathetic to the idea that it may make sense to expand the number of papers presented at the top conferences. Here I find Mike Mislove's proposal most persuasive (in fact, we're already doing this to some extent). Why not hold a Federated Programming Languages Conference in which we, at least on occasion and perhaps regularly, seek to consolidate as many meetings in the PL area as we can to encourage publication and attendance? 3. The tenure and promotion process is always a vexed issue because the fact is that the decision is pretty much invariably made in a state of ignorance by most of those involved. We rely heavily on letters of reference, and letter writers back up their claims about a candidate by pointing to publications in venues like POPL. This process is imperfect, but it's not as though there's a better one just waiting to be adopted. Meanwhile, why should POPL neuter itself as playing a decisive role in determining the direction of the field? It will be determined _somehow_ by a process that is surely to be imperfect; I don't see that relyng on publication at POPL as an all- that-terrible a way to do things. Bob From mwh at cs.umd.edu Wed Jan 13 18:47:38 2010 From: mwh at cs.umd.edu (Michael Hicks) Date: Wed, 13 Jan 2010 17:47:38 -0600 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <4B4C9BED.6020209@cs.cornell.edu> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> <4B4C9BED.6020209@cs.cornell.edu> Message-ID: It seems like a common desire in the many interesting responses so far is to increase the effectiveness of the review process, to accept deserving papers, and to provide good feedback to papers that need a bit more work. I'd just like to add my voice to Andrew's (below) that tiered reviewing works well toward achieving these goals, somewhat to my surprise. The multiple phases of review increases the chances of obtaining expert reviews. The filtering in the early phases ensures that interesting, but not universally-acceptable papers get more reviews, which improves the quality of feedback. I was a bit worried that early-phase filtering might unfairly remove papers from the process, but I don't believe that has ever happened on the PCs I've been on; i.e., even a fairly conservative criterion for eliminating papers from further consideration (e.g., the first two reviews are both 'D') worked very well. I'm sure Andrew can provide more stats on this, for those interested. Also, I've found the PLDI and ISMM "review committee" approach to expanding the review pool to work pretty well, but I have no general stats on that. -Mike On Jan 12, 2010, at 9:57 AM, Andrew Myers wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > The current two-phase proposal sounds to me as if it will > significantly > increase the amount of reviewing work without significantly increasing > the quality of the reviewing process, for the reasons Derek has > argued. > > Why not look at the approaches other communities have taken? Several > major conferences in the networking, systems and security communities > have changed to a different two- or three-phase reviewing process in > which papers are rejected early in the process if they have enough > confident negative reviews. Only the best papers and papers with low > confidence continue on. I've seen this both as a PC member and as a PC > chair, and in my experience, it's great. The reviewing load is > increased > only slightly, and both the quality of the reviews and the quality of > the decision process is improved. It's also more fun and educational > to > be a PC member, because the average quality of the papers you review > is > higher. And the accepted papers get more reviews, which also improves > the product. > > I believe Tom Anderson first introduced this idea for SIGCOMM 2006; I > have more detailed notes on how this worked for IEEE Security and > Privacy (Oakland) 2009. > > Cheers, > > -- Andrew From andrews at csd.uwo.ca Wed Jan 13 19:16:31 2010 From: andrews at csd.uwo.ca (Jamie Andrews) Date: Wed, 13 Jan 2010 19:16:31 -0500 (EST) Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <2e0980f31001121122s3866a338k9f1f21d2027a8189@mail.gmail.com> Message-ID: A data point from another area that I do research in... The Automated Software Engineering conference (ASE) gets submissions in the form of 10-page papers, and accepts them as either "long papers" or "short papers". Long papers get 10 pages in the conference proceedings, and a 25-minute talk at the conference. Short papers get 4 pages in the proceedings, no talk, and a poster at a poster session. ASE has the poster session in a clean well-lighted place, in a prominent spot in the schedule, with no other parallel session going on, so that poster presenters get the most out of the discussions around their posters. I have had papers accepted there as either long or short papers. I am disappointed when a paper is accepted as short, because it does mean it was not as well loved as the long papers. On the other hand, I have had good discussions at the poster sessions. A 10-minute discussion in front of a large, detailed poster beats a 5-minute Q&A after a talk, or a 20-minute discussion over lunch with only napkins to write on. The paper shows up on my resume as a 4-page paper at a conference, which is what it is, not stigmatized by a label like "poster". I'm not saying it's perfect (e.g., there is endless debate in the PC about what should be accepted as short and what as long). However, it seems to work pretty well and gets more people involved than is possible when every accepted paper corresponds to a 25-minute talk in a session. cheers --Jamie. From dpw at CS.Princeton.EDU Wed Jan 13 22:49:01 2010 From: dpw at CS.Princeton.EDU (David Walker) Date: Wed, 13 Jan 2010 22:49:01 -0500 (EST) Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <1833250288.827901263440858933.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> Message-ID: <453356116.827921263440941577.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> > Anyone who's sat in a pc meeting knows there will be papers > where expert reviews are lacking, and someone volunteers to > read the paper overnight and provide an opinion. -- I think this could be solved by requiring reviews be due 1 week (or 2 weeks) before the meeting. At that point, the PC could identify those papers with low quality reviews and solicit another one or two from experts. This minor deviation from current practice would seem to be a direct solution to the stated problem. -- Another solution: Don't have double-blind reviewing. Double-blind reviewing requires going through the PC chair to get external reviews, which disincentivizes getting these reviews even when you aren't an expert yourself. -- Another solution: Expand the PC and/or have a greater percentage of the reviews be from external reviewers. The goal would be to reduce the number of papers each PC member reviews. My current experience with PLDI suggests I have a fixed total amount of time & energy for reviewing regardless of how many papers I have to review. If I had to review 15-20 papers instead of 25, my 15-20 reviews would be better than the 25. I also wonder, if there was 2-phase reviewing, whether my first phase reviews may be worse, because I have to save time and energy for the second phase. Or alternatively, I wonder if might be too burned out by the first phase to do anything useful for the second phase. > They will > also know that innovative papers often have flaws, and the > dynamics of pc meetings is that the detractors usually win > out over the champions. These are the issues that two-phase > reviewing is intended to address. -- Will more rounds of reviewing or more in-depth reviewing flip the dynamic so that champions win over detractors? If somebody wants to trash a paper, they can. With more effort invested, they can generally find more holes to poke in the work. I'm skeptical the proposed scheme will help solve this problem. -------------- Two other comments: -- I would massively disagree with any proposal in which some papers are not presented or there is disproportionate talk time given to certain papers, especially based on voting. Who would ever vote to have a student you have never heard of give a talk over Simon Peyton Jones? No one. I'd be voting for Simon every single time without even bothering to look at the paper! And imagine your student has one great result and one great POPL paper and a coin flip means they don't get to present. I could easily see this leading to the student missing out on getting interviews. -- If you want to change journal/conference culture, let's not change POPL or PLDI. Let's change TOPLAS instead: have TOPLAS papers accepted that year presented at POPL or PLDI or ICFP or OOPSLAA to attract attention to them. Dave From dreyer at mpi-sws.org Thu Jan 14 03:33:06 2010 From: dreyer at mpi-sws.org (Derek Dreyer) Date: Thu, 14 Jan 2010 09:33:06 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <453356116.827921263440941577.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> References: <1833250288.827901263440858933.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> <453356116.827921263440941577.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> Message-ID: <7fa251b71001140033o5d8e809bu934584d00672abc7@mail.gmail.com> >> Anyone who's sat in a pc meeting knows there will be papers >> where expert reviews are lacking, and someone volunteers to >> read the paper overnight and provide an opinion. > > -- I think this could be solved by requiring reviews be due > 1 week (or 2 weeks) before the meeting. ?At that point, > the PC could identify those papers with low quality reviews and > solicit another one or two from experts. ?This minor deviation > from current practice would seem to be a direct solution to > the stated problem. In fact, this *is* the current practice, at least for POPL. In the past few years, the author response period has occurred a full week before the PC meeting, and I know for a fact that a number of expert reviews have been requested during that period. Moreover, for POPL 2011, the PC is planning an even longer period of 2 weeks between the author response period and the physical PC meeting, precisely in order to allow sufficient time to identify and debate contentious and/or inadequately-reviewed papers online, and to seek further expert reviews for them. Regarding all of Dave's other comments, I agree with them 100%. Derek > -- Another solution: ?Don't have double-blind reviewing. ?Double-blind > reviewing requires going through the PC chair to get external reviews, > which disincentivizes getting these reviews even when you aren't an > expert yourself. > > -- Another solution: ?Expand the PC and/or have a greater percentage of the > reviews be from external reviewers. ?The goal would be to reduce the number > of papers each PC member reviews. ?My current experience with PLDI suggests > I have a fixed total amount of time & energy for reviewing regardless of how > many papers I have to review. ?If I had to review 15-20 papers instead of 25, > my 15-20 reviews would be better than the 25. ?I also wonder, if there > was 2-phase reviewing, whether my first phase reviews may be worse, because I have > to save time and energy for the second phase. ?Or alternatively, I wonder if > might be too burned out by the first phase to do anything useful for the > second phase. > >> They will >> also know that innovative papers often have flaws, and the >> dynamics of pc meetings is that the detractors usually win >> out over the champions. ?These are the issues that two-phase >> reviewing is intended to address. > > -- Will more rounds of reviewing or more in-depth reviewing flip > the dynamic so that champions win over detractors? ?If somebody > wants to trash a paper, they can. ?With more effort invested, > they can generally find more holes to poke in the work. ?I'm > skeptical the proposed scheme will help solve this problem. > > -------------- > > Two other comments: > > -- I would massively disagree with any proposal in which some papers are not > presented or there is disproportionate talk time given to certain papers, > especially based on voting. ?Who would ever vote to have a student you have > never heard of give a talk over Simon Peyton Jones? ?No one. I'd be voting for > Simon every single time without even bothering to look at the paper! ?And imagine > your student has one great result and one great POPL paper and a coin flip > means they don't get to present. ?I could easily see this leading to the > student missing out on getting interviews. > > -- If you want to change journal/conference culture, let's not change POPL or > PLDI. ?Let's change TOPLAS instead: ?have TOPLAS papers accepted that year > presented at POPL or PLDI or ICFP or OOPSLAA to attract attention to them. > > Dave > From patrick.baillot at ens-lyon.fr Thu Jan 14 04:36:12 2010 From: patrick.baillot at ens-lyon.fr (Patrick Baillot) Date: Thu, 14 Jan 2010 10:36:12 +0100 Subject: [TYPES/announce] DICE 2010 workshop -- Call for short presentations Message-ID: <20100114103612.285237txv7ck2zrg@webmail.ens-lyon.fr> - deadline for submission of short presentations: January 28, 2010 - notification: February 5, 2010 ====================================================== Call for short presentations International Workshop on Developments in Implicit Computational complExity (DICE 2010) http://www.ens-lyon.fr/LIP/DICE2010/ March 27-28, 2010, Paphos, Cyprus as part of ETAPS 2010 ====================================================== SCOPE AND TOPIC: The area of Implicit Computational Complexity (ICC) has grown out from several proposals to use logic and formal methods to provide languages for complexity-bounded computation (e.g. Ptime, Logspace computation). It aims at studying computational complexity without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles implying complexity properties. This workshop focuses on ICC methods related to programs (rather than descriptive methods). In this approach one relates complexity classes to restrictions on programming paradigms (functional programs, lambda calculi, rewriting systems), such as ramified recurrence, weak polymorphic types, linear logic and linear types, and interpretative measures. The two main objectives of this area are: - to find natural implicit characterizations of various complexity classes of functions, thereby illuminating their nature and importance; - to design methods suitable for static verification of program complexity. Therefore ICC is related on the one hand to the study of complexity classes, and on the other hand to static program analysis. The workshop will be open to contributions on various aspects of ICC including (but not exclusively): - types for controlling complexity, - logical systems for implicit computational complexity, - linear logic, - semantics of complexity-bounded computation, - rewriting and termination orderings, - interpretation-based methods for implicit complexity. - application of implicit complexity to other programming paradigms (e.g. imperative or object-oriented languages) Recent meetings on this topic have been held with success in Paris in 2008 (WICC'08, http://www-lipn.univ-paris13.fr/~mogbil/wicc08/ ), in Marseille in 2006 (GEOCAL'06 workshop on Implicit computational complexity, http://www-lipn.univ-paris13.fr/~baillot/GEOCAL06/ICCworkshop.html), and Paris in 2004 (ICC and logic meeting, http://www-lipn.univ-paris13.fr/~baillot/workshopGEOCAL/complexite.html), which motivated the organization of an international event at ETAPS 2010. INVITED SPEAKERS: Amir Ben-Amram (Tel-Aviv) Simone Martini (Bologna) IMPORTANT DATES: * Full paper submission: * December 21, 2009 * (closed) * Short presentation (extended abstract) submission:* January 28,2010 * * Notification for full papers: January 27, 2010 Notification for short presentations: February 5, 2010 * Final version of full papers due: February 8, 2010 * Workshop: March 27-28, 2010 STUDENT GRANTS: A limited number of student grants will be available for some PhD or Master students presenting a paper at the workshop, so as to cover their local expenses and registration. Students who have not yet defended their PhD or have defended it after September 2009 are eligible. To apply for a grant, send by * January 4, 2010* (extended), a mail to patrick.baillot at ens-lyon.fr , with subject line 'DICE 2010 student grant application' , containing: (i) a short recommendation letter by your PhD/Master advisor, (ii) a scan of your university student card justifying your status. SUBMISSION PROCEDURE: The workshop proceedings will be published in the new EPTCS series (Electronic Proceedings in Theoretical Computer Science, http://www.cse.unsw.edu.au/~rvg/EPTCS/). There will be two categories of submissions: * Full papers: up to 15 pages (including bibliography). * Extended abstracts for short presentations (that will not be included in the proceedings): up to 3 pages; Authors must indicate if their submission belongs to the second category (by mentioning "(Extended Abstract)" in the title). Papers must be submitted electronically, as pdf files, in the EPTCS format, at the following URL: http://www.easychair.org/conferences/?conf=dice2010 Submissions of the first category (full papers) should not have been published before or submitted simultaneously to another conference or journal. This restriction does not hold for the second category (extended abstracts). These latter submissions will be an opportunity to present work in progress or to get a feedback from the audience on a work already published elsewhere. Submissions of papers authored by PC members are allowed. If the number and the quality of submissions justifies it, the publication of a special issue of a journal devoted to the workshop will be considered. PROGRAMME COMMITTEE: * Patrick Baillot (CNRS-ENS Lyon) (chair) * Ugo Dal Lago (University of Bologna) * Martin Hofmann (LMU Munich) * Lars Kristiansen (University of Oslo) * Daniel Leivant (Indiana University) * Jean-Yves Marion (Nancy University) * Virgile Mogbil (University Paris 13) * Simona Ronchi Della Rocca (University of Torino) * Olha Shkaravska (Radboud University, Nijmegen) * Kazushige Terui (University of Kyoto) * Lorenzo Tortora de Falco (University Roma Tre) FINANCIAL SUPPORT: The workshop is partially supported by: ANR project COMPLICE (Implicit Computational Complexity, Concurrency and Extraction), ANR-08-BLANC-0211-01. CONTACT: patrick.baillot at ens-lyon.fr From alain.girault at inria.fr Thu Jan 14 04:57:21 2010 From: alain.girault at inria.fr (Alain Girault) Date: Thu, 14 Jan 2010 10:57:21 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: References: Message-ID: <4B4EEA81.6020903@inria.fr> Jamie Andrews wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > A data point from another area that I do research in... > > The Automated Software Engineering conference (ASE) gets > submissions in the form of 10-page papers, and accepts them as > either "long papers" or "short papers". Long papers get 10 > pages in the conference proceedings, and a 25-minute talk at the > conference. Short papers get 4 pages in the proceedings, no > talk, and a poster at a poster session. ASE has the poster > session in a clean well-lighted place, in a prominent spot in > the schedule, with no other parallel session going on, so that > poster presenters get the most out of the discussions around > their posters. > > I have had papers accepted there as either long or short > papers. I am disappointed when a paper is accepted as short, > because it does mean it was not as well loved as the long > papers. On the other hand, I have had good discussions at the > poster sessions. A 10-minute discussion in front of a large, > detailed poster beats a 5-minute Q&A after a talk, or a > 20-minute discussion over lunch with only napkins to write on. > The paper shows up on my resume as a 4-page paper at a > conference, which is what it is, not stigmatized by a label like > "poster". > > I'm not saying it's perfect (e.g., there is endless debate > in the PC about what should be accepted as short and what as > long). However, it seems to work pretty well and gets more > people involved than is possible when every accepted paper > corresponds to a 25-minute talk in a session. To avoid the problems you mention, why not allow all the papers 10 pages in the proceedings; since the proceedings are electronic, space is not an issue; plus, reducing a paper from 10 pages to 4 pages is always very frustrating, difficult, and very long. Then, instead of selecting oral presentation versus poster presentation based on the ranks of the papers, do it randomly. That way, researchers who come regularly at POPL will experience both ways of presenting their work, and since the decision will be made randomly, attendees will not be tempted to skip the poster session because they will know that, statistically, 50% of the best papers of the conference are there. Usually people skip poster presentations because they have the wrong feeling that these are the "low-end" papers. Random selection will avoid that. P.S. This 50% figure assumes that half the papers are presented as posters, which by the way will allow you to double the number of accepted papers. best regards Alain -- ------------- Alain GIRAULT http://pop-art.inrialpes.fr/~girault INRIA senior researcher tel: +(33|0) 476 61 53 51 Head of the POP ART project-team fax: +(33|0) 476 61 52 52 ----------------------------------------------------------------------------- Sauvons la Recherche ! http://www.sauvonslarecherche.fr ----------------------------------------------------------------------------- From marcello at liacs.nl Thu Jan 14 05:19:49 2010 From: marcello at liacs.nl (Marcello M. Bonsangue) Date: Thu, 14 Jan 2010 11:19:49 +0100 (CET) Subject: [TYPES/announce] Two PhD positions in theoretical computer science Message-ID: <556095a06507b7490cadeda8d97e4a49.squirrel@webmail.liacs.nl> Vacancies for PhD positions in theoretical computer science =========================================================== Leiden Institute of Advanced Computer Science (LIACS) of Leiden University and Centrum Wiskunde & Informatica (CWI) in Amsterdam are looking for two PhD students for working in the NWO funded research project CoRE: Coinductive Calculi of Regular Expressions The purpose of the project is to use the theory of coalgebras and Kleene algebras for automatic reasoning and verification of quantitative and probabilistic systems, interactive systems and advanced functional programs. We are looking for excellent candidates with a background (Master degree) in mathematics, computer science or a related degree and who have strong interest in the mathematical foundations of computer science. Conditions of employment ------------------------ There are two PhD positions available. One candidate will be employed at LIACS in the Foundations of Software Technology (FAST) group. The other will be employed at CWI in the Coordination Languages group (SEN3) in the sub-group `Coalgebraic Models of Computation' led by Prof. Jan Rutten. Both groups provide a dynamic and productive work environment, are in close collaboration with each other and are involved in several national and international research projects. Both PhD candidates will be appointed for a period of four years and will receive salary based on a full-time employment. The salary and labour agreements are in accordance with the CAO for Dutch universities and research institutes. How to Apply? ------------- You are invited to send your application letter together with a curriculum vitae (including a list of master courses), an abstract of your master thesis or a list of publications, and the names and contact addresses of two potential referees. Please send your application before 1 March 2010 to: Marcello Bonsangue and Milad Niqui From shilov at iis.nsk.su Thu Jan 14 06:26:39 2010 From: shilov at iis.nsk.su (shilov@iis.nsk.su) Date: Thu, 14 Jan 2010 17:26:39 +0600 Subject: [TYPES/announce] CFP: Workshop on Program Semantics, Specification and Verification (PSSV 2010, June 14-15, 2010 in Kazan, Russia) Message-ID: <8F1119352A264D1D87E4BFEFAA60E922@fitmobile01> PSSV 2010 Call for Papers The Workshop on Program Semantics, Specification and Verification: Theory and Applications (PSSV 2010) affiliated with 5th International Computer Science Symposium in Russia (CSR-2010, http://csr2010.antat.ru , June 16-20, 2010) will be held on June 14-15, 2010 in Kazan, Russia. =========================================== Important dates Extended abstract submission: March 10, 2010 Notification: March 31, 2010 =========================================== Official languages: English and Russian =========================================== Scope and Topics Research, work in progress and position papers are welcome. List of topics of interest includes (but is not limited to): * formalisms for program semantics; * formal models and semantics of programs and systems; * semantics of programming and specification languages; * formal specification of programs and systems; * logics for formal specification and verification; * deductive program verification; * model checking of programs and systems; * formal approach to testing and validation; * software verification tools. =========================================== Program Chairs * Valery Nepomniaschy (Institute of Informatics Systems, Novosibirsk, Russia, vnep at iis.nsk.su) * Valery Sokolov (Yaroslavl State University, Yaroslavl, Russia, sokolov at uniyar.ac.ru) Program Committee * Natasha Alechina (University of Nottingham, UK) * Boris Konev (University of Liverpool, UK) * Victor Kuliamin (Institute for System Programming, Moscow, Russia) * Nikolay V. Shilov (Institute of Informatics Systems, Novosibirsk, Russia) * Natalia Sidorova (Techn. University Eindhoven, Netherlands) * Vladimir Zakharov (Moscow State University, Russia) =========================================== Submission and Publication Program committee plans to have contributed talks and posters presentations. Program Committee invites submissions in the form of extended abstracts with length up to 6 pages A4 in 12 pt font with line-spacing 1.5 intervals (in English or in Russian). Additional details may be included in an appendix up to 4 pages for Program Committee. Submissions should be in PDF format and should be sent (as attachments) by e-mail to Alexei Promsky (Inst. of Informatics Systems, Novosibirsk, Russia) promsky at iis.nsk.su All accepted papers will be published in the preliminary proceedings before the workshop and the volume of the proceedings will be distributed at the workshop. Selected papers will be published after the workshop in one of Russian peer-review journals. At least one author of every accepted paper should present a talk in the workshop. From alur at seas.upenn.edu Thu Jan 14 10:32:12 2010 From: alur at seas.upenn.edu (Rajeev Alur) Date: Thu, 14 Jan 2010 10:32:12 -0500 Subject: [TYPES/announce] Proposed changes to POPL review process Message-ID: <4B4F38FC.7040507@seas.upenn.edu> Dear Phil, It has been interesting to see all these responses to the two-phase proposal. I also think two-phase reviewing is not that great. One additional drawback I see is that getting rejection after the second phase will amplify the frustration (particularly for starting graduate students). I feel that low acceptance ratio of POPL is a desirable feature, it is critical to its reputation, and I would hate to see that go up significantly. As an aside, some people have essentially suggested that "since number of POPL papers impacts tenure, we should make it easy for researchers to publish in POPL". I do not find this argument compelling. In fact, I am not aware any committee counting this number. What matters is whether senior POPL researchers are impressed by your work, and given that POPL is selective, easiest way for someone to gain attention is by publishing papers in POPL. Fortunately, selection is based on merit, so this presents a clear recipe to draw attention to your work. If POPL is not selective, then the only way would be to be a student of a famous advisor. In fields such as control theory, top conferences such as CDC have high acceptance rates, and indeed good pedigree is a necessity. In any case, POPL review process should focus on selecting best papers and maintaining high quality, without worrying about other factors. More constructively: conferences such as LICS and CAV use electronic PC meeting. I have been on POPL PC once and PLDI PC once, but I have a lot more experience with LICS and CAV (also as PC Chair for both). The problem with POPL (or LICS/CAV for that matter) initial reviews is not the quality (with some exceptions, most papers' contribution is very clear from the reviews), and also not the selective biases of individuals (which are a given, and also, useful, otherwise no evaluation would be possible), but rather that assignment of letter grades A/B/C/D in a distributed manner. For example, a clear technical advance on a well-studied problem may get a B or a C depending on the reviewer. This can make a huge difference, and thus, the same paper rejected from one conference may get accepted the next time, making the process unpredictable. The goal of the PC meeting is to correct for this bias. But the physical meeting is not conducive to correcting this. For a given paper, the opinion of the person whose interests match most closely with the paper, counts more (but it should not: experts' reviews are useful, not his/her biases on what to do with supposedly incremental, or supposedly theoretical-that-will-never-work, or supposedly practical-but-not-conceptually-deep papers). Also, more vocal people get more influence. Time pressure impacts decisions. In practice, PC members are actively involved only in papers they have been assigned, maintaining the distributed nature of the process. What one says on the spur of moment weighs more than what one writes after careful thought, editing, and sanity checks. Thus, physical PC meeting adds unpredictable noise in the selection process. These are less of a problem in an electronic PC meeting. I think every PC member needs to look at all the papers, and focus on selecting best X submissions based on reviews by applying his/her bias uniformly (and not just to one's own pile). This is easier to do on a longer time scale of electronic PC meeting. Bottomline: not clear why POPL does not switch to electronic PC meeting. More dramatically: I mentioned this to Jens after this year's POPL meeting: abolish the PC (i.e. reduce its role to a "reviewers committee" of an exapnded size). Two or three co-chairs can collect reviews for each paper from those who are real experts on the subject. Then based on the reviews, make a decision applying fair and uniform standards. This is not as bad as it sounds. Jens indeed spent a lot of time browsing through all submissions anyway, and could have easily picked the papers after looking at the reviews. Maybe a single person's bias would be detrimental, but, say 3, would make the process better than it is now (and reduce the cumulative amount of time one would spend on POPL PC duties). best regards --rajeev From monnier at iro.umontreal.ca Thu Jan 14 11:20:15 2010 From: monnier at iro.umontreal.ca (Stefan Monnier) Date: Thu, 14 Jan 2010 11:20:15 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: (Philip Wadler's message of "Wed, 13 Jan 2010 19:25:03 +0000") References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: 1. random-choice is good Since people seem to agree that the current selection process is somewhat arbitrary, and too conservative, I think that the human selection should only be used to select the "acceptable papers", and then a random choice can be used to pick the N papers we can accomodate. This has already been suggested here, where "acceptable" is used to decide whether to include it in the proceedings and the random choice decides whether you get a time slot, but if noone likes this option, we could use the random choice directly to pick the set of papers to include in the proceedings. It may sound outrageous (to quote David "imagine your student has one great result and one great POPL paper and a coin flip means they don't get to ..."), but it's not clear it would be worse than what we already have, and it would probably reduce the load on PC members. 2. shortening presentations To take an example from yet another field: in literature, conference presentations don't come with papers at all. You submit an abstract (like half a page) and the rest is purely oral (even slides are unusual). It shows that proceedings and presentations really don't have to go hand in hand. So we may want to make the link between the two a bit more loose. In many ways, conference talks are ways to promote the article: 25 minutes aren't enough to really show much more than the very general idea and the kind of problems it might solve. So shortening some of the talks even more might not be such a bad idea. I might go even further and suggest we shorten all the talks down to 10minutes. We could link that idea with stronger "sessions" that add a longer discussion period shared among all the presenters, so the few talks that need/deserve more time get it back in the form of a discussion. This might also make the conferences themselves more lively (rather than only having life in the backroom talks). Stefan From rm27 at cornell.edu Thu Jan 14 11:43:23 2010 From: rm27 at cornell.edu (Rod Moten) Date: Thu, 14 Jan 2010 11:43:23 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <4B4F49AB.2090208@cornell.edu> I haven't been to a POPL conference in years, but shortening the presentations to 10 minutes is a bad idea. You should give more time instead of less. How long does it take to determine your findings that you present at POPL? How many people did it take to determine those findings? How much funding was needed? How valuable to the community are the findings? I think the answers to these questions should determine the selection process and the length of presentations. Just my $0.02. Stefan Monnier wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > 1. random-choice is good > > Since people seem to agree that the current selection process is > somewhat arbitrary, and too conservative, I think that the human > selection should only be used to select the "acceptable papers", and > then a random choice can be used to pick the N papers we can accomodate. > > This has already been suggested here, where "acceptable" is used to > decide whether to include it in the proceedings and the random choice > decides whether you get a time slot, but if noone likes this option, we > could use the random choice directly to pick the set of papers to > include in the proceedings. It may sound outrageous (to quote David > "imagine your student has one great result and one great POPL paper and > a coin flip means they don't get to ..."), but it's not clear it would > be worse than what we already have, and it would probably reduce the > load on PC members. > > 2. shortening presentations > > To take an example from yet another field: in literature, conference > presentations don't come with papers at all. You submit an abstract > (like half a page) and the rest is purely oral (even slides are > unusual). It shows that proceedings and presentations really don't have > to go hand in hand. So we may want to make the link between the two > a bit more loose. In many ways, conference talks are ways to promote > the article: 25 minutes aren't enough to really show much more than the > very general idea and the kind of problems it might solve. > So shortening some of the talks even more might not be such a bad idea. > I might go even further and suggest we shorten all the talks down to > 10minutes. We could link that idea with stronger "sessions" that add > a longer discussion period shared among all the presenters, so the few > talks that need/deserve more time get it back in the form of > a discussion. This might also make the conferences themselves more > lively (rather than only having life in the backroom talks). > > > Stefan > > From andru at cs.cornell.edu Thu Jan 14 11:47:21 2010 From: andru at cs.cornell.edu (Andrew Myers) Date: Thu, 14 Jan 2010 11:47:21 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> <4B4C9BED.6020209@cs.cornell.edu> Message-ID: <4B4F4A99.8080304@cs.cornell.edu> Michael Hicks wrote: > I'd just like to add my voice to Andrew's (below) that tiered > reviewing works well toward achieving these goals, somewhat to my > surprise. The multiple phases of review increases the chances of > obtaining expert reviews. The filtering in the early phases ensures > that interesting, but not universally-acceptable papers get more > reviews, which improves the quality of feedback. I was a bit worried > that early-phase filtering might unfairly remove papers from the > process, but I don't believe that has ever happened on the PCs I've > been on; i.e., even a fairly conservative criterion for eliminating > papers from further consideration (e.g., the first two reviews are > both 'D') worked very well. I'm sure Andrew can provide more stats on > this, for those interested. > I've posted the part of the Oakland 2009 chair's report that talks about the three-round reviewing process used there to: http://www.cs.cornell.edu/andru/oakland09/reviewing-slides.pdf We had 253 submissions and got that down to 26 accepts with 5-8 reviews per accepted paper. Reviewing load was about 20-23 papers per PC member. There were 25 people at the physical PC meeting (I think a physical PC meeting is important for a 'top' conference in its area). The keys to making this work were 1) to have the PC split into 'heavy' and 'light' contingents -- this is different from the external review committee approach used in recent PL conferences, and 2) to filter papers in early rounds. To aid filtering, I think it was useful to have a 6-point rating scale with clearly defined semantics and ratings above A and below D (strong accept/reject). The slides have the timeline and the numbers, which do matter if you're trying to engineer a similar process. -- Andrew From jonathan.aldrich at cs.cmu.edu Thu Jan 14 12:13:18 2010 From: jonathan.aldrich at cs.cmu.edu (Jonathan Aldrich) Date: Thu, 14 Jan 2010 12:13:18 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <4B4F50AE.80001@cs.cmu.edu> I appreciate the ongoing conversation, and have some input and ideas to add. 1) There is a *ton* of great work in this community, and since it has grown over time, the number of papers accepted should grow also. Accepting 25-30% would not lower the quality appreciably, but it would help ensure a broader program and focus the decision on "is this of the right quality" and reduce the impulse to inject reviewer bias (e.g. about topic) into reviews. 2) Presentations are very important. They're a great way to learn about other work. They are *especially* important as a way way for students (who may not already know many people in the field) to get exposure. This hasn't been emphasized so far in the conversation. I'm ok with shortening presentations a bit, and going to a multi-track event is a good idea. But let's continue to ensure that all published papers can be presented in a main conference session, not a poster session. 3) A journal-like process would be *great* to have as an option for submitting to POPL--i.e. submit at any time, review can include more than one stage with revisions, and accepted papers appear in the next POPL whenever it is. If this option were available I would use it more often than the "regular" POPL process. I personally am happy to contribute to making this happen. 4) Recruiting a single group of papers but accepting them in 2 "tiered" categories, i.e. short/long or present/not--is a bad idea. If I submitted a paper to POPL and it got accepted but "demoted" to an inferior category I would strongly consider withdrawing the paper and submitting to another venue--or not submitting in the first place. 5) More than one paper track, where people submit to different tracks, may be worth considering. OOPSLA has added a track (now a co-located conference) called "Onward!" which is specifically intended to accept exceptionally innovative, but perhaps not as well validated, papers. There are tradeoffs in this approach--less validation often means more disagreement about quality--but having a second track recognizes that there is more than one dimension to "good" papers and helps to ensure that more "out of the the box" work can be considered. 6) Random choice is terrible. Use it for computing algorithms, but not for conference paper or presentation selection. It is especially cruel to submit our students to a random process--even if the current process is imperfect, explicit randomness could only make it worse. I would probably never submit to POPL if there were a random choice element. 7) The proposed 2-phase POPL process may improve results, but it will also increase reviewing costs and likely increase lead time. I think a journal-like option (perhaps in addition to the normal submission) would be a better investment of reviewing effort; then authors can choose if they want the greater lead time in exchange for a journal-like process. Thanks to the POPL steering committee for gathering input on this important issue! Jonathan Aldrich From dutchyn at cs.usask.ca Thu Jan 14 12:32:34 2010 From: dutchyn at cs.usask.ca (Christopher Dutchyn) Date: Thu, 14 Jan 2010 11:32:34 -0600 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <53C957BA-6469-4476-856C-F6C883B343E5@cs.usask.ca> On 2010-01-14, at 10:20 AM, Stefan Monnier wrote: > 1. random-choice is good As a relative outsider, my POPL publication record is "in my future", please recognize that I cannot speak with the authority and experience that others wield. But, my gut-reaction to this is "NO!". Recognizing that there is arbitrariness in the selection process doesn't mean we should institutionalize it -- imagine the impact on POPL's reputation as demonstrated by the following conversation: In a hallway somewhere A) "My paper was accepted to POPL -- a premier PL conference." B) "Don't they pick those things randomly?" (thinking to himself: it was pure luck.) I believe the impact of developing a reputation of picking randomly has no upside, and significant risk/cost. I would suggest an alternative way to select 40 from among the 80 meritous papers: how do they fit together into a well-rounded conference? There should be some Group 1 "this area is now solved, here are the details" papers -- these would arise from considering the hot topics over the last few years. There should be some Group 2 "I've made significant progress" papers, in current hot topics; preferably grouped by topic into sessions of three papers, almost a mini-workshop. If papers can't be put into a session in that way, then they're candidates for "reject until next year." There should be some Group 3 "this is novel/unusual/risky/interesting" which move the area into new directions; these are subjective criteria, and the PC needs to actively encourage these potentially incomplete, but strong submissions. This scheme has the advantage that a strong Group 2, but rejected, paper might still be a POPL paper next year because next year it will fit into the track better. I would consider resubmitting papers for which POPL is the right audience/venue. I would ask that the reviewers state "acceptable but didn't fit" for all of the 40 papers rejected on that basis. Furthermore, I believe the PC and especially the chair, have a responsibility to always accept "off-cycle" papers that are seminal, head-and-shoulders above the pack. > 2. shortening presentations I like this idea. A junior researcher, Christopher Dutchyn Assistant Professor, Computer Science, University of Saskatchewan -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100114/8a09c942/attachment-0001.htm From rinard at csail.mit.edu Thu Jan 14 12:32:36 2010 From: rinard at csail.mit.edu (Martin Rinard) Date: Thu, 14 Jan 2010 12:32:36 -0500 Subject: [TYPES/announce] POPL Review Process Message-ID: <19279.21812.617312.614472@cagsrv.csail.mit.edu> I am in complete agreement with Simon's proposal to increase the number of papers accepted at POPL (and other programming language conferences). I would like to add some reasons why I believe the field as a whole would be better served by accepting more papers. 1) The current very selective process makes it difficult for program committees to accept papers that go against the existing value system of the field. Such papers will almost always have at least one strong detractor, which makes the paper virtually impossible to accept over papers that are well-executed but more conservative (and therefore present less provocative ideas). The immediate negative impact of this situation is that the field loses the benefit of the new ideas in the rejected paper. A more subtle but arguably more pernicious effect is that researchers are motivated to perform relatively incremental research that reinforces the existing value system rather than more adventurous research that challenges the value system. I would not be surprised at all if this motivation is currently skewing the research that people in the field choose to do. An alternate, and potentially much more damaging possibility, is that people who are interested in innovation, creativity, and challenging the status quo choose not to enter the field in the first place. The overall effect is to suppress innovation and hamper the intellectual development of the field over time. This is bad for the field both internally and as it competes with other fields. Based on my interaction with colleagues in a variety of situations, POPL is viewed as publishing technically excellent but conservative papers. This perception (which I believe has some justification in reality) is bad for the field - I have seen it negatively impact the perception of researchers who publish in POPL. 2) My first four submitted papers (two of which were POPL papers) were all accepted. Anecdotally I have observed a similar pattern with many other students who chose to pursue research careers. I believe that this early positive experience with the field helps students view the whole research endeavor positively and motivates them to stay in the field. The current publication process winds up rejecting many papers that are at least as deserving of publication as the papers that are accepted. Students who experience this kind of unjustified rejection can easily come to view the system (again with some basis in reality) as unfairly and arbitrarily failing to recognize legitimate accomplishment. As a result they become disillusioned with research and choose to pursue careers in other areas. By the way, I am not alone in this perception - I have heard other senior faculty express their frustration with the effect that the current publication process has on their students. 3) Greg Morrisett makes the point that rejected POPL papers are often published in other conferences. This is true, which mitigates some of the negative effects, but it is hardly an ideal situation. First, the publication delay denies the field timely access to the idea. Second, the publication delay runs the risk of getting the priority for the idea in the paper wrong. Finally, the proliferation of conferences fragments the field and hampers the useful interchange of ideas between subcommunities. 4) Rajeev Alur (and Simon Peyton-Jones, although he comes to a different conclusion) makes the point that selectivity can enhance both the reputation and visibility of the accepted papers. I agree with this point and indeed, believe that I have benefited enormously from this phenomenon myself. The problem is that the field has tipped over into a situation in which there are not enough slots in the top conferences to publish clearly deserving papers. There are two negative effects: a) The process becomes arbitrary and unfair because it becomes next to impossible to separate the top, say, 40 papers from the next 20 papers based on merit. b) The selection criteria become biased to counterproductively emphasize execution and conformance to the existing value system over innovation and creativity, with long-term negative consequences for the development of the field as detailed above. In my view these negative effects, at this point in time, more than counterbalance the positive effects of an extremely selective system. Another way to look at this is that the growth in the field (over the last two decades) has outstripped the growth in the number of papers published at POPL, to the point that POPL is no longer an effective publication outlet for the field as a whole. So why is accepting more papers the right way to attack this problem at this time? Because it effectively addresses so many of the problems above. First, it removes some of the selection pressure and makes room for more innovative papers in the short run and more innovative research programs in the long run. Second, it provides a fairer publication process that recognizes accomplishment and makes the field more attractive to students who are looking for such a field. Third, it maximizes publication timeliness. Finally, it would enable (but certainly not require if this were not to be perceived to be desirable) the creation of fewer but broader conferences that help facilitate communication across subfields. In the long term, of course, the most productive course is to move to a more standard conference/journal system in which the purpose of conferences is to enable the fast dissemenation of recent information and promote interaction between members of the community, while the purpose of journals is to publish vetted results. But this is a topic for a different discussion. Martin From kutsia at risc.uni-linz.ac.at Thu Jan 14 14:12:42 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Thu, 14 Jan 2010 20:12:42 +0100 Subject: [TYPES/announce] 2nd CfP: LOPSTR 2010 Message-ID: <20100114191242.GA15923@risc.uni-linz.ac.at> ========================================================================= Call for papers 20th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2010 http://www.risc.uni-linz.ac.at/conferences/lopstr2010/ Hagenberg, Austria, July 23-25, 2010 (co-located with PPDP 2010) ========================================================================= Objectives: The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium, so authors can incorporate the feedback in the published papers. The 20th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2010) will be held in Hagenberg, Austria; previous symposia were held in Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester. LOPSTR 2010 will be co- located with PPDP 2010 (12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming). Topics: Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in- the-small and programming-in-the-large. Papers describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: specification synthesis verification transformation analysis optimisation specialization inversion composition program/model manipulation certification security transformational techniques in SE applications and tools Survey papers that present some aspect of the above topics from a new perspective. Application papers, that describe experience with industrial applications, 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. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. Following past editions, publication of the formal post-conference proceedings in the Springer series Lecture Notes in Computer Science (LNCS) is envisaged. IMPORTANT DATES AND SUBMISSION GUIDELINES: Paper/extended abstract submission: March 25, 2010 Notification (for pre-proceedings): May 15, 2010 Camera-ready (for pre-proceedings): June 15, 2010 Symposium: July 23-25, 2010 Submissions can either be (short) extended abstracts or (full) papers whose length should not exceed 9 and 15 pages, respectively. Submissions must be formatted in the Springer LNCS style (excluding well-marked appendices not intended for publication). Referees are not required to read the appendices, and thus papers should be intelligible without them. Short papers may describe work-in-progress or tool demonstrations. Both short and full papers can be accepted for presentation at the symposium and will then appear in the LOPSTR 2010 pre-proceedings. Full papers can also be immediately accepted for publication in the formal proceedings published by Springer-Verlag in the LNCS series. In addition, after the symposium, the programme committee will select further short or full papers presented in LOPSTR 2010 to be considered for formal publication. These authors will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then after another round of reviewing, these revised papers can also be published in the formal post-proceedings. Papers should be submitted electronically via the submission page http://www.easychair.org/conferences/?conf=lopstr2010 They should be in PDF format and interpretable by Acrobat Reader. Invited Speakers: Bruno Buchberger RISC, Johannes Kepler University Linz, Austria Olivier Danvy University of Aarhus, Denmark Johann Schumann RIACS/NASA Ames Research Center, USA Program Committee: Maria Alpuente Tech. University of Valencia (Chair), Spain Sergio Antoy Portland State University, USA Gilles Barthe IMDEA Software, Madrid Manuel Carro Tech. University of Madrid, Spain Marco Comini University of Udine, Italy Danny De Schreye K.U.Leuven, Belgium Santiago Escobar Tech. University of Valencia, Spain Moreno Falaschi University of Siena, Italy Fabio Fioravanti University of Chieti - Pescara, Italy John Gallagher Roskilde University, Denmark Michael Hanus University of Kiel, Germany Patricia M Hill University of Parma, Italy Andy King University of Kent, UK Temur Kutsia Johannes Kepler University Linz, Austria Ralf Lämmel Universität Koblenz-Landau, Germany Michael Leuschel University of Southampton, UK Yanhong Annie Liu State University of New York at Stony Brook, USA Julio Mariño Tech. University of Madrid, Spain Ricardo Peña University Complutense of Madrid, Spain Peter Schneider-Kamp University of Southern Denmark Alicia Villanueva Tech. University of Valencia, Spain Contacts Program Chair Maria Alpuente DSIC - Technical University of Valencia Camino de Vera s/n Apdo. 22.012 E-46022 Valencia (Spain) Email: alpuente at dsic.upv.es Conference Chair Temur Kutsia Research Institute for Symbolic Computation Johannes Kepler University Linz Altenbergerstrasse 69 A-4040 Linz, Austria Email: kutsia at risc.uni-linz.ac.at From wadler at inf.ed.ac.uk Thu Jan 14 18:05:12 2010 From: wadler at inf.ed.ac.uk (Philip Wadler) Date: Thu, 14 Jan 2010 23:05:12 +0000 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: Before the Types discussion began, I collected comments on the two-phase proposal, which I planned to post on the web (with permission). I am now posting them here. Enjoy! -- P ------------------------------------------------------------------------ Dan Grossman, 11 Dec 2009 At first blush, I'm quite supportive of this. Among the community I'm one of the "happier" ones with how things are now, and quite concerned about making major changes that "throw the baby out with the bathwater". But this proposal seems quite measured and certainly worth trying as an experiment. I agree it should lead to better results. It seems like a thoughtful compromise. I had two questions that if I don't ask somebody else will, so I encourage the POPL EC to think through rough answers: 1. Approximately what percentage do they envision being accept, resubmit, and reject? 5% resubmit and 50% resubmit are _very_ different things. 2. Will there be a length limit on the cover letters? 500 words? 3 pages? No limit? ------------------------------------------------------------------------ Erez Petrank, 13 Dec 2009 As the proposal mentions, this is a step towards making our conferences something of a journal, and probably another step towards reducing the value of journals in our community. The discussion on the POPL proposal may fit well into our planned discussion on conferences versus journals in the next [SIGPLAN EC] meeting. --Erez ------------------------------------------------------------------------ Manuel Chakravarty, 14 Dec 2009 Hi Phil, This is an interesting proposal, and I'd be curious to see how it performs in practice. I wonder whether you have thought about any specific means to evaluate both the amount of additional work generated by two-phase reviewing (once it has been trialled) and to evaluate its impact on the POPL program. I appreciate that especially the latter is hard to measure, which is why I'm curious whether any concrete metrics have been discussed. The proposal mentions having two PC chairs to spread the work load. Do you also plan to have more PC members on the committee? How detailed do you expect the second-phase reviews to be? Cheers, Manuel ------------------------------------------------------------------------ Francois Pottier, 14 Dec 2009 Dear Phil, Some thoughts and questions: + the idea that this would work better than the current author response process sounds plausible. Is there an evaluation of the current rebuttal process? o one should make sure that the two weeks during which authors are supposed to revise the paper do not fall within the summer break (i.e. avoid August; early September would be fine) o how are the reviewers supposed to evaluate the revised version? read it all again in detail? have a quick look? will at least one new reviewer be enrolled? - if the second round reviewers are the same as the first round reviewers, then it is not clear that the quality of the selection process will improve. - the review process will become significantly longer (at least for the papers which pass the first round). It is not very encouraging for authors to have to spend several months waiting for the final result. It is perhaps more acceptable for a journal, where presumably the work is well polished already and stands a good chance of being accepted; but for a selective conference, where there is a good chance of being rejected, isn't that a waste of time? If conferences are supposed to encourage the dissemination of new results, then the process should be quick. (One might argue that the authors should not wait, but instead continue working while the paper is under consideration. Maybe so, but this is a shift to a new paradigm.) -- Fran?ois Pottier Francois.Pottier at inria.fr http://gallium.inria.fr/~fpottier/ ------------------------------------------------------------------------ James Hook, 14 Dec 2009 I think it is a very good idea to have conferences experiment. I would like to thank the POPL steering committee for creating this proposal, and for inviting feedback. On the goal: I think the goal "improve the decision process" needs refinement. What aspect of the decision process do you wish to improve? Is there any way to measure it? Do you feel the current process is too conservative, and want to encourage publication of less incremental work? Do you feel that too many technically weak papers have been accepted? Do you feel that too many technically sound and subsequently influential papers have been rejected? Do you feel that authors have not taken the opportunity to improve their papers once they are notified of acceptance? Are authors of rejected material getting reviews of sufficient quality to help them improve their work? (There is some discussion of these points in the "advantages section", but I would recommend a clear goal statement.) Leading the proposal with the impact of the decisions on promotion and tenure cases suggests to me that perfection might be a goal. The statement is true---the decisions have consequences. But ultimately the PC must evaluate papers, not individuals, and make the best decisions they can on the work products submitted. We serve our community best by bringing integrity to the reviewing process, not by allowing ourselves to be distracted by the very real personal consequences of our decisions. I think perfection of the process should not be a goal. Experience suggests that there will be some clear winners, some clear losers, and a bunch of papers in the middle. I have seen no evidence that any amount of time invested in reviewing or discussing the papers on the cusp will significantly improve the quality of the technical program selected. Overall structure: I would recommend structuring the proposal as an experiment. What is the goal? What is the evaluation plan? When will it be evaluated? I doubt we would learn very much from doing it once and then abandoning it. After it has been tried and tuned for three years is it ready to be evaluated? Timeline: The proposal is trying to balance end-to-end time with time for meaningful revisions. I think this is an area where we need to gain some experience to make an informed judgement. The submission-to- presentation time seems quite long to me. It is difficult to predict what the impact will be of having the POPL submission date coupled to the ICFP notification date. Currently the ICFP satellite events are informally coupled with the ICFP notification date. The largest of these is the Haskell Symposium. Perhaps the best thing to do here is to include some measurement of ICFP workshop and Haskell symposium submissions as part of the evaluation plan. It is clear that it is not the intent of the proposal to weaken these technical meetings, but it is one possible consequence. I hope other members of the ICFP SC will comment on this aspect. Other issues: To what extent is the current print publication process adding confounding delays to the overall submission-to-presentation time? Is there a way to borrow time from Sheridan instead of moving the submission deadlines earlier in the year? In closing, thank you for the stimulating and innovative proposal! Regards, Jim ------------------------------------------------------------------------ Martin Abadi, 6 Jan 2010 Dear Phil, I am concerned about the possibility of revisions, for two reasons: * It can be a scheduling problem. Not all authors will be equally available in any two-week period, and some periods are particularly harsh on particular groups of authors (e.g., the French in august, academics near the start of the quarter). * I am unclear on what sorts of revisions will be expected or allowed, and I am concerned that this will be a source of problems when working on a tight schedule. Happy New Year. Martin ------------------------------------------------------------------------ Cristina Cifuentes, 7 Jan 2010 It is not clear to me what the net result of the two-phase reviewing will be: to discourage journal publications even further? Or to increase the quality of POPL papers? POPL papers have a page limit, which journals do not normally have. A journal paper is more complete, and as such, I believe journals are a good place to publish more complete work that cannot "fit" into a conference paper. The two-phase review will improve the quality of some POPL papers at the expense of more work by the PC. POPL already has a high standing in academia, increasing its quality will NOT make it the same as publishing in a journal. In other fields, journal papers are highly valued and are rather short, e.g., Nature (4 page papers). One could argue that part of the problem with our journal papers is that they are too long: long time lead to write, review and publish, leading to not-up-to-date information. In fields like Nature, papers are published in a timely basis, but their length is rather short. Regards, Cristina ------------------------------------------------------------------------ Derek Dreyer to Benjamin Pierce, 8 Jan 2010 Based on this email, I don't entirely understand the proposed process, nor do I really understand its motivation. What is the problem being solved? It seems that the idea is to make POPL reviewing more similar to journal reviewing. However, it's unclear to me what "resubmit" corresponds to in journal reviewing. "Resubmit" on a journal submission usually is tantamount to "major revisions needed", but presumably major revisions cannot be carried out in 2 weeks. Or is that not the meaning of "resubmit"? After the PC initially decides between accept, resubmit, and reject, who has to resubmit? Is it just the people who got "resubmit" who are judged in the second round? Why does the PC meet physically after the first round but not the second? Is it because it is expected that there will only be a few papers in the "resubmit" category, that it will be used sparingly for only really tough borderline cases? Otherwise, I can imagine a PC meeting devolving into "resubmit everything". One very real concern I have is that the people who would be most likely to resubmit their POPL rejects to ESOP (which would perhaps be among the better papers at ESOP) are precisely those who would have to wait an extra 6 weeks to get "reject" and thus have missed the ESOP deadline. I guess it's not POPL's concern whether it feeds into ESOP, but I thought I'd mention it. ------------------------------------------------------------------------ Peter Sewell to Benjamin Pierce, 8 January 2010 I'm strongly against this proposal. The current process certainly has a lot of noise, but I don't think this would be much better - much of the noise comes from the PC and reviewer assignment at the start, despite the best efforts of the PC chairs. This proposal sounds like a massive amount of additional work for the PC and (if there are a significant number of "resubmits") for the reviewers and authors. Instead, as there often seem to be many perfectly good papers that get rejected, I would simply move to accepting more papers, multi-tracking or extending the conference. It might also be that more care to ensure a subject-balanced PC could be taken. ------------------------------------------------------------------------ John Reppy to Kathleen Fisher, 10 January 2010 On the face of it, I think that this is a bad idea that will increase the work for reviewers, who are already overworked. It is not clear what problem this proposal is attempting to fix. Is there a concern that bad papers are getting accepted to POPL by accident? I suspect that that is not a serious problem. Is the concern that the quality of POPL reviewing is not high enough? That could be addressed by increasing the size of the PC (or perhaps using the external reviewer mechanism of PLDI) to reduce the number of reviews that each member is responsible for, but again I suspect that review quality is not a pressing issue (in fact, the quality of reviews has significantly improved over the time that I've been submitting conference papers). Instead, the problem that POPL suffers from (and it is not alone in this regard) is an insufficient number of slots for the number of worthwhile papers that are submitted. The proposal does not address that issue at all. The fact that POPL is both a crap shoot and really important for tenure decisions is a symptom of a broader problem that our discipline faces. Our current publication model doesn't really scale to an ever-growing community of researchers. In the short term, we can increase the number of slots by decreasing talk length (probably a good thing) and adding parallel sessions (probably a bad thing). I do worry that increasing the conference size will eventually reach a point where there won't be consistency across the reviewing process. I am also concerned about the first-round accept class of papers. What percentage of papers would likely be accepted/rejected the first round? Can a paper that is accepted the first round be rejected in the second round? Is this just a mechanism to force authors to make the changes requested by reviewers? This plan also loses what, I think, is the most important benefit of author response. Namely, that it is a forcing function that requires reviewers to produce a quality review before the PC meeting. Lastly, I do think the idea of moving to co-chairs for the PC has merit. ------------------------------------------------------------------------ Karl Crary, 11 Jan 2010 I won't be at POPL this year, so I thought I would send you my comments: I'm not against the proposal, exactly. I can see some possible benefits, and it definitely seems like an improvement over the current system of author response (which I am against). However, I am troubled by the endless tinkering with a system that seems to be functioning well overall. Each change carries with it the possibility of some negative unintended consequence, while the upside is limited. I had hoped that the system had already converged, and I wouldn't mind rejecting the proposal on the if-it-ain't-broke-don't fix-it principle. But if we do adopt the proposal, I hope it's the last change for some time. I do appreciate you raising the topic for general discussion. It's a welcome contrast to the recent history of unilateral changes. -- Karl ------------------------------------------------------------------------ -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From kohei at dcs.qmul.ac.uk Thu Jan 14 19:57:57 2010 From: kohei at dcs.qmul.ac.uk (Kohei Honda) Date: Fri, 15 Jan 2010 00:57:57 +0000 Subject: [TYPES/announce] PLACES'10: deadline extension Message-ID: 2nd CALL FOR PAPERS (deadline extension) PLACES'10 Programming Language Approaches to Concurrency and communication-cEntric Software 21st March 2010, Paphos, Cyprus Affiliated with ETAPS 2010 http://places10.di.fc.ul.pt/ Theme and Goals Applications on the web today are built using numerous interacting services; soon off-the-shelf CPUs will host hundreds of cores; and sensor networks will be composed from a large number of processing units. Many normal software, including applications and system-level services, will soon need to make effective use of thousands of computing nodes. At some level of granularity, computation in such systems will be inherently concurrent and communication-centred. To exploit and harness the richness of this computing environment, designers and programmers will utilise a rich variety of programming paradigms, depending on the shape of the data and control flow. Plausible candidates for such paradigms include structured imperative concurrent programming, stream-based programming, concurrent functions with asynchronous message passing, higher-order types for events, and the use of types for communications and data structures (such as session types and linear types), to name but a few. Combinations of these abstractions will be used even in a single application, and the runtime environment needs to ensure seamless execution without relying on differences in available resources such as the number of cores. The development of effective programming methodologies for the coming computing paradigm demands exploration and understanding of a wide variety of ideas and techniques. This workshop aims to offer a forum where researchers from different fields exchange new ideas on one of the central challenges for programming in the near future, the development of programming methodologies and infrastructures where concurrency and distribution are the norm rather than a marginal concern. Topics of Interest Submissions are invited in the general area of foundations of programming languages for concurrency, communication and distribution. Specific topics include: language design and implementations for communications and/or concurrency, program analysis, session types, multicore programming, use of message passing in systems software, interface languages for communication and distribution, concurrent data types, concurrent objects and actors, web services, novel programming methodologies for sensor networks, integration of sequential and concurrent programming, high-level programming abstractions for security concerns in concurrent, distributed programming, and runtime architectures for concurrency, scalability and/or resource allocations. Papers are welcome which present novel and valuable ideas as well as experiences. Submission Guidelines Authors are invited to submit a five-page abstract in PDF format by 22nd January using the EasyChair proceedings template available at: http://www.easychair.org/easychair.zip Abstracts and full papers should be submitted using EasyChair: http://www.easychair.org/conferences/?conf=places2010 Preliminary proceedings will be available at the workshop. The post-proceedings of the workshop will be published in a journal (the past post-proceedings were published in ENTCS and EPTCS). Please address enquires to am at cl.cam.ac.uk and kohei at dcs.qmul.ac.uk, with a subject field containing "[PLACES]". Important Dates (deadline extended) Deadline of 5-page abstracts: Friday 22nd Jan 2010 Notification: Friday 12th Feb 2010 Camera Ready for pre-proceedings: Friday 26th Feb 2010 Invited Speakers William Cook, Jayadev Misra (University of Texas, Austin) Program Committee Alastair Beresford, University of Cambridge Marco Carbone, IT University of Copenhagen Simon Gay, University of Glasgow Joshua Guttman, The MITRE Corporation and Worcester Polytechnic Institute Kohei Honda (chair), Queen Mary, University of London Alan Mycroft (chair), University of Cambridge Hanne Riis Nielson, The Technical University of Denmark John Reppy, University of Chicago Konstantinos Sagonas, National Technical University of Athens and Uppsala University Vivek Sarkar, Rice University Vasco T. Vasconcelos, University of Lisbon Jan Vitek, Purdue University Nobuko Yoshida, Imperial College London From kaufmann at cs.utexas.edu Fri Jan 15 10:25:29 2010 From: kaufmann at cs.utexas.edu (Matt Kaufmann) Date: Fri, 15 Jan 2010 09:25:29 -0600 Subject: [TYPES/announce] ITP-10: Call for Rough Diamonds Message-ID: <201001151525.o0FFPTis024974@sundance.cs.utexas.edu> Call for "Rough Diamonds" ITP 2010: Conference on Interactive Theorem Proving 11-14 July 2010, Edinburgh, Scotland http://www.floc-conference.org/ITP-cfp.html As previously announced, the deadline is today for abstracts of papers to be submitted to ITP 2010. However, we have waived the requirement for abstracts of submissions in the "rough diamonds" category; such submissions will be accepted through Friday, January 22 (the paper submissions deadline for full papers). Quoting from the Call for Papers: In addition to regular submissions, described above, there will be a "rough diamonds" section. Rough diamond submissions are limited to four pages and may consist of an extended abstract. They will be refereed: they will be expected to present innovative and promising ideas, possibly in an early form and without supporting evidence. Accepted diamonds will be published in the main proceedings. They will be presented at the conference venue in a poster session. Please see the above URL for the full Call for Papers, which includes instructions for submission using EasyChair. Regards, Matt Kaufmann and Larry Paulson (ITP 2010 co-chairs) From osantos at cs.york.ac.uk Fri Jan 15 12:04:25 2010 From: osantos at cs.york.ac.uk (Osmar Marchi dos Santos) Date: Fri, 15 Jan 2010 17:04:25 +0000 Subject: [TYPES/announce] LAST REMINDER - CALL FOR PAPERS: TOOLS EUROPE 2010 Message-ID: <4B50A019.7040203@cs.york.ac.uk> ========================================================================== LAST CALL FOR PAPERS (Deadline: January 22, 2010) TOOLS EUROPE 2010 48th International Conference Objects, Models, Components, Patterns Co-located with *** International Conference on Model Transformation (ICMT 2010) *** *** International Conference on Software Composition (SC 2010) *** *** International Conference on Tests and Proofs (TAP 2010) *** M?laga - Spain, 28 June - 02 July 2010 http://malaga2010.lcc.uma.es/ ========================================================================== TOOLS EUROPE is devoted to the combination of technologies that have emerged as a result of object technology becoming "mainstream". Like its predecessors, TOOLS EUROPE combines an emphasis on quality with a strong practical focus. Started in 1989, TOOLS conferences, held in Europe, the USA, Australia, China and Eastern Europe, have played a major role in the development of object technology; many of seminal concepts were first presented at TOOLS. After an interruption of four years, the conference was revived in 2007 to reflect the maturing of the field and the new challenges ahead and has become a yearly event. Contributions are solicited on all aspects of object technology and related fields, in particular model-based development, component-based development, and patterns (design, analysis and other applications); more generally, any contribution addressing topics in advanced software technology fall within the scope of TOOLS. Reflecting the practical emphasis of TOOLS, contributions showcasing applications along with a sound conceptual contribution are particularly welcome. Topics include: * Object technology, including programming techniques, languages, tools * Testing of object-oriented systems * Patterns, pattern languages, tool support for patterns * Distributed and concurrent object systems * Real-time object-oriented programming and design * Experience reports, including efforts at standardisation * Applications to safety- and security-related software * Component-based programming, modelling, tools * Aspects and aspect-oriented programming and modelling * Frameworks for component-based development * Trusted and reliable components * Model-driven development and Model-Driven Architecture * Domain specific languages and language design * Tools and frameworks for supporting model-driven development * Language implementation techniques, compilers, run-time systems * Practical applications of program verification and analysis * Open source solutions & Reproduction studies All contributions will be subject to a rigorous selection process by the international Program Committee, with a stress on originality, practicality and overall quality. The proceedings will be published in Springer LNBIP. For detailed submission information see the conference page. Important Dates: Papers submission deadline: January 22, 2010 Acceptance notification: March 24, 2010 Camera-ready final copy: April 5, 2010 Conference: June 28 -- July 02, 2010 Conference Chair: Bertrand Meyer, ETH Z?rich and Eiffel Software Program Chair: Jan Vitek, Purdue University Publicity Chair: Osmar Santos, University of York Program Committee: Uwe Assman, University of Dresden, Germany Elisa Baniassad, Chinese University of Hong Kong, Hong Kong Alexandre Bergel, University of Chile, Chile Lorenzo Bettini, University of Torino, Italy Judith Bishop, Microsoft Research, USA William Cook, University of Texas Austin, USA Sophia Drossopolou, Imperial College London, UK Catherine Dubois, ENSIIE, France St?phane Ducasse, INRIA Lille, France Manuel Fahndrich, Microsoft Research, USA Harald Gall, University of Zurich, Switzerland Benoit Garbinato, University of Lausanne, Switzerland Angelo Gargantini, University of Bergamo, Italy Jeff Gray, University of Alabama Birmingham, USA Kathryn Gray, University of Cambridge, UK Thomas Gschwind, IBM Research, Switzerland Matthias Hauswith, University of Lugano, Switzerland Nigel Horspool, University of Victoria, Canada Tomas Kalibera, Charles University, Czech Republic Gerti Kappel, Vienna University of Technology, Austria Doug Lea, State University of New York Oswego, USA Shane Markstrum, Brucknell University, USA Peter M?ller, ETH Zurich, Switzerland Oscar Nierstrasz, University of Bern, Switzerland James Noble, Victoria University of Wellington, New Zealand Nate Nystrom, University of Texas Arlington, USA Manuel Oriol, University of York, UK Jonathan Ostroff, York University, Canada Richard Paige, University of York, UK Shaz Qadeer, Microsoft Research, USA Awais Rashid, Lancaster University, UK Vivek Sarkar, Rice University, USA Doug Schmidt, Vanderbilt University, USA Manuel Serrano, INRIA Sophia Antipolis, France Peter Thiemann, University of Freiburg, Germany Dave Thomas, Bedarra Research Labs, Canada Laurence Tratt, Bournemouth University, UK Mandana Vaziri, IBM Research, USA Tian Zhao, University of Wisconsin-Milwaukee, USA From matthias at ccs.neu.edu Fri Jan 15 15:04:12 2010 From: matthias at ccs.neu.edu (Matthias Felleisen) Date: Fri, 15 Jan 2010 15:04:12 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: Dear typists, as many of you know Jens Palsberg sent out a brief survey to the authors of POPL 2010 submissions on behalf of the SC. Several expressed a dislike for non-anonymous surveys and others pointed out that they didn't submit this year but are otherwise regular authors. Phil asked me to create a surveymonkey survey and I did by copying and pasting Jens's questions into a web page: http://www.surveymonkey.com/s/ZLJF6VG I still have to figure out how to get the results back but in the meantime, fire away. -- Matthias From dd at dominicduggan.org Fri Jan 15 15:08:53 2010 From: dd at dominicduggan.org (Dominic Duggan) Date: Fri, 15 Jan 2010 15:08:53 -0500 Subject: [TYPES/announce] CFP: First International Workshop on Programming Methods for Mobile and Pervasive Computing (PMMPS 10) Message-ID: *First International Workshop on Programming Methods for Mobile and Pervasive Systems (PMMPS'10) http://www.pmmps.org * *Helsinki, Finland, May 17, 2010.* * Colocated with Pervasive 2010, the 8th International Conference on Pervasive Computing . * The International Workshop on Programming Methods for Mobile and Pervasive Systems (PMMPS) is intended to bring together researchers in programming languages, software architecture and design, and pervasive systems to present and discuss results and approaches to the development of mobile and pervasive systems. The goal is to begin the process of developing the software design and development tools necessary for the next generation of services in dynamic environments, including mobile and pervasive computing, wireless sensor networks, and adaptive devices. *Discussions of type systems for mobile and pervasive systems are part of the parvenu for the workshop.* Potential workshop participants should submit a paper on topics relevant to programming models for mobile and pervasive systems. We are primarily seeking short position papers (2?4 pages), although full papers that have not been published and are not under consideration elsewhere will also be considered (a maximum of 10 pages). Position papers that lay out some of the challenges to programming mobile and pervasive systems, including past failures, are welcome. Papers longer than 10 pages may be automatically rejected by the chairs or workshop committee. From the submissions, the program committee will strive to balance participation between academia and industry and across topics. Selected papers will appear on the workshop web site; PMMPS has no formal published proceedings. Authors of selected papers will be invited to submit extended versions for publication in an appropriate journal (under negotiation). Submission deadline: March 1, 2010. Notification: March 29, 2010. Final copy: April 12, 2010. Workshop: May 17, 2010. Both new ideas *and critical evaluation of earlier approaches* are welcome. -- Dominic Duggan Associate Professor, Computer Science Stevens Institute of Technology Hoboken, NJ 07030. Telephone: (201) 216-8042 Email: dduggan at stevens.edu Web: http://www.dominicduggan.org -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100115/89356ccf/attachment-0001.htm From Lists at Alessio.Guglielmi.name Fri Jan 15 19:09:40 2010 From: Lists at Alessio.Guglielmi.name (Alessio Guglielmi) Date: Sat, 16 Jan 2010 01:09:40 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <7fa251b71001130255h2261c89cp41f4215e56328243@mail.gmail.com> References: <20100113071830.9607414CD93@janeway.inf.tu-dresden.de> <7fa251b71001130255h2261c89cp41f4215e56328243@mail.gmail.com> Message-ID: <20100116000943.C35C114CDDE@janeway.inf.tu-dresden.de> Hello, At 11:55 +0100 13/1/2010, Derek Dreyer wrote: >>And the conferences should serve the purpose of disseminating new >>ideas, not of distributing medals. > >Given that there have been several posts with something approaching >this sentiment, I would like to respectfully, and strongly, >disagree. POPL and other top conferences have been a place where >many great *ideas* in programming languages have been first set >forth. Yes, nobody is disputing that, but not all the ideas have the right granularity to fit the conference format, which is the problem that many of us lament. In other words, the problem is that giving excessive importance to conference publication distorts research towards what fits conferences, which is not necessarily bad, but it's certainly not all there is. This is particularly bad in certain areas and for the young researchers, who are told `publish several small easily digestible things at conferences (or perish)' instead of `do good research'. Of course there is, for the obvious dynamics, a strong cultural attractor that tends to blur those two concepts, and I think that this is precisely what should be resisted. >>There are so many `papers' produced, that, right now, in computer >>`science', not even the authors read their own work. Thanks to cut >>& paste we have now a ratio of reads/writes < 1. > >I don't know what you're talking about: I read way more papers than >I write, and I read way more conference papers than journal articles >in a given year, often because I am asked to review them! Most of >what I learn about new ideas in PL is from reading conference papers. I didn't mean to be taken so literally. But then again, it really depends on the areas and on what we mean by `reading'. For example, POPL prospective authors used to be advised, in the call for papers, that their works would have been judged after a 40-minute `reading'. Should we really count this reading? It happened to me to review a short and very well written paper (for a journal) whose claims looked to me absolutely impossible, outrageous. After reading (= studying) the paper for days, I still was in the dark, and had to dig out some older results the paper was relying upon, and this took me weeks of study. The paper was right, it was accepted, and it changed dramatically my own research ever since. A fantastic idea. I wonder what I would have done of that paper in 40 minutes. Ciao, -Alessio From wadler at inf.ed.ac.uk Sat Jan 16 10:39:10 2010 From: wadler at inf.ed.ac.uk (Philip Wadler) Date: Sat, 16 Jan 2010 15:39:10 +0000 Subject: [TYPES/announce] Proposed changes to POPL review process In-Reply-To: <4B4F38FC.7040507@seas.upenn.edu> References: <4B4F38FC.7040507@seas.upenn.edu> Message-ID: Following on from Rajeev Alur's e-mail, I want to make the following proposal: - Replace the POPL physical PC meeting with an electronic one. This proposal was discussed by the POPL Steering Committee, which was split on the matter. Input from the community would be helpful. My experience matches Rajeev's. The process of a physical PC meeting necessarily requires quick decisions, often based on who is most vocal or an overnight reading of a paper. My experience of electronic meetings is that the discussions can be more considered. I believe the advantages of electronic meetings become clearer in a context where more papers are accepted, so the decisions centre on 'Is this paper of good quality?' rather than 'Is it better than the other papers we've accepted?' In addition to the cogent points raised by Rajeev, I'll mention that there is also the cost, particularly to the climate, of a physical meeting. Typically, POPL has about 200 attendees and a PC of 25, so a physical PC meeting increases the carbon footprint of the conference by on the order of 10%. How does the community feel about a move to electronic PC meetings? Yours, -- P On Thu, Jan 14, 2010 at 3:32 PM, Rajeev Alur wrote: > [ The Types Forum (announcements only), > ? ? http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > Dear Phil, > It has been interesting to see all these responses to the two-phase > proposal. I also think two-phase reviewing is not that great. > One additional drawback I see is that getting rejection after the > second phase will amplify the frustration (particularly for starting > graduate students). > I feel that low acceptance ratio of POPL is a desirable feature, it is > critical > to its reputation, and I would hate to see that go up significantly. > As an aside, some people have essentially suggested that "since number > of POPL papers impacts tenure, we should make it easy for researchers to > publish in POPL". I do not find this argument compelling. In fact, I am > not aware > any committee counting this number. What matters is whether senior POPL > researchers are impressed by your work, and given that POPL is selective, > easiest way for someone to gain attention is by publishing > papers in POPL. Fortunately, selection is based on merit, so this presents > a clear recipe to draw attention to your work. If POPL is not selective, > then the only way would be to be a student of a famous advisor. > In fields such as control theory, top conferences such as CDC have > high acceptance rates, and indeed good pedigree is a necessity. > In any case, POPL review process should focus on selecting best papers > and maintaining high quality, without worrying about other factors. > > More constructively: > conferences such as LICS and CAV use electronic PC meeting. > I have been on POPL PC once and PLDI PC once, but I have a lot more > experience with LICS and CAV (also as PC Chair for both). > The problem with POPL (or LICS/CAV for that matter) initial reviews is > not the > quality (with some exceptions, most papers' contribution is very clear > from the reviews), > and also not the selective biases of individuals (which are a given, and > also, useful, > otherwise no evaluation would be possible), but rather that assignment > of letter grades > A/B/C/D in a distributed manner. For example, a clear technical advance > on a well-studied > problem may get a B or a C depending on the reviewer. This can make a huge > difference, and thus, the same paper rejected from one conference may > get accepted the > next time, making the process unpredictable. The goal of the PC meeting > is to correct > for this bias. But the physical meeting is not conducive to correcting > this. > For a given paper, the opinion of the person whose interests match most > closely with the paper, > counts more (but it should not: experts' reviews are useful, > not his/her biases on what to do with supposedly incremental, or supposedly > theoretical-that-will-never-work, or supposedly > practical-but-not-conceptually-deep papers). > Also, more vocal people get more influence. Time pressure impacts > decisions. > In practice, PC members are actively involved only in papers they have > been assigned, > maintaining the distributed nature of the process. > What one says on the spur of moment weighs more than what one writes > after careful > thought, editing, and sanity checks. > Thus, physical PC meeting adds unpredictable noise in the selection > process. > These are less of a problem in an electronic PC meeting. I think every PC > member needs to look at all the papers, and focus on selecting best X > submissions > based on reviews by applying his/her bias uniformly (and not just to > one's own pile). > This is easier to do on a longer time scale of electronic PC meeting. > Bottomline: not clear why POPL does not switch to electronic PC meeting. > > More dramatically: > I mentioned this to Jens after this year's POPL meeting: abolish the PC > (i.e. reduce its role > to a "reviewers committee" of an exapnded size). > Two or three co-chairs can collect reviews for each paper from those who > are real experts > on the subject. Then based on the reviews, make a decision applying fair > and uniform standards. > This is not as bad as it sounds. Jens indeed spent a lot of time > browsing through all submissions anyway, > and could have easily picked the papers after looking at the reviews. > Maybe a single person's bias would be detrimental, > but, say 3, would make the process better than it is now (and reduce the > cumulative amount > of time one would spend on POPL PC duties). > > best regards > --rajeev > > > > -- .\ Philip Wadler, Professor of Theoretical Computer Science ./\ School of Informatics, University of Edinburgh / \ http://homepages.inf.ed.ac.uk/wadler/ The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From Jeremy.Gibbons at comlab.ox.ac.uk Sat Jan 16 12:21:48 2010 From: Jeremy.Gibbons at comlab.ox.ac.uk (Jeremy.Gibbons@comlab.ox.ac.uk) Date: Sat, 16 Jan 2010 17:21:48 GMT Subject: [TYPES/announce] Spring School in Generic and Indexed Programming Message-ID: <201001161721.o0GHLmbY024289@merc3.comlab.ox.ac.uk> SPRING SCHOOL ON GENERIC AND INDEXED PROGRAMMING Wadham College, Oxford, 22nd to 26th March 2010 TOPIC "Generic programming" is about making programs more widely applicable via exotic kinds of parametrization - not just along the dimensions of values or of types, but of things such as the shape of data, algebraic structures, strategies, computational paradigms, and so on. "Indexed programming" is a lightweight form of dependently typed programming, constraining flexibility by allowing one to state and check relationships between parameters: that the shapes of two arguments agree, that an encoded value matches to some type, that values transmitted along a channel conforms to some protocol, and so on. The two forces of genericity and indexing balance each other nicely, simultaneously promoting and controlling generality. The EPSRC-funded Generic and Indexed Programming project at Oxford has been exploring their interaction over the period 2006 - 2010; this school is the closing activity of the project. LECTURERS Six lecturers from the Programming Languages community, each an acknowledged expert in their specialism, will cover various aspects of generic and indexed programming. Each will give about four hours' lectures, distributed throughout the week. Nate Foster (Princeton University) "Bidirectional Programming" Ralf Hinze (University of Oxford) "Generic Programming with Adjunctions" Oleg Kiselyov (Fleet Numerical Meteorology and Oceanography Center) "Typed Tagless Interpreters" Simon Peyton Jones (Microsoft Research Cambridge) "Type Functions" Jeremy Siek (University of Colorado at Boulder) "Concepts in C++" Stephanie Weirich (University of Pennsylvania) "Generic Programming with Dependent Types" PREREQUISITES The school is aimed at doctoral students in programming languages and related areas; however, researchers and practitioners will be very welcome, as will strong masters students with the support of a supervisor. It will be assumed that participants have a good understanding of typed functional programming, as in Haskell or O'Caml. DATES Registration deadline: 19th February School: 22nd March (0900) to 26th March (lunchtime) VENUE Lectures will be held and accommodation provided in Wadham College in the centre of Oxford. The college celebrates its 400th anniversary in 2010; notable past members include Sir Christopher Wren, the founder of the Royal Society, and notable present ones Marcus du Sautoy, the mathematician and TV presenter. COSTS Costs will be kept low, thanks to support from EPSRC. There will be a nominal registration fee, and B&B accommodation in college will be about £55 per night. (Precise costs are yet to be determined.) FURTHER INFORMATION Further information, including instructions on how to register, will be available soon at the website: http://www.comlab.ox.ac.uk/projects/gip/school.html From dreyer at mpi-sws.org Sat Jan 16 13:34:04 2010 From: dreyer at mpi-sws.org (Derek Dreyer) Date: Sat, 16 Jan 2010 19:34:04 +0100 Subject: [TYPES/announce] Proposed changes to POPL review process In-Reply-To: References: <4B4F38FC.7040507@seas.upenn.edu> Message-ID: <7fa251b71001161034x3d9d7a3k47868b6f402d67e9@mail.gmail.com> Hi, Phil. FWIW, the POPL'11 PC also discussed this issue in detail when deciding what kind of meeting we are going to hold this year. As you say, the issue split people down the middle. I thought it might be useful to summarize the main arguments that were given for physical vs. electronic meetings. (To clarify, by "electronic", I'm talking here about a week-long, online discussion through the conference management website, NOT a phone discussion, which most of the PC members pooh-poohed.) Main benefits of physical meeting: - Easier to get a "global" view of the submissions - PC members are more likely to contribute to the discussion of papers they didn't review - More effective use of PC members' "bandwidth", no delays in communication due to time zone differences - Excellent networking opportunity, esp. for more junior PC members - Much more fun, esp. for extroverts Main benefits of electronic meeting: - No travel costs, no jet lag, no carbon footprint - Longer, more careful and thorough discussion of papers (with the possibility of requesting additional expert reviews during the discussion) - Easier, more fun for non-native English speakers (as well as introverts) to participate In the end, the POPL'11 PC decided to have a 10-day electronic meeting followed by a 2-day physical meeting. Personally, I started the discussion strongly in favor of physical meetings, for all the reasons given above, but I found the arguments for electronic meetings to be compelling, and I sense that the future is electronic. Phil, concerning your comment that the advantages of electronic meetings become clearer in a context where more papers are accepted, I understand the argument but I don't think it's so clear-cut. You're right that there's less of a need for a "global" view in this case, because determining the "cut-off" point is less important. OTOH, getting a global view is still important for the purpose of normalizing the reviewing process. That is, one paper might get a B and 2 C's (and get rejected), and another might get an A and two B's (and get accepted), with the only difference being that the first paper had reviewers with low average scores and the second paper had reviewers with high average scores. To detect this problem, one cannot simply consider each paper independently, and so I think it is easier to detect in a physical meeting, given that more people pay attention to the discussion of each paper. But there may, of course, be purely electronic solutions. Best regards, Derek On Sat, Jan 16, 2010 at 4:39 PM, Philip Wadler wrote: > [ The Types Forum (announcements only), > ? ? http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > Following on from Rajeev Alur's e-mail, I want to make the following proposal: > > ?- Replace the POPL physical PC meeting with an electronic one. > > This proposal was discussed by the POPL Steering Committee, which was > split on the matter. ?Input from the community would be helpful. > > My experience matches Rajeev's. ?The process of a physical PC meeting > necessarily requires quick decisions, often based on who is most vocal > or an overnight reading of a paper. ?My experience of electronic > meetings is that the discussions can be more considered. ?I believe > the advantages of electronic meetings become clearer in a context > where more papers are accepted, so the decisions centre on 'Is this > paper of good quality?' rather than 'Is it better than the other > papers we've accepted?' > > In addition to the cogent points raised by Rajeev, I'll mention that > there is also the cost, particularly to the climate, of a physical > meeting. ?Typically, POPL has about 200 attendees and a PC of 25, so a > physical PC meeting increases the carbon footprint of the conference > by on the order of 10%. > > How does the community feel about a move to electronic PC meetings? > Yours, ?-- P > > > > On Thu, Jan 14, 2010 at 3:32 PM, Rajeev Alur wrote: >> [ The Types Forum (announcements only), >> ? ? http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] >> >> Dear Phil, >> It has been interesting to see all these responses to the two-phase >> proposal. I also think two-phase reviewing is not that great. >> One additional drawback I see is that getting rejection after the >> second phase will amplify the frustration (particularly for starting >> graduate students). >> I feel that low acceptance ratio of POPL is a desirable feature, it is >> critical >> to its reputation, and I would hate to see that go up significantly. >> As an aside, some people have essentially suggested that "since number >> of POPL papers impacts tenure, we should make it easy for researchers to >> publish in POPL". I do not find this argument compelling. In fact, I am >> not aware >> any committee counting this number. What matters is whether senior POPL >> researchers are impressed by your work, and given that POPL is selective, >> easiest way for someone to gain attention is by publishing >> papers in POPL. Fortunately, selection is based on merit, so this presents >> a clear recipe to draw attention to your work. If POPL is not selective, >> then the only way would be to be a student of a famous advisor. >> In fields such as control theory, top conferences such as CDC have >> high acceptance rates, and indeed good pedigree is a necessity. >> In any case, POPL review process should focus on selecting best papers >> and maintaining high quality, without worrying about other factors. >> >> More constructively: >> conferences such as LICS and CAV use electronic PC meeting. >> I have been on POPL PC once and PLDI PC once, but I have a lot more >> experience with LICS and CAV (also as PC Chair for both). >> The problem with POPL (or LICS/CAV for that matter) initial reviews is >> not the >> quality (with some exceptions, most papers' contribution is very clear >> from the reviews), >> and also not the selective biases of individuals (which are a given, and >> also, useful, >> otherwise no evaluation would be possible), but rather that assignment >> of letter grades >> A/B/C/D in a distributed manner. For example, a clear technical advance >> on a well-studied >> problem may get a B or a C depending on the reviewer. This can make a huge >> difference, and thus, the same paper rejected from one conference may >> get accepted the >> next time, making the process unpredictable. The goal of the PC meeting >> is to correct >> for this bias. But the physical meeting is not conducive to correcting >> this. >> For a given paper, the opinion of the person whose interests match most >> closely with the paper, >> counts more (but it should not: experts' reviews are useful, >> not his/her biases on what to do with supposedly incremental, or supposedly >> theoretical-that-will-never-work, or supposedly >> practical-but-not-conceptually-deep papers). >> Also, more vocal people get more influence. Time pressure impacts >> decisions. >> In practice, PC members are actively involved only in papers they have >> been assigned, >> maintaining the distributed nature of the process. >> What one says on the spur of moment weighs more than what one writes >> after careful >> thought, editing, and sanity checks. >> Thus, physical PC meeting adds unpredictable noise in the selection >> process. >> These are less of a problem in an electronic PC meeting. I think every PC >> member needs to look at all the papers, and focus on selecting best X >> submissions >> based on reviews by applying his/her bias uniformly (and not just to >> one's own pile). >> This is easier to do on a longer time scale of electronic PC meeting. >> Bottomline: not clear why POPL does not switch to electronic PC meeting. >> >> More dramatically: >> I mentioned this to Jens after this year's POPL meeting: abolish the PC >> (i.e. reduce its role >> to a "reviewers committee" of an exapnded size). >> Two or three co-chairs can collect reviews for each paper from those who >> are real experts >> on the subject. Then based on the reviews, make a decision applying fair >> and uniform standards. >> This is not as bad as it sounds. Jens indeed spent a lot of time >> browsing through all submissions anyway, >> and could have easily picked the papers after looking at the reviews. >> Maybe a single person's bias would be detrimental, >> but, say 3, would make the process better than it is now (and reduce the >> cumulative amount >> of time one would spend on POPL PC duties). >> >> best regards >> --rajeev >> >> >> >> > > > > -- > .\ Philip Wadler, Professor of Theoretical Computer Science > ./\ School of Informatics, University of Edinburgh > / ?\ http://homepages.inf.ed.ac.uk/wadler/ > > The University of Edinburgh is a charitable body, registered in > Scotland, with registration number SC005336. > > From Francois.Pottier at inria.fr Sat Jan 16 16:21:07 2010 From: Francois.Pottier at inria.fr (Francois Pottier) Date: Sat, 16 Jan 2010 22:21:07 +0100 Subject: [TYPES/announce] Proposed changes to POPL review process In-Reply-To: References: <4B4F38FC.7040507@seas.upenn.edu> Message-ID: <20100116212107.GB21419@yquem.inria.fr> On Sat, Jan 16, 2010 at 03:39:10PM +0000, Philip Wadler wrote: > My experience matches Rajeev's. The process of a physical PC meeting > necessarily requires quick decisions, often based on who is most vocal > or an overnight reading of a paper. My experience of electronic > meetings is that the discussions can be more considered. My experience is quite opposite. The physical PC meetings that I participated in were quite interesting and every paper was considered and discussed by the whole PC. During electronic meetings, on the other hand, I feel that I have no global understanding of what is going on, just a limited view of the papers that I have reviewed. The argument of cost (in time, money and carbon) is important, but otherwise I think a physical meeting wins hands down. Of course, it might be possible to use a combination of both modes (e.g. hold a preliminary electronic discussion before the physical meeting takes place; make sure every paper has received enough expert reviews, for instance). Best regards, -- Fran?ois Pottier Francois.Pottier at inria.fr http://gallium.inria.fr/~fpottier/ From vs at ecs.soton.ac.uk Sat Jan 16 16:57:23 2010 From: vs at ecs.soton.ac.uk (Vladimiro Sassone) Date: Sat, 16 Jan 2010 21:57:23 +0000 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <2e0980f31001121122s3866a338k9f1f21d2027a8189@mail.gmail.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <4B4C84B1.2070002@cs.mcgill.ca> <2e0980f31001121122s3866a338k9f1f21d2027a8189@mail.gmail.com> <2134A8F9-C9BE-4133-83B3-9E6FBC953311@ecs.soton.ac.uk> Message-ID: I wish to add to the discussion a brief marginal note on my experience with running ETAPS (www.etaps.org). ETAPS covers in five main parallel member conferences the aspects of design, engineering, programming, transformation and validation of software systems (and several more in about 20 satellite events). We have about 600 submission, between 550-650 participants, presentations of 30 mins, and acceptance rate of around 25-28%, which we believe guarantees high quality whilst being reasonably inclusive. The reality is that this works pretty well, and I personally think it is time for ETAPS to consider about expanding itself further. With best regards, V. Sassone (as chair of the ETAPS Steering Ctte) From mwh at cs.umd.edu Sat Jan 16 17:20:49 2010 From: mwh at cs.umd.edu (Michael Hicks) Date: Sat, 16 Jan 2010 17:20:49 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <20100116000943.C35C114CDDE@janeway.inf.tu-dresden.de> References: <20100113071830.9607414CD93@janeway.inf.tu-dresden.de> <7fa251b71001130255h2261c89cp41f4215e56328243@mail.gmail.com> <20100116000943.C35C114CDDE@janeway.inf.tu-dresden.de> Message-ID: <122694F5-6FFB-4E50-80B5-27F890DD49B6@cs.umd.edu> > It happened to me to review a short and very well written paper (for > a journal) whose claims looked to me absolutely impossible, > outrageous. After reading (= studying) the paper for days, I still > was in the dark, and had to dig out some older results the paper was > relying upon, and this took me weeks of study. The paper was right, > it was accepted, and it changed dramatically my own research ever > since. A fantastic idea. I wonder what I would have done of that > paper in 40 minutes. I don't know the paper, but I disagree with the implication that great papers will somehow be precluded from publication indefinitely if they are not immediately accepted. As Greg Morrisett previously noted, there are many other high-quality publication venues if the paper is not selected for POPL. Indeed, revision may be required to make the paper great. When I review a paper, I am interested in the technical idea in the paper *and* how well the paper communicates that idea to the reader. Indeed, these two things are tied together. As a rule of thumb, I've found that if I can't understand the basic idea and why it works, the novelty of the idea, and its potential impact within 40 minutes, there's reason to believe that POPL readers would be similarly vexed, give up on the paper, and thus get little from it. Understanding all of the technical details for the general case is another matter and will take longer; but the basic idea and approach should be clear enough after an hour. I have been in conversations with people who have complained that a particular published paper is not very deep/interesting/insightful/ etc. but after some discussion realize there is more to the paper than they thought, but the paper fails to communicate it clearly. Perhaps the paper could use better motivation, a few key examples, a careful description of an elided algorithm, better comparison to a related approach, ... whatever. As a reviewer, I try to suggest where I'm having trouble understanding the paper, how it could make its points better, etc. so the authors can revise accordingly. So while POPL PCs may not select eventually-great papers, I think it would be even more tragic for a paper to be published prematurely, and thus a potentially great idea not appreciated, especially when that idea could have been more widely understood after a round of revision. -Mike From Lists at Alessio.Guglielmi.name Sun Jan 17 04:26:56 2010 From: Lists at Alessio.Guglielmi.name (Alessio Guglielmi) Date: Sun, 17 Jan 2010 10:26:56 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <122694F5-6FFB-4E50-80B5-27F890DD49B6@cs.umd.edu> References: <20100113071830.9607414CD93@janeway.inf.tu-dresden.de> <7fa251b71001130255h2261c89cp41f4215e56328243@mail.gmail.com> <20100116000943.C35C114CDDE@janeway.inf.tu-dresden.de> <122694F5-6FFB-4E50-80B5-27F890DD49B6@cs.umd.edu> Message-ID: <20100117092703.1FBB414CDC8@janeway.inf.tu-dresden.de> Hello, At 17:20 -0500 16/1/10, Michael Hicks wrote: >>It happened to me to review a short and very well written paper >>(for a journal) whose claims looked to me absolutely impossible, >>outrageous. [...] I wonder what I would have done of that paper in >>40 minutes. > >I don't know the paper, but I disagree with the implication that >great papers will somehow be precluded from publication indefinitely >if they are not immediately accepted. [...] Indeed, revision may be >required to make the paper great. Actually, I didn't mean such an implication, and, as I said, the paper was brilliantly written. As a reviewer, I didn't ask for changes in the exposition, because it was already perfect. The paper was in proof theory/proof complexity, so, not really in the POPL scope, but still in computer science, and in particular in the range of interests of the TYPES list. The main reason why I'm discussing this issue here is because TYPES and my area intersect, and am worried by what I perceive as a cultural bias. >As a rule of thumb, I've found that if I can't understand the basic >idea and why it works, the novelty of the idea, and its potential >impact within 40 minutes, there's reason to believe that POPL >readers would be similarly vexed, give up on the paper, and thus get >little from it. I agree with what you say, except for one thing, the `why it works', and this is a very important point. So, let's use the example of our paper. One could understand in one minute what the paper was claiming, its novelty and its impact, and 40 minutes would suffice to understand the basic idea, in broad terms. However, its results would clash dramatically with my expectations, and indeed those of my community. This is one of those cases where one says `it cannot be true'. The only way to judge is to check the details, and this takes days or weeks of study because there's some serious mathematics behind. Suppose this masterfully-written paper is submitted to a 40-minute-review conference: should we accept it or not? I'd say YES if the conference is just for making ideas circulate and be discussed; I'd say NO if a conference accept is an important medal to be exhibited before a tenure committee, because we should make sure that tenured faculty actually prove what they claim. (Probably, and rightfully, in our paper's case, the author didn't even dream of sending his paper to a conference.) I suppose you see my point: 40-minute-reviewing is OK to judge whether an idea should be communicated, it's not OK to judge whether somebody is a good scientist (at least when some deep theory is involved). Unless, of course, we think that publishing at conferences is sufficient to define the good scientist. I think most disagree with it, but are we all aware that this is precisely the risk we are incurring? Isn't it obvious that our species is already perversely adapting to the conference environment? That the rule makers are more and more the products of the game? If the computer-science peculiar way to conferences gains even more ground, the important kind of research of our paper will be even more discouraged than it is already (which is a lot). We will also see more conference papers brilliantly communicating false results, and people making careers out of that (perhaps not at the top places, but below?). Expanding POPL (for example) means expanding the overall space for papers, because the expansion will trickle down the conference chain. This, unless the last conference down the chain closes (I bet it won't). Since nature abhors vacuum, more papers will be written; but we all are already at the limit of our working possibilities, so there will be even less serious reading. (By the way, I agree with Peyton-Jones that writing is tremendously important for clarifying ideas, but this doesn't mean that after writing a paper the best thing to do is to rush it out. The best is to rewrite, and then rewrite, certainly not until perfection, but definitely until maturity.) Anyway, expanding POPL means lowering the standards, plain and simply, perhaps not of POPL, but of the whole business. And what would the reason be? Because some are randomly denied the top medal? If conferences were just for communicating ideas, instead of being races, this would not be felt as much of a problem. This is not a problem of POPL, of course, but of the whole culture at play here. Let's say that some of its assumptions are politically incorrect towards the minority for which leks, as Prakash accurately called them, are not suited. Ciao, -Alessio From adamc at hcoop.net Sun Jan 17 07:32:14 2010 From: adamc at hcoop.net (Adam Chlipala) Date: Sun, 17 Jan 2010 07:32:14 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <20100117092703.1FBB414CDC8@janeway.inf.tu-dresden.de> References: <20100113071830.9607414CD93@janeway.inf.tu-dresden.de> <7fa251b71001130255h2261c89cp41f4215e56328243@mail.gmail.com> <20100116000943.C35C114CDDE@janeway.inf.tu-dresden.de> <122694F5-6FFB-4E50-80B5-27F890DD49B6@cs.umd.edu> <20100117092703.1FBB414CDC8@janeway.inf.tu-dresden.de> Message-ID: <4B53034E.1080308@hcoop.net> Alessio Guglielmi wrote: > However, its results would clash dramatically with my expectations, > and indeed those of my community. This is one of those cases where > one says `it cannot be true'. The only way to judge is to check the > details, and this takes days or weeks of study because there's some > serious mathematics behind. > This is one area where we can benefit from the shift towards machine-checked proofs that is already going on in this community. If the theorem were proved with a proof assistant, then one would only need to audit the theorem statement and the definitions it depends on. (Of course, understanding the structure of the argument would still be important, but not _as_ important.) It would take a significant culture change to reach the point where a proof isn't believed if it isn't machine-checked, but I wouldn't want to bet against the POPL community reaching that point in the next few decades. Because of that possibility, this particular reason in support of high time investment by reviewers may not need to be considered as fundamental. From aleks.nanevski at imdea.org Mon Jan 18 07:25:46 2010 From: aleks.nanevski at imdea.org (Aleksandar Nanevski) Date: Mon, 18 Jan 2010 13:25:46 +0100 Subject: [TYPES/announce] Openings at IMDEA-Software, Madrid, Spain Message-ID: <4B54534A.4000504@imdea.org> Openings at IMDEA Software, Madrid, Spain ******************************************* Background ************ The Madrid Institute of Advanced Studies (IMDEA) is a network of international research centers in the Madrid region of Spain for research of excellence in areas of high economic impact. The main focus of the Madrid Institute for Advanced Studies in Software Development Technologies (IMDEA Software) is to perform research of excellence required to devise methods that will allow the cost-effective development of software products with sophisticated functionality and high quality that are safe, reliable, and efficient. In order to achieve this goal IMDEA Software is gathering a critical mass of top international researchers and providing them with an ideal environment to perform their research. IMDEA Software is funded by the regional government of Madrid (Communidad de Madrid) with the task of becoming an international preeminent center of research. The focus of the Institute includes all aspects of the software development cycle (analysis, design, implementations, validation and verification), including methodologies, languages, and mechanisms. The Institute's distinguishing feature is its concentration on approaches that are rigorous and that, at the same time, allow building practical tools. IMDEA Software has recently hired world-class researchers in the areas of programming languages and type theory, formal methods, verification, static analysis, systems modeling and validation, and language-based security. The Institute intends to grow to about 100 scientific personnel (including postdoctoral scholars and PhD students) in five years and will be relocating to a new, state-of-the art building by late 2011. Salaries and research packages are competitive. The Institute offers an ideal work environment, open and collaborative, where researchers can focus on developing new ideas and projects. IMDEA-Software is located in the region of Madrid, Spain, with easy access to the lively cultural, sports, business and restaurant scenes of the city of Madrid. Madrid has recently hosted several international conferences, e.g., POPL 2010 and WWW 2009. The campus has excellent communication with both the airport as well as downtown Madrid by way of efficient public transit. Several major international airlines fly into Madrid. The city is well served by an excellent national high-speed train network. Openings ********** IMDEA-Software invites applications for (a) Tenure-track (Assistant Research Professor) and Tenured (Associate Research Professor and Research Professor) faculty positions (b) Postdoctoral fellowships (c) PhD fellowships (d) Research Internships in the broad area of rigorous technologies for software development. Please visit the websites http://software.imdea.org and http://software.imdea.org/open_positions/positions.html for more information (including application forms). The working language at IMDEA-Software is English. IMDEA-Software is an Equal Opportunity Employer and strongly encourages applications from a diverse and international community. IMDEA-Software complies with the European Charter for Researchers. From G.A.McCusker at bath.ac.uk Mon Jan 18 08:30:09 2010 From: G.A.McCusker at bath.ac.uk (Guy McCusker) Date: Mon, 18 Jan 2010 13:30:09 +0000 Subject: [TYPES/announce] PhD studies in Computer Science at Bath Message-ID: <29AC8758-CC33-489B-A157-11055CA49F65@bath.ac.uk> *** PhD studies in Logic and Semantics at Bath *** Applications are invited for PhD study in the Logic and Semantics of Computation research group at the University of Bath. Our staff include Alessio Guglielmi, Jim Laird, Guy McCusker and John Power. We welcome students interested in logic and proof theory, semantics of programming languages and proof systems, and category theory. The research publications of the Department of Computer Science at Bath were ranked 3rd in the UK at the 2008 Research Assessment Exercise. The department's other research interests include computer algebra, computational geometry, logic programming, computer vision and graphics, artificial intelligence, agents, and human-computer interaction. A wide range of funding opportunities, including full stipendiary studentships as well as scholarships and fee-waivers, is available, for studies commencing in October 2010. Every application will be considered for all eligible funding sources. The sooner you apply, the more opportunities are available. Please direct informal enquiries to G.A.McCusker at bath.ac.uk or visit http://www.bath.ac.uk/comp-sci/postgraduate/phd/ for application details. ----- Guy McCusker Professor of Computer Science Dept of Computer Science University of Bath Bath BA2 7AY United Kingdom +44 (0) 1225 383578 From Peter.Sewell at cl.cam.ac.uk Mon Jan 18 09:14:49 2010 From: Peter.Sewell at cl.cam.ac.uk (Peter Sewell) Date: Mon, 18 Jan 2010 14:14:49 +0000 Subject: [TYPES/announce] 3-year faculty position at Cambridge (Programming/Logic/Semantics) Message-ID: [Please draw this to the attention of any suitable applicants - thanks, Peter] http://www.admin.cam.ac.uk/offices/hr/jobs/vacancies.cgi?job=6156 Fixed Term Lectureship in Computer Science Faculty of Computer Science & Technology Vacancy Reference No: NR06156 Salary: £36,532-£46,278 Limit of tenure applies* FIXED-TERM LECTURESHIP IN COMPUTER SCIENCE Faculty of Computer Science & Technology Applications are invited for a Lectureship for a fixed term of three years to carry out research and teaching in the area of computer science centred on programming languages. The successful candidate will be expected to take up the appointment on 1 October 2010, or as soon as possible thereafter. The appointment has been created in connection with the award of an EPSRC Leadership Fellowship within the Laboratory. It is targeted at the core area of computer science that comprises language design, compilation, and program analysis, evolution, semantics, testing and verification. The successful candidate will contribute to one or more of these topics within the Laboratory's Programming, Logic and Semantics Research Group. Research group boundaries are very flexible and the successful candidate may also contribute to other areas of the Laboratory's work. The Laboratory provides an environment in which engagement between theoretical and practical aspects of Computer Science, and with industry, is encouraged. The person appointed will be expected to contribute to the teaching of the new M.Phil in Advanced Computer Science and to support undergraduate teaching in this key area. Further details of the Department can be found at http://www.cl.cam.ac.uk. Informal enquiries may be addressed to Professor Anuj Dawar, email Anuj.Dawar at cl.cam.ac.uk. Applications should be sent to The Secretary of the Appointments Committee, Computer Laboratory, 15 JJ Thomson Avenue, Cambridge CB3 0FD, UK so as to reach her by 28 February 2010. Applications may also be sent by e-mail (with documents in PDF format) to personnel-admin at cl.cam.ac.uk. Applications should include - a single document containing a Curriculum Vitae (resume), a list of publications, and a statement of research interests and future plans - a completed application form PD18 (parts I and III only) including the names and e-mail addresses of 3 referees Provisional Interview Date: 21 April 2010 * Limit of tenure: 3 years fixed-term. Closing date: 28 February 2010. Interview date: 21 April 2010. The University values diversity and is committed to equality of opportunity. The University has a responsibility to ensure that all employees are eligible to live and work in the UK. From david.delahaye at cnam.fr Mon Jan 18 13:20:21 2010 From: david.delahaye at cnam.fr (david.delahaye@cnam.fr) Date: Mon, 18 Jan 2010 19:20:21 +0100 (CET) Subject: [TYPES/announce] Calculemus 2010: First Call for Papers Message-ID: <33340.163.173.229.111.1263838821.squirrel@webmail.cnam.fr> [Apologies for cross-postings.] ----------------------------------------- CALCULEMUS 2010 - First Call for Papers ----------------------------------------- 17th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning CNAM, Paris, France, July 7-8, 2010 http://cicm2010.cnam.fr/calculemus/ Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and systems for mechanised reasoning, the interactive theorem provers or proof assistants (PA) and the automated theorem provers (ATP). Currently, symbolic computation is divided into several (more or less) independent branches: traditional ones (e.g., computer algebra and mechanised reasoning) as well as newly emerging ones (on user interfaces, knowledge management, theory exploration, etc.) The main concern of the Calculemus community is to bring these developments together in order to facilitate the theory, design, and implementation of integrated systems for computer mathematics that will routinely be used by mathematicians, computer scientists and engineers in their every day business. We seek original research papers for the upcoming Calculemus meeting, which will be held jointly with AISC 2010 and MKM 2010 (confederated in the Conferences on Intelligent Computer Mathematics, CICM 2010) in Paris (France). Topics of Interest ================== The scope of Calculemus covers all aspects of the interplay of mechanised reasoning and computer algebra, including cross-fertilisation between those two research areas, as well as the development of integrated systems that transcend both computer algebra and theorem proving. Potential topics of interest include: * Theorem proving in computer algebra (CAS) * Computer algebra in theorem proving (PA and ATP) * Case studies and applications that both involve computer algebra and mechanised reasoning * Representation of mathematics in computer algebra * Adding computational capabilities to PA and ATP * Formal methods requiring mixed computing and proving * Combining methods of symbolic computation and formal deduction * Mathematical computation in PA and ATP * Theory, design and implementation of interdisciplinary systems for computer mathematics * Infrastructure for mathematical services * Theory exploration techniques Papers on other topics closely related to the above research areas will also be welcomed for consideration. Submission ========== Theoretical and applied research papers on all topics within the scope of the symposium are invited. Submitted papers must be in English and must not exceed 15 pages for full papers and we suggest 10 pages for emerging trends extended abstracts (the upper limit is 20 pages, authors must provide at least a title and 200 word abstract). The title page should contain the title, author(s) with affiliation(s), e-mail address(es), listing of keywords and abstract. The program committee will subject all full papers submitted to a peer review. Emerging trends papers will be lightly reviewed. Results must be unpublished. Papers should be prepared in LaTeX and formatted according to the requirements of the Springer's LNAI series (the corresponding style files can be downloaded from http://www.springer.de/comp/lncs/authors.html and are the same for LNCS and LNAI). The web page for electronic submission is: http://www.easychair.org/conferences/?conf=calculemus2010 Proceedings =========== The proceedings of full papers of the conference will be published as a volume in the series Lecture Notes in Artificial Intelligence (LNAI) by Springer-Verlag. Extended abstracts on emerging trends will be published as a technical report of CEDRIC (CNAM/ENSIIE) and will be electronically available. Important Dates =============== For (reviewed) full paper submissions: Abstract submission: February 24, 2010 Submission deadline: March 3, 2010 Notification of acceptance: April 14, 2010 Camera ready copies due: April 28, 2010 For extended abstracts on emerging trends: Abstract submission: April 30, 2010 Submission deadline: May 7, 2010 Notification of acceptance: May 30, 2010 Camera ready copies due: June 7, 2010 The Calculemus conference is on July 7-8, 2009. Programme Committee =================== Markus Aderhold (TU Darmstadt, Germany) Arjeh Cohen (Eindhoven University of Technology, The Netherlands) Thierry Coquand (Chalmers University of Technology, Sweden) James H. Davenport (University of Bath, UK) David Delahaye (CNAM, France), Chair Lucas Dixon (University of Edinburgh, UK) William M. Farmer (McMaster University, Canada) Temur Kutsia (RISC, Austria) Assia Mahboubi (INRIA Saclay, France) Renaud Rioboo (ENSIIE, France), Chair Julio Rubio (Universidad de La Rioja, Spain) Volker Sorge (University of Birmingham, UK) Stephen M. Watt (University of Western Ontario, Canada) Freek Wiedijk (Radboud University Nijmegen, The Netherlands) Wolfgang Windsteiger (RISC, Austria) From Jean-Yves.Marion at loria.fr Tue Jan 19 02:54:28 2010 From: Jean-Yves.Marion at loria.fr (Jean-Yves Marion) Date: Tue, 19 Jan 2010 07:54:28 -0000 Subject: [TYPES/announce] (PN) [STACS] First Call for Participation Message-ID: ********************************************************************************* 27th International Symposium on Theoretical Aspects of Computer Science STACS 2010 - CALL FOR PARTICIPATION MARCH 4-6, 2010, NANCY, FRANCE http://stacs.loria.fr/ ******************************************************************************* INVITED SPEAKERS *********************** Mikolaj Bojanczyk, Warsaw University Rolf Niedermeier, University of Jena Jacques Stern, Ecole Normale Sup?rieure ACCEPTED PAPERS ************************ http://stacs.loria.fr/AcceptedPapers.html PROGRAM COMMITTEE *************************** Markus Bl?ser, Saarland University Harry Buhrman, CWI, University of Amsterdam Thomas Colcombet, CNRS, Paris 7 University Anuj Dawar, University of Cambridge Arnaud Durand, Paris 7 University S?ndor Fekete, Braunschweig University of Technology Ralf Klasing, CNRS, Bordeaux University Christian Knauer, Freie Universit?t of Berlin Piotr Krysta, University of Liverpool Sylvain Lombardy, Marne la Vall?e University Parthasarathy Madhusudan, University of Illinois Jean-Yves Marion, Nancy University (co-chair) Pierre McKenzie, Universit? de Montr?al Rasmus Pagh, IT University of Copenhagen Boaz Patt-Shamir, Tel Aviv University Christophe Paul, CNRS, Montpellier University Georg Schnitger, Frankfurt University Thomas Schwentick, TU Dortmund University (co-chair) Helmut Seidl, TU Munich Jir? Sgall, Charles University Sebastiano Vigna, Universit? degli Studi di Milano Paul Vitanyi, CWI, Amsterdam CONTACT : stacs at loria.fr ************************* -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100119/b1fc867d/attachment-0001.htm -------------- next part -------------- ---- [[ Petri Nets World: ]] [[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/ ]] [[ Mailing list FAQ: ]] [[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/pnml/faq.html ]] [[ Post messages/summary of replies: ]] [[ petrinet at informatik.uni-hamburg.de ]] From kutsia at risc.uni-linz.ac.at Tue Jan 19 06:08:21 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Tue, 19 Jan 2010 12:08:21 +0100 Subject: [TYPES/announce] CfP: PPDP 2010 Message-ID: <4B5592A5.4030101@risc.uni-linz.ac.at> ====================================================================== Call for Papers PPDP 2010 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming Hagenberg, Austria, 26-28 July 2010 (co-located with LOPSTR 2010) http://www.risc.uni-linz.ac.at/conferences/ppdp2010/ ====================================================================== PPDP 2010 aims to bring together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, AI languages and knowledge representation languages used, for example, in the semantic web. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analysing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. The conference will take place in July 2010 in the Castle of Hagenberg, Austria, colocated with the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2010), organised by the Research Institute for Symbolic Computation (RISC) of the Johannes Kepler University Linz. Topics: * Logic, Constraint, and Functional Programming * Database, AI and Knowledge Representation Languages * Visual Programming * Executable Specification Languages * Applications of Declarative Programming * Methodologies: 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 * Programming Environments The list above is not exhaustive - submissions describing new and interesting ideas relating broadly to declarative programming are encouraged. Submission guidelines: Papers should be submitted via the Easychair submission website for PPDP 2010: http://www.easychair.org/conferences/?conf=ppdp2010 Papers should consist of the equivalent of 12 pages under the ACM formatting guidelines. These guidelines are available online, along with formatting templates or style files. 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. No simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Proceedings: The proceedings will be published by ACM Press. Authors of accepted papers will be required to sign a copyright form. Camera ready papers for accepted papers should be prepared and submitted according to the final instructions that will be sent by the publisher after notification of acceptance. Invited Speakers: As in previous years, we are planning to include invited talks in the programme. Important Dates: # Submission: title and abstract: 15 March 2010 full paper: 21 March 2010 # Notification: 23 April 2010 # Final version: 12 May 2010 # Symposium: 26-28 July 2010 Programme Committee: Elvira Albert (Spain) Sergio Antoy (US) Frederic Blanqui (China) Michele Bugliesi (Italy) Giuseppe Castagna (France) Mariangiola Dezani (Italy) Francois Fages (France) Maribel Fernandez (UK), chair Joxan Jaffar (Singapore) Andy King (UK) Temur Kutsia (Austria) Francisco Lopez Fraguas (Spain) Ian Mackie (France) Henrik Nilsson (UK) Albert Rubio (Spain) Kazunori Ueda (Japan) Philip Wadler (UK) Symposium Chairs: Temur Kutsia and Wolfgang Schreiner (Austria) For more information, please contact the chairs: Maribel Fernandez King's College London, UK Email: Maribel.Fernandez at kcl.ac.uk Temur Kutsia and Wolfgang Schreiner Research Institute for Symbolic Computation Johannes Kepler University Linz Email: kutsia at risc.uni-linz.ac.at From simonpj at microsoft.com Tue Jan 19 12:08:11 2010 From: simonpj at microsoft.com (Simon Peyton-Jones) Date: Tue, 19 Jan 2010 17:08:11 +0000 Subject: [TYPES/announce] Reviewing for POPL: a concrete proposal In-Reply-To: References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <59543203684B2244980D7E4057D5FBC10AFA2016@DB3EX14MBXC306.europe.corp.microsoft.com> <59543203684B2244980D7E4057D5FBC10AFA2BE8@DB3EX14MBXC306.europe.corp.microsoft.com> <11BC7A81-4FAC-4440-A827-CDCABE147F21@cis.upenn.edu> <59543203684B2244980D7E4057D5FBC10AFA353E@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <59543203684B2244980D7E4057D5FBC10AFA54FE@DB3EX14MBXC306.europe.corp.microsoft.com> Gentle colleagues There has been a vigorous debate on the Types mailing list about acceptance rates and criteria for POPL. Phil Wadler, as SIGPLAN Chair, and a member of the POPL steering committee, asked me to present a concrete proposal for discussion at the POPL community meeting tomorrow. Thank you for the opportunity, Phil. The proposal appears below. I am sorry that I am missing the meeting this year. Enjoy POPL! Simon Reviewing for POPL: a concrete proposal ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ I will not repeat the details of the debate here, since you all have access to it: http://lists.seas.upenn.edu/pipermail/types-announce/2010/thread.html#1740 Instead, responding to Phil's request, I want to make single proposal That we use a "quality bar" rather than a "quantity bar" to govern acceptance for POPL. It is difficult to quantify just what "POPL-publishable quality" is, but I propose that it should be a level that, if it had been applied in recent years, would have resulted in an acceptance range in the region of 30%. The current norm is 16-23%. One data point is that ICFP typically accepts rather more than 30%, but the quality IMHO is still very high. (Historical figures for POPL, PLDI, and ICFP appear below) An alternative would to continue with a quantity bar, but increase it substantially, say from its current 35 to 50 papers. Personally I prefer a target acceptance rate because my gut feel is that the average quality does not change much year to year, whereas submission volume does. Regardless of the exact figure, I am advocating a sea change in our attitude to the POPL evaluation process, not just an incremental shift in policy. It is worth noting anecdotal evidence that individual POPL program chairs have tried and failed to get their committee to accept more papers. The idea is discussed, potential papers are brought up, but they are ultimately rejected. To achieve this change, if we want it, will take a broad community decision that gives a clear mandate to the program committee. With all that said, we can't tie the program committee's hands completely, by requiring them to accept N papers or X% of submissions; in the end we have to trust the PC. This proposal is not to restrict their discretion, but to give them a mandate. Reasons for this change (in brief) ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ * Fine, publishable papers are being rejected, which is bad for both authors and audience. Those papers are recycled at other conferences and workshop, where they increase the reviewing load (by being re-reviewed) and crowd out workshop-y papers. * Acceptance or rejection has a significant element of chance: it is very difficult for program committees to choose 35 out of 70 very good papers. Yet, partly because it is so competitive, acceptance at POPL has a strong effect on promotion and tenure committees. Having career-important decisions based on a chancy process seems wrong. * The pressure for slots makes it hard for a program committee to accept a ground-breaking but flawed paper over a more incremental but well-executed one. This is not a clear-cut issue, but many people (including me) think that the relentless pressure for slots forces program committees to err towards more conservative conference programmes. * It is a change that we can deliver. In contrast, arguing that journal publications should be valued more highly might be desirable, but is a cultural change that no one can guarantee to deliver. (However if POPL starts accepting more papers, a cultural change may well follow in due course.) Consequences of the change ~~~~~~~~~~~~~~~~~~~~~~~~~~ If this proposal were to be accepted, we would need to figure out how to accommodate many more papers at the physical meeting. How to achieve this is secondary to my main proposal, but a number of proposals have been floated, including * Parallel sessions * A lottery among accepted papers * Voting by conference registrants * Program committee decision I suggest that we invite the POPL steering committee to consider these and other possibilities, and make a proposal in due course. Background acceptance rates for POPL, PLDI, ICFP ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Source: http://people.engr.ncsu.edu/txie/seconferences.htm --------------------------------------------------- Year POPL PLDI ICFP --------------------------------------------------- 2008 35/212(16%) 34/184(18%) 29/87(33%) 2007 36/198(18%) 45/178(25%) 26/103(25%) 2006 33/167(20%) 36/169(21%) 24/74(32%) 2005 31/172(18%) 28/135(21%) 26/87(30%) 2004 29/176(16%) ?/?(20%) 21/80(26%) 2003 24/126(19%) 28/131(21%) 24/95(25%) 2002 28/128(22%) 28/169(17%) 24/76(32%) 2001 24/126(19%) 30/144(21%) 23/66(35%) 2000 30/151(20%) 30/173(17%) 24/110(22%) 1999 24/136(18%) 26/130(20%) 25/81(31%) 1998 31/175(18%) 31/136(23%) 30/70(39%) 1997 36/225(16%) 31/158(20%) 25/78(32%) 1996 34/148(23%) 28/112(25%) 25/83(30%) 1995 ? 28/105(27%) ? --------------------------------------------------- From dpw at CS.Princeton.EDU Wed Jan 20 00:54:25 2010 From: dpw at CS.Princeton.EDU (David Walker) Date: Wed, 20 Jan 2010 00:54:25 -0500 (EST) Subject: [TYPES/announce] Reviewing for POPL: a concrete proposal In-Reply-To: <973633032.910231263966608926.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> Message-ID: <1786066673.910331263966865113.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> > If this proposal were to be accepted, we would need to figure out how > to accommodate many more papers at the physical meeting. How to > achieve this is secondary to my main proposal, but a number of > proposals have been floated, including > > * Parallel sessions > * A lottery among accepted papers > * Voting by conference registrants > * Program committee decision I know this is secondary, but I want to make sure I get my two cents in: the only rational choice is to go to parallel sessions or to extend the length of the conference. I believe that voting, either by PC or conference registrants, has the potential to be much more unfair than current paper selection practice. If part of the voting explicitly depends upon answering the question "who will give a good talk?" as opposed to "what is the content of the paper" then this introduces an extreme bias towards old, famous, successful researchers and away from young, new, unheard of researchers and students. Whereas we now at least try to judge POPL papers purely on the merit of the current technical document, we would instead be veering away from that crucial principle. And the more we start asking personality-based questions such as "who will give a good talk," the more we may be susceptible to subconscious biases against various minorities (women, racial, etc) or the more we may try to overcompensate for such biases, resulting in reverse-discrimination. I also believe that lottery for talks is bad. What a lottery does is select some set of papers for which the talk audience is zero. With parallel sessions, the talk audiences will be smaller, but not zero. If I had a really great idea, I'd rather present it 6 months later at PLDI than have it appear 6 months earlier in the POPL proceedings, but not have the chance to give a talk. One last thing: while we may be getting all tied in knots over this popl review process right now, from what I've heard, within computer science, our community is really pretty great when it comes to selecting papers for inclusion in conferences based on their merits. I've heard of all kinds of dysfunctionality and biases and turf wars and sketchiness in other communities that we don't seem to be suffering from at all. Of course, that's probably because we're constantly working to try to make the process better and more fair to all. Cheers, Dave From alain.girault at inria.fr Wed Jan 20 05:35:12 2010 From: alain.girault at inria.fr (Alain Girault) Date: Wed, 20 Jan 2010 11:35:12 +0100 Subject: [TYPES/announce] Reviewing for POPL: a concrete proposal In-Reply-To: <1786066673.910331263966865113.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> References: <1786066673.910331263966865113.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> Message-ID: <4B56DC60.8060608@inria.fr> Dear all First, I completely agree with Simon's proposal. Then, concerning how to accommodate more papers at the conference, my preference also goes to solution A (i.e., parallel sessions). cheers Alain >> If this proposal were to be accepted, we would need to figure out how >> to accommodate many more papers at the physical meeting. How to >> achieve this is secondary to my main proposal, but a number of >> proposals have been floated, including >> >> * Parallel sessions >> * A lottery among accepted papers >> * Voting by conference registrants >> * Program committee decision > > I know this is secondary, but I want to make sure I get my two cents in: the only rational choice is to go to parallel sessions or to extend the length of the conference. > > I believe that voting, either by PC or conference registrants, has the potential to be much more unfair than current paper selection practice. If part of the voting explicitly depends upon answering the question "who will give a good talk?" as opposed to "what is the content of the paper" then this introduces an extreme bias towards old, famous, successful researchers and away from young, new, unheard of researchers and students. Whereas we now at least try to judge POPL papers purely on the merit of the current technical document, we would instead be veering away from that crucial principle. And the more we start asking personality-based questions such as "who will give a good talk," the more we may be susceptible to subconscious biases against various minorities (women, racial, etc) or the more we may try to overcompensate for such biases, resulting in reverse-discrimination. > > I also believe that lottery for talks is bad. What a lottery does is select some set of papers for which the talk audience is zero. With parallel sessions, > the talk audiences will be smaller, but not zero. If I had a really great idea, I'd rather present it 6 months later at PLDI than have it appear 6 months earlier in the POPL proceedings, but not have the chance to give a talk. > > One last thing: while we may be getting all tied in knots over this popl review process right now, from what I've heard, within computer science, our community is really pretty great when it comes to selecting papers for inclusion in conferences based on their merits. I've heard of all kinds of dysfunctionality and biases and turf wars and sketchiness in other communities that we don't seem to be suffering from at all. Of course, that's probably because we're constantly working to try to make the process better and more fair to all. > > Cheers, > Dave -- ------------- Alain GIRAULT http://pop-art.inrialpes.fr/~girault INRIA senior researcher tel: +(33|0) 476 61 53 51 Head of the POP ART project-team fax: +(33|0) 476 61 52 52 ----------------------------------------------------------------------------- Sauvons la Recherche ! http://www.sauvonslarecherche.fr ----------------------------------------------------------------------------- From doaitse at swierstra.net Wed Jan 20 10:34:55 2010 From: doaitse at swierstra.net (S. Doaitse Swierstra) Date: Wed, 20 Jan 2010 16:34:55 +0100 Subject: [TYPES/announce] Reviewing for POPL: a concrete proposal In-Reply-To: <4B56DC60.8060608@inria.fr> References: <1786066673.910331263966865113.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> <4B56DC60.8060608@inria.fr> Message-ID: The POPL event is actually a multi-event, with a lot of workshops around one main conference with top papers. One of the problems with refereeing is that first papers are sent to POPL and once rejected are resubmitted as a workshop paper. Notwithstanding the good work done by the POPL-PC's I know from my own experience that: - quite a number of papers submitted are probably not so excellent; but why not try since there always is a second chance at a more specialised event? - papers come form a large variety of subjects, and it is not always easy to find a sufficient number of informed PC members I can see a solution in which: - people initially/only submit to one of the more specialised conferences and workshops - the PC's of these conferences select the papers they think are of high quality and deserve to be presented to a wider community because they represent something new and interesting for everyone - the POPL PC constructs a nice single track conference out of these preselected papers, and there are no conferences scheduled in parallel when these papers are presented (e.g. in the morning) - the other events run in the afternoon and in parallel with the papers which were accepted by their PC's except those who made to the plenary POPL sessions. As a result we have more accepted papers, a better balanced program, automatic decisions about paralell session, and the committee has an easier job, since fewer and better papers have to be judged, and an initial review has already been done by the experts in the PC of the associated conferences. It also takes a bit of the gambling effect away. From my Haskell Symposium/ICFP experience I would rather have the HS PC select which are the best Haskell papers and send them one level up to the ICFP plenary forum, then to leave the selection to the ICFP PC. Given the broader scope of POPL I would expect this effect to be even stronger. Doaitse On 20 jan 2010, at 11:35, Alain Girault wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > > Dear all > > First, I completely agree with Simon's proposal. > Then, concerning how to accommodate more papers at the conference, > my preference also goes to solution A (i.e., parallel sessions). > > cheers > > Alain > >>> If this proposal were to be accepted, we would need to figure out >>> how >>> to accommodate many more papers at the physical meeting. How to >>> achieve this is secondary to my main proposal, but a number of >>> proposals have been floated, including >>> >>> * Parallel sessions >>> * A lottery among accepted papers >>> * Voting by conference registrants >>> * Program committee decision >> >> I know this is secondary, but I want to make sure I get my two >> cents in: the only rational choice is to go to parallel sessions or >> to extend the length of the conference. >> >> I believe that voting, either by PC or conference registrants, has >> the potential to be much more unfair than current paper selection >> practice. If part of the voting explicitly depends upon answering >> the question "who will give a good talk?" as opposed to "what is >> the content of the paper" then this introduces an extreme bias >> towards old, famous, successful researchers and away from young, >> new, unheard of researchers and students. Whereas we now at least >> try to judge POPL papers purely on the merit of the current >> technical document, we would instead be veering away from that >> crucial principle. And the more we start asking personality-based >> questions such as "who will give a good talk," the more we may be >> susceptible to subconscious biases against various minorities >> (women, racial, etc) or the more we may try to overcompensate for >> such biases, resulting in reverse-discrimination. >> >> I also believe that lottery for talks is bad. What a lottery does >> is select some set of papers for which the talk audience is zero. >> With parallel sessions, >> the talk audiences will be smaller, but not zero. If I had a >> really great idea, I'd rather present it 6 months later at PLDI >> than have it appear 6 months earlier in the POPL proceedings, but >> not have the chance to give a talk. >> >> One last thing: while we may be getting all tied in knots over >> this popl review process right now, from what I've heard, within >> computer science, our community is really pretty great when it >> comes to selecting papers for inclusion in conferences based on >> their merits. I've heard of all kinds of dysfunctionality and >> biases and turf wars and sketchiness in other communities that we >> don't seem to be suffering from at all. Of course, that's probably >> because we're constantly working to try to make the process better >> and more fair to all. >> >> Cheers, >> Dave > > > -- > ------------- > Alain GIRAULT http://pop-art.inrialpes.fr/~girault > INRIA senior researcher tel: +(33|0) 476 61 53 51 > Head of the POP ART project-team fax: +(33|0) 476 61 52 52 > ----------------------------------------------------------------------------- > Sauvons la Recherche ! http://www.sauvonslarecherche.fr > ----------------------------------------------------------------------------- From michaelw at cs.utwente.nl Thu Jan 21 10:16:12 2010 From: michaelw at cs.utwente.nl (Michael Weber) Date: Thu, 21 Jan 2010 16:16:12 +0100 Subject: [TYPES/announce] SPIN 2010 Call for Papers Message-ID: 17th International SPIN Workshop on Model Checking of Software (SPIN 2010) September 27--29, 2010, University of Twente, The Netherlands URL: Co-located with: ICGT 2010 , PDMC+HiBi 2010, Aim and Scope ============= The SPIN workshop is a forum for practitioners and researchers interested in state space-based techniques for the validation and analysis of software systems. The focus of the workshop is on theoretical advances and empirical evaluations based on explicit representations of state spaces, as implemented in the SPIN model checker or other tools, or techniques based on combinations of explicit and other symbolic representations. We welcome papers describing the development and application of state-space and path-exploration techniques for the testing and the verification of security-critical software, enterprise and web applications, embedded software, and other interesting software platforms. The workshop aims to encourage interactions and exchanges of ideas with all related areas in software engineering. Topics of Interest include (but are not limited to): ==================================================== * Algorithms and storage methods for explicit-state model checking * Theoretical and algorithmic foundations of model-checking based analysis * Directed model checking using heuristics * Parallel or distributed model checking * Model checking of timed and probabilistic systems * Abstraction and symbolic execution techniques in relation to software verification * Static analysis for state space reduction * Combinations of enumerative and symbolic techniques * Analysis for modeling languages, such as UML/state charts * Property specification languages, including new forms of temporal logic * Model checking for various programming languages and code analysis * Automated testing using state space and/or path exploration techniques * Derivation of specifications, test cases, or other useful material from state spaces * Combination of model-checking techniques with other analysis techniques * Modularity and compositionality * Comparative studies, including comparisons with other model-checking techniques * Case studies of interesting systems or with interesting results * Engineering and implementation of model-checking tools and platforms * Benchmarks for software verification Solicited Contributions ======================= We solicit two kinds of papers: * TECHNICAL PAPERS. These papers should contain original work which has not been submitted or accepted for publication elsewhere. Submissions should adhere to the LNCS format and should be no longer than 18 pages. * TOOL PAPERS. These papers should describe novel tools or tool extensions. If previous versions of the described tool have been published before, the novel features of the tool should be explained clearly. These papers should also specify availability of the tool, number of users, and applications/case studies. Tool paper submissions should consist of two parts. The first part is at most 5 pages in LNCS format. The name "Tool Presentation" should appear in the title. If accepted, this 5 page paper will be published in the workshop proceedings. The second part should describe an informal plan for the oral presentation of the tool. This part will not be included in the proceedings. If accepted, both regular and tool papers will be presented at the conference and will be included in the workshop proceedings. At least one author of each accepted paper is expected to be present at the conference. Submissions are held confidential until publication. Submission and Publication ========================== As in previous years, the proceedings of this edition of the workshop will appear in Lecture Notes in Computer Science. Important Dates =============== Abstract submission: April 9, 2010 Paper submission: April 16, 2010 Notification of acceptance: June 7, 2010 Final papers due: June 28, 2010 Workshop: September 27--29, 2010 ORGANIZATION ============ Program Chairs: Jaco van de Pol, U Twente, Netherlands Michael Weber, U Twente, Netherlands Program Committee: Dragan Bosnacki (TU Eindhoven, The Netherlands) Jiri Barnat (Masaryk University Brno, Czech Republic) Stefan Edelkamp (University of Bremen, Germany) Patrice Godefroid (Microsoft Research, Redmond, USA) Ganesh Gopalakrishnan (University of Utah, USA) Jan Friso Groote (TU Eindhoven, The Netherlands) Orna Grumberg (Technion, Israel) Gerard Holzmann (NASA/JPL, USA) Radu Iosif (Verimag Grenoble, France) Stefan Leue (University of Konstanz, Germany) Rupak Majumdar (University of California at Berkeley, USA) Eric G. Mercer (Brigham Young University, USA) Albert Nymeyer (University of New South Wales, Australia) Dave Parker (Oxford Univerisity, UK) Corina Pasareanu (CMU/NASA Ames, USA) Doron Peled (Bar-Ilan University, Israel) Paul Pettersson (Malardalen University, Sweden) Scott Stoller (Stony Brook University, USA) Willem Visser (Stellenbosch University, South Africa) Tomohiro Yoneda (National Institute of Informatics, Japan) Steering Committee: Susanne Graf, VERIMAG, France Gerard Holzmann, JPL, USA Stefan Leue (chair), U Konstanz, Germany Pierre Wolper, U Liege, Belgium -- Michael Weber University of Twente, The Netherlands http://fmt.cs.utwente.nl/~michaelw/ From peterol at ifi.uio.no Thu Jan 21 11:45:33 2010 From: peterol at ifi.uio.no (=?ISO-8859-1?Q?Peter_Csaba_=D6lveczky?=) Date: Thu, 21 Jan 2010 17:45:33 +0100 Subject: [TYPES/announce] CfP: Workshop on Rewriting Techniques for Real-Time Systems (Spitsbergen/polar bears/EPTCS proceedings) Message-ID: <6C21E039-A91A-49A8-8713-2A7AD80B8107@ifi.uio.no> 1st International Workshop on Rewriting Techniques for Real-Time Systems R T R T S 2010 Longyearbyen, Spitsbergen, Norway, April 6-9, 2010 http://rtrts10.ifi.uio.no/ *** Proceedings will be published by EPTCS *** IMPORTANT DATES February 24, 2010 Deadline for submission Early March, 2010 Notification of acceptance April 6-9, 2010 Workshop in Spitsbergen AIMS AND SCOPE The aim of the workshop is to bring together researchers with an interest in the use of rewriting-based techniques (including rewriting logic) and tools for the modeling, analysis, and/or implementation of real-time and hybrid systems, 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: - methods and tools supporting rewriting-based modeling and analysis of real-time and hybrid systems, and extensions of such systems; - use of rewriting techniques to provide rigorous support for model-based software engineering of timed systems; - applications and case studies; - comparison with other formalisms and tools. PROGRAM COMMITTEE Erika ?brah?m RWTH Aachen Francisco Dur?n Universidad de Malaga Narciso Marti-Oliet Universidad Complutense de Madrid Jos? Meseguer University of Illinois at Urbana-Champaign Sayan Mitra University of Illinois at Urbana-Champaign Thomas Noll RWTH Aachen Peter ?lveczky (chair) University of Oslo Joel Ouaknine Oxford University Olaf Owe University of Oslo Grigore Rosu University of Illinois at Urbana-Champaign Stavros Tripakis University of California, Berkeley Martin Wirsing Ludwig-Maximillian University, Munich VENUE RTRTS 2010 will be held in Longyearbyen, Spitsbergen. Spitsbergen is a fascinating archipelago pretty close to the North Pole (same latitude as northern Greenland!). April is the high season, with the sun above the horizon yet it should be wintry enough to do the usual winter activities, like dog sledding, snow scooter trips, and ice cave exploration, etc. Maybe this could be your last chance to see polar bears roaming around freely? SUBMISSIONS Submissions will be evaluated by the Program Committee for inclusion in the proceedings, which will be published by Electronic Proceedings in Theoretical Computer Science. 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 should not exceed 20 pages, formatted according to EPTCS guidelines (http://style.eptcs.org), and should be submitted electronically using Easychair: http://www.easychair.org/conferences/?conf=rtrts2010 INVITED SPEAKERS (to be announced) CONTACT INFORMATION For more information, please contact the organizer peterol at ifi.uio.no or visit the workshop web page http://rtrts10.ifi.uio.no/ From m.stannett at dcs.shef.ac.uk Thu Jan 21 15:22:54 2010 From: m.stannett at dcs.shef.ac.uk (Mike Stannett) Date: Thu, 21 Jan 2010 20:22:54 +0000 Subject: [TYPES/announce] CfP: Midlands Graduate School in the Foundations of Computing Science Message-ID: <4B58B79E.9010507@dcs.shef.ac.uk> Call for Participation MIDLANDS GRADUATE SCHOOL IN THE FOUNDATIONS OF COMPUTING SCIENCE (MGS 2010) 28.03.-01.04.2010, Sheffield, UK http://www.dcs.shef.ac.uk/~georg/mgs.html The MGS is the leading annual research training event in Theoretical Computer Science in the UK. We are widely known for our courses on the mathematical foundations of computing. Our main mission is advanced research training for PhD students, but our school is open for anyone. We have consistently been evaluated as excellent: All recent participants would recommend the school to others. The MGS addresses primarily PhD students in their first and second year. But we warmly welcome postdoctoral researchers, academics or industrial practitioners as well. Further information can be found at the MGS 2010 web site. PROGRAMME: The MGS is an intensive one-week training event. We offer nine courses with five hours of lectures plus exercise sessions. Invited Speaker: Lectures on Separation Logic Peter O'Hearn (Queen Mary, London) Introductory Courses: Category Theory Graham Hutton (Nottingham) Functional Programming Henrik Nilsson (Nottingham) Typed Lambda Calculi Eike Ritter (Birmingham) Advanced Courses: Domain Theory and Denotational Semantics Mart?n Escard? (Birmingham) Game Semantics and Applications Dan Ghica (Birmingham) Formal Languages and Group Theory Rick Thomas (Leicester) Protocol Verification Emilio Tuosto (Leicester) Quantum Topos Theory Steve Vickers (Birmingham) VENUE: The MGS 2010 will be hosted at the University of Sheffield. B&B accommodation is provided at the newly built Ranmoor Student Village. Sheffield is centrally located in the UK and easy to reach by train, air or car. Travel advice and general information for visitors can be found at the MGS 2010 web site. REGISTRATION: Registration fee: ?350 (incl accommodation) Registration deadline: 01.03.2010. Instructions on how to register can be found at the MGS 2010 web site. FURTHER INFORMATION: http://www.dcs.shef.ac.uk/~georg/mgs.html From asperti at cs.unibo.it Fri Jan 22 11:08:58 2010 From: asperti at cs.unibo.it (Andrea Asperti) Date: Fri, 22 Jan 2010 17:08:58 +0100 Subject: [TYPES/announce] MSCS Special Issue - Mechanization of Mathematics In-Reply-To: <1260973587.6056.71.camel@amelior> References: <1260973587.6056.71.camel@amelior> Message-ID: <4B59CD9A.6040405@cs.unibo.it> Mathematical Structures in Computer Science Special Issue on Advances and Perspectives in the Mechanization of Mathematics Guest Editors: Andrea Asperti and Jeremy Avigad Call for contributions Recent advances in automated reasoning and interactive theorem proving have made it possible to formalize and mechanically check substantial mathematical theorems, such as the prime number theorem, the four color theorem, and the Jordan curve theorem. In particular, a number of interactive proof assistants have been developed to help users manage libraries of definitions and theorems, and fill in the inferential details of a mathematical argument. Automated methods are also often used to verify calculations that are too long and complex to check by hand. As mathematical proofs become more complicated and, increasingly, rely on extensive calculation, this gives rise to an exciting interaction between traditional methods and computational means of verifying mathematical claims. The present issue is devoted to recent advances and new perspectives in this field, including descriptions of formalizations, thoughtful reflection on the future of the discipline, novel insights, innovative research directions, and critical assessments of the current state of the art. Deadlines Deadline for submissions: June 28, 2010 Author's notification: September 27, 2010 Submissions: All papers should be written in pdf and submitted via the EasyChair system, accessible at the following address: https://www.easychair.org/login.cgi?conf=mscsadvancesandperspectivesint Authors are invited to write their papers following the mscs instructions available in the MSCS guide for contributors downloadable here: http://assets.cambridge.org/MSC/MSC_ifc.pdf. Extended versions of work previously published in conference proceedings are eligible for submission but authors should make it clear how their submission improves upon the conference publication; in those cases where Cambridge University Press is not the publisher of the original conference proceedings, authors should take care to avoid infringing that publisher's copyright. Authors who wish to discuss potential submissions are encouraged to contact the guest editors. Papers should not be longer than 35 pages; shorter papers are obviously welcome. ------------------------------------------------------------ All informations can be found at the following web page: http://www.cs.unibo.it/~asperti/mscs -- Andrea Asperti & Jeremy Avigad From Bob.Coecke at comlab.ox.ac.uk Mon Jan 25 09:39:29 2010 From: Bob.Coecke at comlab.ox.ac.uk (Bob Coecke) Date: Mon, 25 Jan 2010 14:39:29 +0000 (GMT) Subject: [TYPES/announce] 6th Workshop on Categories, Logic and Foundations of Physics, Oxford, 9th March 2010 Message-ID: Dear all, The sixth workshop on: "Categories, Logic and Foundations of Physics" (CLP 6), http://categorieslogicphysics.wikidot.com/ will take place at: Oxford University Computing Laboratory Tuesday, 9th March 2010, 12:00 - 18:20. REGISTRATION: For logistic reasons, it would be helpful if you send us a quick email if you would like to take part. Many thanks! Our workshop series is aimed at nourishing research in the fields named in the title and at bringing together scientists from the different fields involved. The videos and slides of previous workshops plus a number of talks from other events are available from: http://categorieslogicphysics.wikidot.com/events The site is constantly growing. SPEAKERS AND SCHEDULE: Room 478: 12.00-12.50 Martin Hyland (Cambridge) http://www.dpmms.cam.ac.uk/~martin/ Lecture Theatre A: 14.00-14.50 Boris Zilber (Oxford) http://people.maths.ox.ac.uk/zilber/ 14:50-15.40 Pawel Blasiak (Krakow) http://www.ifj.edu.pl/~blasiak/ 15:40-16:10 Why n-categories? Panel discussion with Tom Leinster, Urs Schreiber and any other n-category cafe server who shows up: http://golem.ph.utexas.edu/category/ 16:40-17:30 Urs Schreiber (Hamburg) http://www.math.uni-hamburg.de/home/schreiber/ 17:30-18:20 Bertfried Fauser (Birmingham) http://www.cs.bham.ac.uk/~fauserb/ Please bring the workshop to the attention of others who might be interested. We are maintaining a mailing list so please let us know if you either wish to be removed from it or adjoined to it. Best regards, Andreas Doering and Bob Coecke. P.S.: Since both Andreas Doering, Jamie Vicary and newly recruited CLP'er Chris Heunen have all joined the Oxford University Computing Laboratory: http://web.comlab.ox.ac.uk/activities/quantum/ the entire CLP team is now located in one place. We hereby invite people at other (relatively easy to reach) institutions to host future CLP events. From Radu.Iosif at imag.fr Mon Jan 25 10:45:47 2010 From: Radu.Iosif at imag.fr (Radu Iosif) Date: Mon, 25 Jan 2010 16:45:47 +0100 Subject: [TYPES/announce] Post-doctoral position at VERIMAG, Grenoble, France Message-ID: <4B5DBCAB.3030703@imag.fr> [Apologies for multiple postings] The VERIMAG laboratory has a vacancy for a post-doctoral position on: Development of Automatic Techniques for Software Verification ========================================= *** Project description The goal of this project is the verification of C programs that are used to control safety-critical systems, such as power plants. A major problem is the scalability of existing verification techniques for programs with dynamic data structures. These techniques are capable nowadays of analyzing and finding bugs in toy programs of about 100 lines of code. In this project we aim, on one hand, at extending the existing verification techniques in order to deal with parallel programs handling singly-linked lists and array data structures. On the other hand, we aim at applying these techniques to real-life test cases, with sizes of several tens of thousands lines of C code. *** Research group The research will take place in the Distributed and Complex Systems group (http://www-verimag.imag.fr/~async/pv.html) of the research laboratory VERIMAG. The members of this group focus on a wide range of problems such as program verification, computer security, testing and synthesis, component-based development, etc. VERIMAG is an academic research laboratory affiliated with CNRS (French National Research Center), UJF (University Joseph Fourrier) and INPG (National Polytechnic Institute of Grenoble). *** Qualifications The applicants must have a PhD in Computer Science, with knowledge in at least one of the following fields: - logics, proof theory, arithmetic theories, linear integer programming - formal languages, automata theory - deductive or algorithmic verification (model checking) *** Job description The appointment is for one year, starting as soon as possible, with possibility of extension. The contract will be within the VERIDYC project of the ANR (French National Research Agency). More information at: http://www-verinew.imag.fr/VERIDYC.html The chosen candidate is expected to work on the implementation of a prototype using the Frama-C framework: http://frama-c.cea.fr/ Knowledge of the French language is not required. *** Contact For further information and applications, send email to Radu.Iosif at imag.fr From Dave.Clarke at cs.kuleuven.be Mon Jan 25 11:20:08 2010 From: Dave.Clarke at cs.kuleuven.be (Dave Clarke) Date: Mon, 25 Jan 2010 17:20:08 +0100 Subject: [TYPES/announce] Call for Papers: COORDINATION 2010 Message-ID: <201001251620.o0PGK8AU021631@leo.cs.kuleuven.be.> An embedded and charset-unspecified text was scrubbed... Name: not available Url: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100125/6d7b0ff9/attachment.ksh From troina at di.unito.it Mon Jan 25 12:03:43 2010 From: troina at di.unito.it (Angelo Troina) Date: Mon, 25 Jan 2010 18:03:43 +0100 Subject: [TYPES/announce] CS2Bio'10 - Second Call for Papers (Invited Speakers Updated) Message-ID: <035E6D3B-9859-4754-9F63-A4D33AA9590C@di.unito.it> ====================================================================== Second call for papers CS2Bio'10 1st International Workshop on Interactions between Computer Science and Biology Affiliated to DisCoTec'10 10th of June 2010 Amsterdam, Netherlands http://cs2bio10.di.unito.it/ ====================================================================== Systems Biology is a stimulating field of application for computer scientists and a promising resource for biologists. The scope of this workshop is to gather researchers in formal methods that are interested at the convergence between Computer Science with Biology and life sciences. In particular, we solicit contribution of original results that address on both theoretical (modelling, analysis, and validation techniques) and applied aspects of biological behaviour: from the representation of biological scenarios to the validation and testing of relevant biological properties and the related simulations and development tools. *** SCOPE *** The scope is to include theoretical and applied aspects of concurrent and distributed systems in the modelling, analysis, simulation and validation of biological properties. The workshop intends to attract researchers interested in models, verification, tools, and programming primitives concerning such complex interactions. We strongly encourage the submission of works carried on in collaboration between computer scientists and biologists. Topics of interest include, but shall not be limited to: Formal Biological Modelling: - Formal methods for the representation of biological systems (rewrite systems, process calculi, graph grammars, hybrid systems, etc.); - Theoretical links and comparisons between different formal models for the modelling of biological processes; - Quantitative (probabilistic, timed, stochastic, etc.) languages and calculi; - Spatial (geometrical, topological) languages and calculi. Formal Testing and Validation of Biological Properties: - Prediction of biological behaviour from incomplete information; - Model Checking, Abstract Interpretation, Type Systems, etc. Tools and Simulations: - Modelling, analysis and simulation tools for systems biology; - Emergence of properties in complex biological systems; - Tools for parallel, distributed, and multi-resolution simulation methods; - Detailed biological case-studies. *** INVITED SPEAKERS *** - Luca Cardelli (Microsoft Research - Cambridge, UK) - J?r?me Feret (INRIA and ?cole Normale Sup?rieure - Paris, France) *** SUBMISSION GUIDELINES *** Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Authors should submit their papers via EasyChair (http://www.easychair.org/conferences/?conf=cs2bio10). Papers should take the form of a pdf file in ENTCS style and should not exceed 12 pages. If necessary, detailed proofs or other additional material can be added in an appendix (referees might review it at their discretion). We also encourage the submission of short papers, limited to 7 pages, presenting new tools or platforms for the modelling of biological systems. *** DISSEMINATION *** The post-proceedings of the workshop will be published in a volume of the Electronic Notes on Theoretical Computer Science series (Elsevier ENTCS). The quality of the received papers permitting, publication in a special issue of Mathematical Structures in Computer Science, with a second round of reviews, is planned. *** IMPORTANT DATES *** - Submission deadline: 19 March 2010 - Reviews due: 23 April 2010 - Notification to authors: 30 April 2010 - Workshop: 10 June 2010 *** PROGRAM COMMITTEE *** - Luca Cardelli - Gabriel Ciobanu - Mario Coppo - Ferruccio Damiani - Vincent Danos - Erik de Vink - Mariangiola Dezani - Fran?ois Fages - J?r?me Feret - Walter Fontana - Russ Harmer - Jane Hillston - Jean Krivine (Co-chair) - Giancarlo Mauri - Emanuela Merelli - Paolo Milazzo - Gethin Norman - Ion Petre - Angelo Troina (Co-chair) - Verena Wolf - Gianluigi Zavattaro From moggi at disi.unige.it Wed Jan 27 02:30:19 2010 From: moggi at disi.unige.it (moggi@disi.unige.it) Date: Wed, 27 Jan 2010 08:30:19 +0100 (CET) Subject: [TYPES/announce] ICTCS 2010 preliminary CFP Message-ID: <20100127073019.9079435D86@mailstore.csita.unige.it> Preliminary Call for Papers 12th Italian Conference on Theoretical Computer Science (ICTCS 2010) Camerino, Italy, September 15-17, 2010 http://www.cs.unicam.it/ictcs2010 ICTCS 2010 provides a forum for the exchange of ideas among researchers, and it aims to foster an environment, where junior researchers and PhD students can gain experience in presenting their work, broaden their views on the subject, and benefit from contact with more established researchers. Also researchers from outside Italy are welcome to submit papers and attend the Conference. The Scientific and Organizing Committee welcomes contributions in any area of Theoretical Computer Science. These contributions could describe - original works, that the authors may want to submit to a post-conference special issue; - original works submitted or accepted somewhere else, that the authors wish to publicize at ICTCS; - works in progress, on which the authors wish to get feedback at ICTCS. INVITED SPEAKERS Marco Bernardo (Univ. di Urbino) Stefano Crespi-Reghizzi (Poli. di Milano) Rossella Petreschi (Sapienza Univ. di Roma) IMPORTANT DATES Submission Deadline: May 20 Notification of Acceptance: June 20 Early registration deadline: July 30 Conference: September 15-17 SUBMISSIONS. Authors are invited to submit electronically an extended abstract (in pdf format), not exceeding four single spaced pages. The Scientific and Organizing Committee is considering the publication of a postconference special issue in the Journal Theoretical Informatics and Applications. For additional information, please refer to the conference web page. Further queries concerning submissions for presentation at ICTCS or to the special issue can be sent to ictcs2010 at easychair.org ICTCS is hosted by Camerino University. Camerino is an historical town in the Center of Italy, known and respected since Roman times, which became particularly important in the middle-age. Camerino is located in hilly surroundings (Marche Region), between the spectacular Appennini mountains and the pleasant Adriatic coast. SCIENTIFIC AND ORGANIZING COMMITTEE Marcella Anselmo (Univ. di Salerno) Tiziana Calamoneri (Sapienza Univ. di Roma) Flavio Corradini (Univ. di Camerino) Emanuela Merelli (Univ. di Camerino) Eugenio Moggi (Univ. di Genova) From bove at chalmers.se Wed Jan 27 04:07:40 2010 From: bove at chalmers.se (Ana Bove) Date: Wed, 27 Jan 2010 10:07:40 +0100 Subject: [TYPES/announce] PAR 2010: First CFP Message-ID: <4B60025C.7040502@chalmers.se> Please distribute to those you might think are interested. ======================================================================== 1st Call for Papers PAR 2010 Workshop on Partiality And Recursion in Interactive Theorem Provers Edinburgh, UK, 15 July 2010 (satellite workshop of ITP'10) a mid-FLoC 2010 workshop ======================================================================== PAR'10 workshop is a venue for researchers working on new approaches to cope with partial functions and terminating general (co)recursion in theorem provers. Theorem provers with inductive types provide a restricted programming language together with a formal meta-theory for reasoning about the language. When propositions are represented as types and proofs as programs, non-terminating proofs are disallowed for consistency and decidability of type checking. As a result, there is no trivial way to represent partial functions, and termination is syntactically ensured by imposing that the recursive calls must be made on structurally smaller arguments. Similar issues exist for productivity of functions on infinite objects where syntactic methods are used to ensure an infinite flow of data. The workshop aims to address these issues and various approaches for dealing with them. We invite submissions on all aspects of partiality and termination of general (co)recursive functions in a logical framework. The topics of this workshop include but are not limited to: * partial functions and functions over partial objects in theorem provers; * specialised type systems for general (co)recursion; * syntactical tests to guarantee termination of general recursive functions; * syntactical tests to guarantee productivity of functions on infinite objects; * methods to ensure termination of special classes of recursion definitions, eg nested recursion, simultaneous inductive-recursive data types and functions; * semantic approaches to termination and productivity, eg based on domain theory and topology; * categorical approaches to termination and productivity; * algebra of programming with partial functions and general (co)recursion. Description of software tools and case studies for dealing with the issues in the scope of the workshop are welcome. Submissions ----------- The articles will be evaluated by the PC for publication in the proceedings of the workshop. The final proceedings will be published after the workshop as a special issue of EPTCS and a preliminary version will be available during the workshop. The articles must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. Submissions should preferably not exceed 16 pages (excluding bibliography). Submissions must be prepared in LaTeX using the EPTCS macro package . The web-based system EasyChair will be used for submission (). Important dates --------------- * 29 March 2010: Submission deadline * 29 April 2010: Notification of acceptance * 24 May 2010: Final version of accepted papers * 15 July 2010: the workshop Invited Speakers ---------------- * Conor McBride (University of Strathclyde) * TBA Programme Committee ------------------- Andreas Abel (Ludwig Maximilians University Munich, D) Yves Bertot (INRIA Sophia-Antipolis, FR) Ana Bove (Chalmers University of Technology, SE) Ekaterina Komendantskaya (University of St Andrews, UK) Ralph Matthes (IRIT Toulouse, FR) Milad Niqui (CWI, NL) Anton Setzer (Swansea University, UK) Organisers ---------- Ana Bove Ekaterina Komendantskaya Milad Niqui From Maribel.Fernandez at kcl.ac.uk Wed Jan 27 08:45:05 2010 From: Maribel.Fernandez at kcl.ac.uk (Maribel Fernandez) Date: Wed, 27 Jan 2010 13:45:05 +0000 Subject: [TYPES/announce] CFP UNIF 2010 at FLoC (Edinburgh, 14 July) In-Reply-To: <4909F8C4.7020903@kcl.ac.uk> References: <4909F8C4.7020903@kcl.ac.uk> Message-ID: <4B604361.2010501@kcl.ac.uk> Call for Papers UNIF 2010 24th International Workshop on Unification 14 July 2010, Edinburgh, UK A FLoC workshop associated to RTA and IJCAR http://www.dcs.kcl.ac.uk/staff/maribel/UNIF.html ============================================================== This workshop promotes research and collaboration in the area of unification theory and related fields, including constraint solving and applications of unification to theorem proving and programming languages. It encourages the presentation of new directions, developments and results, as well as tutorials on existing knowledge in this area. Topics of interest include, but are not restricted to: * General E-unification and calculi * Narrowing * Matching algorithms * Special unification algorithms * Higher-order and nominal unification * Constraint solving * Disunification * Combination problems * Complexity analysis * Implementation techniques * Applications: type checking and reconstruction, automated theorem proving, programming language design, etc. System descriptions and demonstrations are also welcome. SUBMISSION GUIDELINES The submission is in two stages. 1)Before the workshop, authors are invited to submit an abstract (max. 5 pages) in pdf format, using the Easychair submission site. Accepted abstracts will be presented at the workshop and included in the preliminary proceedings, available at the workshop. 2) After the workshop, authors will be invited to submit a paper based on their presentation, which will be refereed for inclusion in the final workshop proceedings published by EPTCS. We also invite authors to submit a 5 page abstract describing relevant work that has been or will be published elsewhere, or work in progress. Submissions in this class will be only considered for presentation at the workshop and inclusion in the preliminary proceedings but not in the final proceedings. IMPORTANT DATES # Submission: 28 March 2010 # Notification: 23 April 2010 # Preliminary proceedings version due: 16 May 2010 # Workshop: 14 July 2010 # Submission for final proceedings: 12 September 2010 # Notification: 7 November 2010 # Final version: 5 December 2010 PROGRAMME COMMITTEE Maribel Fernandez (UK), chair Temur Kutsia (Austria) Jordi Levy (Spain) Christopher Lynch (US) Cathy Meadows (US) Gianfranco Rossi (Italy) Laurent Vigneron (France) For more information, please contact Maribel Fernandez King's College London, UK Email: Maribel.Fernandez at kcl.ac.uk From katoen at cs.rwth-aachen.de Thu Jan 28 06:51:03 2010 From: katoen at cs.rwth-aachen.de (Joost-Pieter Katoen) Date: Thu, 28 Jan 2010 12:51:03 +0100 Subject: [TYPES/announce] ETAPS 2010: Call For Participation Message-ID: <4B617A27.702@cs.rwth-aachen.de> [We apologise for multiple copies.] ==================================================================== CALL FOR PARTICIPATION: ETAPS 2010 *** 5 Conferences, 19 Workshops, 4 Tutorials *** European Joint Conferences on Theory And Practice of Software March 20 - March 28, 2010 Paphos, Cyprus http://www.etaps.org http://www.etaps10.cs.ucy.ac.cy/ ==================================================================== -- REGISTRATION -- For online registration, please visit http://www.etaps10.cs.ucy.ac.cy/ and click on the menu item "Registration". The early registration deadline is *February 15, 2010*, and the normal registration deadline is February 28, 2010. -- ABOUT ETAPS -- The European Joint Conferences on Theory and Practice of Software (ETAPS) is the primary European forum for academic and industrial researchers working on topics relating to Software Science. ETAPS, established in 1998, is a confederation of five main annual confe- rences, accompanied by satellite workshops and other events. ETAPS 2010 is the thirteenth event in the series. -- THE HOST CITY: PAPHOS, CYPRUS -- The west coast town of Paphos, with its pleasant harbour and medieval fort, combines a cosmopolitan holiday resort, spectacular countryside and historical sites. With a population of just 28.000 inhabitants, Paphos nestles in the lee of the Western Troodos Mountains and close to the Akamas National Park which add another dimension to this area of scenic beauty. Paphos has an air of holiday charm combined with history, and olden-day elegance is lent to the town by its classical style buildings in the upper part of town which leads to the shopping area. The lower part of the town has a life of its own, down near the sea, home of the harbour, the fish taverns, souvenir shops and several hotels with important archaeological sites around them. Paphos was the island's capital, and it is famous for the remains of the Roman Governor's palace, where extensive, fine mosaics are a major tourist attraction. The town of Paphos is included in the official UNESCO list of cultural and natural treasures of the world's heritage. ETAPS 2010 is organized by the University of Cyprus and will take place at the Coral Beach Hotel and Resort in Paphos, Cyprus, a 5-start hotel overlooking the golden sandy beaches and sparkling waters of Coral bay and adjacent to the Akamas National Park. For more information about Paphos, please visit the Cyprus Tourism Organization website: http://www.visitcyprus.com/wps/portal For travel information, please consult the ETAPS'10 website: http://www.etaps10.cs.ucy.ac.cy/ -- MAIN CONFERENCES -- - CC: International Conference on Compiler Construction ( http://www.cs.ucr.edu/~gupta/CC%202010.htm ) - ESOP: European Symposium on Programming ( http://research.microsoft.com/en-us/um/people/adg/ESOP2010/ ) - FASE: Fundamental Approaches to Software Engineering ( http://www.mathematik.uni-marburg.de/~swt/fase2010/ ) - FOSSACS: Foundations of Software Science and Computation Structures ( http://users.comlab.ox.ac.uk/luke.ong/FoSSaCS2010/ ) - TACAS: Tools and Algorithms for the Construction and Analysis of Systems ( http://tacas10.in.tum.de/ ) -- INVITED SPEAKERS -- Mark Harman (KCL, UK) Jim Larus (MSR, Redmond USA) Dave Naumann (Stevens, USA) Jean-Francois Raskin (Brussels, Belgium) Joseph Sifakis (IMAG, France) Colin Stirling (Edinburgh, UK) Philip Wadler (Edinburgh, UK) -- SATELLITE EVENTS -- The ETAPS 2010 satellite events comprise of workshops and tutorials which will be held on the Saturday/Sunday (March 20/21) before and the Saturday/Sunday (March 27/28) after the main conferences. WORKSHOPS - ACCAT, Applied and Computational Category Theory - ARSPA-WITS, Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security - BYTECODE, Bytecode Semantics, Verification, Analysis and Transformation - CMCS, Coalgebraic Methods in Computer Science - COCV, Compiler Optimization Meets Compiler Verification - DCC, Designing Correct Circuits - DICE, Developments in Implicit Computational Complexity - FBTC, From Biology to Concurrency and back - FESCA, Formal Engineering approaches to Software Components and Architectures - FOSS-AMA, Free and Open Source Software - for Accessible Mainstream Applications - GaLoP, Games for Logics and Programming Languages - GT-VMT, Graph Transformation and Visual Modeling Techniques - LDTA, Language Descriptions, Tools and Applications - MBT, Model-Based Testing - PLACES, Programming Language Approaches to Concurrency and Communication-cEntric Software - QAPL, Quantitative Aspects of Programming Languages - SafeCert, Certification of Safety-Critical Software Controlled Systems - WGT, Workshop on Generative Technologies - WRLA, Workshop on Rewriting Logic and its Applications TUTORIALS * Uncertainty Modeling in Cyber-Physical Systems (Manuela Bujorianu) * Security, specification and refinement (Annabelle McIver) * Executable Models of Gene Regulatory Networks (Wan Fokkink) * The DisCoVeri continues ... (On the Application of Concurrency Theory to Fault-Tolerant Distributed Algorithms) (Uwe Nestmann) Additional information about the satellite events is available on the ETAPS web page: http://www.etaps10.cs.ucy.ac.cy/ -- FURTHER INFORMATION AND ENQUIRIES -- ETAPS 2010 is organised by the Dept. of Computer Science, University of Cyprus. For further information, do not hesitate to contact the Local Organisers at the following address: etaps10 at cs.ucy.ac.cy From pierre.geneves at inria.fr Thu Jan 28 08:13:13 2010 From: pierre.geneves at inria.fr (Pierre Geneves) Date: Thu, 28 Jan 2010 14:13:13 +0100 Subject: [TYPES/announce] Postdoctoral position at INRIA Grenoble, France Message-ID: <4B618D69.5040306@inria.fr> Applications are invited for a postdoctoral position at INRIA Grenoble, France. The appointment will be in the areas of programming languages, computational logic, and program analysis and verification. The selected candidate will be expected to conduct research on some of the following topics: * the design of logics for reasoning about programs manipulating tree-shaped structures * the implementation of satisfiability solvers for such logics, and * the use of the implemented systems in building type-checkers and reasoners for actual programs. The WAM project seeks to establish logical foundations and automated reasoning techniques with applications concerning, but not limited to, static analysis of programs manipulating XML documents, pointer and heap analysis, program verification. Information about previous relevant research is available online: http://wam.inrialpes.fr/web-solver/webinterface.html The position is under the supervision of Nabil Layaida (INRIA) and Pierre Geneves (CNRS). Applicants should have interests in programming languages, type theory, and/or mathematical logic, with a concern in the intersection of theory and practice. Expertise in the following areas are particularly welcomed: - program analysis - formal methods - automated reasoning The fellowship is offered for a period of up to 16 months and can start as soon as possible, depending on the candidate availability. A prerequisite for employment is a doctoral degree in Computer Science or closely related field. Applications should include: - detailed curriculum vitae, in pdf format - copies of relevant publications, or url-pointers to them - the names of at least 2 referees - a statement outlining the applicant's suitability to the project. Applications should be sent to Nabil Layaida and Pierre Geneves . Informal enquiries about the position are welcomed. From cesar.a.munoz at nasa.gov Thu Jan 28 10:32:58 2010 From: cesar.a.munoz at nasa.gov (Munoz, Cesar Augusto (LARC-D320)) Date: Thu, 28 Jan 2010 09:32:58 -0600 Subject: [TYPES/announce] 2nd Call for Papers IWS2010 In-Reply-To: Message-ID: 2nd CALL FOR PAPERS International Workshop on Strategies in Rewriting, Proving, and Programming IWS 2010 iws2010.inria.fr (A satellite workshop of FLoC 2010) July 9 2010, Edinburgh, UK *** IMPORTANT DATES *** Abstract submission: March 26, 2010 Notification date: April 11, 2010 Abstract final version: April 25, 2010 Workshop: July 9, 2010 Submission of full paper for the proceedings: September 5, 2010 Strategies are ubiquitous in programming languages, automated deduction and reasoning systems, yet only since about ten years have they been studied in their own right. In the two communities of Rewriting and Programming on one side, and of Deduction and Proof engines (Provers, Assistants, Solvers) on the other side, workshops have been launched to make progress towards a deeper understanding of the nature of strategies, their descriptions, their properties, and their usage, in all kinds of computing and reasoning systems. Since more recently, strategies are also playing an important role in rewrite-based programming languages, verification tools and techniques like SAT/SMT engines or termination provers. Moreover strategies have come to be viewed more generally as expressing complex designs for control in computing, modeling, proof search, program transformation, and access control. Possible topics to address in this workshop include: * Foundations for the definition and semantic description of strategies: models of search spaces, logical or mathematical formalisms to define strategies and prove properties about them. * Properties of strategies and corresponding computations: logical or mathematical formalisms to prove properties about them. * Analysis and optimization techniques for strategies: analysis of the search space, evaluation and comparison of strategies. * Integration of strategic deductions and/or strategic computations: interrelations, combinations and applications of deduction and computation under different strategies, control issues and strategies in the integration of systems, strategies in decision procedures for SMT. * Strategy languages: essential constructs, meta-level features. Definition, design, implementation and application. Comparison of strategies in (existing) systems. * Concrete types of (reduction/evaluation) strategies in rewriting and programming, lambda calculi, normalization, narrowing, constraint solving, as well as their properties and characteristics (complexity, decidability, ...). * Applications and case studies in which strategies play a major role. FLoC 2010 provides an excellent opportunity to foster exchanges between the communities of Rewriting and Programming on one side, and of Deduction and Proof engines on the other side. This workshop is a joint follow-up of two series of workshops, held since 1997: the Strategies workshops held by the CADE-IJCAR community and the Workshops on Reduction Strategies (WRS) held by the RTA-RDP community. Submissions ---------- The submission process is in two stages. 1) Before the workshop, authors are invited to submit an extended abstract (max. 5 pages) to be formatted in the EasyChair class style http://www.easychair.org/easychair.zip through the EasyChair submission site: http://www.easychair.org/conferences/?conf=iws2010 Accepted abstracts will be presented at the workshop and included in the preliminary proceedings, available at the workshop. 2) After the workshop, authors will be invited to submit a full paper of their presentation (typically a 15-pages paper), which will be refereed and considered for publication in the electronic journal: Electronic Proceedings in Theoretical Computer Science (http://eptcs.org). Beyond original ideas and recent results not published nor submitted elsewhere, we also invite authors to submit a 5-pages abstract describing relevant work that has been or will be published elsewhere, or work in progress. These submissions will be only considered for presentation at the workshop and inclusion in the preliminary proceedings but not in the final proceedings. Invited Speakers ------------- Dan Dougherty, Worcester Polytechnic Institute http://web.cs.wpi.edu/~dd/ Assia Mahboubi, INRIA Saclay http://www.lix.polytechnique.fr/~assia/index-eng.html Organizers --------- Helene Kirchner, INRIA Bordeaux - Sud-Ouest, France Cesar Munoz, NASA Langley Research Center, Hampton, USA Program Committee ----------------- Maria Paola Bonacina, Univ. degli Studi di Verona, Italy Jean-Christophe Filliatre, CNRS, France Bernhard Gramlich, Technische Universitat Wien, Austria Salvador Lucas, Universidad Politecnica de Valencia, Spain Pierre-Etienne Moreau, LORIA-INRIA Nancy, France Natarajan Shankar, SRI International, Menlo Park, CA, USA Eelco Visser, Delft Univ. of Technology, The Netherlands Christoph Weidenbach, MPI-INF, Saarbrucken, Germany Web: iws2010.inria.fr Email: iws2010 at inria.fr From carlos.martin at urv.cat Sat Jan 30 15:11:05 2010 From: carlos.martin at urv.cat (carlos.martin@urv.cat) Date: Sat, 30 Jan 2010 21:11:05 +0100 Subject: [TYPES/announce] LATA 2010: early registration deadline Message-ID: 4th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2010) Trier, Germany, May 24-28, 2010 ******************************************************* Early registration deadline: February 15, 2010 !!! Please visit: http://grammars.grlmc.com/LATA2010/ ******************************************************* INVITED LECTURES John Brzozowski Complexity in Convex Languages Alexander Clark Three Learnable Models for the Description of Language Lauri Karttunen to be announced (tutorial) Borivoj Melichar Arbology: Trees and Pushdown Automata Anca Muscholl Analysis of Communicating Automata (tutorial) CONTRIBUTED PAPERS Vincent Aravantinos, Ricardo Caferra, and Nicolas Peltier Complexity of the Satisfiability Problem for a Class of Propositional Schemata Pablo Arrighi and Jonathan Grattage A Simple n-dimensional Intrinsically Universal Quantum Cellular Automata Abdullah N. Arslan A Fast Longest Common Subsequence Algorithm for Similar Strings Francine Blanchet-Sadri, Jane Kim, Robert Mercas, William Severa, and Sean Simmons Abelian Square-Free Partial Words Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, and Eric Weissenstein Avoidable Binary Patterns in Partial Words Nicolas Bousquet and Christof Loeding Equivalence and Inclusion Problem for Strongly Unambiguous B?chi Automata Wojciech Buszkowski and Lin Zhe Pregroup Grammars with Letter Promotions J?r?mie Cabessa and Alessandro Villa A Hierarchical Classification of First-Order Recurrent Neural Networks Rafael Carrascosa, Fran?ois Coste, Matthias Gall?, and Gabriel Infante-L?pez Choosing Word Occurrences for the Smallest Grammar Problem Claudia Casadio Agreement and Cliticization in Italian: a Pregroup Analysis Jean-Marc Champarnaud, Jean-Philippe Dubernard, and Hadrien Jeanne Geometricity of Binary Regular Languages Christian Choffrut, Andreas Malcher, Carlo Mereghetti, and Beatrice Palano On the Expressive Power of FO[+] Christophe Costa Florencio and Henning Fernau Finding Consistent Categorial Grammars of Bounded Value: a Parameterized Approach Stefano Crespi Reghizzi and Dino Mandrioli Operator Precedence and the Visibly Pushdown Property Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, and Tomasz Walen On the Maximal Number of Cubic Runs in a String William de la Cruz de los Santos and Guillermo Morales Luna On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT Barbara Di Giampaolo, Salvatore La Torre, and Margherita Napoli Parametric Metric Interval Temporal Logic R?diger Ehlers Short Witnesses and Accepting Lassos in omega-automata Travis Gagie and Pawel Gawrychowski Grammar-Based Compression in a Streaming Model Hermann Gruber and Stefan Gulan Simplifying Regular Expressions. A Quantitative Perspective Reinhard Hemmerling, Katarina Smolenova, and Winfried Kurth A Programming Language Tailored to the Specification and Solution of Differential Equations Describing Processes on Networks Dag Hovland The Inclusion Problem for Regular Expressions Sanjay Jain, Qinglong Luo, and Frank Stephan Learnability of Automatic Classes Charles Jordan and Thomas Zeugmann Untestable First-Order Sentences: Four Universal and One Existential Quantifier Makoto Kanazawa and Sylvain Salvati The Copying Power of Well-nested Multiple Context-free Grammars Barbara Klunder and Wojciech Rytter Post Correspondence Problem with Partially Commutative Alphabets Timo K?tzing and Anna Kasprzik String Extension Learning using Lattices Martin Kutrib and Andreas Malcher Reversible Pushdown Automata Alexander Letichevsky, Arsen Shoukourian, and Samvel Shoukourian The Equivalence Problem of Deterministic Multitape Finite Automata. A New Proof of Solvability Using A Multidimensional Tape Peter Leupold Primitive Words Are Unavoidable for Context-Free Languages Florin Manea and Catalin Tiseanu Hard Counting Problems for Partial Words Tobias Marschall and Sven Rahmann Exact Analysis of Horspool's and Sunday's Pattern Matching Algorithms with Probabilistic Arithmetic Automata Nimrod Milo, Tamar Pinhas, and Michal Ziv-Ukelson SAPC - Sequence Alignment with Path Constraints Sakthi Muthiah and Parameswaran Seshan Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem Benedek Nagy and Friedrich Otto CD-Systems of Stateless Deterministic R(1)-Automata Accept all Rational Trace Languages Turlough Neary A Boundary Between Universality and Non-universality in Extended Spiking Neural P Systems Rafael Pe?aloza Using Sums-of-products for Non-standard Reasoning Martin Platek, Frantisek Mraz, and Marketa Lopatkova Restarting Automata with Structured Output and Functional Generative Description Alberto Policriti, Alexandru I. Tomescu, and Francesco Vezzi A Randomized Numerical Aligner (rNA) Fernando Rosa-Velardo and Giorgio Delzanno A Language-based Comparison of Nets with Black Tokens, Pure Names and Ordered Data Neda Saeedloei and Gopal Gupta Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R) Sarai Sheinvald, Orna Grumberg, and Orna Kupferman Variable Automata over Infinite Alphabets Hellis Tamm Some Minimality Results on BiRFSA and Biseparable Automata Frank Weinberg and Markus Nebel Extending Stochastic Context-Free Grammars for an Application in Bioinformatics Ryo Yoshinaka, Yuichi Kaji, and Hiroyuki Seki Chomsky-Sch?tzenberger-Type Characterization of Multiple Context-Free Languages Hans Zantema Complexity of Guided Insertion-Deletion in RNA-editing Lin Zhe Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-freeness From zambon at cs.utwente.nl Mon Feb 1 05:14:04 2010 From: zambon at cs.utwente.nl (Eduardo Zambon) Date: Mon, 01 Feb 2010 11:14:04 +0100 Subject: [TYPES/announce] 2nd Call for Papers: ICGT 2010 -- Abstract submission: 9 Apr '10 Message-ID: <4B66A96C.7020000@cs.utwente.nl> [Our apologies for multiple receptions of this message.] -------------------------------------------------------------------------------- 5th International Conference on Graph Transformation (ICGT 2010) University of Twente, Enschede, The Netherlands 29 September - 1 October 2010 ---------------------------------------------- 2nd Call for Papers The 5th International Conference on Graph Transformation (ICGT 2010) will be held at the University of Twente in Enschede (The Netherlands) in the last week of September 2010. It continues the line of conferences previously held in Barcelona (Spain) in 2002, Rome (Italy) in 2004, Natal (Brazil) in 2006 and Leicester (UK) in 2008, as well as a series of six International Workshops on Graph Transformation with Applications in Computer Science between 1978 and 1998. The conference takes place under the auspices of EATCS, EASST, and IFIP WG 1.3. Awards will be given by EATCS and EASST for the best theoretical and application-oriented papers. Proceedings will be published by Springer in the Lecture Notes in Computer Science series (http://www.springer.com/lncs). ICGT 2010 will be colocated with the SPIN 2010 workshop on Software Model Checking, and will also host several satellite events. Invited Speakers ================ We are pleased to announce the following invited speakers: - Javier Esparza, University of Munich (joint keynote speaker with SPIN 2010) - Krzysztof Czarnecki, University of Waterloo - Christoph Brandt, University of Luxembourg Satellite events ================ The following workshops will take place as ICGT satellite events: - 3rd Workshop on Graph Computation Models (GCM 2010) - 6th International Workshop on Graph-Based Tools (GraBaTs 2010) - 4th Workshop on Petri Nets and Graph Transformations (PNGT 2010) - Workshop and Tutorial on Natural Computing (WTNC 2010) Scope ===== Graphs are among the simplest and most universal models for a variety of systems, not just in computer science, but throughout engineering and the life sciences. When systems evolve we are interested in the way they change, to predict, support, or react to their evolution. Graph transformation combines the idea of graphs as a universal modelling paradigm with a rule-based approach to specify evolution. The area is concerned with both the theory of graph transformation and their application to a variety of domains. The conference aims at bringing together researchers and practitioners interested in the foundations and application of graph transformation to a variety of areas. Topics of interest include, but are not limited to * Foundations and theory of o General models of graph transformation o High-level and adhesive replacement systems o Node-, edge-, and hyperedge replacement grammars o Parallel, concurrent, and distributed graph transformation o Term graph rewriting o Hierarchical graphs and decompositions of graphs o Graph theoretical properties of graph languages o Geometrical and topological aspects of graph transformation o Automata on graphs and parsing of graph languages o Analysis and verification of graph transformation systems o Structuring and modularization concepts for transformation systems o Graph transformation and Petri nets * Languages, tool support and applications in o Software architecture o Workflows and business processes o Software quality, testing and evolution o Access control and security models o Aspect-oriented development o Model-driven development, especially model transformations o Domain-specific languages o Implementation of programming languages o Bioinformatics and system biology o Natural computing o Image generation and pattern recognition techniques o Massively parallel computing o Self-adaptive systems and ubiquitous computing o Service-oriented applications and semantic web Paper submission is at http://www.easychair.org/conferences/?conf=icgt2010. Submitted papers may not exceed fifteen (15) pages using Springer's LNCS format (http://www.springer.com/lncs), and should contain original research. Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. Selected papers will be invited for submission to special issues of Fundamenta Informaticae (for theoretically oriented papers) and Software and Systems Modeling (for application-oriented papers). Important Dates: ================ Abstract submission: 9 April 2010 Full paper submission: 16 April 2010 Notification of acceptance: 7 June 2010 Final version due: 28 June 2010 Main conference: 29 September - 1 October 2010 Satellite events: 28 September and 2 October 2010 Venue: ====== The University of Twente is located in a beautiful green area between the cities of Hengelo and Enschede, in the eastern part of The Netherlands. It has good connections to the airports of Schiphol (Amsterdam, The Netherlands) and M?nster (Germany). The main town, Enschede, lies directly on the Dutch/German border, and it is a characteristic, modern and lively university town. Elegant historic buildings in the town and surrounding area are evocative of Enschede's rich textile past. Some of the town's most notable monuments are the beautiful town hall, several beautiful churches and a unique synagogue. The University of Twente is an entrepreneurial research university. It was founded in 1961 and offers education and research in areas ranging from public policy studies and applied physics to biomedical technology. The UT is the Netherlands' only campus university. It counts in the order of 10,000 students. Programme Committee: ==================== - Paolo Baldan, University of Padova (Italy) - Luciano Baresi, University of Milano (Italy) - Michel Bauderon, University of Bordeaux (France) - Artur Boronat, University of Leicester (UK) - Paolo Bottoni, University of Rome La Sapienza (Italy) - Andrea Corradini, University of Pisa (Italy) - Juan de Lara, Autonomous University of Madrid (Spain) - Hartmut Ehrig, Technical University of Berlin (Germany) - Gregor Engels, University of Paderborn (Germany) - Claudia Ermel Technical University of Berlin (Germany) - Holger Giese, University of Potsdam (Germany) - Annegret Habel, University of Oldenburg (Germany) - Reiko Heckel, University of Leicester (UK) - Dirk Janssens, University of Antwerp (Belgium) - Garbor Karsai, Vanderbilt University (USA) - Ekkart Kindler, Technical University of Denmark (Denmark) - Barbara Koenig, University of Duisburg-Essen (Germany) - Hans-J?rg Kreowski, University of Bremen (Germany) - Ralf L?mmel, University of Koblenz (Germany) - Mark Minas, Universit?t der Bundeswehr M?nchen (Germany) - Ugo Montanari, University of Pisa (Italy) - Mohamed Mosbah, University of Bordeau (France) - Manfred Nagl, RWTH Aachen University (Germany) - Fernando Orejas, Technical University of Catalonia (Spain) - Francesco Parisi-Presicce, University of Rome La Sapienza (Italy) - Rinus Plasmeijer, Radboud University (The Netherlands) - Detlef Plump, University of York (UK) - Arend Rensink (PC co-chair), University of Twente (The Netherlands) - Leila Ribeiro, Federal University of Rio Grande do Sul (Brazil) - Andy Sch?rr (PC co-chair), Technische Universit?t Darmstadt (Germany) - Gabriele Taentzer, University of Marburg (Germany) - Pieter Van Gorp, Technical University of Eindhoven (The Netherlands) - D?niel Varr?, Budapest University of Technology and Economics (Hungary) - Gergely Varr?, Budapest University of Technology and Economics (Hungary) - Jens-Holger Weber-Jahnke, University of Victoria (USA) - Albert Z?ndorf, University of Kassel (Germany) Organisation ============ Program Chairs - Arend Rensink , University of Twente, The Netherlands - Andy Sch?rr , Technische Universit?t Darmstadt, Germany Local Organisation - Maarten de Mol , University of Twente, The Netherlands Publicity Chair: - Eduardo Zambon , University of Twente, The Netherlands Workshop Chair: - Amir Ghamarian , University of Twente, The Netherlands Further information can be found at: http://www.utwente.nl/icgt2010 -------------------------------------------------------------------------------- From ronchi at di.unito.it Mon Feb 1 10:22:40 2010 From: ronchi at di.unito.it (Simona Ronchi della Rocca) Date: Mon, 1 Feb 2010 16:22:40 +0100 Subject: [TYPES/announce] Workshop on Logic and Computational Complexity (LCC'10) Message-ID: ======================================================================== ======================================================== Preliminary call for papers 11th International Workshop on Logic and Computational Complexity LCC'10 http:// web.comlab.ox.ac.uk/people/stephan.kreutzer/lcc10/index.html Edinburgh, July 10, 2010 affiliated to LICS 2010 ======================================================================== ======================================================== The Eleventh International Workshop on Logic and Computational Complexity (LCC'10) will be held in Edinburgh on 10th July 2010, as an affiliated meeting of Logic in Computer Science (LiCS) 2010 as part of the 2010 Federated Logic Conference (FLoC). LCC meetings are aimed at the foundational interconnections between logic and computational complexity, as present, for example, in implicit computational complexity (descriptive and type-theoretic methods); deductive formalisms as they relate to complexity (e.g. ramification, weak comprehension, bounded arithmetic, linear logic and resource logics); complexity aspects of finite model theory and databases; complexity-mindful program derivation and verification; computational complexity at higher type; and proof complexity. The LCC'10 program consists of invited lectures as well as contributed papers selected by the program committee. Details on invited speakers will be made available later. Types of submission This year we invite two forms of submissions: full papers and abstracts for short presentation. Submissions published elsewhere or which are simultaneouosly being submitted to another conference or workshop are welcome, but this information must be revealed to the PC chairs. Complete submissions: Complete papers have a page limit of 15 pages, and their acceptance implies a presentation of half an hour. Abstract submissions: Abstracts have a page limit of 4 pages, they are supposed to be used for communicating problems or not yet developed ideas, and their acceptance imply a short presentation of ten minutes. Proceedings: Post-preceedings could be considered, depending on the number and the quality of the submissions. Important Dates: Submission deadline: 1 May 2010, 1am CET (GMT +1). The submission server will remain open till 7am CET. Author notification: 1 June 2010 Program Committee Andrei Bulatov (Vancouver) Phokion Kolaitis (Santa Cruz) Jan Krajicek (Prague) Stephan Kreutzer (Oxford, co-chair) Olivier Laurent (Lyon) Jean Yves Moyen (Paris 13) Damian Niwinski (Warsaw) Simona Ronchi Della Rocca (Torino, co-chair) Steering Committee Michael Benedikt (Oxford) (Co-chair) Robert Constable (Cornell) Anuj Dawar (Cambridge) Fernando Ferreira (Lisbon) Martin Hofmann (U Munich) Neil Immerman (U Mass. Amherst) Neil Jones (Copenhagen) Bruce Kapron (U Victoria) Daniel Leivant (Indiana U) (Co-chair) Jean-Yves Marion (LORIA Nancy) Luke Ong (Oxford) Martin Otto (Darmstadt) James Royer (Syracuse) Helmut Schwichtenberg (U Munich) Pawel Urzyczyn (Warsaw) -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100201/df03f435/attachment.htm From xinyu.feng at gmail.com Mon Feb 1 20:38:50 2010 From: xinyu.feng at gmail.com (Xinyu Feng) Date: Mon, 01 Feb 2010 19:38:50 -0600 Subject: [TYPES/announce] Postdoctoral Research Fellows in, Methods of Model-Based Design and, Verification (UNU-IIST) Message-ID: <4B67822A.7020605@gmail.com> See below. If you are interested, please send your applications or contact Dr. Zhiming Liu following the instructions (do *not* contact me). - Xinyu ======================== cut here ================== Vacancy Announcement United Nations University International Institute for Software Technology (UNU-IIST ) Three Postdoctoral Research Fellows *Model-Based Design and Verification* The rCOS Team at UNU-IIST is looking for three postdoctoral research fellows in the area of model-based design and verification techniques, and tool development. http://rcos.iist.unu.edu/rcos-postdocs-2010 Research topics include, but are not limited to: * Research on Formal Methods with application to Software Engineering (e.g. semantics of OO, model- and program transformation, correctness by construction, refinement). * Formal use of UML and tool development for model-driven design and analysis. * Specification languages for verification properties, their expressiveness and visualization. * Efficiency of runtime monitors: analyse, visualize and improve performance of runtime monitors. * Guided runtime verification: combine testing and runtime verification. * Synthesize and monitor runtime checks in generated code from specifications. Requirements: We are seeking young research scientists with (or in the process of obtaining) a PhD in computer science. The successful applicants should have background in one of the following fields: model checking, runtime verification, (model based) testing, theorem proving. OO programming experience is of advantage. Good English speaking and writing skills are necessary. The rCOS Modeler for use case-driven design of component-based systems using UML covers both the rCOS specification language in a pre/postcondition style, and a graphical editor to develop component models. Several back-ends address verification/model checking, code generation, and test case-generation. The tool is made available as an Open Source product. Besides research, the successful applicants will also be involved in helping to supervise postgraduate students from developing countries recruited to the project as UNU-IIST fellows, and are invited to participate in other activities of the institute. Conditions: The postdoctoral positions are contract appointments starting with one year, renewable depending on performance. Salary will be in the range 2,500-3,500 USD per month paid without deduction of tax. UNU-IIST will provide medical insurance and a fully-furnished apartment (exclusive of utility expenses). Research Group: The rCOS group has a track record of attracting young international Post Docs to jump start their academic careers. Research will be conducted in close cooperation with the international rCOS team, colleagues at UNU-IIST, and colleagues in Norway, Denmark, Germany and China (including universities in Macau). The group is led by Dr. Zhiming Liu and part of UNU-IIST's Information Engineering Programme. There are current two projects, Harnessing Theories for Tool Support (HTTS ) and Applied Runtime Verification (ARV ). HTTS is a joint project with the University of Macau, ARV in collaboration with the University of Oslo, Norway, and the Institute of Software at the Chinese Academy of Sciences, Beijing. UNU-IIST is a Research and Training Centre of the United Nations University . Its mission is to help developing countries strengthen their education and research in computer science and their ability to produce computer software. It thus provides a unique setting with a proven record in the application of mathematical methods to the production of useful theories for practical problems and for training young researchers in Formal Methods and Theoretical Computer Science. Macao is a multi-cultural city blending Asian and Western elements, about one hour from Hong Kong, and offering easy access to China and South-East Asia. The positions are open immediately until filled. Prospective candidates should submit their electronic application giving a potential starting date, including CV and a list of publications. Please list the email addresses of two or three people to whom we can apply for references. Such people should be able to comment authoritatively on your work, education, skills, and abilities. Please indicate if you do not want us to contact them at this stage. You may also attach soft copies of up to three of your papers, e.g. if the publication is not easily/electronically available. Please direct applications to \n Mrs. Wendy Hoi This e-mail address is being protected from spambots. You need JavaScript enabled to view it (Administrative & Programme Services Officer). Feel free to contact Dr. Zhiming Liu or Dr. Volker Stolz directly for informal enquiries. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100201/a68d62a5/attachment-0001.htm From birkedal at itu.dk Tue Feb 2 07:36:17 2010 From: birkedal at itu.dk (Lars Birkedal) Date: Tue, 02 Feb 2010 13:36:17 +0100 Subject: [TYPES/announce] Ph.D. positions at the IT University of Copenhagen Message-ID: <4B681C41.3060607@itu.dk> Dear All, A number of Ph.D. positions are available in the Programming, Logic, and Semantics research group at the IT University of Copenhagen. Please see http://www1.itu.dk/graphics/ITU-library/Intranet/Personale/Stillingsopslag/VIP/Stillingsopslag%202010/PhD%20call_spring%202010_text.pdf for the official announcement and for information on how to apply. Application deadline is March 24, 2010. Potential applicants are welcome to contact me or other faculty members in the PLS group (www.itu.dk/research/pls) for more information. Best wishes, Lars Birkedal Professor, Head of PLS group and the FIRST research school. www.itu.dk/~birkedal From jfrazee at mail.utexas.edu Tue Feb 2 11:36:05 2010 From: jfrazee at mail.utexas.edu (Joey Frazee) Date: Tue, 2 Feb 2010 10:36:05 -0600 Subject: [TYPES/announce] NASSLLI 2010: CALL FOR PARTICIPATION Message-ID: <103f6a951002020836k37ba07dla0dc46a28b9aa651@mail.gmail.com> CALL FOR PARTICIPATION Fourth North American Summer School in Logic, Language, and Information NASSLLI 2010 June 20-26, 2010 http://www.indiana.edu/~nasslli/ The North American Summer School in Logic, Language, and Information (NASSLLI) is a summer school with classes in the interface between computer science, linguistics, and logic. After previous editions at Stanford University, Indiana University, and UCLA, NASSLLI will return to Bloomington, Indiana, June 20?26, 2010. The summer school, loosely modeled on the long-running ESSLLI series in Europe, will consist of a number of courses and workshops, selected on the basis of the proposals. Courses and workshops meet for 90 or 120 minutes on each of five days, June 21?25, and there will be tutorials on June 20 and a day-long workshop on June 26. The instructors are prominent researchers who volunteer their time and energy to present basic work in their disciplines. Many are coming from Europe just to teach at NASSLLI. NASSLLI courses are aimed at graduate students and advanced undergraduates in wide variety of fields. The instructors know that people will be attending from a wide range of disciplines, and they all are pleased to be associated with an interdisciplinary school. The courses will also appeal to post-docs and researchers in all of the relevant fields. We hope to have 100-150 participants. In addition to classes in the daytime, the evenings will have social events and plenary lectures. Bloomington is a wonderful place to visit, known for arts, music, and ethnic restaurants. All of this is within 15 minutes walking from campus. We aim to make NASSLLI fun and exciting. Joey Frazee Student Program Committee From vs at ecs.soton.ac.uk Tue Feb 2 12:38:14 2010 From: vs at ecs.soton.ac.uk (Vladimiro Sassone) Date: Tue, 2 Feb 2010 17:38:14 +0000 Subject: [TYPES/announce] call for papers: IFIP-TCS 2010 References: <924D2C6F-B7F7-438D-ADCB-3AD6ACCC8A8D@ecs.soton.ac.uk> Message-ID: Dear colleagues, please consider submitting a paper to the 6th IFIP International Conference on Theoretical Computer Science a part of the IFIP World Computer Congress 2010 Brisbane, Australia 20-23 September 2010 www.wcc2010.com Deadline for abstracts: Feb 12th Deadline for papers: Feb 19th. The CfP is available at http://www.wcc2010.com/migrated/TCS2010/TCS2010_cfp.html Submission at https://www.easychair.org/login.cgi?conf=tcs2010 With best regards, V. Sassone PC chair From rinard at csail.mit.edu Wed Feb 3 15:21:43 2010 From: rinard at csail.mit.edu (Martin Rinard) Date: Wed, 03 Feb 2010 15:21:43 -0500 Subject: [TYPES/announce] OOPSLA 2010 Call For Papers Message-ID: <4b69dad7.XiesKR5zZXIFBEkd%rinard@csail.mit.edu> Call for Papers OOPSLA 2010 Research Papers October 17 to 20 Reno/Tahoe Nevada, USA www.splashcon.org Paper Submission Deadline: March 25, 2010 Accept/Reject Notification Date: May 24, 2010 OOPSLA 2010 solicits research papers that present new research, report novel technical results, advance the state of the art, or discuss experience or experimentation. The scope of OOPSLA includes all aspects of programming languages and software engineering, broadly construed. Papers may address any aspect of software development, including requirements, modeling, prototyping, design, implementation, generation, analysis, verification, testing, evaluation, project cancellation, maintenance, reuse, regeneration, replacement, and retirement of software systems. Papers on tools (such as new programming languages, dynamic or static program analyses, compilers, and garbage collectors) or techniques (such as new programming methodologies, type systems, design processes, code organization approaches, and management techniques) designed to reduce the time, effort, and/or cost of software systems are particularly welcome. Submitted papers should conform to the ACM Proceedings Format. There is no page limit on submitted papers. It is, however, the responsibility of the authors to keep the reviewers interested and motivated to read the paper. Reviewers are under no obligation to read all or even a substantial portion of a paper if they do not find the initial part of the paper interesting. The committee will not accept a paper if it is not clear to the committee that the paper will fit in the OOPSLA 2010 proceedings, which will limit accepted papers to 20 pages. We anticipate that the vast majority of accepted OOPSLA submissions will fit in 12 pages or less. OOPSLA particularly encourages the submission of papers that diverge from the dominant trajectory of the field or challenge the existing value system. Such papers are often controversial. To enhance the ability of the program committee to accept such papers, each member of the committee will have the unilateral right to accept one paper into the conference regardless of the opinions of the other committee members. This policy is designed to favor papers that elicit strong opinions (both positive and negative) over relatively predictable papers that simply reinforce the existing status quo. The program committee may consider the following criteria when evaluating submitted papers: Novelty - The paper presents new ideas and/or results and places these ideas and results appropriately within the context established by previous research in the field. Interest - The results in the paper are interesting, intriguing, or provocative. The paper challenges or changes informed opinion about what is possible, true, or likely. Evidence - The paper presents evidence supporting its claims. Examples of evidence include formalizations and proofs, implemented systems, experimental results, statistical analyses, case studies, and anecdotes. Clarity - The paper presents its claims and results clearly. OOPSLA 2010 will continue a long-standing tradition of recognizing a student-authored paper of the conference. The program chair will select the recognized paper among those recommended by the program committee. Eligible papers will describe the work of one or more students, one of whom must be the primary author. Authors will indicate eligibility as part of the submission process. OOPSLA 2010 will also present an award for the most influential paper published 10 years ago at OOPSLA 2000. OOPSLA Research papers will be presented as part of the new Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH) Conference, which grew out of the Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA). Program Chair: Martin Rinard (MIT) rinard at lcs.mit.edu Program Committee Ali-Reza Adl-Tabatabai (Intel) Elisa Baniassad (Australian National University) Emery Berger (University of Massachusetts, Amherst) Hans-J. Boehm (HP Labs) Michael Bond (University of Texas, Austin) Cristian Cadar (Imperial College) Robert Cartwright (Rice University) Wei-Ngan Chin (National University of Singapore) Jong-Deok Choi (Samsung) Brian Demsky (University of California, Irvine) Kathleen Fisher (AT&T Labs Research) Richard P. Gabriel (IBM Research) Robert Hirschfeld (Hasso-Plattner-Institut Potsdam) Antony Hosking (Purdue University) Maria Jump (King's College) Christoph Kirsch (University of Salzburg) Patrick Lam (Waterloo) Gary T. Leavens (University of Central Florida) Ondrej Lhotak (Waterloo) Benjamin Pierce (University of Pennsylvania) Bill Pugh (University of Maryland) Shaz Qadeer (Microsoft) Jakob Rehof (University of Dortmund) Dirk Riehle (Friedrich-Alexander-University of Erlangen-Nurnberg) Dave Thomas (Bedarra Research Labs) Vijay Saraswat (IBM Research) Koushik Sen (University of California, Berkeley) Eli Tilevich (Virginia Tech) Frank Tip (IBM Research) Westley Weimer (University of Virginia) Eran Yahav (IBM Research) Kwangkeun Yi (Seoul National University) Lenore Zuck (National Science Foundation, University of Illinois at Chicago) OOPSLA 2010 will not accept submissions from Program Committee members. OOPSLA 2010 submissions must conform to both the ACM Policy on Prior Publication and Simultaneous Submissions, available at http://www.acm.org/publications/policies/sim_submissions/, and the SIGPLAN Republication Policy, available at http://www.sigplan.org/republicationpolicy.htm. From Bob.Coecke at comlab.ox.ac.uk Thu Feb 4 08:13:17 2010 From: Bob.Coecke at comlab.ox.ac.uk (Bob Coecke) Date: Thu, 4 Feb 2010 13:13:17 +0000 (GMT) Subject: [TYPES/announce] CSR 2010 Workshop on High Productivity Computations, Kazan, Russia, June 21-22 2010. Message-ID: CSR 2010 Workshop on High Productivity Computations, June 21-22 2010, Kazan, Russia. http://csr2010.antat.ru/HPC.html Scope: The workshop is intended to organize the discussions about high productivity computing means and models, including but not limited to high performance and quantum information processing. Work in the area of Computer Science Logic is particularly welcome. The workshop proceeds the 5th International Computer Science Symposium in Russia (CSR 2010) which is also held in Kazan, June 16--20. Program committee chairs: Farid Ablayev Bob Coecke Program committee: Rusins Freivalds Aida Gainutdinova Alexander Holevo Richard Jozsa Airat Khasianov Vladimir Korepin Alexander Razborov Alexander Vasiliev Mingsheng Ying Scope: The workshop is intended to organize the discussions about high productivity computing means and models, including but not limited to high performance and quantum information processing. The workshop proceeds the 5th International Computer Science Symposium in Russia (CSR 2010) which is also held in Kazan, June 16--20. http://csr2010.antat.ru/index.html Submissions: Authors are invited to submit an up to 6 pages abstract which provides an essence of results allowing the program committee to evaluate the work. Submissions of works in progress are encouraged but must be more substantial than a research proposal. Submissions of both original and already presented research are welcome. Submissions should be in Postscript or PDF format and should be sent to HPC.CSR2010 at gmail.com by February 25, 2010, with a subject ``Submission''. We're applying to publish the extended versions of abstracts in Electronic Proceedings in Theoretical Computer Science Further information and contact: http://csr2010.antat.ru/HPC.html HPC.CSR2010 at gmail.com From sacerdot at cs.unibo.it Thu Feb 4 19:06:36 2010 From: sacerdot at cs.unibo.it (Claudio Sacerdoti Coen) Date: Fri, 05 Feb 2010 01:06:36 +0100 Subject: [TYPES/announce] Call for papers: User Interfaces for Theorem Provers, UITP 2010 Message-ID: <1265327816.21285.291.camel@zenone> [Apologies if you receive multiple copies] CALL FOR PAPERS User Interfaces for Theorem Provers, UITP 2010 A satellite workshop of FLoC'10 Edinburgh, Scotland, 15th July 2010 http://uitp10.cs.unibo.it/ The User Interfaces for Theorem Provers workshop series brings together researchers interested in designing, developing and evaluating interfaces for interactive proof systems, such as theorem provers, formal method tools, and other tools manipulating and presenting mathematical formulas. While the reasoning capabilities of interactive proof systems have increased dramatically over the last years, the system interfaces have often not enjoyed the same attention as the proof engines themselves. In many cases, interfaces remain relatively basic and under-designed. The User Interfaces for Theorem Provers workshop series provides a forum for researchers interested in improving human interaction with proof systems. We welcome participation and contributions from the theorem proving, formal methods and tools, and HCI communities, both to report on experience with existing systems, and to discuss new directions. UITP 2010 is a one-day workshop to be held the 15th July 2010 in Edinburgh, Scotland, as a FLoC'10 workshop. Submissions Submissions are encouraged in one of the following two categories: - Regular paper: Submissions in this category should describe previously unpublished work (completed or in progress), including descriptions of research, tools, and applications. Papers should be formated following the ENTCS guidelines and up to 15 pages long - System description: Submissions in this category are intended to describe existing systems. Papers should be formated following the ENTCS guidelines and up to 5 pages long The additional UTIP'10-specific ENTCS macro file can be downloaded from: http://www.entcs.org/files/uitp10/prentcsmacro.sty Suggested topics include, but are not restricted to: * Application-specific interaction mechanisms or designs for prover interfaces * Experiments and evaluation of prover interfaces * Languages and tools for authoring, exchanging and presenting proofs * Implementation techniques (e.g. web services, custom middleware, DSLs) * Integration of interfaces and tools to explore and construct proof * Representation and manipulation of mathematical knowledge or objects * Visualisation of mathematical objects and proofs * System descriptions Authors are encouraged to bring along versions of their systems suitable for informal demonstration during breaks in the program of talks. The workshop proceedings will be distributed at the workshop as a collection of the accepted papers. Final versions of accepted papers have to be prepared with LaTeX. Following up the workshop the (revised) accepted papers will be published in a volume of ENTCS devoted to the workshop. Dates Deadline for submissions: April 5th 2010 Notification: April 28th 2010 Final versions due: May 22nd 2010 Workshop: July 15th 2010 Submission is via EasyChair (thanks to Andrei Voronkov) http://www.easychair.org/conferences/?conf=uitp09 More information can be found on the UITP web page at http://uitp10.cs.unibo.it/ Program Committee David Aspinall (University of Edinburgh, UK) (Co-Chair) Serge Autexier (DFKI Bremen, DE) Christoph Benzm?ller (Saarland University, DE) Yves Bertot (INRIA Sophia-Antipolis - M?diterran?e, FR) Ewen Denney (NASA Ames Research Center, USA) Cezary Kaliszyk (Technical University M?nchen, DE) Paul Libbrecht (University of Saarlandes and DFKI Saarbr?cken, DE) Christoph L?th (University of Bremen and DFKI Bremen, DE) Michael Norrish (NICTA, AU) Claudio Sacerdoti Coen (University of Bologna, IT) (Co-Chair) Geoff Sutcliffe (University of Miami, USA) Laurent Thery (INRIA Sophia-Antipolis - M?diterran?e, FR) Gem Stapleton (University of Brighton, UK) Makarius Wenzel (TU Munich, DE) Burkhart Wolff (University Paris-Sud 11, FR) Organizers and PC Chairs David Aspinall (University of Edinburgh, DE) Claudio Sacerdoti Coen (University of Bologna, IT) From david.pichardie at irisa.fr Fri Feb 5 03:47:59 2010 From: david.pichardie at irisa.fr (David Pichardie) Date: Fri, 5 Feb 2010 09:47:59 +0100 Subject: [TYPES/announce] Final Call for Participation: BYTECODE 2010 Message-ID: <0349C322-E158-4C0C-9772-999FF8AB0A99@irisa.fr> ******************************************************************** FINAL CALL FOR PARTICIPATION BYTECODE 2010 5th workshop on Bytecode Semantics, Verification, Analysis and Transformation (Satellite Event of the European Joint Conferences on Theory and Practice of Software, ETAPS 2010) March 27, 2010 Paphos, Cyprus http://bytecode2010.inria.fr/ ******************************************************************** IMPORTANT DATES Early registration deadline for ETAPS: February 15, 2010 REGISTRATION To register for BYTECODE 2010, follow the link from the ETAPS 2010 page, at http://www.etaps10.cs.ucy.ac.cy/ SCOPE Bytecode, such as produced by e.g. Java and .NET compilers, has become an important topic of interest, both for industry and academia. The industrial interest stems from the fact that bytecode is typically used for Internet and mobile devices (smart-cards, phones, etc.) applications, where security is a major issue. Moreover, bytecode is device-independent and allows dynamic loading of classes, which provides an extra challenge for the application of formal methods. In addition, the unstructuredness of the code and the pervasive presence of the operand stack also provide extra challenges for the analysis of bytecode. This workshop will focus on theoretical and practical aspects of semantics, verification, analysis, certification and transformation of bytecode. Both new theoretical results and tool demonstrations are welcome. INVITED SPEAKERS Mark Marron, IMDEA Software, Spain Francesco Logozzo, Microsoft Research, USA Matthew Parkinson, University of Cambridge, UK Fausto Spoto, University of Verona, Italy PRELIMINARY PROGRAM ---------------------- ** Session I 9:00-10:30 *** 09:00 Invited Speaker: Francesco Logozzo (Microsoft Research, USA) Language-agnostic Contract specification and checking with CodeContracts and Clousot *** 10:00 Jacek Chrzqszcz, Patryk Czarnik and Aleksy Schubert (The University of Warsaw, Poland) A dozen instructions make Java bytecode ---------------------- ** 10:30 coffee break ---------------------- ** Session II 11:00-12:30 *** 11:00 Invited Speaker: Mark Marron (IMDEA Software, Spain) Spec-tacular: heap assertions for .net bytecode *** 12:00 Jaroslav Bauml and Premek Brada (University of West Bohemia, Czech Republic) Reconstruction of Type Information from Java Bytecode for Component Compatibility ---------------------- ** 12:30 lunch ---------------------- ** Session III 14:00-16:00 *** 14:00 Invited Speaker: Matthew Parkinson (University of Cambridge, UK) The design of jStar *** 15:00 Philippe Wang, Adrien Jonquet and Emmanuel Chailloux (LIP6- UPMC, France) Non Intrusive Structural Coverage for Objective Caml *** 15:30 Jevgeni Kabanov (Tartu University, Estonia) JRebel Tool Demo ---------------------- ** 16:00 coffee break ---------------------- ** Session IV 16:30-18:00 *** 16:30 Invited Speaker: Fausto Spoto (University of Verona, Italy) Static Analysis of Java: from the Julia Perspective *** 17:30 Michael Eichberg and Andreas Sewe (Technische Universit?t Darmstadt, Germany) Encoding the Java Virtual Machine's Instruction Set PROGRAM COMMITTEE * David Aspinall, University of Edinburgh, Scotland * Stephen Chong, Harvard University, USA * Alessandro Coglio, Kestrel Institute, USA * Pierre Cr?gut, Orange Labs, France T?l?com, France * Samir Genaim, Complutense University of Madrid, Spain * Bart Jacobs, Katholieke Universiteit Leuven, Belgium * Gerwin Klein, University of New South Wales, Australia * Victor Kuncak, EPFL, Switzerland * Patrick Lam, University of Waterloo, Canada * Francesco Logozzo, Microsoft Research, USA * Matthew Parkinson, University of Cambridge, UK * David Pichardie (chair), INRIA Rennes, France * Rene Rydhof Hansen, Aalborg University, Denmark * Fausto Spoto, University of Verona, Italy From d.sannella at contemplateltd.com Fri Feb 5 04:05:52 2010 From: d.sannella at contemplateltd.com (Don Sannella) Date: Fri, 05 Feb 2010 09:05:52 +0000 Subject: [TYPES/announce] Jobs in Program Analysis R&D Message-ID: <4B6BDF70.2070000@contemplateltd.com> Contemplate Ltd, a spin-out from the University of Edinburgh, is working on tools for improving software quality, using type-based static analysis and related technologies. Our current focus is multi-threaded Java programs. Our current implementation languages include OCaml, Java, and Datalog. Contemplate has openings for a small number of Researcher Engineers and Software Engineers. Researcher Engineers should have PhD-level or equivalent training and also be excellent software engineers, capable of directing others. Software Engineers should have an outstanding academic and/or industrial record of achievement. For more details of desirable background experience, please see our recruiting page at http://www.contemplateltd.com/jobs.html Send notes of interest and enquiries to jobs at contemplateltd.com. -- -------------------------------------------------------- Don Sannella d.sannella at contemplateltd.com Contemplate Ltd www.contemplateltd.com From michaelw at cs.utwente.nl Fri Feb 5 16:36:44 2010 From: michaelw at cs.utwente.nl (Michael Weber) Date: Fri, 5 Feb 2010 22:36:44 +0100 Subject: [TYPES/announce] PDMC 2010 Call for Papers Message-ID: <638671C5-577D-44B1-AF9B-3B4CE861C782@cs.utwente.nl> Call for Papers - PDMC 2010 ======================================================================= 9th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2010) joint with 2nd International Workshop on High Performance Computational Systems Biology (HiBi 2010) ======================================================================= September 30 - October 1, 2010, Twente, The Netherlands http://www.pdmc.cz/PDMC10/ Co-locating with the joint ICGT/SPIN conference, Sep 27 - Oct 2 ----------------------------------------------------------------------- IMPORTANT DATES: ---------------- * Abstract submission: June 14, 2010 * Paper submission: June 21, 2010 * Author notification: July 31, 2010 * Workshop: September 30 - October 1, 2010 AIM AND SCOPE: -------------- The aim of the PDMC workshop series is to cover all aspects related to the verification and analysis of very large and complex systems using methods and techniques that exploit state-of-the-art hardware architectures. As such, the workshop provides a working forum for presenting, sharing, and discussing recent achievements in the field of high-performance verification. Topics of interest include, but are not limited to: * multi-core model checking * distributed model checking * multi-threaded/distributed equivalence checking * distributed state space generation * slicing and distributing the state space * parallel/distributed satisfiability checking * parallel/distributed theorem proving * parallel/distributed constraint solving * parallel methods in probabilistic model checking * parallel methods in performance evaluation * I/O efficient algorithms for verification * GPU accelerated verification * (libraries for) distributed graph algorithms * tools and case studies * industrial applications SUBMISSIONS: ------------ We accept * regular papers (max. 8 pages in IEEE format) * tool papers (max. 2 pages in IEEE format) * work-in-progress presentations All submissions must be original and unpublished. Regular and tool papers accepted for the presentation at the workshop will appear in IEEE post-proceedings. High-quality and mature work-in-progress papers might be invited for the proceedings, depending on the presentation at the workshop. INVITED SPEAKERS: ----------------- To be announced. PROGRAMME CHAIRS: ----------------- Jiri Barnat (Masaryk University, Czech Republic) Michael Weber (University of Twente, Netherlands) PROGRAMME COMMITTEE: -------------------- Henri Bal (Free University Amsterdam, Netherlands) Dragan Bosnacki (Eindhoven University of Technology, Netherlands) Lubos Brim (Masaryk University, Czech Republic) Gianfranco Ciardo (University of California at Riverside, USA) Stefan Edelkamp (TZI Bremen, Germany) Ganesh Gopalakrishnan (University of Utah, USA) Keijo Heljanko (Aalto University, Finland) Gerard Holzmann (NASA/JPL, USA) William Knottenbelt (Imperial College, UK) Radu Mateescu (INRIA, France) Jaco van de Pol (University of Twente, Netherlands) Wheeler Ruml (University of New Hampshire, USA) Anna Slobodova (Centaur Technology, USA) -- Michael Weber University of Twente, The Netherlands http://fmt.cs.utwente.nl/~michaelw/ From urzy at mimuw.edu.pl Sat Feb 6 15:14:11 2010 From: urzy at mimuw.edu.pl (=?UTF-8?B?UGF3ZcWCIFVyenljenlu?=) Date: Sat, 06 Feb 2010 21:14:11 +0100 Subject: [TYPES/announce] Workshop on Higher-Order Recursion Schemes & Pushdown Automata Message-ID: <4B6DCD93.3090705@mimuw.edu.pl> Workshop on Higher-Order Recursion Schemes & Pushdown Automata 10-12 March 2010 Paris, France http://www.liafa.jussieu.fr/~serre/WorkshopSchemes *** Subject *** The Workshop on Higher-Order Recursion Schemes and Pushdown Automata will be an opportunity to assess and disseminate recent advances in higher-order recursion schemes, higher-order pushdown automata, related models and their applications. It aims to promote interaction and collaboration between experts in these areas, and stimulate interest from researchers in related fields. *** Important Dates *** Registration by the 28th of February. Workshop the 10th (afternoon only), 11th and 12th (morning only) of March 2010. *** Confirmed Speakers *** Achim Blumensath (Technische Universit?t Darmstadt) A Pumping Lemma for Higher-order Pushdown Automata. Arnaud Carayol (LIGM ? Universit? Paris-Est & CNRS) Linear Orders in the Pushdown Hierarchy. Didier Caucal (LIGM ? Universit? Paris-Est & CNRS) An Extension of the Pushdown Hierarchy. Bruno Courcelle (Universit? Bordeaux 1 & Institut Universitaire de France) Syntactic Tools for Equivalence Problems. Ir?ne Guessarian (LIAFA & Universit? Paris 6) Program schemes: early results about semantics. Alexander Kartzow (Technische Universit?t Darmstadt) Collapsible Pushdown Graphs of Level 2 are Tree-Automatic. Naoki Kobayashi (Tohoku University) Types and Recursion Schemes for Higher-Order Program Verification. Christof L?ding (RWTH Aachen) Finite Set Interpretations and Tree Automatic Structures of Higher Order. Luke Ong (Oxford University Computing Laboratory) Recursion Schemes and Collapsible Pushdown Automata. Sylvain Salvati (INRIA Bordeaux Sud-Ouest, Universit? de Bordeaux, LaBRI) Extending Recognizability to the Simply Typed lambda-Calculus. G?raud S?nizergues (Universit? Bordeaux 1) Automata on Free Groups and Regular Sets of Words of Level k. Olivier Serre (LIAFA ? Universit? Paris 7 & CNRS) Applications of the Equi-expressivity Theorem. Colin Stirling (School of Informatics, University of Edinburgh) To be announced. Igor Walukiewicz (LaBRI ? Universit? Bordeaux 1 & CNRS) A Model-Theoretic Approach to Model Checking Recursion Schemes. *** Registration Fees & Financial Support *** There will be no registration fee. We will be able to cover travel and accomodation costs for a limited number of participants (especially students). For more information on this support, please contact Olivier Serre. *** Sponsors *** The workshop is sponsored by the following Research Networking Programmes of the European Science Foundation: - Automata: from Mathematics to Applications (AutoMathA) - Games for Design and Verification (GAMES) *** Organisers *** Arnaud Carayol (Arnaud.Carayol at univ-mlv.fr) Luke Ong (lo at comlab.ox.ac.uk) Olivier Serre (Olivier.Serre at liafa.jussieu.fr) Pawe? Urzyczyn (urzy at mimuw.edu.pl) From Jeremy.Gibbons at comlab.ox.ac.uk Sun Feb 7 16:54:43 2010 From: Jeremy.Gibbons at comlab.ox.ac.uk (Jeremy.Gibbons@comlab.ox.ac.uk) Date: Sun, 7 Feb 2010 21:54:43 GMT Subject: [TYPES/announce] Call for Papers: Haskell Symposium 2010 Message-ID: <201002072154.o17LshYf013834@merc4.comlab.ox.ac.uk> Haskell 2010 ACM SIGPLAN Haskell Symposium 2010 Baltimore MD, United States 30th September, 2010 CALL FOR PAPERS http://www.haskell.org/haskell-symposium/2010/ The ACM SIGPLAN Haskell Symposium 2010 will be co-located with the 2010 International Conference on Functional Programming (ICFP), in Baltimore, Maryland. The purpose of the Haskell Symposium is to discuss experiences with Haskell and future developments for the language. The scope of the symposium includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Topics of interest include, but are not limited to: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal treatments of the semantics of the present language or future extensions, type systems, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management as well as foreign function and component interfaces; * Tools, in the form of profilers, tracers, debuggers, pre-processors, and suchlike; * Functional Pearls, being elegant, instructive examples of using Haskell; * Applications, Practice, and Experience, using Haskell for scientific and symbolic computing, database, multimedia and Web applications, and so forth, as well as general experience with Haskell in education and industry. Papers in the latter two categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, reusable programming idioms, or elegant new ways of approaching a problem. (More advice appears on the symposium webpage.) The key criterion for such a paper is that it makes a contribution from which other Haskellers can benefit. It is not enough simply to describe a program! Before 2008, the Haskell Symposium was known as the Haskell Workshop. The name change reflects both the steady increase of influence of the Haskell Workshop on the wider community, as well as the increasing number of high quality submissions. The selection process is highly competitive. After eleven Haskell Workshops between 1995 and 2007, the first Haskell Symposium was held in Victoria in 2008, and the second in Edinburgh in 2009. Submission Details * Submission Deadline: Monday, 14th June 2010, 15:00 UTC * Author Notification: Monday, 12th July 2010 * Final Papers Due : Monday, 2nd August 2010 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (http://www.acm.org/sigs/sigplan/authorInformation.htm). The text should be in a 9pt font in two columns; the length is restricted to 12 pages, except for "Applications, Practice, and Experience" papers, which are restricted to 6 pages. Each submission must adhere to SIGPLAN's republication policy, as explained on the web. Violation risks summary rejection of the offending submission. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. In addition, we solicit proposals for system demonstrations, based on running (perhaps prototype) software rather than necessarily on novel research results. Proposals are limited to 2-page abstracts, in the same ACM format as papers, and should explain why a demonstration would be of interest to the Haskell community. They will be assessed for relevance by the PC; accepted proposals will be published on the Symposium website, but not formally published in the proceedings. Links * http://www.haskell.org/haskell-symposium, the permanent homepage of the Haskell Symposium. * http://www.haskell.org/haskell-symposium/2010, the 2010 Haskell Symposium web page. * http://www.icfpconference.org/icfp2010, the ICFP 2010 web page. Programme Committee * Jeremy Gibbons, University of Oxford (chair) * James Cheney, University of Edinburgh * Duncan Coutts, Well-Typed LLP * Sharon Curtis, Oxford Brookes University * Fritz Henglein, Kobenhavns Universitet * Tom Schrijvers, Katholieke Universiteit Leuven * Chung-chieh Shan, Rutgers - The State University of New Jersey * Martin Sulzmann, Informatik Consulting Systems AG * Wouter Swierstra, Vector Fabrics * Peter Thiemann, Universitaet Freiburg * Andrew Tolmach, Portland State University * Malcolm Wallace, University of York From A.M.Silva at cwi.nl Mon Feb 8 04:17:13 2010 From: A.M.Silva at cwi.nl (A.M.Silva@cwi.nl) Date: Mon, 8 Feb 2010 10:17:13 +0100 Subject: [TYPES/announce] ICE 2010: First call for papers Message-ID: <20100208091713.GA28088@wendy.sen.cwi.nl> [- Apologies for multiple copies -] 3rd Interaction and Concurrency Experience ICE 2010: Guaranteed Interactions Satellite workshop of DisCoTec 2010 10th of June 2010 Amsterdam, The Netherlands http://www.artist-embedded.org/artist/-ICE-10-.html === Highlights === - Innovative selection procedure - Travel grants for young researchers === Important Dates === - Abstract submission: 22 March 2010 - Full paper submission: 29 March 2010 - Reviews, rebuttal and PC discussion: 30 March - 28 April 2010 - Notification to authors: 30 April 2010 === Scope === Interaction and Concurrency Experiences (ICEs) is a series of international scientific meetings oriented to theoretical computer science researchers with special interest in models, verification, tools and programming primitives for complex interactions. The general scope is to include theoretical and applied aspects of interactions and the synchronization mechanisms used among actors of concurrent/distributed systems, but every experience will focus on a different specific topic which affects several areas of computer science. The theme of ICE'10 is ***Guaranteed Interactions***, like guaranteeing safety, responsiveness, quality of service levels or satisfaction of analysis hypotheses. In this context, coordination can be viewed as imposing constraints on the interaction among the actors. Such constraints and guarantees of their satisfaction play an important role in the analysis of distributed systems. In order to provide such guarantees, a number of directions are being explored to develop appropriate models, methodologies and tools, like behavioural types, component-based model checking, assume-guarantee and ?by construction? techniques such as glue synthesis. Considering interaction as a first class entity is crucial for overcoming complexity issues of distributed systems, such as state space explosion. Topics of interest include, but shall not be limited to: - logic and types for interactions - concurrent models and semantics - techniques and tools for specification, analysis, verification of guaranteed interaction - programming primitives for interactions - languages, protocols and mechanisms for sound coordination - "by construction" guarantees for interaction - expressiveness results - formal contract languages - disciplined interactions inspired by emerging computational models (systems biology, quantum computing, etc.) === Selection Procedure === The workshop proposes an innovative paper selection mechanism based on an interactive discussion amongst authors and PC members. As witnessed by the past two editions of ICE, this considerably improves the accuracy of the feedback from reviews, the fairness of the selection, the quality of accepted papers, and the discussion during the workshop. During the review phase, each submitted paper is published on a Wiki and associated with a discussion forum whose access will be restricted to the authors and to all the PC members not in conflict of interests. The PC members post comments / questions which the authors shall reply to. === The Public Wiki === After the notification, the accepted papers will be published on a public forum, the rationale being to initiate public discussions that will trigger and stimulate the scientific debate of the workshop. We argue that this will drive the workshop discussions and let perspective participants to interact with each other well in advance with respect to the modus operandi of more traditional events. === Submission Guidelines === Papers must report previously unpublished work and not be simultaneously submitted to other conferences / workshops with refereed proceedings. The ICE'10 post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/). Depending on the quality of submissions a special issue in a journal will be considered. Submissions must be made electronically in PDF format via EasyChair (http://www.easychair.org/conferences/?conf=ice2010) and should not exceed 15 pages with EPTCS style (http://style.eptcs.org/). Accepted papers must be presented at the workshop by one of the authors. === Program Committee === - Paolo Baldan (University of Padova, Italy) - Ananda Basu (Verimag, France) - Karthik Bhargavan (INRIA, France) - Simon Bliudze (CEA LIST, France; co-chair) - Andrea Bracciali (University of Pisa, Italy) - Roberto Bruni (University of Pisa, Italy; co-chair) - Pierre-Malo Deni?lou (Imperial College London, UK) - Erik de Vink (Technische Universiteit Eindhoven, Netherlands) - Laurent Doyen (ENS Cachan, France) - Carlo Furia (ETH Zurich, Switzerland) - Fabio Gadducci (University of Pisa, Italy) - Julian Gutierrez (University of Edinburgh, UK) - Thomas Hildebrandt (IT University of Copenhagen, Denmark) - Daniel Hirschkoff (ENS Lyon, France) - Barbara Jobstmann (CNRS/Verimag, France) - Ivan Lanese (University of Bologna, Italy) - Alberto Lluch Lafuente (IMT Lucca, Italy) - Hernan Melgratti (University of Buenos Aires, Argentina) - Madhavan Mukund (Chennai Mathematical Institute, India) - Dejan Nickovic (IST, Austria) - Sophie Quinton (Verimag, France) - Alexandra Silva (CWI, Netherlands) - Pawel Sobocinski (University of Southampton, UK) - Ana Sokolova (University of Salzburg, Austria) - Paola Spoletini (University of Insubria, Italy) - Emilio Tuosto (University of Leicester, UK) - Hugo Torres Vieira (New University of Lisbon, Portugal) === ICEcreamers === - Simon Bliudze (CEA LIST, France; co-chair) - Roberto Bruni (University of Pisa, Italy; co-chair) - Davide Grohmann (Universita' di Udine; website and discussion forum) - Alexandra Silva (CWI, Netherlands; local arrangements) === Contact === Please write to for any additional information you may need. === Previous editions === The previous two editions of ICE have been held in: ? Reykjavik, Iceland, on July 6th, 2008, with focus on Synchronous and Asyn- chronous Interactions in Concurrent/Distributed Systems, co-located with ICALP?08 (http://ice08.dimi.uniud.it/). The post proceedings were published in ENTCS (vol.229-3). ? Bologna, Italy, on August 31st, 2009, with focus on Structured Interactions, co-located with CONCUR?09 (http://ice09.dimi.uniud.it/). The post proceedings were published in EPTCS (vol.12) and a special issue of MSCS is now in preparation. === Sponsors === * CEA LIST (http://www-list.cea.fr) * ArtistDesign network of excellence (http://www.artist-embedded.org) * Institute for Programming research and Algorithmics (IPA - http://www2.win.tue.nl/ipa/) . From anindya.banerjee at imdea.org Mon Feb 8 08:42:05 2010 From: anindya.banerjee at imdea.org (Anindya Banerjee) Date: Mon, 8 Feb 2010 14:42:05 +0100 Subject: [TYPES/announce] Second Call for Papers: PLAS 2010, Toronto, Canada Message-ID: <431427801002080542p326dfe85qedb9aff46a64522f@mail.gmail.com> *********************************************************************** Second Call for Papers Fifth ACM SIGPLAN Workshop on Programming Languages and Analysis for Security (PLAS 2010) http://software.imdea.org/events/plas2010/index.html June 10, 2010 Co-located with PLDI 2010, Toronto, Canada *********************************************************************** SCOPE PLAS aims to provide a forum for exploring and evaluating ideas on the use of programming language and program analysis techniques to improve the security of software systems. Strongly encouraged are proposals of new, speculative ideas, evaluations of new or known techniques in practical settings, and discussions of emerging threats and important problems. The scope of PLAS includes but is not limited to: * Compiler-based security mechanisms or runtime-based security mechanisms such as inline reference monitors * Program analysis techniques for discovering security vulnerabilities * Automated introduction and/or verification of security enforcement mechanisms * Language-based verification of security properties in software including verification of cryptographic protocols * Specifying and enforcing security policies for information flow and access control * Model-driven approaches to security * Security concerns for web programming languages * Language design for security in new domains such as cloud computing and embedded platforms * Applications, case studies, and implementations of these techniques IMPORTANT INFORMATION ********************************* Submissions due: Friday, March 12, 2010 Author notification: Friday, April 23, 2010 Revised papers due: Monday, May 10, 2010 PLAS 2010 workshop: Thursday, June 10, 2010 Submission URL: https://www.easychair.org/login.cgi?conf=plas2010 SUBMISSION GUIDELINES We invite papers in two categories: * Full papers should be at most 12 pages long including bibliography and appendices. Papers in this category are expected to have relatively mature content. Full paper presentations will be 25 minutes each. * Position papers should be at most 6 pages long including bibliography and appendices. Preliminary and exploratory work are welcome in this category. Position paper presentations will be 10 minutes each. Authors submitting papers in this category must prepend the phrase "Position Paper: " (without quotes) to the title of the submitted paper. Submissions should be PDF documents typeset in the ACM proceedings format using 10pt fonts. SIGPLAN-approved templates can be found at http://www.acm.org/sigs/sigplan/authorInformation.htm. We recommend using this format, which improves greatly on the ACM LaTeX format. All submissions must be in English. Page limits are strict. Both full and position papers must describe work not published in other refereed venues (see the SIGPLAN republication policy at http://www.acm.org/sigs/sigplan/republicationpolicy.htm for details). Accepted papers will appear in the workshop proceedings which will be distributed to workshop participants and be available in the ACM Digital Library. PROGRAM COMMITTEE Anindya Banerjee (IMDEA Software) (co-chair) Gilles Barthe (IMDEA Software) Avik Chaudhuri (University of Maryland) Veronique Cortier (LORIA, CNRS) Brendan Eich (Mozilla Corporation) Ulfar Erlingsson (Microsoft Research and Reykjavik University) Deepak Garg (Carnegie Mellon University) (co-chair) Andrew D. Gordon (Microsoft Research) Joshua Guttman (Worcester Polytechnic Institute) Shriram Krishnamurthi (Brown University) Sergio Maffeis (Imperial College London) Todd Millstein (University of California, Los Angeles) John Mitchell (Stanford University) Marco Pistoia (IBM TJ Watson Research Center) Andrei Sabelfeld (Chalmers University) Zhendong Su (University of California, Davis) -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100208/123495af/attachment.htm From eabonelli at gmail.com Mon Feb 8 08:53:54 2010 From: eabonelli at gmail.com (Eduardo Bonelli) Date: Mon, 8 Feb 2010 10:53:54 -0300 Subject: [TYPES/announce] HOR'2010 - 2nd CFP Message-ID: ************************************** * * * HOR 2010 2nd CALL FOR ABSTRACTS * * * ************************************** 5th International Workshop on Higher-Order Rewriting (Affiliated with RTA'2010) Wednesday July 14, 2010, Edinburgh, UK http://hor.pps.jussieu.fr/10/ IMPORTANT DATES: March 25, 2010 : deadline electronic submission of paper April 20, 2010 : notification of acceptance of papers May 17, 2010 : deadline for final version of accepted papers HOR 2010 is a forum to present work concerning all aspects of higher-order rewriting. The aim is to provide an informal and friendly setting to discuss recent work and work in progress. HOR 2010 is part of FLoC 2010 in Edinburgh. HOR 2007 was part of RDP 2007 in Paris, France. HOR 2006 was part of FLoC 2006 in Seattle, USA. HOR 2004 was part of RDP 2004 in Aachen, Germany. HOR 2002 was part of FLoC 2002 in Copenhagen, Denmark. TOPICS of interest include (but are not limited to): APPLICATIONS: proof checking, theorem proving, generic programming, declarative programming, program transformation, automated termination/confluence tools FOUNDATIONS: pattern matching, unification, strategies, narrowing, termination, syntactic properties, type theory, complexity of derivations. FRAMEWORKS: term rewriting, conditional rewriting, graph rewriting, net rewriting, comparisons of different frameworks. IMPLEMENTATION: explicit substitution, rewriting tools, compilation techniques. SEMANTICS: semantics of higher-order rewriting, categorical rewriting, higher-order abstract syntax, games and rewriting INVITED SPEAKERS: Maribel Fern?ndez King's College London, UK Silvia Ghilezan University of Novi Sad, Serbia PROGRAM COMMITTEE Zena Ariola University of Oregon, USA Fr?d?ric Blanqui INRIA & Tsinghua University, China Eduardo Bonelli Universidad Nacional de Quilmes, Argentina, chair Mariangiola Dezani-Ciancaglini Universit? di Torino, Italy Roel de Vrijer Vrije Universiteit, The Netherlands HOR 2010 SUBMISSIONS: Abstracts between 2 and 5 pages. As HOR is meant to be a platform to discuss ongoing research we are also interested in abstracts describing work in progress, or problems in higher-order rewriting. Please use the EasyChair page http://www.easychair.org/conferences/?conf=hor2010 to submit or update your paper (updates are always possible before the deadline). Please address your questions to the PC chair, under: ebonelli * gmail.com (where '*' is replaced by '@'). PROCEEDINGS: The proceedings of HOR 2010 will be made available on the HOR 2010 web page and copies will be distributed to the participants at the workshop. Publication of post-workshop proceedings in EPTCS is under consideration. STEERING COMMITTEE Delia Kesner Universit? Paris 7, France Femke van Raamsdonk Vrije Universiteit, The Netherlands LOCAL ARRANGEMENTS: Venue Coordinator of the local organizing committee of FLoC'2010: Floris Geerts (fgeerts at inf.ed.ac.uk) From jv at cs.purdue.edu Mon Feb 8 18:31:17 2010 From: jv at cs.purdue.edu (Jan Vitek) Date: Mon, 8 Feb 2010 18:31:17 -0500 Subject: [TYPES/announce] Third Summer School on Trends in Concurrency Message-ID: <94962BDF-09C1-4873-B7EF-819F2AFB2BFE@cs.purdue.edu> ****************************************************************** *** TiC'10 *** *** Third International Summer School on Trends in Concurrency *** *** IIT-Bangalore, India *** *** May 23 - 30, 2010 *** ****************************************************************** email: tic10 at cs.purdue.edu Web: http://web.me.com/vitekj/TIC10 Speakers: * Madan Musuvavthi, Microsoft Research. * Mark Moir, Sun Microsystems * G. Ramalingam, Microsoft Research * Vijay Saraswat, IBM Research * Peter Sewell, Cambridge University. * Satnam Singh, Microsoft Research. * Matthew Parkinson, Cambridge University * Jean Pierre Talpin, INRIA * Adam Welc, Intel Research. Topics: Concurrency is a pervasive and essential characteristic of modern computer systems. Whether it is the design of new hyper-threading techniques in computer architectures, specification of non-blocking data structures and algorithms, implementation of scalable computer farms for handling massive data sets, or the design of a robust software architecture for distributed business processes, a deep understanding of mechanisms and foundations for expressing and controlling concurrency is required. Recent architectural advances in multi-core and many-core architectures have made this an essential topic for any serious student of computer science. This summer school will bring together outstanding researchers from academia and industry to discuss current research and future trends in concurrent systems design and implementation. All instructors have had significant impact in the area of concurrency, and play an active role in substantial ongoing research and commercial efforts. The goal of this school is to expose graduate students and young researchers to new and important ideas in concurrent programming. The focus this year is on programming language design, program analysis, specification, and implementation as they relate to concurrent and real-time systems. To encourage free discussion, attendance will be limited to 40 participants. Admission will be competitive, and preference will be given to students actively pursuing a Ph.D in the topic areas being covered. A small number of travel grants will be available. Sponsors: * Microsoft Research * Infosys * National Science Foundation Organizers: * Suresh Jagannathan * Ananth Gramma * Jan Vitek From cbraga at ic.uff.br Tue Feb 9 06:02:56 2010 From: cbraga at ic.uff.br (Christiano Braga) Date: Tue, 9 Feb 2010 09:02:56 -0200 Subject: [TYPES/announce] SBLP 2010 - 1st Call for Paper Message-ID: <4388158A-8D95-4A2F-8CA5-FA9F4403F6EE@ic.uff.br> [We apologize in advance if you receive multiple copies of this CFP] ============================================================= CALL FOR PAPERS 14th BRAZILIAN SYMPOSIUM ON PROGRAMMING LANGUAGES Salvador, Bahia, Brazil September 27-29, 2010 http://cbsoft.dcc.ufba.br/ Abstract Submission: May 17, 2010 Paper Submission: May 24, 2010 ============================================================= The 14th Brazilian Symposium on Programming Languages, SBLP 2010, will be held in Salvador, Bahia, Brazil, on September 27-29, 2010. SBLP provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. This year the symposium will be part of the 1st Brazilian Conference on Software: Theory and Practice, CBSoft 2010, http://cbsoft.dcc.ufba.br, which will host three traditional, well-established symposia: * IV Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) * XIV Brazilian Symposium on Programming Languages (SBLP) * XXIV Brazilian Symposium on Software Engineering (SBES) SBLP 2010 invites authors to contribute with Technical Papers and Tutorial Proposals related (but not limited) to: * Programming language design and implementation * Formal semantics of programming languages * Theoretical foundations of programming languages * Design and implementation of programming language environments * Object-oriented programming languages * Functional programming * Aspect-oriented programming languages * Scripting languages * Domain-specific languages * Programming languages for mobile, web and network computing * New programming models * Program transformations * Program analysis and verification * Compilation and interpretation techniques Contributions can be written in Portuguese or English. Papers should have at most 14 pages. All accepted papers will be published in the conference proceedings. Selected papers written in English should be invited for a journal publication. ** We are currently in contact with Elsevier to ** ** have a special issue with selected papers. ** Papers should be presented in the language of submission. Detailed submission guidelines will be available at http://cbsoft.dcc.ufba.br/ IMPORTANT DATES Paper abstract submission (15 lines): May 17, 2010 Full paper submission: May 24, 2010 Notification of acceptance: July 09, 2010 Final papers due: August 02, 2010 BEST PAPER AWARD Awards will be given for the best papers at the symposium. GENERAL CHAIR Rita Suzana Pitangueira Maciel, UFPB, Brazil PROGRAMME CHAIR Ricardo Massa F. Lima, UFPE, Brazil PROGRAMME COMMITTEE Alberto Pardo, Univ. de La Republica Alex Garcia, IME Alfio Martini, PUC-RS Alvaro Freitas Moreira, UFRGS Andre Rauber Du Bois, UCPel Andr? Santos, UFPE Carlos Camarao, UFMG Christiano Braga, Univ. Comp. de Madrid Cristiano Damiani, UFPEL Edward Hermann Haeusler, PUC-Rio Fernando Castor Filho, UFPE Francisco Heron de Carvalho Junior, UFC Isabel Cafezeiro, UFF Jo?o Saraiva, Universidade do Minho Johan Jeuring, Utrecht Univ. Jose Guimaraes, UFSCAR Jose E. Labra Gayo, Univ. of Oviedo Jose Luiz Fiadeiro, Univ. of Leicester Lucilia Figueiredo, UFOP Luis Soares Barbosa, Univ. do Minho Luis Carlos Meneses, UFPE Marcelo A. Maia, UFU Marco Tulio Valente, PUC Minas Mariza A. S. Bigonha, UFMG Martin A. Musicante, UFRN Noemi Rodriguez, PUC-Rio Paulo Borba, UFPE Peter Mosses, Swansea University Renato Cerqueira, PUC-Rio Roberto S. Bigonha, UFMG Roberto Ierusalimschy, PUC-Rio Rodolfo Jardim de Azevedo, UNICAMP Sandro Rigo, UNICAMP Sergio de Mello Schneider, UFU Sergio Soares, UFPE Sergiu Dascalu, Univ. of Nevada Simon Thompson, Univ. of Kent Varmo Vene, Univ. de Tartu Vladimir Di Iorio, UFV Vitor Santos Costa, UFRJ ORGANIZATION Brazilian Computer Society and Universidade Federal da Bahia From cbraga at ic.uff.br Tue Feb 9 06:07:30 2010 From: cbraga at ic.uff.br (Christiano Braga) Date: Tue, 9 Feb 2010 09:07:30 -0200 Subject: [TYPES/announce] ICTAC 2010: FINAL Call for Papers Message-ID: ********************************************************************* FINAL Call for Papers - ICTAC 2010 International Colloquium on Theoretical Aspects of Computing Natal, Rio Grande do Norte, Brazil 1-3 September, 2010 http://www.ictac.net/ictac2010 ********************************************************************** ********************************************************************** * News *************************************************************** ** ** Submission site now open: ** http://www.easychair.org/conferences/?conf=ictac2010 ** ** Authors of a selection of the accepted papers will be invited to ** submit an extended version of their papers to a special issue of ** Elsevier's journal Theoretical Computer Science. * ** LNCS proceedings confirmed. * ********************************************************************** Background and Objectives ICTAC is an International Colloquium on Theoretical Aspects of Computing created by the International Institute for Software Technology of the United Nations University (UNU-IIST). The aim of the colloquium is to bring together practitioners and researchers from academia, industry and government to present research results, and exchange experience, ideas and solutions for their problems in theoretical aspects of computing. Beyond these scholarly goals, another main purpose of the conference is to promote cooperation in research and education between participants and their institutions, from developing and industrial countries, as in the mandate of the United Nations University. The previous six ICTAC events were held in Guiyang, China (2004), Hanoi, Vietnam (2005), Tunis, Tunisia (2006), Macau (2007), Istanbul, Turkey (2008) and Kuala Lumpur, Malaysia (2009). ICTAC 2010 includes two special tracks: a track on Formal Approaches to Testing, chaired by Marie-Claude Gaudel, and a track on the Grand Challenge in Verified Software, chaired by Jim Woodcock. The topics of the conference include, but are not limited to: - automata theory and formal languages - principles and semantics of programming languages - logics and their applications - software architectures and their description languages - software specification, refinement, verification and testing, - model checking and theorem proving - formal techniques in software testing - models of object and component systems - coordination and feature interaction - integration of theories, formal methods and tools for engineering computing systems - service-oriented development - service-oriented architectures: models and development methods - document-driven development - models of concurrency, security, and mobility - theory of parallel, distributed, and grid computing - real-time, embedded and hybrid systems - type and category theory in computer science - case studies, theories, tools and experiments of verified systems - domain-specific modeling and technology: examples, frameworks and experience ICTAC 2010 will be held in Brazil, in the city of Natal, Rio Grande do Norte. It will be organized jointly with the 3rd edition of the Pernambuco School on Software Engineering, to be held in Recife, Pernambuco, on the the topic of Formal Component Based Development and Coordination. ICTAC 2010 will include tutorials and technical sessions. Sponsors and Organisation ICTAC 2010 will be organized jointly by the Federal University of Rio Grande do Norte and UNU-IIST. They are also sponsors of ICTAC 2010. Invited Speakers Paulo Borba (Universidade Federal de Pernambuco, Brazil) Wolfram Schulte (Microsoft Research) Submission and Publication Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Papers should be written in English and not exceed 15 pages in LNCS format (see www.springer.de/comp/lncs/authors.html for details).Papers should be submitted at www.easychair.org/conferences/?conf=ictac2010. All queries should be sent to: ictac2010 at iist.unu.edu. Important Dates Submission of abstracts: March 08th, 2010; Submission deadline: March 15th, 2010; Notification of results: April 30th, 2010; Final version: May 16th, 2010 Steering Committee John Fitzgerald, UK Martin Leucker, Germany Zhiming Liu (Chair), Macao Tobias Nipkow, Germany Augusto Sampaio, Brazil Natarajan Shankar, USA Jim Woodcock, UK Special Tracks Chairs Marie-Claude Gaudel, France Jim Woodcock, UK Program Committee Bernhard Aichernig, Austria Keijiro Araki, Japan Jonathan Bowen, UK Christiano Braga, Brazil Michael Butler, UK Andrew Butterfield, Ireland Ana Cavalcanti, UK (chair) Antonio Cerone, Macao Jim Davies, UK David Deharbe, Brazil (chair) John Fitzgerald, UK Wan Fokkink, Netherlands Pascal Fontaine, France Marcelo Frias, Argentina Lindsay Groves, New Zealand Michael Hansen, Denmark Robert Hierons, UK Monzoo Kim, South Korea Maciej Koutny, UK Pascale Le Gall, France Martin Leucker, Germany Zhiming Liu, Macao Patricia Machado, Brazil Marius Minea, Romania Ali Mili, USA Michael Mislove, USA Tobias Nipkow, Germany Jose Nuno Oliveira, Portugal Paritosh Pandya, India Alberto Pardo, Uruguay Anders P Ravn, Denmark Leila Ribeiro, Brazil Markus Roggenbach, UK Augusto Sampaio, Brazil Bernhard Schaetz, Germany Gerhard Schellhorn, Germany Emil Sekerinski, Canada Natarajan Shankar, USA Marjan Sirjani, Iran Jin Song Dong, Singapore Dang Van Hung, Vietnam Daniel Varro, Hungary Helmut Veith, Germany Ji Wang, China Martin Wirsing, Germany Burkhart Wolff, France Husnu Yenigun, Turkey Naijun Zhan, China Organising Committee David Deharbe, Brazil Anamaria Moreira, Brazil Martin Musicante, Brazil Marcel Oliveira, Brazil Bartira Rocha, Brazil From Bob.Coecke at comlab.ox.ac.uk Tue Feb 9 10:17:27 2010 From: Bob.Coecke at comlab.ox.ac.uk (Bob Coecke) Date: Tue, 9 Feb 2010 15:17:27 +0000 (GMT) Subject: [TYPES/announce] CFP: 7th workshop on QUANTUM PHYSICS AND LOGIC (QPL), Oxford University, May 29-30, 2010. Message-ID: 7th workshop on QUANTUM PHYSICS AND LOGIC (QPL) Oxford University, May 29-30, 2010. http://web.comlab.ox.ac.uk/people/Bob.Coecke/QPL_10.html The workshop succeeds a Spring School marking the end of the EU FP6 STREP QICS on Foundational Structures in Quantum Computation and Information, Oxford University, May 24-28, 2010. http://web.comlab.ox.ac.uk/people/Bob.Coecke/QICS_School.html Invited Speakers at QPL: Antonio Acin (Barcelona; TBC) John Baez (UCR & Singapore) Louis Crane (Kansas State) QPL Organizers: Bob Coecke (co-chair) Prakash Panangaden (co-chair) Peter Selinger (co-chair) QPL Program Committee: Howard Barnum (Los Alamos) Dan Browne (UCL - London) Bob Coecke (Oxford) Andreas Doering (Oxford) John Harding (NMSU) Viv Kendon (Leeds) Keye Martin (NRL - Washington) Prakash Panangaden (McGill) Simon Perdrix (Grenoble) Peter Selinger (Dalhousie) Alex Wilce (Susquehanna) Deadlines: March 28: Submission April 13: Notification of authors May 16: Corrected papers due Description: This event has as its goal to bring together researchers working on mathematical foundations of quantum physics, quantum computing and spatio-temporal causal structures, and in particular those that use logical tools, ordered algebraic and category-theoretic structures, formal languages, semantical methods and other computer science methods for the study physical behaviour in general. Over the past couple of years there has been a growing activity in these foundational approaches together with a renewed interest in the foundations of quantum theory, which complement the more mainstream research in quantum computation. A predecessor of this event, with the same acronym, called Quantum Programming Languages, was held in Ottawa (2003), Turku (2004), Chicago (2005) and Oxford (2006). The first QPL under the new name Quantum Physics and Logic was held in Reykjavik (2008) and the second in Oxford (2009); with the change of name and a new program committee we emphasise the intended much broader scope of this event, aiming to nourish interaction between modern computer science logic, quantum computation and information, models of spatio-temporal causality, and quantum foundations. Submission: Prospective speakers are invited to submit a 2-5 pages abstract which provides sufficient evidence of results of genuine interest and provides sufficient detail to allows the program committee to assess the merits of the work. Submissions of works in progress are encouraged but must be more substantial than a research proposal. We both encourage submissions of original research as well as research submitted elsewhere. Submissions should be in Postscript or PDF format and should be sent to Bob Coecke by March 28, with as subject line QPL Submission. Receipt of all submissions will be acknowledged by return email. Extended versions of accepted original research contributions will be published as a special issue of a jounal - we are currently still exploring the options. From blume at tti-c.org Tue Feb 9 21:05:27 2010 From: blume at tti-c.org (Matthias Blume) Date: Tue, 9 Feb 2010 20:05:27 -0600 Subject: [TYPES/announce] *** FLOPS 2010: Call for Participation *** Message-ID: <4A1829C3-04E3-462E-8732-E80C36370941@tti-c.org> Call For Participation Tenth International Symposium on Functional and Logic Programming FLOPS 2010 April 19-21, 2010 Sendai, JAPAN http://www.kb.ecei.tohoku.ac.jp/flops2010/ ** Early registration ends on April 2, 2010 ** FLOPS is a forum for research on all issues concerning declarative programming, including functional programming and logic programming, and aims to promote cross-fertilization between the two paradigms. Previous FLOPS meetings were held in Fuji Susono (1995), Shonan Village (1996), Kyoto (1998), Tsukuba (1999), Tokyo (2001), Aizu (2002), Nara (2004), Fuji Susono (2006), and Ise (2008). VENUE The meeting will be held at the Aoba Memorial Hall, in the Aoba-yama Campus of the Tohoku University. REGISTRATION The registration is now open at the Symposium home page: http://www.kb.ecei.tohoku.ac.jp/flops2010/wiki/index.php?Registration PROCEEDINGS The proceedings will be published as volume 6009 of Lecture Notes in Computer Science, Springer, and distributed at the Symposium. INVITED SPEAKERS Brigitte Pientka (McGill University, Canada) Kostis Sagonas (National Technical University of Athens, Greece) Naoyuki Tamura (Kobe University, Japan) PROGRAM April 19 (Monday) 12:00-13:20 Registration and lunch 13:20-14:20 Invited talk Beluga: programming with dependent types and higher-order data Brigitte Pientka 14:40-16:10 Types - A Church-Style Intermediate Language for MLF Didier Remy, Boris Yakobowski - ??: Dependent Types without the Sugar Thorsten Altenkirch, Nils Anders Danielsson, Andres L?h, Nicolas Oury - Haskell Type Constraints Unleashed Dominic Orchard, Tom Schrijvers 16:30-18:00 Program analysis and transformation - A Functional Framework for Result Checking Gilles Barthe, Pablo Buiras, C?sar Kunz - Tagfree Combinators for Binding-Time Polymorphic Program Generation Peter Thiemann, Martin Sulzmann - Code Generation via Higher-Order Rewrite Systems Florian Haftmann, Tobias Nipkow April 20 (Tuesday) 09:00-10.00 Invited talk Using Static Analysis to Detect Type Errors and Race Conditions in Erlang Programs Konstantinos Sagonas 10:20-11:50 Foundations - A Complete Axiomatization of Strict Equality Javier ?lvez, Francisco Javier L?pez-Fraguas - Standardization and B?hm trees for Lambda-mu calculus Alexis Saurin - An Integrated Distance for Atoms Vicent Estruch, C?sar Ferri, Jos? Hern?ndez-Orallo, M.Jos? Ram?rez-Quintana 11:50- Lunch, excursion, and banquet April 21 (Wednesday) 09:00-10:00 Invited talk Solving Constraint Satisfaction Problems with SAT Technology Naoyuki Tamura 10:20-11:50 Logic programming - A Pearl on SAT Solving in Prolog Jacob Howe, Andy King - Automatically Generating Counterexamples to Naive Free Theorems Daniel Seidel, Janis Voigtl?nder - Applying Constraint Logic Programming to SQL Test Case Generation Yolanda Garc?a-Ruiz, Rafael Caballero, Fernando S?enz-P?rez 11:50-12:50 Lunch 12:50-14:20 Evaluation and normalization - Internal Normalization, Compilation and Decompilation for System F Stefano Berardi, Makoto Tatsuta - Normalization by Evaluation for the beta-eta Calculus of Constructions Andreas Abel - Defunctionalized Interpreters for Call-by-Need Evaluation Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny 14:40-16:10 Term rewriting - Complexity Analysis by Graph Rewriting Martin Avanzini, Georg Moser - Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and ?-Calculus Jeroen Ketema, Jakob Grue Simonsen - Proving Injectivity of Functions via Program Inversion in Term Rewriting Naoki Nishida, Masahiko Sakai 16:30-18:00 Parallelism and control - Delimited Control in OCaml, Abstractly and Concretely. System Description Oleg Kiselyov - Automatic Parallelization of Recursive Functions using Quanti?er Elimination Akimasa Morihata, Kiminori Matsuzaki - A Skeleton for Distributed Work Pools in Eden Mischa Dieterle, Jost Berthold, Rita Loogen PC CO-CHAIRS Matthias Blume (Google, Chicago, USA) German Vidal (Technical University of Valencia, Spain) CONFERENCE CHAIR Naoki Kobayashi (Tohoku University, Sendai, Japan) PC MEMBERS Nick Benton (Microsoft Research, Cambridge, UK) Manuel Chakravarty (University of New South Wales, Australia) Michael Codish (Ben-Gurion University of the Negev, Israel) Bart Demoen (Katholieke Universiteit Leuven, Belgium) Agostino Dovier (University of Udine, Italy) John P. Gallagher (Roskilde University, Denmark) Maria Garcia de la Banda (Monash University, Australia) Michael Hanus (University of Kiel, Germany) Atsushi Igarashi (Kyoto University, Japan) Patricia Johann (Rutgers University, USA) Shin-ya Katsumata (Kyoto University, Japan) Michael Leuschel (University of Dusseldorf, Germany) Francisco Lopez-Fraguas (Complutense University of Madrid, Spain) Paqui Lucio (University of the Basque Country, Spain) Yasuhiko Minamide (University of Tsukuba, Japan) Frank Pfenning (Carnegie Mellon University, USA) Francois Pottier (INRIA, France) Tom Schrijvers (Katholieke Universiteit Leuven, Belgium) Chung-chieh "Ken" Shan (Rutgers University, USA) Zhong Shao (Yale University, USA) Jan-Georg Smaus (University of Freiburg, Germany) Nobuko Yoshida (Imperial College London, UK) LOCAL CHAIR Eijiro Sumii (Tohoku University, Sendai, Japan) SOME PREVIOUS FLOPS: FLOPS 2008, Ise: http://www.math.nagoya-u.ac.jp/~garrigue/FLOPS2008/ FLOPS 2006, Fuji Susono: http://hagi.is.s.u-tokyo.ac.jp/FLOPS2006/ FLOPS 2004, Nara FLOPS 2002, Aizu: http://www.ipl.t.u-tokyo.ac.jp/FLOPS2002/ FLOPS 2001, Tokyo: http://www.ueda.info.waseda.ac.jp/flops2001/ SPONSOR Japan Society for Software Science and Technology (JSSST), SIG-PPL Graduate School of Information Sciences, Tohoku University International Information Science Foundation IN COOPERATION with AAFS (Asian Association for Foundation of Software) ACM SIGPLAN ALP (Association for Logic Programming) INQUIRIES to flops2010 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100209/c2dfc1c6/attachment-0001.htm From stavros.tripakis at gmail.com Wed Feb 10 14:01:35 2010 From: stavros.tripakis at gmail.com (Stavros Tripakis) Date: Wed, 10 Feb 2010 11:01:35 -0800 Subject: [TYPES/announce] Two phase reviewing for POPL; a response Message-ID: Dear Simon, all, Thanks for sharing your thoughts. A complementary idea, or maybe a cheaper starting point, would be to separate dissemination from selection: http://www-verimag.imag.fr/~tripakis/papers/lets.pdf I'd be happy to get comments on this. Thank you and best regards, Stavros From olivier.laurent at ens-lyon.fr Wed Feb 10 16:34:54 2010 From: olivier.laurent at ens-lyon.fr (Olivier Laurent) Date: Wed, 10 Feb 2010 22:34:54 +0100 Subject: [TYPES/announce] Galop V @ ETAPS 2010: Call for participation Message-ID: <4B73267E.7050907@ens-lyon.fr> ====================================================================== *** CALL FOR PARTICIPATION *** GaLoP V 5th Workshop on Games for Logic and Programming Languages (satellite event of ETAPS 2010) Paphos, Cyprus 20-21 March 2010 http://perso.ens-lyon.fr/olivier.laurent/galop10/ ====================================================================== REGISTRATION http://www.etaps10.cs.ucy.ac.cy/ * early registration: before February 15 * normal registration: between February 16 and February 28 * late registration: after March 1 PROGRAM Saturday, March 20th Morning * [Invited talk] Jean Goubault-Larrecq * AJM-games revisited (Nikos Tzevelekos and Samson Abramsky) * Pointer game semantics for polymorphism (Paul Blain Levy and Soren B. Lassen) * Understanding Game Semantics through Coherence Spaces (Ana C. Calderon and Guy McCusker) Afternoon * [Invited talk] Jacques Duparc * The lambda lambda-bar calculus: a calculus for static, fine grained control of the view (Alexis Goyet) * Game semantics and normalization (Pierre Clairambault) * Realizability for games (Olivier Laurent) Sunday, March 21st Morning * [Invited talk] Kazushige Terui * Graphs of Interaction : Multiplicatives (Thomas Seiller) * Incarnation in Ludics and maximal cliques (Christophe Fouquere and Myriam Quatrini) * Multiparty Session Types (Nobuko Yoshida) Afternoon * [Invited talk] Andrzej Murawski * Algorithmic Game Semantics and Symbolic Execution (David Hopkins and Luke Ong) * Type Systems for Control of Pipelining (Dan Ghica) INVITED SPEAKERS * Jacques Duparc, Lausanne * Jean Goubault-Larrecq, Cachan * Andrzej Murawski, Oxford * Kazushige Terui, Kyoto ABOUT GALOP GaLoP is an annual international workshop on game-semantic models for logics and programming languages and their applications. This is an informal workshop that welcomes work in progress, overviews of more extensive work, programmatic or position papers and tutorials as well as contributed papers. The fifth GaLoP will be held in Paphos (Cyprus) between March 20 and 21 and will be part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2010). From yu at docomolabs-usa.com Wed Feb 10 17:07:52 2010 From: yu at docomolabs-usa.com (Dachuan Yu) Date: Wed, 10 Feb 2010 14:07:52 -0800 Subject: [TYPES/announce] Internship Positions at DOCOMO USA Labs Message-ID: <2FD61F37AFF16D4DB46149330E4273C702AC00BE@dcl-ex.dcml.docomolabs-usa.com> The Mobile Service Laboratory at DOCOMO USA Labs has 4 internship positions available for Summer 2010. An HTML version of this announcement is available at http://www.docomolabs-usa.com/car_open_msl-int.html -2010 Summer internship positions- US working permit is required for the following positions! 1. Software Specification and Testing The Mobile Services Lab at DOCOMO USA Labs is looking for a bright and motivated candidate to work on an applied research project related to handset specification and testing. The multiplicity of handsets and heterogeneous software stacks add unique challenges to the software assurance problem in this domain. We are interested in building software specification and testing frameworks and researching new techniques in this area, that take into account the particular software production and distribution models supported by a mobile operator. The selected candidate will work closely with a team of researchers on the project, and will have the opportunity to enable direct industrial impact through their work here, in addition to any publications that may arise out of the work. A strong background in one or more of the following areas is desirable: formal methods, programming languages, and software testing. Interested candidates must be pursuing an M.S. or Ph.D. degree in CS or EE, and must have strong research experience. A strong programming background is also essential. The ability to work well with a team is expected. Applicants must have, or should be able to obtain, the relevant authorization to work as an intern in a U.S. company. Applications and enquiries should be sent to msl_intern_recruit at docomolabs-usa.com or mail it to:(Please write "MSL-Int-SST" in Subject) Attn: MSL-Int-SST recruiting DOCOMO Communications Laboratories USA, Inc. 3240 Hillview Avenue Palo Alto, CA 94304-1201 2. Mobile Usability The Mobile Services Lab at DOCOMO USA Labs is looking for a bright and motivated candidate to work on a systems project aimed at fostering a mobility-centric lifestyle. The number of cell phone users is constantly on the rise worldwide, and an increasingly larger percentage of them use cell phones for daily tasks. However, the small form-factor of mobile devices, as well as the design of software user interfaces and available services can be a limiting factor impacting the usability of cell phones for daily activities. Our work focuses on approaches for improving mobile usability through service and interface design and analysis, that can be adopted by a mobile operator towards consumer-centric solutions. The selected candidate will work closely with a researcher, and will have the opportunity to enable direct industrial impact through their work here, in addition to any publications that may arise out of the work. A strong background in one or more of the following areas is desirable: usability, mobile user interfaces, user-centric service design, natural language processing, data mining, and web-based middleware. Interested candidates must be pursuing a Ph.D. degree in CS or EE, and must have strong research experience. A strong programming background is also essential, and Experiences with the mobile Web and/or browser/server extensions are big pluses. The ability to work well with a team is expected. Applicants must have, or should be able to obtain, the relevant authorization to work as an intern in a U.S. company. Applications and enquiries should be sent to msl_intern_recruit at docomolabs-usa.com or mail it to:(Please write "MSL-Int-MU" in Subject) Attn: MSL-Int-MU recruiting DOCOMO Communications Laboratories USA, Inc. 3240 Hillview Avenue Palo Alto, CA 94304-1201 3. Content Analytics The Mobile Services Lab at DOCOMO USA Labs is looking for a bright and motivated candidate to work on technologies related to content analytics to facilitate new classes of mobile applications. By now, cell phones are the world's largest and most widespread computing platform, and have access to unique context and sensor information that is accessible to mobile applications through middleware APIs. Today, consumers express their intent either in natural language by using communication channels like email, SMS, status updates, etc., or by directly interacting with the interface of software applications. This project will investigate techniques for analyzing the content created by mobile consumers in interacting with other consumers or with software applications, with the goal of connecting the intent expressed in natural language with software application interactions and vice versa. The selected candidate will work closely with a researcher, and will have the opportunity to enable direct industrial impact through their work here, in addition to any publications that may arise out of the work. A strong background in one or more of the following areas is desirable: natural language processing, data mining, intelligent agents, cognitive modeling, artificial intelligence. Interested candidates must be pursuing a Ph.D. degree in CS or EE, and must have strong research experience. A strong programming background is also essential, and Experiences with the mobile Web and/or browser/server extensions are big pluses. The ability to work well with a team is expected. Applicants must have, or should be able to obtain, the relevant authorization to work as an intern in a U.S. company. Applications and enquiries should be sent to msl_intern_recruit at docomolabs-usa.com or mail it to:(Please write "MSL-Int-CA" in Subject) Attn: MSL-Int-CA recruiting DOCOMO Communications Laboratories USA, Inc. 3240 Hillview Avenue Palo Alto, CA 94304-1201 4. Adaptive Approximations of Visual Data The Mobile Services Lab (Media Technology Project) at DOCOMO USA Labs is seeking a strong PhD student for a summer internship position. Many types of signals can be modeled as arising from known families of approximation spaces. Yet there are many other signals for which such models do not hold. In this project we will construct adaptive approximations for "difficult" signals by developing highly nonlinear analytical and algorithmic techniques. The project will allow us to better understand the statistical nature of visual data so that we can design better processing algorithms targeting mobile augmented reality applications. -PhD student in Electrical Engineering, Computer Science, or Mathematics -Very strong mathematical skills -Very strong knowledge of basic signal and image processing techniques -Excellent programming skills in C/C++ Applicants must have, or should be able to obtain, the relevant authorization to work as an intern in a U.S. company. Applications and enquiries should be sent to msl_intern2_recruit at docomolabs-usa.com or mail it to:(Please write "MSL-MTP" in Subject) Attn: MSL-MTP recruiting DOCOMO Communications Laboratories USA, Inc. 3240 Hillview Avenue Palo Alto, CA 94304-1201 Thank you for your consideration. Dachuan Yu Mobile Service Laboratory DOCOMO USA Labs -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100210/e965790e/attachment-0001.htm From roberto at dicosmo.org Thu Feb 11 10:56:48 2010 From: roberto at dicosmo.org (Roberto Di Cosmo) Date: Thu, 11 Feb 2010 16:56:48 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: References: Message-ID: <20100211155648.GE13227@traveler> Dear Stavros, thanks for the refreshing reading. Since you touch upon dissemination and not only selection, I might suggest you to have a look also to this contribution that tries to clarify several issues with scientific publishing (but not selection, which is IMHO a delicate point with too many parameters for me to have a significant contribution to make). http://www.upgrade-cepis.org/issues/2006/3/up7-3DiCosmo.pdf --Roberto On Wed, Feb 10, 2010 at 11:01:35AM -0800, Stavros Tripakis wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > Dear Simon, all, > > Thanks for sharing your thoughts. > > A complementary idea, or maybe a cheaper starting point, would be to > separate dissemination from selection: > > http://www-verimag.imag.fr/~tripakis/papers/lets.pdf > > I'd be happy to get comments on this. > > Thank you and best regards, > Stavros -- --Roberto Di Cosmo ------------------------------------------------------------------ Professeur En delegation a l'INRIA PPS E-mail: roberto at dicosmo.org Universite Paris Diderot WWW : http://www.dicosmo.org Case 7014 Tel : ++33-(0)1-44 27 86 55 5, Rue Thomas Mann Fax : ++33-(0)1-44 27 86 54 F-75205 Paris Cedex 13 FRANCE. ------------------------------------------------------------------ Attachments: MIME accepted Word deprecated, http://www.rfc1149.net/documents/whynotword ------------------------------------------------------------------ Office location: Bureau 6C15 (6th floor) 175, rue du Chevaleret, XIII Metro Chevaleret, ligne 6 ------------------------------------------------------------------ From andrei at chalmers.se Thu Feb 11 12:58:55 2010 From: andrei at chalmers.se (Andrei Sabelfeld) Date: Thu, 11 Feb 2010 18:58:55 +0100 Subject: [TYPES/announce] OWASP AppSec Research deadline extended to March 7 Message-ID: <4B74455F.7040008@chalmers.se> Dear TYPES-announce subscribers, The deadline for the "Publish or Perish" track (full papers) at the OWASP AppSec Research in Stockholm is extended to March 7. If you have a suitable paper in the pipeline, please submit it to AppSec to make both academic and industrial impact and support this exciting event that connects academia and industry. As before, type-based submissions are warmly welcome! More information: http://www.owasp.org/index.php/OWASP_AppSec_Research_2010_-_Stockholm%2C_Sweden#tab=CFP Best, -Andrei From ldixon at inf.ed.ac.uk Fri Feb 12 05:37:42 2010 From: ldixon at inf.ed.ac.uk (Lucas Dixon) Date: Fri, 12 Feb 2010 10:37:42 +0000 Subject: [TYPES/announce] PLMMS 2010 Call for Papers Message-ID: <4B752F76.1020106@inf.ed.ac.uk> [Apologies for possible multiple postings.] ------------------------------------------------------------------- First CALL FOR PAPERS ------------------------------------------------------------------- In co-operation with ACM SIGSAM, the International Workshop on Programming Languages for Mechanized Mathematics Systems (PLMMS 2010) Part of CICM-2010, in CNAM, Paris, France; 8th of July 2010 ------------------------------------------------------------------- Important Dates --------------- * Abstract submission: Fri 26 March 2010 * Paper submission: Fri 9 April 2010 * Reviews sent to authors: Mon 10 May 2010 * Author's response deadline: Mon 17 May 2010 * Notification of acceptance: Mon 24 May 2010 * Camera ready copy due: Mon 7 June 2010 * Workshop: Thu 8 July 2010 PLMMS Scope ----------- The program committee welcomes submissions on programming language issues related to all aspects of mechanised mathematics systems (MMS). In particular: - Mathematical algorithms - Tactics and proof search - Proofs - Mathematical notation Of particular interest are the dimensions of: - Expressiveness - Efficiency - Correctness - Understandability and Usability - Modularity and Extensibility - Design and implementation Mechanised mathematics systems, whether stand-alone or embedded in larger systems, include but are not limited to: - Dependent typed programming languages - Proof assistants - Computer algebra systems - Proof planning systems - Theorem proving systems - Theory formation systems These issues have a very colourful history. Why are all the languages of mainstream computer algebra systems untyped? Why are the (strongly typed) proof assistants so much harder to use than a typical computer algebra systems? What forms of polymorphism exist in mathematics? What forms of dependent types may be used in mathematical modelling? How can MMS regain the upper hand on issues of "genericity" and "modularity"? What are the biggest barriers when using more mainstream languages for computer algebra systems, proof assistants or theorems provers? Many programming language innovations appeared in either computer algebra or proof systems first, before migrating into more mainstream programming languages. This workshop is an opportunity to present the latest innovations in the design of MMS that may be relevant to future programming languages, or conversely novel programming language principles that improve upon the implementation and deployment of MMS. Submission Details ------------------ Accepted papers will appear in the ACM Digital Library. Papers should be submitted via the PLMMS 2010 easychair website: http://www.easychair.org/conferences/?conf=plmms2010 Submissions must describe original unpublished work which is not been submitted for publication elsewhere. At least one author of each accepted paper is expected to attend PLMMS 2010 and present her or his paper. Papers should be no more than 8 pages in length and are to be submitted in PDF format. They must conform to the ACM SIGPLAN style guidelines using 9-point font size (see http://www.acm.org/sigs/sigplan/authorInformation.htm - this also provides latex templates). Each submission must also adhere to SIGPLAN's republication policy (http://www.sigplan.org/republicationpolicy.htm). Papers will be reviewed by at least three reviewers and the authors will have an opportunity for rebuttal by the response deadline. Links ----- * http://www.easychair.org/conferences/?conf=plmms2010 abstract and paper submission webpage * ttp://www.acm.org/sigs/sigplan/authorInformation.htm submission style guide * http://www.sigplan.org/republicationpolicy.htm republication policy * http://dream.inf.ed.ac.uk/events/plmms-2010/ the PLMMS 2010 web site * http://cicm2010.cnam.fr/ the CICM 2010 conference web site Program Committee ----------------- * Thorsten Altenkirch (University of Nottingham, UK) * Serge Autexier (DFKI, Germany) * David Delahaye (CNAM, Paris, France) * James Davenport [PC co-chair] (University of Bath, UK) * Lucas Dixon [PC co-chair] (University of Edinburgh, UK) * Gudmund Grov (University of Edinburgh, UK) * Ewen Maclean (University of Herriot Watt, UK) * Dale Miller (INRIA, France) * Gabriel Dos Reis (Texas A&M University, USA) * Carsten Schuermann (IT University of Copenhagen, Denmark) * Tim Sheard (Portland State University, USA) * Sergei Soloviev (IRIT, Toulouse, France) * Stephen Watt (The University of Western Ontario, Canada) * Makarius Wenzel (ITU Munich, Germany) * Freek Wiedijk (Radboud University Nijmegen, Netherlands) -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From wadler at inf.ed.ac.uk Tue Feb 16 05:36:39 2010 From: wadler at inf.ed.ac.uk (Philip Wadler) Date: Tue, 16 Feb 2010 10:36:39 +0000 Subject: [TYPES/announce] Chair and Readership in Computer Security and Algorithms and Computational Complexity Message-ID: Readers familiar with the School of Informatics and LFCS will know that we have a special affinity for types, so we would welcome applications from those following type-based approaches to security and complexity. (Not that we exclude those following other approaches!) We are hoping to fill the positions with a professor and a reader, but we welcome applications from strong candidates at any level; the chair may go to either the security or complexity post. Note that the professorial salary listed is the low end of the scale. Please contact me if you have any questions. Cheers, -- P The University of Edinburgh School of Informatics Chair and Readership in (A) Computer Security and (B) Algorithms and Computational Complexity The University of Edinburgh invites applications for two posts, from candidates with research of international standing, one Chaired Professorship and one Readership (approximately associate professorship), in TWO areas: (A) Computer Security The appointee will have an outstanding research record in one or more areas of computer security. Areas that match our current strengths include: theoretical foundations of security, database security, programming language based security, security properties of mobile and concurrent systems, automated logical analysis of protocol correctness, and security analysis of APIs. Applications are also highly encouraged from areas that complement our current strengths: cryptography and network security. The post will be associated with the Scottish Informatics and Computer Science Alliance (SICSA) and it is anticipated that the appointee will join the Laboratory for Foundations of Computer Science (LFCS). (B) Algorithms and Computational Complexity The appointee will have an excellent research record in any active area of algorithms and computational complexity including: randomized algorithms, approximation algorithms, combinatorial optimization, algorithmic game theory, complexity theory, and distributed algorithms. The successful candidate is anticipated to join the Laboratory for Foundations of Computer Science within the School of Informatics. The laboratory?s current research in algorithms and complexity covers randomized algorithms, algorithmic game theory, computational complexity, approximation algorithms, combinatorial and stochastic optimization, algebraic complexity, quantum computing, and descriptive complexity. Salary details Chair: Grade 10 ? salary from ?53,650 pa. Reader: Grade 9 ? salary ?47,278 to ?52,086 pa. Candidates for the posts may be in either area. Appointment at lecturer level (grade 8: ?36,532 - ?43,622 pa) may be considered for a less experienced, but exceptional candidate. Closing date for applications for both posts: 26 February 2010. -- .\ Philip Wadler, Professor of Theoretical Computer Science ./\ School of Informatics, University of Edinburgh / \ http://homepages.inf.ed.ac.uk/wadler/ The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From tom.hirschowitz at univ-savoie.fr Tue Feb 16 10:14:01 2010 From: tom.hirschowitz at univ-savoie.fr (Tom Hirschowitz) Date: Tue, 16 Feb 2010 16:14:01 +0100 Subject: [TYPES/announce] CFP Types postproceedings Message-ID: <3BB7B463-29E3-4BE7-84D7-A8B89B731FCD@univ-savoie.fr> Post-Proceedings of TYPES 2009 The Post-Proceedings of the TYPES 2009 Annual Workshop http://lama.univ-savoie.fr/types09/ will be published, after a formal referee process, as a volume of the Electronic Proceedings in Theoretical Computer Science (EPTCS) series http://eptcs.org/ . Submissions are not restricted to works presented at the workshop, nor are authors expected to be formally involved in the Types project. Deadlines - abstract submission: Wednesday, May 19th, 2010, 12:00 Paris time, - paper submission: Wednesday, May 26th, 2010, 12:00 Paris time. We encourage submissions on the themes of the Types Project http://www.cs.chalmers.se/Cs/Research/Logic/Types/ . The aim of Types is to develop the technology of formal reasoning and computer programming based on Type Theory. This is done by improving the languages and computerised tools for reasoning, and by applying the technology in several domains such as analysis of programming languages, certified software, formalisation of mathematics and mathematics education. We invite submission of high quality papers, written in English and typeset in LaTeX2e using the EPTCS style: http://style.eptcs.org/ . Submissions should not have been published and should not be under consideration for publication elsewhere. We encourage authors to keep their submissions below 30 pages. Authors should submit their papers electronically to Tom Hirschowitz. The guest editors, Thorsten Altenkirch, Tom Hirshowitz, Christophe Raffalli, and Alan Schmitt. From A.M.Silva at cwi.nl Tue Feb 16 12:04:45 2010 From: A.M.Silva at cwi.nl (A.M.Silva@cwi.nl) Date: Tue, 16 Feb 2010 18:04:45 +0100 Subject: [TYPES/announce] CMCS 2010: Call for Short Submissions & Call for Participation Message-ID: <20100216170445.GA24278@wendy.sen.cwi.nl> ------------------------------------------------------------------------ CMCS 2010 Call for Short Submissions & Call for Participation ------------------------------------------------------------------------ The 10th International Workshop on Coalgebraic Methods in Computer Science 26-28 March 2010, Paphos, Cyprus (co-located with ETAPS 2010) Aims and scope ------------------------- The aim of the workshop is to bring together researchers with a common interest in the theory of coalgebras and its applications. Over the last two decades, coalgebra has developed into a field of its own, presenting a mathematical foundation for various kinds of dynamical systems, infinite data structures, and logics. Coalgebra has an ever growing range of applications in and interactions with 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 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). An anniversary: the 10th CMCS --------------------------------------------- CMCS took place for the first time when ETAPS started, in 1998. Since then, it has always been collocated with ETAPS, becoming bi-annual since the start of CALCO (Conference on Algebra and Coalgebra) in 2005. In 2010, we will celebrate the 10th edition of CMCS, by inviting a number of specialists in the field to present overviews of both obtained results and future challenges. Invited Speakers ------------------------- At this tenth meeting the following invited speakers will present overviews of important subareas. * Venanzio Capretta: Coalgebra in functional programming and type theory * Bartek Klin: Operational semantics coalgebraically * Dirk Pattinson: Logic and coalgebra * Ana Sokolova: Probabilistic systems coalgebraically Short contributions ----------------------------- Apart from the presentation of regular papers (see list below) and invited contributions, some time has been reserved for *short contributions* . These will not be published in the proceedings but will be bundled in a CWI technical report. They should be no more than two pages and may describe work in progress, summarise work submitted to a conference or workshop elsewhere, or in some other way appeal to the CMCS audience. The instructions for submitting short contributions can be found at: Important dates ------------------- * 27 February 2010: strict submission deadline short contributions * 28 February 2010: deadline normal registration * 6 March 2010: notification short contributions * 26-28 March 2010: the workshop List of accepted regular papers --------------------------------------------- * Jan Komenda . Coinduction in concurrent timed systems * Jiri Adamek, Stefan Milius and Jiri Velebil . Recursive Program Schemes and Context-Free Monads * Bartek Klin . Structural operational semantics and modal logic, revisited * Hauhs Michael and Baltasar Tranc n y Widemann . Applications of Algebra and Coalgebra in Scientific Modelling: Illustrated with the Logistic Map * Kazuyuki Asada and Ichiro Hasuo . Categorifying Computations into Components via Arrows as Profunctors * Corina Cirstea . Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics * Vincenzo Ciancia, Alexander Kurz and Ugo Montanari . Families of symmetries for the semantics of programming languages * Jiho Kim . Higher-order algebras and coalgebras from parameterized endofunctors * Bart Jacobs . From Coalgebraic to Monoidal Traces * Adriana Balan and Alexander Kurz . On coalgebras over algebras Programme Committee ---------------------------------- Jiri Adamek (Braunschweig) Alexandru Baltag (Oxford) Luis Barbosa (Braga) Marcello Bonsangue (Leiden) Corina Cirstea (Southampton) Robin Cockett (Calgary) Andrea Corradini (Pisa) Neil Ghani (Glasgow) Peter Gumm (Marburg) Furio Honsell (Udine) Bart Jacobs (Nijmegen, co-chair) Bartek Klin (Cambridge) Clemens Kupke (London) Alexander Kurz (Leicester) Marina Lenisa (Udine) Stefan Milius (Braunschweig) Ugo Montanari (Pisa) Larry Moss (Bloomington) Milad Niqui (Amsterdam) Dirk Pattinson (London) Dusko Pavlovic (Oxford) John Power (Edinburgh) Horst Reichel (Dresden) Grigore Rosu (Urbana) Jan Rutten (Amsterdam, co-chair) Davide Sangiorgi (Bologna) Lutz Schr der (Bremen) Alexandra Silva (Amsterdam) Hendrik Tews (Nijmegen) Tarmo Uustalu (Tallinn) Yde Venema (Amsterdam) Hiroshi Watanabe (Osaka) James Worrell (Oxford) Organising Committee -------------------------- Bart Jacobs, Milad Niqui (co-chair, CWI), Jan Rutten, Alexandra Silva (co-chair, CWI). Contact ---------- cmcs10 at cwi.nl . From eernst at cs.au.dk Wed Feb 17 11:37:24 2010 From: eernst at cs.au.dk (Erik Ernst) Date: Wed, 17 Feb 2010 17:37:24 +0100 Subject: [TYPES/announce] CFP - MASPEGHI 2010 Message-ID: <6DD11865-9EF1-4725-B8F5-843DAE2B8DCD@cs.au.dk> [Apologies if you receive multiple copies of this] Call for Papers for the MASPEGHI 2010 Workshop MechAnisms for SPEcialization, Generalization and inHerItance Associated with ECOOP 2010, Maribor, Slovenia MASPEGHI 2010 invites papers suitable for generating insight and discussion about mechanisms for specialization, generalization, code reuse, and inheritance, with the following important dates: - Paper submission: April 19, 2010 - Notification of acceptance: May 5, 2010 - ECOOP early registration deadline: May 10, 2010 - Workshop: June 21 or 22 Please note that registration must be done with ECOOP itself. For more information, please visit the workshop web site: http://www.i3s.unice.fr/maspeghi2010/ -- Erik Ernst - eernst at cs.au.dk Department of Computer Science, Aarhus University IT-parken, Aabogade 34, DK-8200 Aarhus N, Denmark From naumann at cs.stevens.edu Wed Feb 17 12:33:28 2010 From: naumann at cs.stevens.edu (David Naumann) Date: Wed, 17 Feb 2010 12:33:28 -0500 (EST) Subject: [TYPES/announce] Theory workshop at VSTTE 2010 - call for papers Message-ID: ********************************************************** ??????????????????CALL FOR PAPERS ???????????????????VS-THEORY 2010 ???????The THEORY Workshop at VSTTE 2010 (Verified ???????Software: Theories, Tools and Experiments) ???http://www.cs.stevens.edu/~naumann/vstte-theory-2010/ ???????????????Edinburgh, Scotland, UK ??????????????????19th August, 2010 ???????The THEORY Workshop is part of VSTTE 2010 ???????http://www.macs.hw.ac.uk/vstte10/Home.html *********************************************************** VS-THEORY 2010 invites submissions of technical papers of up to 10 pages (LNCS format) related to software verification in a broad sense. This includes research on proof methods for various programming paradigms (object-oriented, functional, imperative, concurrent etc), program/proof codesign, requirements modeling, specification languages, formal calculi, programming languages, language semantics, software design methods, software testing, automatic code generation, meta-programming and multi-stage computation, refinement methodologies, type systems, computer security, model checking and theorem proving. Evaluations, comparisons, and unification of rival methods are welcome. This list of topics is indicative, and is explicitly intended to be non-exhaustive. In addition to technical papers we welcome challenge papers, up to 5 pages, that pose specific or general problems in theory that pertain to the Verified Software Initiative. Such submissions should have the word ``challenge'' in their title. Accepted papers will be made available online as an informal proceedings, but there will be no formal proceedings so publication elsewhere is not precluded. IMPORTANT DATES: Submission deadline: 21 May Notification of acceptance: ?25 June Final versions due: 23 July VSTTE 2010 main conference: 16 - 18 August Workshop: 19 August PROGRAM COMMITTEE Amal Ahmed, Indiana University, US Rajeev Alur, University of Pennsylvania, US Anupam Datta, Carnegie Mellon University, US Yannis Kassios, ETH Zurich, CH Neel Krishnaswami, Microsoft Research, UK Daniel Kroening, Oxford University, UK Antoine Mine, CNRS, FR Aleks Nanevski, IMDEA Software, SP David Naumann, Stevens Institute of Technology, US (co-chair) Tamara Rezk, INRIA, FR Dave Schmidt, Kansas State University, US Ashish Tiwari, SRI International, US Viktor Vafeiadis, University of Cambridge, UK Hongseok Yang, Queen Mary University of London, UK (co-chair) From alur at seas.upenn.edu Wed Feb 17 17:23:06 2010 From: alur at seas.upenn.edu (Rajeev Alur) Date: Wed, 17 Feb 2010 17:23:06 -0500 Subject: [TYPES/announce] Post-doctoral positions in Formal Verification / Software Analysis / Hybrid Systems at Penn Message-ID: <4B7C6C4A.6070807@seas.upenn.edu> Postdoctoral research positions are available at University of Pennsylvania in the broad areas of formal verification, software analysis, and hybrid systems. Research in formal methods at Penn spans foundations in logics, automata, and abstractions, tools for analysis and synthesis of software systems, and model-based design of embedded control systems (see http://www.cis.upenn.edu/~alur/) University of Pennsylvania is conveniently located in central Philadelphia. Department of Computer and Information Science has strong research groups in related areas such as programming languages, embedded software systems, and robotics. The appointment can be upto two years starting Summer 2010. Please email enquiries and applications to Rajeev Alur (alur at cis.upenn.edu) From damiano.mazza at lipn.univ-paris13.fr Wed Feb 17 17:30:35 2010 From: damiano.mazza at lipn.univ-paris13.fr (Damiano Mazza) Date: Wed, 17 Feb 2010 23:30:35 +0100 Subject: [TYPES/announce] Post-doc position at Paris 13 Message-ID: <4B7C6E0B.2030002@lipn.univ-paris13.fr> _______________________________________________________ Post-doctoral position at LIPN, Universit? Paris 13 Linear logic and implicit computational complexity http://www-lipn.univ-paris13.fr/complice/spip.php?rubrique4 ________________________________________________________ A 12-month post-doctoral position is available at the Laboratoire d'Informatique de Paris Nord (LIPN), Universit? Paris 13 within the research project COMPLICE (Implicit Computational Conmplexity, Concurrency and Extraction, http://www-lipn.univ-paris13.fr/complice/spip.php?rubrique4), founded by the French national research agency (ANR). _______________________________________________________ ________________ Scientific context ___________________ COMPLICE is a four-year project whose partner sites are ENS Lyon, Universit? Paris 13 and LORIA-Nancy. The project's goal is to investigate the foundations and applications of implicit computational complexity (ICC), along the lines of semantics and logic, functional programming, program extraction from proofs, quantitative properties and ICC for concurrent systems. _______________________________________________________ ______________________ Location _______________________ LIPN (http://www-lipn.univ-paris13.fr/?lang=uk) plays a major role in research in computer science within the northern Paris area. The post-doc researcher will work within the Logic, Computation and Reasoning group (http://www-lipn.univ-paris13.fr/LCR/?lang=uk), among whose main research directions there are proof theory, linear logic, lambda-calculus, implicit computational complexity, denotational semantics, system specification and verification, and algebraic combinatorics. LIPN is situated in Villetaneuse, in the northern suburbs of Paris, within the campus of the University Paris 13 (about 45 minutes from the city center by public transportation). Interaction with the other sites of the COMPLICE project is also expected. Additionally, LIPN has long established interactions with the following sites: - Preuves, Programmes et Syst?mes, Paris 7; - Institut de Mathematiques de Luminy, Marseille; - Dipartimento di Informatica, Universit? di Torino; - Dipartimento di Filosofia, Universita Roma Tre, Rome; _______________________________________________________ ________________ Salary and benefits __________________ The monthly salary will be around 2000 EUR. This is then subject to income tax. The position is for 12 months, but might be extendable for a longer period. The post-doc researchers will be affiliated to the French social security system, and will be entitled to unemployment benefit at the end of the contract. _______________________________________________________ ____________________ Requirements _____________________ The applicants should hold a PhD. We are especially interested in candidates with background in one or several of the following fields: - linear logic (proof nets, geometry of interaction, ludics) - rewriting theory (lambda-calculus, interaction nets) - denotational semantics (category theory, games semantics, vectorial semantics) - implicit computational complexity (light logics, type systems for complexity) _______________________________________________________ _______________ Application procedure _________________ Applications should be sent EXCLUSIVELY by email, to the addresses Damiano.Mazza at lipn.univ-paris13.fr Virgile.Mogbil at lipn.univ-paris13.fr preferably with the subject containing the words "Complice Application" (to be sure that the application is not accidentally eaten by spam filters...). The application must include: - a detailed resume; - a short research project (1 page); - contact information of two possible references. Applications are currently open and will stay open until the position is filled, without a specific deadline. Potentially interested candidates are invited to contact us as soon as possible. The starting date of the post-doc will be decided with the candidate (earlier dates are preferred). Further information, including the notification of when the position will be filled, will be made available on the following web page: http://www-lipn.univ-paris13.fr/complice/spip.php?rubrique14 From brunocdsoliveira at googlemail.com Thu Feb 18 06:59:21 2010 From: brunocdsoliveira at googlemail.com (Bruno Oliveira) Date: Thu, 18 Feb 2010 20:59:21 +0900 Subject: [TYPES/announce] WGP 2010 Call for Papers Message-ID: 6th ACM SIGPLAN Workshop on Generic Programming, 2010 Baltimore, Maryland, US Sunday, September 26th, 2010 http://osl.iu.edu/wgp2010 Goals of the workshop Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, and, for at least 20 years, generic programming techniques have been a specific focus of research in the functional and object-oriented programming communities. Generic programming has gradually spread to more and more mainstream languages, and today is widely used in industry. This workshop brings together leading researchers and practitioners in generic programming from around the world, and features papers capturing the state of the art in this important area. We welcome contributions on all aspects, theoretical as well as practical, of * polytypic programming, * programming with dependent types, * programming with type classes, * programming with (C++) concepts, * generic programming, * programming with modules, * meta-programming, * adaptive object-oriented programming, * component-based programming, * strategic programming, * aspect-oriented programming, * family polymorphism, * object-oriented generic programming, * and so on. Organisers: Co-Chair Bruno C. d. S. Oliveira, Seoul National University Co-Chair Marcin Zalewski, Indiana University Programme Committee: Alley Stoughton, Kansas State University Andrei Alexandrescu, Facebook Bruno C. d. S. Oliveira (Co-Chair), Seoul National University Doug Gregor, Apple Gilad Bracha, I am a Computational Theologist Emeritus Magne Haveraaen, Universitetet i Bergen Marcin Zalewski (Co-Chair), Indiana University Neil Mitchell, Standard Chartered Ralf L?mmel, University of Koblenz-Landau Shin-Cheng Mu, Academia Sinica Thorsten Altenkirch, University of Nottingham Ulf Norell, Chalmers University We plan to have formal proceedings, published by the ACM. Submission details Deadline for submission: Sunday 2010-06-13 Notification of acceptance: Monday 2010-07-12 Final submission due: Tuesday 2010-07-27 Workshop: Sunday 2010-09-26 Authors should submit papers, in postscript or PDF format, formatted for A4 paper, to the WGP09 EasyChair instance by 13th of June 2010. The length should be restricted to 12 pages in standard (two-column, 9pt) ACM format. Accepted papers are published by the ACM and will additionally appear in the ACM digital library. History of the Workshop on Generic Programming This year: * Baltimore, Maryland, US 2010 (affiliated with ICFP10) Earlier Workshops on Generic Programming have been held in * Edinburgh, UK 2009 (affiliated with ICFP09) * Victoria, BC, Canada 2008 (affiliated with ICFP), * Portland 2006 (affiliated with ICFP), * Ponte de Lima 2000 (affiliated with MPC), * Marstrand 1998 (affiliated with MPC). Furthermore, there were a few informal workshops * Utrecht 2005 (informal workshop), * Dagstuhl 2002 (IFIP WG2.1 Working Conference), * Nottingham 2001 (informal workshop), There were also (closely related) DGP workshops in Oxford (June 3-4 2004), and a Spring School on DGP in Nottingham (April 24-27 2006, which had a half-day workshop attached). Additional information: The WGP steering committee consists of J Gibbons, R Hinze, P Jansson, J Jarvi, J Jeuring, B Oliveira, S Schupp and M Zalewski -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100218/ed5d2e9f/attachment-0001.htm From kaufmann at cs.utexas.edu Thu Feb 18 09:53:28 2010 From: kaufmann at cs.utexas.edu (Matt Kaufmann) Date: Thu, 18 Feb 2010 08:53:28 -0600 Subject: [TYPES/announce] Call for Votes on bids to host ITP-2011 Message-ID: <201002181453.o1IErSEL014760@sundance.cs.utexas.edu> Bidding has now closed for ITP-2011, and the bids can be viewed at http://www.cs.utexas.edu/users/kaufmann/itp-2011-bids.html Voting is now open to decide which bid should be adopted. If you are seriously thinking of attending ITP-2011, then you may vote. Please read the bids and judge them by the plans as a whole: are the facilities appropriate? Are the transportation links adequate? Do you have confidence in the organisers? TPHOLs had a tradition of alternating between Europe and North America, but bids were opened world-wide since the first call for bids was unsuccessful. It is up to you, the electorate, to decide which location will be best for 2011. Voting will be by single transferable vote: each ballot will consist of your preferences in decreasing order. Votes will be counted in a series of rounds until a candidate wins a majority. At each round, the least popular candidate will be eliminated. Your second choice vote will only be counted if your first choice candidate is eliminated, and so forth. This system is known by many other names: instant run-off voting (IRV), alternative vote (AV), etc. To ensure that your ballot is counted, please adhere carefully to following formatting instructions. List your choices from most to least preferable (any positive number of choices up to five is acceptable). For example, the following ballot (with fictitious choices) indicates a preference first for Alice, then for Bob, and so on. Alice Bob Frank Mary Each choice should be one of the tags shown on the above web page: China, Netherlands, Spain, Denmark, or USA. Send your vote by March 1, by email to Matt Kaufmann, kaufmann at cs.texas.edu. Regards, Matt Kaufmann and Larry Paulson (ITP-10 co-chairs) From dvanhorn at ccs.neu.edu Thu Feb 18 14:46:45 2010 From: dvanhorn at ccs.neu.edu (David Van Horn) Date: Thu, 18 Feb 2010 14:46:45 -0500 Subject: [TYPES/announce] Higher-Order Flow Analysis (HOFA) Forum Message-ID: <4B7D9925.1000406@ccs.neu.edu> [ There are well known connections between types and flow analyses, so the HOFA forum should be of interest to many TYPES readers. Also, the forum itself is modeled closely on TYPES. Please join the forum if you are interested in flow analysis, and send mail if you or your lab should be listed on the researchers page. -- David ] Higher-Order Flow Analysis (HOFA) Forum http://hofa.lambda-calcul.us/ The HOFA forum is an email forum for the discussion and dissemination of research results in the area of higher-order flow analysis, broadly construed, within computer science and related disciplines. Flow analysis and related static analyses are a fundamental tool for program verification, bug detection, compiler optimization, program understanding, and software maintenance. The HOFA forum aims to facilitate theoretical, practical, and application advances in the area of functional, object-oriented, concurrent, distributed, and mobile programming. From txa at Cs.Nott.AC.UK Mon Feb 22 09:15:08 2010 From: txa at Cs.Nott.AC.UK (Thorsten Altenkirch) Date: Mon, 22 Feb 2010 14:15:08 +0000 Subject: [TYPES/announce] DEPENDENTLY TYPED PROGRAMMING 2010 (CFP) Message-ID: <326A9189-5E67-48C5-AA56-FCAA9FDCAAA3@Cs.Nott.AC.UK> (s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)-> DTP 2010 --- 1st Call for Talks Workshop on DEPENDENTLY TYPED PROGRAMMING Edinburgh, Scotland, 9&10 July 2010 (a FLoC workshop, affiliated with LICS) http://sneezy.cs.nott.ac.uk/darcs/dtp10/ (s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)-> Dependently typed programming is here today: where will it go tomorrow? We invite contributed talks for the latest in a series of workshops on dependently typed programming which started in 1999. The workshop will have two invited talks --- from Ana Bove and Matthieu Sozeau --- and however many contributed talks you contribute. We expect there will be plenty of provocation, and plenty of time for discussion. If you want to volunteer a talk or a demo at the workshop, please send us a title and abstract before Friday 4 June 2010 at dtp10 at cs.nott.ac.uk Slots will be at least 30 minutes (unless you ask for less), and we hope to fit everyone in. Clearly, if we're overwhelmed, we'll be very pleased, and we'll have to think again. We plan to organize a special issue of Fundamenta Informaticae to contain refereed papers related to the topic of the workshop. In a nutshell, what: Dependently Typed Programming 2010 where: Edinburgh, Scotland when: 9&10 July, 2010 invited: Ana Bove, Matthieu Sozeau requested: titles and abstracts for contributed talks and demos slot time: 30 minutes deadline: 4 June 2010 afterwards: refereed selected postproceedings in FI We look forward to an exciting two days exploring the very latest activity in this growing and challenging field. In fact, in type-theoretic style, we can hardly contain ourselves. All the best Thorsten and Conor From patrick.baillot at ens-lyon.fr Mon Feb 22 09:58:16 2010 From: patrick.baillot at ens-lyon.fr (Patrick Baillot) Date: Mon, 22 Feb 2010 15:58:16 +0100 Subject: [TYPES/announce] DICE @ ETAPS 2010: call for participation Message-ID: <20100222155816.160358klzdhcy4js@webmail.ens-lyon.fr> ====================================================== Call for participation International Workshop on Developments in Implicit Computational complExity (DICE 2010) http://www.ens-lyon.fr/LIP/DICE2010/ March 27-28, 2010, Paphos, Cyprus as part of ETAPS 2010 ====================================================== REGISTRATION http://www.etaps10.cs.ucy.ac.cy/ * normal registration: between February 16 and February 28 * late registration: after March 1 PROGRAMME Saturday, march 27. =================== 9:30-10:30 (invited talk) A.Ben-Amram. On decidable growth-rate properties of imperative programs. 10:30-11:00 coffee break 11:00-12:30 U. Dal Lago, S. Martini and M. Zorzi. General Ramified Recurrence is Sound for Polynomial Time. G. Bonfante. Non confluence in implicit complexity characterizations. 14:00-16:00 M. Lasson. Controlling program extraction in Elementary Linear Logic. P. Boudes, D. Mazza, L. Tortora de Falco. A Categorical Construction for Linear Logic by Levels. S. Ronchi Della Rocca. TBA. M. Gaboardi, M. Pagani. Can Resource Calculus Be Resource Conscious? 16:00-16:30 coffee break 16:30-17:30 B. Redmond. PTIME + a distributive law = PSPACE. U. Dal Lago, U. Sch ?pp. Experiments on logspace-programming with IntML. o Sunday, march 28. ================= 9:30-10:30 (invited talk) S. Martini. Implicit computational complexity in the small. 10:30-11:00 coffee break Alois Brunel, K. Terui. Church ? Scott= Ptime: an application of resource sensitive realizability. 11:00-12:30 L. Roversi, L. Vercelli. Safe Recursion on Notation into a light logic by levels. 14:00-15:00 Y. Zhang, D. Nowak. A calculus for game-based security proofs. J.-Y. Marion. Non-interference types and tier recursion. SCOPE AND TOPIC: The area of Implicit Computational Complexity (ICC) has grown out from several proposals to use logic and formal methods to provide languages for complexity-bounded computation (e.g. Ptime, Logspace computation). It aims at studying computational complexity without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles implying complexity properties. This workshop focuses on ICC methods related to programs (rather than descriptive methods). In this approach one relates complexity classes to restrictions on programming paradigms (functional programs, lambda calculi, rewriting systems), such as ramified recurrence, weak polymorphic types, linear logic and linear types, and interpretative measures. The two main objectives of this area are: - to find natural implicit characterizations of various complexity classes of functions, thereby illuminating their nature and importance; - to design methods suitable for static verification of program complexity. Therefore ICC is related on the one hand to the study of complexity classes, and on the other hand to static program analysis. The workshop will be open to contributions on various aspects of ICC including (but not exclusively): - types for controlling complexity, - logical systems for implicit computational complexity, - linear logic, - semantics of complexity-bounded computation, - rewriting and termination orderings, - interpretation-based methods for implicit complexity. - application of implicit complexity to other programming paradigms (e.g. imperative or object-oriented languages) From dg at cs.cmu.edu Mon Feb 22 13:03:00 2010 From: dg at cs.cmu.edu (Deepak Garg) Date: Mon, 22 Feb 2010 13:03:00 -0500 Subject: [TYPES/announce] Call for papers: FCS-PrivMod 2010 Message-ID: <4B82C6D4.7090906@cs.cmu.edu> +-------------------------------------------------------------------------+ ! ! ! FCS-PrivMod 2010 ! ! Edinburgh, UK ! ! July 14-15, 2010 ! ! http://www.loria.fr/~cortier/FCS-PrivMod10/ ! ! ! ! Affiliated with FLoC 2010 ! ! ! +-------------------------------------------------------------------------+ IMPORTANT DATES =============== Papers due: March 23, 2010 Notification: April 25, 2010 BACKGROUND, AIM AND SCOPE ========================= Formal foundations for computer security have emerged in recent years, including the formal specification and analysis of security protocols, programming languages, access control systems, and their applications. A particular aspect of security is personal privacy, which may be threatened whenever users interact with services and devices which are not directly under their control. From a user's point of view, privacy is often seen as a part of security; but from a service provider's point of view, privacy and security are often opposites that have to be balanced with each other. FCS-PrivMod aims to bring together international researchers from industry and academia in formal methods, computer security, and privacy, to develop advances and new perspectives in security and privacy models and analysis. It comprises the FCS workshop (Foundations of Computer Security), a satellite of LICS since 2002, and PrivMod (Privacy: Models & Analysis), a new workshop specifically about privacy-supporting protocols and systems. We are interested both in new results in theories of computer security and privacy and also in more exploratory presentations that examine open questions and raise fundamental concerns about existing theories, as well as in new results on developing and applying automated reasoning techniques and tools for the formal specification and analysis of security protocols. We thus solicit submissions of papers both on mature work and on work in progress. Because FCS-PrivMod is not published in archival form, we also welcome papers that overlap with papers recently or simultaneously submitted for publication. In such cases, overlaps should be clearly cited and the potential to generate interesting discussion at the workshop will be a factor in the selection process. Topics of interest include, but are not limited to: Automated reasoning Decidability & complexity Formal methods Foundations of verification Information flow analysis Language-based security Linkability & traceability Logic-based design Program transformation Security models Static analysis Statistical methods Tools Trust management Verification for Anonymity & pseudonymity Access control and resource usage control Authentication Availability and denial of service Cloud computing Communication Confidentiality Electronic voting Health care Integrity and privacy Intrusion detection Mobile computing Mutual distrust Privacy RFID Social networks Security policies Security protocols SUBMISSION ========== All submissions will be peer-reviewed. Authors of accepted papers must guarantee that their paper will be presented at the workshop. Submissions should be at most 15 pages (a4 paper, 11pt), including references in the Springer LNCS style available at the URL http://www.springer.de/comp/lncs/authors.html The cover page should include title, names of authors, coordinates of the corresponding author, an abstract, and a list of keywords. Submissions that are clearly too long may be rejected immediately. Additional material intended for the referees but not for publication in the final version - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. Authors are invited to submit their papers electronically, as portable document format (pdf) or postscript (ps); please, do not send files formatted for word processing packages (e.g., Microsoft Word or Wordperfect files). The only mechanism for paper submissions will be through the dedicated easychair submission web page. http://www.easychair.org/conferences/?conf=fcsprivmod2010 PUBLICATION =========== Informal proceedings will be made available in electronic format and they will be distributed to all participants of the workshop. PROGRAM COMMITTEE ================= * Myrto Arapinis (University of Birmingham, UK) * Kostas Chatzikokolakis (University of Eindhoven, Netherlands) * Liqun Chen (HP Labs Bristol, UK) * Stephen Chong (Harvard University, USA) * Tom Chothia (University of Birmingham, UK) * Veronique Cortier (LORIA INRIA-Lorraine, France; co-chair) * George Danezis (Microsoft Cambridge, UK) * St?phanie Delaune (CNRS - ENS de Cachan, France) * Deepak Garg (Carnegie Mellon University, USA) * Hans H?ttel (Aalborg University, Denmark) * Steven Murdoch (University of Cambridge, UK) * Catuscia Palamidessi (INRIA and Ecole Polytechnique, France) * Mark Ryan (University of Birmingham, UK; co-chair) * Pierangela Samarati (Universita` degli Studi di Milano, Italy) * Vitaly Shmatikov (University of Texas at Austin, USA; co-chair) * Ben Smyth (University of Birmingham, UK & ENS Paris, France) * Paul Syverson (Naval Research Laboratory, USA) * Gene Tsudik (University of California, Irvine, USA) * Luca Vigano (University of Verona, Italy) From chong at seas.harvard.edu Mon Feb 22 18:14:35 2010 From: chong at seas.harvard.edu (Stephen Chong) Date: Mon, 22 Feb 2010 18:14:35 -0500 Subject: [TYPES/announce] 2nd CFP: Analysis and Programming Languages for Web Apps and Cloud Apps 2010 In-Reply-To: <4B1006B3.3000602@seas.harvard.edu> References: <4AF313AD.60906@seas.harvard.edu> <4B022FBF.7020204@seas.harvard.edu> <4B0E11E6.5040903@seas.harvard.edu> <4B0E9C5B.7080303@seas.harvard.edu> <4B1006B3.3000602@seas.harvard.edu> Message-ID: <4B830FDB.6050709@seas.harvard.edu> CALL FOR PAPERS *Analysis and Programming Languages for Web Applications and Cloud Applications * (APLWACA 2010) http://research.microsoft.com/en-us/um/redmond/events/APLWACA2010 Toronto, Canada, Sunday June 6, 2010 Co-located with PLDI 2010 Submission due date: Friday March 26, 2010 Analysis and Programming Languages for Web Applications and Cloud Applications (APLWACA, pronounced "apple-whacka") is a new workshop that provides a forum for exploring and evaluating ideas on the use of program analysis and programming language techniques to improve web and cloud applications. Web applications are distributed systems that communicate using Web protocols, and contain client systems executing within commodity web browsers. Cloud applications are distributed systems that utilize cloud computing technologies. The focus of the workshop is primarily on reliability, security, and performance of web and cloud applications. Strongly encouraged are proposals of new, speculative ideas; evaluations of new or known techniques in practical settings; and discussions of important existing and emerging problems. The scope of APLWACA includes, but is not limited to: * Static analysis of web and cloud applications * Runtime analysis of web and cloud applications and enhanced web and cloud application runtimes * Program analysis techniques for discovering reliability issues, security vulnerabilities, or performance bottlenecks * Testing and model checking of web and cloud applications * Compiler- and language-based mechanisms for security and performance * New languages, techniques, and runtimes for programming web and cloud applications, including client-side programming * Characterizing web and cloud application workloads and benchmarks, especially as it comes to large distributed applications like Facebook or Hotmail More details can be found on the APLWACA website: http://research.microsoft.com/en-us/um/redmond/events/APLWACA2010 Important Dates Submission due date Friday, March 26, 2010 Author notification Friday, April 30, 2010 Revised papers due Friday, May 14, 2010 APLWACA 2010 workshop Sunday, June 6, 2010 Technical Program Committee Stephen Chong Harvard University (co-chair) Ranjit Jhala University of California San Diego Trevor Jim AT&T Labs Research Shriram Krishnamurthi Brown University Benjamin Livshits Microsoft Research (co-chair) Sergio Maffeis Imperial College London John C. Mitchell Stanford University Anders M?ller Aarhus University -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100222/a3758835/attachment-0001.htm From andrei at chalmers.se Wed Feb 24 09:11:25 2010 From: andrei at chalmers.se (Andrei Sabelfeld) Date: Wed, 24 Feb 2010 15:11:25 +0100 Subject: [TYPES/announce] CFP: MMM-ACNS 2010 Message-ID: <4B85338D.3090200@chalmers.se> Type-based submissions welcome! -Andrei Call for papers --------------- Fifth International Conference on Mathematical Methods, Models, and Architectures for Computer Networks Security St Petersburg, Russia, September 8-11, 2010 Invited speakers ---------------- * Herve Debar (Institut Telecom - Telecom SudParis, France) * Dieter Gollmann (Technical University of Hamburg-Harburg, Germany) * Greg Morrisett (School of Engineering and Applied Sciences, Harvard University, USA) * Bart Preneel (Electrical Engineering Department, Katholieke Universiteit Leuven, Belgium) * Ravi Sandhu (University of Texas at San Antonio, Institute for Cyber Security, USA) Important dates --------------- * Papers dues: March 7, 2010 * Notification: May 2, 2010 * Camera ready papers May 23, 2010 Further information ------------------- Conference web page: http://www.comsec.spb.ru/mmm-acns10/ From till at informatik.uni-bremen.de Wed Feb 24 10:05:30 2010 From: till at informatik.uni-bremen.de (Till Mossakowski) Date: Wed, 24 Feb 2010 16:05:30 +0100 Subject: [TYPES/announce] Call for Papers: 20th WADT (Workshop on Algebraic Development Techniques) Message-ID: [sorry if you receive this more than once] CALL FOR PAPERS WADT 2010 20th International Workshop on Algebraic Development Techniques July 1-4, 2010, Etelsen, Germany http://www.informatik.uni-bremen.de/WADT2010/ Aims and Scope: The algebraic approach to system specification encompasses many aspects of the formal design of software systems. Originally born as formal method for reasoning about abstract data types, it now covers new specification frameworks and programming paradigms (such as object-oriented, aspect-oriented, agent-oriented, logic and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed and mobile systems). The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends. Topics of interest: Typical, but not exclusive topics of interest are: - Foundations of algebraic specification - Other approaches to formal specification, including process calculi and models of concurrent, distributed and mobile computing - Specification languages, methods, and environments - Semantics of conceptual modelling methods and techniques - Model-driven development - Graph transformations, term rewriting and proof systems - Integration of formal specification techniques - Formal testing and quality assurance, validation, and verification INVITED SPEAKERS Hans-Dieter Ehrich, Institut f\"ur Informationssysteme, Braunschweig Frantisek Plasil, Charles University, Prague Martin Wirsing, Ludwig-Maximilians-Universit\"at, M\"unchen IMPORTANT DATES Submission deadline for abstracts: April 30, 2010 Notification of acceptance: May 23, 2010 Final abstract due: June 13, 2010 Workshop: July 1-4, 2010 Workshop Format and Location: The workshop will take place over four days, Thursday to Sunday, at Schloss Etelsen, www.schloss-etelsen.de, a castle located near Bremen. Presentations will be selected on the basis of submitted abstracts. Three talks will be given by invited speakers. Submissions: The scientific program of the workshop will include presentations of recent results and ongoing research. The presentations will be selected by the Steering Committee on the basis of the submitted abstracts according to originality, significance, and general interest. The abstracts have to be submitted electronically according to the instructions published on the workshop web site. The final versions of the selected abstracts will be included in a hand-out for the workshop participants. After the workshop, selected authors will be invited to submit full papers for the refereed proceedings, which is expected to be published as a volume of Lecture Notes in Computer Science (Springer Verlag). Sponsorship: The workshop takes place under the auspices of IFIP WG 1.3, and is sponsored by IFIP TC1, University of Bremen, and DFKI GmbH. The event is organized by the Computer Science Department of the University of Bremen and the DFKI Bremen group Safe and Secure Cognitive Systems. WADT Steering Committee: Michel Bidoit (France) Andrea Corradini (Italy) Jos\'e Fiadeiro (UK) Rolf Hennicker (Germany) Hans-J\"org Kreowski (Germany) Till Mossakowski (Germany) [chair] Fernando Orejas (Spain) Francesco Parisi-Presicce (Italy) Andrzej Tarlecki (Poland) PROCEEDINGS The abstracts accepted for presentation will be available at the workshop. Refereed LNCS proceedings are planned for full versions of submissions solicited after the workshop. CONTACT WADT 2010 Fachbereich 3 Mathematik und Informatik Enrique-Schmidt-Str. 5 D-28359 Bremen, Germany Phone: +49 421 218 64226 Fax: +49 421 218 98 64226 Email: wadt2010 at informatik.uni-bremen.de From jfrazee at mail.utexas.edu Wed Feb 24 14:29:50 2010 From: jfrazee at mail.utexas.edu (Joey Frazee) Date: Wed, 24 Feb 2010 13:29:50 -0600 Subject: [TYPES/announce] CFP: NASSLLI 2010 Student Session Message-ID: <103f6a951002241129n53f628ebt4966e70a652818fa@mail.gmail.com> CALL FOR PAPERS NASSLLI 2010 STUDENT SESSION June 26, 2010 The Student Session is organized as part of the Fourth North American Summer School in Logic, Language, and Information to be held in Bloomington, IN USA from June 20-26, 2010. ABOUT THE STUDENT SESSION The NASSLLI Student Session provides an opportunity for pre-doctoral students to present original, unpublished work to an interdisciplinary audience. Authors will also receive useful feedback on their submissions from multiple reviewers. We invite submissions in all areas related to the school: logic, computation, language, and any combinations thereof. Papers to the Student Session must represent original work. They should be written with an eye towards two audiences: the wide multi-disciplinary body of students and researchers who will attend NASSLLI, and also the narrower set of people in the particular area of the paper. In short, they should be substantial contributions that can be appreciated by both insiders and outsiders. The organizers anticipate accepting between 10 and 20 papers. PROGRAM COMMITTEE Joey Frazee, UT Austin Joshua Herring, Indiana University Wes Holliday, Stanford University Thomas Icard, Stanford University Joshua Sack, Reykjav?k University Robert Rose (chair), Indiana University Elizabeth Allyn Smith, Ohio State University Andreas Stuhlm?ller, MIT SUBMISSION DETAILS Submissions should be formatted as PDF files, and should not exceed 10 pages. All authors on the papers need to be pre-doctoral students. Please make your submission at the EasyChair site for the NASSLLI Student Session by the deadline listed below. Submissions will be reviewed by the Student Session's program committee and additional reviewers. IMPORTANT DATES * Submissions: April 5, 2010 * Notification: April 19, 2010 * Presentation Date: June 26, 2010 LOCAL ARRANGEMENTS All presenters at the Student Session will be required to register for NASSLLI. The registration fee for authors presenting a paper will correspond to the early student registration fee. There will be no reimbursement for travel costs and accommodation. Presenters who have difficulty in finding funding should contact the local organizing committee to ask for the possibilities for a grant. From icfp.publicity at googlemail.com Wed Feb 24 15:12:08 2010 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Wed, 24 Feb 2010 21:12:08 +0100 Subject: [TYPES/announce] ICFP 2010: Second call for papers Message-ID: <53ff55481002241212m5734c922ka264dd7ef9c30eed@mail.gmail.com> ===================================================================== Second Call for Papers ICFP 2010: International Conference on Functional Programming Baltimore, Maryland, 27 -- 29 September 2010 http://www.icfpconference.org/icfp2010 ===================================================================== Important Dates (at 14:00 UTC) ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Submission: 2 April 2010 Author response: 24 -- 25 May 2010 Notification: 7 June 2010 Final papers due: 12 July 2010 Scope ~~~~~ ICFP 2010 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects or concurrency. Particular topics of interest include * Language Design: type systems; concurrency and distribution; modules; components and composition; metaprogramming; relations to object-oriented or logic programming; interoperability * Implementation: abstract machines; compilation; compile-time and run-time optimization; memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components or low-level machine resources * Software-Development Techniques: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling * Foundations: formal semantics; lambda calculus; rewriting; type theory; monads; continuations; control; state; effects * Transformation and Analysis: abstract interpretation; partial evaluation; program transformation; program calculation; program proof * Applications and Domain-Specific Languages: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia programming; scripting; system administration; security; education * Functional Pearls: elegant, instructive, and fun essays on functional programming The conference also solicits Experience Reports, which are short papers that provide evidence that functional programming really works or describe obstacles that have kept it from working in a particular application. Abbreviated instructions for authors ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ By 2 April 2010, 14:00 UTC, submit an abstract of at most 300 words and a full paper of at most 12 pages (6 pages for an Experience Report), including bibliography and figures. The deadline will be strictly enforced and papers exceeding the page limits will be summarily rejected. Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. A submission will be evaluated according to its relevance, correctness, significance, originality, and clarity. It should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. Functional Pearls and Experience Reports are separate categories of papers that need not report original research results and must be marked as such at the time of submission. Detailed guidelines on both categories are on the conference web site. Each submission must adhere to SIGPLAN's republication policy, as explained on the web at http://www.acm.org/sigplan/republicationpolicy.htm. Proceedings will be published by ACM Press. Authors of accepted submissions are expected to transfer the copyright to the ACM. Presentations will be videotaped and released online if the presenter consents by signing an additional permission form at the time of the presentation. Formatting: Submissions must be in PDF format printable in black and white on US Letter sized paper and interpretable by Ghostscript. If this requirement is a hardship, make contact with the program chair at least one week before the deadline. Papers must adhere to the standard ACM conference format: two columns, nine-point font on a ten-point baseline, with columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). A suitable document template for LATEX is available from SIGPLAN at http://www.acm.org/sigs/sigplan/authorInformation.htm. Submission: Submissions will be accepted electronically at a URL to be named later. Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. Author response: Authors will have a 48-hour period, starting at 14:00 UTC on 24 May 2010, to read and respond to reviews. Special Journal Issue: There will be a special issue of the Journal of Functional Programming with papers from ICFP 2010. The program committee will invite the authors of select accepted papers to submit a journal version to this issue. Organization ~~~~~~~~~~~~ Conference Chair Paul Hudak, Yale University Program Chair Stephanie Weirich, University of Pennsylvania Program Committee: Umut Acar, Max Planck Institute for Software Systems Zena Ariola, University of Oregon James Cheney, University of Edinburgh Peter Dybjer, Chalmers University of Technology Robert Bruce Findler, Northwestern University Andy Gill, Kansas University Fritz Henglein, University of Copenhagen Michael Hicks, University of Maryland, College Park Patricia Johann, University of Strathclyde Andres L?h, Utrecht University Simon L. Peyton Jones, Microsoft Research Didier R?my, INRIA Paris-Rocquencourt John Reppy, University of Chicago Manuel Serrano, INRIA Sophia-Antipolis Matthieu Sozeau, Harvard University From heinz.koeppl at epfl.ch Thu Feb 25 10:06:51 2010 From: heinz.koeppl at epfl.ch (Koeppl Heinz) Date: Thu, 25 Feb 2010 16:06:51 +0100 Subject: [TYPES/announce] Postdocs and PhD positions - Formal methods in computational systems and synthetic biology, ETH Zurich Message-ID: The Swiss Federal Institute of Technology Zurich (ETHZ), Switzerland Automatic Control Lab has vacant positions at the postdoctoral (2) and doctoral (2) level within a new group dedicated to "Formal methods in computational systems and synthetic biology" Topics of interest: - Robustness analysis; bounding reachables for uncertain nonlinear systems using "hybridization". - Rule-based models (Kappa) and their extension to include spatial effects. - Stochastic modeling and hybrid stochastic simulation algorithms. - Applied modeling; construction and parameter estimation for hybrid models of cellular signal transduction systems. - Compositional theory of biomolecular circuits; accounting for retroactivity. For more details please see http://lanos.epfl.ch/positions/ Questions can be addressed to Heinz Koeppl, heinz.koeppl at epfl.ch From david.delahaye at cnam.fr Thu Feb 25 18:38:27 2010 From: david.delahaye at cnam.fr (david.delahaye@cnam.fr) Date: Fri, 26 Feb 2010 00:38:27 +0100 (CET) Subject: [TYPES/announce] Calculemus 2010: Deadline Extension and Final Call for Papers Message-ID: <63889.87.231.38.95.1267141107.squirrel@webmail.cnam.fr> [Apologies for cross-postings.] ---------------------------------------------------------------- CALCULEMUS 2010 - Deadline Extension and Final Call for Papers ---------------------------------------------------------------- 17th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning CNAM, Paris, France, July 6-7, 2010 http://cicm2010.cnam.fr/calculemus/ ************************************* >>>> DEADLINE EXTENSION <<<< Abstract submission: March 12, 2010 Submission deadline: March 15, 2010 ************************************* Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and systems for mechanised reasoning, the interactive theorem provers or proof assistants (PA) and the automated theorem provers (ATP). Currently, symbolic computation is divided into several (more or less) independent branches: traditional ones (e.g., computer algebra and mechanised reasoning) as well as newly emerging ones (on user interfaces, knowledge management, theory exploration, etc.) The main concern of the Calculemus community is to bring these developments together in order to facilitate the theory, design, and implementation of integrated systems for computer mathematics that will routinely be used by mathematicians, computer scientists and engineers in their every day business. We seek original research papers for the upcoming Calculemus meeting, which will be held jointly with AISC 2010 and MKM 2010 (confederated in the Conferences on Intelligent Computer Mathematics, CICM 2010) in Paris (France). Topics of Interest ================== The scope of Calculemus covers all aspects of the interplay of mechanised reasoning and computer algebra, including cross-fertilisation between those two research areas, as well as the development of integrated systems that transcend both computer algebra and theorem proving. Potential topics of interest include: * Theorem proving in computer algebra (CAS) * Computer algebra in theorem proving (PA and ATP) * Case studies and applications that both involve computer algebra and mechanised reasoning * Representation of mathematics in computer algebra * Adding computational capabilities to PA and ATP * Formal methods requiring mixed computing and proving * Combining methods of symbolic computation and formal deduction * Mathematical computation in PA and ATP * Theory, design and implementation of interdisciplinary systems for computer mathematics * Infrastructure for mathematical services * Theory exploration techniques Papers on other topics closely related to the above research areas will also be welcomed for consideration. Submission ========== Theoretical and applied research papers on all topics within the scope of the symposium are invited. Submitted papers must be in English and must not exceed 15 pages for full papers and we suggest 10 pages for emerging trends extended abstracts (the upper limit is 20 pages, authors must provide at least a title and 200 word abstract). The title page should contain the title, author(s) with affiliation(s), e-mail address(es), listing of keywords and abstract. The program committee will subject all full papers submitted to a peer review. Emerging trends papers will be lightly reviewed. Results must be unpublished. Papers should be prepared in LaTeX and formatted according to the requirements of the Springer's LNAI series (the corresponding style files can be downloaded from http://www.springer.de/comp/lncs/authors.html and are the same for LNCS and LNAI). The web page for electronic submission is: http://www.easychair.org/conferences/?conf=calculemus2010 Proceedings =========== The proceedings of full papers of the conference will be published as a volume in the series Lecture Notes in Artificial Intelligence (LNAI) by Springer-Verlag. In addition to the formal proceedings published by Springer, we will provide links to online versions of the published papers from the conference website. Extended abstracts on emerging trends will be published as a technical report of CEDRIC (CNAM/ENSIIE) and will be electronically available. These papers are expected to be describing work in progress. Important Dates =============== For (reviewed) full paper submissions: Abstract submission: March 12, 2010 Submission deadline: March 15, 2010 Notification of acceptance: April 14, 2010 Camera ready copies due: April 28, 2010 For extended abstracts on emerging trends: Abstract submission: April 30, 2010 Submission deadline: May 7, 2010 Notification of acceptance: May 30, 2010 Camera ready copies due: June 7, 2010 The Calculemus conference is on July 6-7, 2010. Programme Committee =================== Markus Aderhold (TU Darmstadt, Germany) Arjeh Cohen (Eindhoven University of Technology, The Netherlands) Thierry Coquand (Chalmers University of Technology, Sweden) James H. Davenport (University of Bath, UK) David Delahaye (CNAM, France), Chair Lucas Dixon (University of Edinburgh, UK) William M. Farmer (McMaster University, Canada) Temur Kutsia (RISC, Austria) Assia Mahboubi (INRIA Saclay, France) Renaud Rioboo (ENSIIE, France), Chair Julio Rubio (Universidad de La Rioja, Spain) Volker Sorge (University of Birmingham, UK) Stephen M. Watt (University of Western Ontario, Canada) Freek Wiedijk (Radboud University Nijmegen, The Netherlands) Wolfgang Windsteiger (RISC, Austria) From katoen at cs.rwth-aachen.de Fri Feb 26 04:05:34 2010 From: katoen at cs.rwth-aachen.de (Joost-Pieter Katoen) Date: Fri, 26 Feb 2010 10:05:34 +0100 Subject: [TYPES/announce] ETAPS 2010: Final Call For Participation Message-ID: <4B878EDE.3020205@cs.rwth-aachen.de> [We apologise for multiple copies.] ==================================================================== CALL FOR PARTICIPATION: ETAPS 2010 *** 5 Conferences, 19 Workshops, 4 Tutorials *** European Joint Conferences on Theory And Practice of Software March 20 - March 28, 2010 Paphos, Cyprus http://www.etaps.org http://www.etaps10.cs.ucy.ac.cy/ ==================================================================== -- REGISTRATION -- For online registration, please visit http://www.etaps10.cs.ucy.ac.cy/ and click on the menu item "Registration". **** The registration deadline is February 28, 2010. **** -- ABOUT ETAPS -- The European Joint Conferences on Theory and Practice of Software (ETAPS) is the primary European forum for academic and industrial researchers working on topics relating to Software Science. ETAPS, established in 1998, is a confederation of five main annual confe- rences, accompanied by satellite workshops and other events. ETAPS 2010 is the thirteenth event in the series. -- THE HOST CITY: PAPHOS, CYPRUS -- The west coast town of Paphos, with its pleasant harbour and medieval fort, combines a cosmopolitan holiday resort, spectacular countryside and historical sites. With a population of just 28.000 inhabitants, Paphos nestles in the lee of the Western Troodos Mountains and close to the Akamas National Park which add another dimension to this area of scenic beauty. Paphos has an air of holiday charm combined with history, and olden-day elegance is lent to the town by its classical style buildings in the upper part of town which leads to the shopping area. The lower part of the town has a life of its own, down near the sea, home of the harbour, the fish taverns, souvenir shops and several hotels with important archaeological sites around them. Paphos was the island's capital, and it is famous for the remains of the Roman Governor's palace, where extensive, fine mosaics are a major tourist attraction. The town of Paphos is included in the official UNESCO list of cultural and natural treasures of the world's heritage. ETAPS 2010 is organized by the University of Cyprus and will take place at the Coral Beach Hotel and Resort in Paphos, Cyprus, a 5-start hotel overlooking the golden sandy beaches and sparkling waters of Coral bay and adjacent to the Akamas National Park. For more information about Paphos, please visit the Cyprus Tourism Organization website: http://www.visitcyprus.com/wps/portal For travel information, please consult the ETAPS'10 website: http://www.etaps10.cs.ucy.ac.cy/ -- MAIN CONFERENCES -- - CC: International Conference on Compiler Construction ( http://www.cs.ucr.edu/~gupta/CC%202010.htm ) - ESOP: European Symposium on Programming ( http://research.microsoft.com/en-us/um/people/adg/ESOP2010/ ) - FASE: Fundamental Approaches to Software Engineering ( http://www.mathematik.uni-marburg.de/~swt/fase2010/ ) - FOSSACS: Foundations of Software Science and Computation Structures ( http://users.comlab.ox.ac.uk/luke.ong/FoSSaCS2010/ ) - TACAS: Tools and Algorithms for the Construction and Analysis of Systems ( http://tacas10.in.tum.de/ ) -- INVITED SPEAKERS -- Mark Harman (KCL, UK) Jim Larus (MSR, Redmond USA) Dave Naumann (Stevens, USA) Jean-Francois Raskin (Brussels, Belgium) Joseph Sifakis (IMAG, France) Colin Stirling (Edinburgh, UK) Philip Wadler (Edinburgh, UK) -- SATELLITE EVENTS -- The ETAPS 2010 satellite events comprise of workshops and tutorials which will be held on the Saturday/Sunday (March 20/21) before and the Saturday/Sunday (March 27/28) after the main conferences. WORKSHOPS - ACCAT, Applied and Computational Category Theory - ARSPA-WITS, Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security - BYTECODE, Bytecode Semantics, Verification, Analysis and Transformation - CMCS, Coalgebraic Methods in Computer Science - COCV, Compiler Optimization Meets Compiler Verification - DCC, Designing Correct Circuits - DICE, Developments in Implicit Computational Complexity - FBTC, From Biology to Concurrency and back - FESCA, Formal Engineering approaches to Software Components and Architectures - FOSS-AMA, Free and Open Source Software - for Accessible Mainstream Applications - GaLoP, Games for Logics and Programming Languages - GT-VMT, Graph Transformation and Visual Modeling Techniques - LDTA, Language Descriptions, Tools and Applications - MBT, Model-Based Testing - PLACES, Programming Language Approaches to Concurrency and Communication-cEntric Software - QAPL, Quantitative Aspects of Programming Languages - SafeCert, Certification of Safety-Critical Software Controlled Systems - WGT, Workshop on Generative Technologies - WRLA, Workshop on Rewriting Logic and its Applications TUTORIALS * Uncertainty Modeling in Cyber-Physical Systems (Manuela Bujorianu) * Security, specification and refinement (Annabelle McIver) * Executable Models of Gene Regulatory Networks (Wan Fokkink) * The DisCoVeri continues ... (On the Application of Concurrency Theory to Fault-Tolerant Distributed Algorithms) (Uwe Nestmann) Additional information about the satellite events is available on the ETAPS web page: http://www.etaps10.cs.ucy.ac.cy/ -- FURTHER INFORMATION AND ENQUIRIES -- ETAPS 2010 is organised by the Dept. of Computer Science, University of Cyprus. For further information, do not hesitate to contact the Local Organisers at the following address: etaps10 at cs.ucy.ac.cy +---------------------------------------------------------------+ | Joost-Pieter Katoen email: my_last_name[at]cs.rwth-aachen.de | | RWTH Aachen University URL: moves.rwth-aachen.de/~katoen | | LS2: Software Modeling and Verification tel: +49 241 8021200 | | D-52056 Aachen, Germany fax: +49-241 8022217 | +---------------------------------------------------------------+ From vxc at Cs.Nott.AC.UK Fri Feb 26 06:53:33 2010 From: vxc at Cs.Nott.AC.UK (Venanzio Capretta) Date: Fri, 26 Feb 2010 11:53:33 +0000 Subject: [TYPES/announce] MSFP: Call for Papers Message-ID: <4B87B63D.6090306@cs.nott.ac.uk> Third Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING 25 September 2010, Baltimore, USA A satellite workshop of ICFP 2010 PRESENTATION The workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Monadic programming in Haskell is the paradigmatic example, but there are many more mathematical insights manifest in programs and in programming language design: Freyd-categories in reactive programming, symbolic differentiation yielding context structures, and comonadic presentations of dataflow, to name but three. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006. Selected papers were published as a special issue of the Journal of Functional Programming (volume 19, issue 3-4). The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP 2008. SUBMISSIONS Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Programme Committee members, barring the co-chairs, may (and indeed are encouraged to) contribute. Accepted papers must be presented at the workshop by one of the authors. There is no specific page limit, but authors should strive for brevity. We are using the EasyChair software to manage submissions. To submit a paper, please log in at: http://www.easychair.org/conferences/?conf=msfp2010 The workshop proceedings will be published by ACM. TIMELINE: Submission of abstracts: 9 April Submission of papers: 16 April Notification: 28 May Final versions due: 25 June Workshop: 25 September For more information about the workshop, go to: http://cs.ioc.ee/msfp/msfp2010/ Programme Committee * Andreas Abel, LMU Munich, Germany * Ana Bove, Chalmers University of Technology, Gothenburg, Sweden * Andrej Bauer, University of Ljubljana, Slovenia * Venanzio Capretta (co-chair), University of Nottingham, UK * James Chapman (co-chair), Institute of Cybernetics, Tallinn, Estonia * Adam Chlipala, Harvard University, Cambridge, MA, USA * Catarina Coquand, Chalmers University of Technology, Gothenburg, Sweden * Karl Crary, Carnegie Mellon University, Pittsburgh, USA * Manuel Alcino Cunha, Universidade do Minho, Braga, Portugal * Andy Gill, University of Kansas, USA * Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina * Oleg Kiselyov, FNMOC, Monterey, California, USA * Lionel Elie Mamane, Radboud University Nijmegen, The Netherlands * Conor McBride, University of Strathclyde, Glasgow, UK * Greg Morrisett, Harvard University, Cambridge, MA, USA * Russell O'Connor, McMaster University, Hamilton, Ontario, Canada * Benoit Razet, TIFR (Tata Institute of Fundamental research), India * Carsten Schrmann, IT University of Copenhagen, Denmark * Wouter Swierstra, Chalmers University of Technology, Gothenburg, Sweden * Tarmo Uustalu, Institute of Cybernetics, Tallinn, Estonia * Varmo Vene, University of Tartu, Estonia From rseba at disi.unitn.it Fri Feb 26 18:00:08 2010 From: rseba at disi.unitn.it (Roberto Sebastiani) Date: Sat, 27 Feb 2010 00:00:08 +0100 Subject: [TYPES/announce] PhD position in ICT on Formal Verification via SMT available in Trento Message-ID: <20100226230008.GA7195@disi.unitn.it> --------------------------------------------------------------------------- [[[ We apologize if you receive multiple copies of this message ]]] --------------------------------------------------------------------------- -------------------------------------------------------------- PLEASE FORWARD THIS EMAIL TO WHOEVER YOU MAY THINK INTERESTED. -------------------------------------------------------------- Posted: February 26, 2010 One Doctoral Student Position in Information and Communication Technologies on the research project "WORD-LEVEL FORMAL VERIFICATION VIA SMT SOLVING" is available at the International Doctorate School in Information and Communication Technologies (http://www.ict.unitn.it/) of the University of Trento, Italy, under the joint supervision of Dr. ALESSANDRO CIMATTI, Embedded Systems Research Unit, FBK-Irst, via Sommarive 18, I-38100 Povo, Trento, Italy http://sra.fbk.eu/people/cimatti/, cimatti[at]fbk[dot]eu Prof. ROBERTO SEBASTIANI Software Engineering & Formal Methods Research Program DISI, University of Trento, via Sommarive 14, I-38100 Povo, Trento, Italy http://disi.unitn.it/~rseba/. rseba[at]disi[dot]unitn[dot]it The research activity will be carried out jointly within the Embedded Systems (ES) Research Unit of the Center for Scientific and Technological Research of the Fondazione Bruno Kessler (FBK), Trento, and the Software Engineering & Formal Methods (SE&FM) Research Program, at Department of Information Engineering and Computer Science (DISI) of University of Trento. The research activity will aim at investigating and developing novel techniques, methodologies and support tools for Satisfiability Modulo Theories (SMT) for the verification of WORD-level circuit designs. This work will be part of the "Word-Level Formal Verification via SMT Solving" (WOLFLING) project, a three-year custom research project supported by SRC/GRC (http://grc.src.org/fr/S200802_Call.asp), in strict collaboration with the Formal Verification Group at Intel, Haifa, Israel. SMT tools will be developed on top of the MathSAT SMT platform (http://mathsat4.disi.unitn.it), and Formal Verification tools will be developed on top of the NuSMV Model Checking platform (http://nusmv.fbk.eu). Both platforms are jointly developed and maintained by ES and SE&FM. The selected candidate will be initially enrolled in a stage and, if he/she passes the selection of the Ph.D. school, he/she will be enrolled as Ph.D. students. Ph.D. courses will start in Autumn 2010, and the thesis must be completed in three or four years. People enrolled in a stage and subsequent Ph.D. courses are expected to move to Trento, and will receive monetary support during both phases of their activity. Candidate Profile ================= The ideal candidate should have an MS or equivalent degree in computer science, mathematics or electronic engineering, and combine solid theoretical background and excellent software development skills. The candidate should be able to work in a collaborative environment, with a strong commitment to reaching research excellence and achieving assigned objectives. Background knowledge and/or previous experience in the following areas (in order of preference), though not strictly mandatory, will be considered very favorably: - Satisfiability Modulo Theory (SMT) - Propositional Satisfiability (SAT) - Embedded Systems Design Languages (e.g. Verilog, VHDL) - Symbolic Model Checking - Automated Reasoning - Constraint Solving and Optimization Applications and Inquiries ========================== Interested candidates should inquire for further information and/or apply by sending email to Prof. Sebastiani (rseba[at]disi[dot]unitn[dot]it) with Dr. Cimatti (cimatti[at]fbk[dot]eu) in CC. Applications should contain a statement of interest, with a Curriculum Vitae, and three reference persons. PDF format is strongly encouraged. Emails will be automatically processed and should have 'PHD ON WOLFLING PROJECT' as subject. Contact Person ============== Prof. ROBERTO SEBASTIANI Software Engineering & Formal Methods Research Program DISI, University of Trento, via Sommarive 14, I-38100 Povo, Trento, Italy http://disi.unitn.it/~rseba/. mailto: rseba[at]disi[dot]unitn[dot]it The Embedded Systems Research Unit at FBK ========================================= The Embedded Systems Unit consists of about 15 persons, including researchers, post-Doc, Ph.D. students, and programmers. The Unit carries out research, tool development and technology transfer in the fields of design and verification of embedded systems. Current research directions include: * Satisfiability Modulo Theory, and its application to the verification of hardware, embedded critical software, and hybrid systems (Verilog, SystemC, C/C++, StateFlow/Simulink). * Formal Requirements Analysis based on techniques for temporal logics (consistency checking, vacuity detection, input determinism, cause-effect analysis, realizability and synthesis). * Formal Safety Analysis, based on the integration of traditional techniques (e.g. Fault-tree analysis, FMEA) with symbolic verification techniques. The Embedded Systems Unit is part of Fondazione Bruno Kessler, formerly Istituto Trentino di Cultura, a public research institute of the Autonomous Province of Trento (Italy), founded in 1976. The institute, through its center for the scientific and technological research, is active in the areas of Information Technology, Microsystems, and Physical Chemistry of Surfaces and Interfaces. Today, FBK is an internationally recognized research institute, collaborating with industries, universities, and public and private laboratories in Italy and abroad. The institute's applied and basic research activities aim at resolving real-world problems, driven by the need for technological innovation in society and industry. The SW Engineering & Formal Methods Research Program at DISI ============================================================ The SW Engineering & Formal Methods R. P. at DISI currently consists on 5 faculties, 4 post-docs and 19 PhD students. The Unit carries out research, tool development and technology transfer in the fields of Goal-Oriented Requirements Engineering, Agent-oriented SW engineering, Security, and Formal Methods. Referring to formal methods, current research directions include: * Satisfiability Modulo Theory, and its application to the verification of hardware, embedded critical software, and hybrid systems. * Advanced Model Checking Techniques for Formal Verification of hardware, embedded critical software, and hybrid systems. * Applications of Propositional Satisfiability (SAT) to various domains. The R.P. is part of the Department of Information Engineering and Computer Science, DISI (http://disi.unitn.it/) of University of Trento. University of Trento in the latest years has always been rated among the top-three small&medium-size universities in Italy. DISI currently consists of 50 faculties, 68 research staff and support people, 21 postdocs and 146 Doctoral students, plus administrative and technical staff. DISI covers all the different areas of information technology (computer science, telecommunications, and electronics) and their applications. These disciplines above are studied individually but also with a strong focus on their integration, Location ======== Trento is a lively town of about 100.000 inhabitants, located 130 km south of the border between Italy and Austria. It is well known for the beauty of its mountains and lakes, and it offers the possibility to practice a wide range of sports. Trento enjoys a rich cultural and historical heritage, and it is the ideal starting point for day trips to famous towns such as Venice or Verona, as well as to enjoy great naturalistic journeys. Detailed information about Trento and its region can be found at http://www.trentino.to/home/index.html?_lang=en. From luigi.santocanale at lif.univ-mrs.fr Sat Feb 27 03:45:46 2010 From: luigi.santocanale at lif.univ-mrs.fr (Luigi Santocanale) Date: Sat, 27 Feb 2010 09:45:46 +0100 Subject: [TYPES/announce] FICS 2010 -- call for papers Message-ID: <4B88DBBA.4060909@lif.univ-mrs.fr> /* Apologies for multiple posting */ Call for Papers (Extended Abstracts) 7th Workshop on Fixed Points in Computer Science, FICS 2010 Brno, Czech Republic, August 21-22 2010 a satellite workshop to MFCS & CSL 2010 http://www.lif.univ-mrs.fr/fics2010/ Background Fixed points play a fundamental role in several areas of computer science and logic by justifying induction and recursive definitions. The construction and properties of fixed points have been investigated in many different frameworks such as: design and implementation of programming languages, program logics, databases. The aim of the workshop is to provide a forum for researchers to present their results to those members of the computer science and logic communities who study or apply the theory of fixed points. Previous workshops were held in Brno (1998, MFCS/CSL workshop), Paris (2000, LC workshop), Florence (2001, PLI workshop), Copenhagen (2002, LICS (FLoC) workshop), Warsaw (2003, ETAPS workshop), Coimbra (2009, CSL workshop). Topics include, but are not restricted to: * categorical, metric and ordered fixed point models * fixed points in algebra and coalgebra * fixed points in languages and automata * fixed points in programming language semantics * the mu-calculus and fixed points in modal logic * fixed points in process algebras and process calculi * fixed points in the lambda-calculus, functional programming and type theory * fixed points in relation to dataflow and circuits * fixed points in logic programming and theorem proving * finite model theory, descriptive complexity theory, fixed points in databases Invited speakers * Arnaud Carayol, Laboratoire d'informatique Gaspard-Monge. * tba * tba Contributed talks Selection of contributed talks is based on extended abstracts/short papers of 3...6 pp formatted with easychair.cls. Submission is via EasyChair, by June 13 2010. The authors will be notified of acceptance/rejection by July 10 2010. Camera-ready versions of the accepted contributions will be published for distribution at the workshop as a technical report. Journal publication If the number and quality of submissions and accepted talks warrant this, EDP Sciences will publish a special issue of Theoretical Informatics and Applications. With one exception, the special issues of the previous FICS editions appeared in this journal. The special issue of FICS 2009 will also appear there. FICS Program Committee Thorsten Altenkirch (University of Nottingham) Giovanna d'Agostino (University of Udine) Peter Dybjer (Chalmers University of Technology) Zolt?n ?sik (University of Szeged) Anna Ing?lfsd?ttir (Reykjav?k University) Gerhard J?ger (University of Bern) Ralph Matthes (IRIT, Toulouse) Andrzej Murawski (University of Oxford) Damian Niwinski (Warsaw University) Luigi Santocanale (LIF, Marseille) Alex Simpson (University of Edinburgh) Jean-Marc Talbot (LIF, Marseille) Tarmo Uustalu (Institute of Cybernetics, Tallinn) Yde Venema (University of Amsterdam) Igor Walukiewicz (LaBRI, Bordeaux) Sponsors Laboratoire d'Informatique Fondamentale de Marseille Universit? de Provence -- Luigi Santocanale LIF/CMI Marseille T?l: 04 91 11 35 74 http://www.cmi.univ-mrs.fr/~lsantoca/ Fax: 04 91 11 36 02 From Manuela.Bujorianu at manchester.ac.uk Sat Feb 27 08:37:06 2010 From: Manuela.Bujorianu at manchester.ac.uk (Manuela Bujorianu) Date: Sat, 27 Feb 2010 13:37:06 +0000 Subject: [TYPES/announce] Lectures on inter-disciplinary analysis of cyber-physical systems Message-ID: <20100227133706.155639gk11sog742@webmail.manchester.ac.uk> Please accept our apologies in case of message multiplication and feel free to distribute to the potentially interested colleagues. Dear Colleague, The following lectures will be presented at the ETAPS2010 tutorial on " Uncertainty Modeling in Cyber-Physical Systems": ? Cyber-physical systems: Quo vadis? (M. Bujorianu) ? Nano-systems: The next big thing will be really small! (M. Bujorianu) ? Controlling uncertainty in renewable energy systems (M. Bujorianu) ? Modelling physics/computation interaction by the hybrid discrete/continuous paradigm (M. Bujorianu) ? Modelling a water cleaning facility using Hybrid Petri nets with general transitions (A. Remke) ? Parametric reachability analysis of Hybrid Petri nets with general transitions (A. Remke) ? Modelling networked automation systems using probabilistic hybrid automata (T. Teige) ? Bounded model checking of probabilistic hybrid automata (T. Teige) The tutorial will take place on 21st March? 2010 in Paphos, Cyprus. http://personalpages.manchester.ac.uk/staff/Manuela.Bujorianu/ETAPStutorial.htm The normal registration fee is available until 7th March 2010. After that date registration is still possible but an increased fee will apply. The lectures will be presented by a team of Young and enthusiastic researchers (Anne Remke, University of Twente, NL; Tino Teige, Oldenburg University, DE; Manuela Bujorianu, Manchester University, UK - tutorial organizer) with experience in interdisciplinary research combining formal methods, software verification, control engineering and stochastic modelling. The tutorial format is designed to allow the maximum interaction between audience and speakers. Key topics: ? Inter-disciplinary nanoscience ? Energy informatics ? Networked control systems ? Stochastic hybrid systems ? Hybrid Petri nets ? Bounded model checking ? Stochastic and parametric reachability analysis Many thanks and hoping to see you in Paphos, Manuela Bujorianu From rwh at cs.cmu.edu Sun Feb 28 19:03:41 2010 From: rwh at cs.cmu.edu (Robert Harper) Date: Sun, 28 Feb 2010 19:03:41 -0500 Subject: [TYPES/announce] University of Oregon Programming Languages Summer School Message-ID: We are pleased to announce this year's program for the University of Oregon Programming Languages Summer School, which will be held June 15-25, 2010 in Eugene, Oregon. This year's theme is Logic, Languages, Compilation, and Verification, and features an impressive roster of speakers, including Robert Constable (Cornell), Anupam Datta (Carnegie Mellon), Robert Harper (Carnegie Mellon), Xavier Leroy (INRIA), Conor McBride (Strathclyde), Greg Morrisett (Harvard), Frank Pfenning (Carnegie Mellon), Benjamin Pierce (Penn), and Andrew Tolmach (Portland State). Please see http://www.cs.uoregon.edu/Activities/summerschool/summer10/ for complete information about this year's summer school. Please note that the registration deadline is MARCH 22, 2010. We look forward to a great program! Zena Ariola Pierre-Louis Curien Robert Harper Hugo Herbelin -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 3910 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100228/33930f49/smime.p7s From Yves.Bertot at sophia.inria.fr Mon Mar 1 03:41:45 2010 From: Yves.Bertot at sophia.inria.fr (Yves Bertot) Date: Mon, 01 Mar 2010 09:41:45 +0100 Subject: [TYPES/announce] CFP: Call for papers, Coq Workshop (Edinburgh, July 9) Message-ID: <4B8B7DC9.2080501@sophia.inria.fr> lease help disseminate this call for papers Two changes in the call for papers: 1/ papers describing experiments in other type theory-based proof assistants are explicitly invited to this workshop, 2/ EPTCS (http://eptcs.org/) has agreed to host the proceedings. Call for papers The Coq workshop will bring together Coq users, developers and contributors. The workshop will be organized from submitted papers, invited talks and a plenary discussion on the evolution and design of Coq. Topics for submitting a paper include: * Experiments with type-theoretic proof assistants * Language or tactics features * Theory and implementation of the Calculus of Inductive Constructions * Applications and experience in education and industry * Tools, platforms built on Coq * Plugins, libraries for Coq * Interfacing with Coq * Formalization tricks and Coq pearls Authors should submit their paper through EasyChair at the following link: http://www.easychair.org/conferences/?conf=coq2 Submitted papers should be in (postscript or) portable document format. Papers should not exceed 12 pages in length in single-column full-page 11pt A4 style. If there is sufficient demand, we will try to organize a time slot for demonstrations. Similarly, we may also organize a session on the lessons learned from teaching Coq. If you are interested, please send a brief proposal. Venue FLoC 2010, Edinburgh, Scotland Important Dates * March 22nd: Deadline for submission of papers * May 1st: Acceptance Notification * May 31st: Final version of articles * July 9th: Workshop in Edinburgh Program Committee * Andrew Appel * Yves Bertot (Chair) * Adam Chlipala * Georges Gonthier * Benjamin Gr?goire * Hugo Herbelin * Micaela Mayero * Christine Paulin-Mohring * Bas Spitters From gvidal at dsic.upv.es Mon Mar 1 14:41:18 2010 From: gvidal at dsic.upv.es (German Vidal) Date: Mon, 1 Mar 2010 20:41:18 +0100 Subject: [TYPES/announce] CFP CICLOPS-WLPE 2010 at FLoC (Edinburgh, 15 July) References: <6679813A-9FD1-42EB-A189-6C6A4984450D@dsic.upv.es> Message-ID: <0202FFD2-8454-4C56-BD30-A8759F1FF000@dsic.upv.es> ******************************************************************* Call For Papers CICLOPS-WLPE 2010 Joint Workshop on Implementation of Constraint Logic Programming Systems and Logic-based Methods in Programming Environments Edinburgh, Scotland, U.K. July 15, 2010 http://users.dsic.upv.es/~ciclops-wlpe10/ Satellite event of the 26th International Conference on Logic Programming (ICLP 2010) http://www.floc-conference.org/ICLP-home.html ******************************************************************* Important Dates: Paper Submission: March 31, 2010 Notification of Authors: April 29, 2010 Camera-ready: May 17, 2010 (tentative) Workshop: July 15, 2010 Invited talks: Programming with Boolean Satisfaction Michael Codish, Ben-Gurion University of the Negev (Israel) Solving Constraint Satisfaction Problems by a SAT Solver Naoyuki Tamura, Kobe University (Japan) Workshop description CICLOPS is a series of colloquia on the implementation of constraint logic programming. Logic and Constraint programming is an important declarative programming paradigm. The features offered by this paradigm such as rule-basedness, pattern matching, automated backtracking, recursion, tabling, and constraint solving have been proved convenient for many programming tasks. Recent improvements in implementation technologies combined with advances in hardware and systems software have made logic and constraint programming a viable choice for many real-world problems. CICLOPS'10 continues a tradition of successful workshops on Implementations of Logic Programming Systems, previously held with in Budapest (1993) and Ithaca (1994), the Compulog Net workshops on Parallelism and Implementation Technologies held in Madrid (1993 and 1994), Utrecht (1995) and Bonn (1996), the Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages held in Port Jefferson (1997), Manchester (1998), Las Cruces (1999), and London (2000), and more recently the Colloquium on Implementation of Constraint and LOgic Programming Systems in Paphos (Cyprus, 2001), Copenhagen (2002), Mumbai (2003), Saint Malo (France, 2004), Sitges (Spain, 2005), Seattle (U.S.A., 2006), Porto (Portugal, 2007), Udine (Italy, 2008), and Pasadena (U.S.A, 2009). WLPE is a series of workshops on practical logic-based software development methods and tools. Software plays a crucial role in modern society. While software keeps on growing in size and complexity, it is more than ever required to be delivered on time, free of error and meeting the most stringent efficiency requirements. Thus more demands are placed on the software developer, and consequently, the need for methods and tools that support the programmer in every aspect of the software development process is widely recognized. Logic plays a fundamental role in analysis, verification and optimization in all programming languages, not only in those based directly on logic. The use of logic-based techniques in software development is a very active area in computing; emerging programming paradigms and growing complexity of the properties to be verified pose new challenges for the community, while emerging reasoning techniques can be exploited. WLPE'10 continues the series of successful international workshops on logic programming environments held in Ohio, USA (1989), Eilat, Israel (1990), Paris, France (1991), Washington D.C., USA (1992), Vancouver, Canada (1993), Santa Margherita Ligure, Italy (1994), Portland, USA (1995), Leuven, Belgium (1997), Las Cruces, USA (1999), Paphos, Cyprus (2001), Copenhagen, Denmark (2002), Mumbai, India (2003), Saint Malo, France (2004), Sitges (Barcelona), Spain (2005), Seattle, USA (2006), Porto, Portugal (2007) and Udine, Italy (2008). More information about the series of WLPE workshops can be found at http://www.cs.usask.ca/projects/envlop/WLPE/ CICLOPS-WLPE 2010 aims at bringing together, in an informal setting, people involved in research in the design and implementation of logic and constraint programming languages and systems and on logic-based methods and tools which support program development and analysis. In addition to papers describing more conceptual and theoretical work, papers describing the implementation of, and experience with, such tools will be welcome. Topics: * Abstract machines and compilation techniques * Compile-time analysis and its application to code generation * Memory management, indexing, and garbage collection issues * Profiling tools and performance evaluation * Implementation of concurrent, parallel, and distributed systems * Extensions such as tabling, constraints, probabilistic reasoning, and learning * New features such as ASP and coinduction * Object-oriented and module systems * Integration with other systems such as CP, SAT, LP/MLP, and Database systems * Experiences from using systems in real-life applications * Static and dynamic analysis * Debugging and testing * Program verification and validation, * Code generation from specifications, * Termination analysis, * Constraints * Rewriting * Profiling and performance analysis, * Type and mode analysis, * Module systems, * Optimization tools, * Program understanding, * Refactoring * Logical meta-languages Authors who are interested in taking part in the workshop, but are unsure if their work falls within its scope, are invited to contact the organizers and will be given suitable advice. Submission details: All papers must be written in English, in Springer LNCS format (http://www.springeronline.com/lncs/), and not exceed 15 pages. Submissions must be made through the easychair system available at http://www.easychair.org/conferences/?conf=ciclopswlpe2010 All accepted papers will be included in the workshop proceedings to be published as a technical report and distributed at the workshop, as well as electronically at the Computing Research Repository (CoRR). Program Committee: Rafael Caballero, Complutense University Madrid, Spain Vitor Santos Costa, Universidade do Porto, Portugal Martin Gebser, University of Potsdam, Germany Samir Genaim, Complutense University of Madrid, Spain Yoshitaka Kameya, Tokyo Institute of Technology, Japan Andy King, University of Kent, UK Huiqing Li, University of Kent, U.K. Lunjin Lu, Oakland University, MI, USA Paulo Moura, Universidade da Beira Interior, Portugal Ulrich Neumerkel, Technische Universit?t Wien, Austria Enrico Pontelli, New Mexico State University, USA Joachim Schimpf, Monash University, Australia Peter Schneider-Kamp, University of Southern Denmark, Denmark Wim Vanhoof, University of Namur, Belgium German Vidal, Technical University of Valencia Neng-Fa Zhou, The City University of New York, NY, USA Workshop organizers: German Vidal DSIC, Universidad Politecnica de Valencia Camino de Vera S/N, 46022 Valencia, Spain http://www.dsic.upv.es/~gvidal/ Neng-Fa Zhou Department of Computer and Information Science, Brooklyn College The City University of New York 2900 Bedford Avenue, Brooklyn, NY 11210-2889 http://www.sci.brooklyn.cuny.edu/~zhou/ From kutsia at risc.uni-linz.ac.at Mon Mar 1 16:53:16 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Mon, 01 Mar 2010 22:53:16 +0100 Subject: [TYPES/announce] 2nd CfP: PPDP'10 Message-ID: <4B8C374C.6050002@risc.uni-linz.ac.at> ====================================================================== Call for Papers PPDP 2010 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming Hagenberg, Austria, 26-28 July 2010 (co-located with LOPSTR 2010) http://www.risc.uni-linz.ac.at/conferences/ppdp2010/ ====================================================================== PPDP 2010 aims to bring together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, AI languages and knowledge representation languages used, for example, in the semantic web. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analysing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. The conference will take place in July 2010 in the Castle of Hagenberg, Austria, colocated with the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2010), organised by the Research Institute for Symbolic Computation (RISC) of the Johannes Kepler University Linz. Topics: * Logic, Constraint, and Functional Programming * Database, AI and Knowledge Representation Languages * Visual Programming * Executable Specification Languages * Applications of Declarative Programming * Methodologies: 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 * Programming Environments The list above is not exhaustive - submissions describing new and interesting ideas relating broadly to declarative programming are encouraged. Submission guidelines: Papers should be submitted via the Easychair submission website for PPDP 2010: http://www.easychair.org/conferences/?conf=ppdp2010 Papers should consist of the equivalent of 12 pages under the ACM formatting guidelines. These guidelines are available online, along with formatting templates or style files. 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. No simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Proceedings: The proceedings will be published by ACM Press. Authors of accepted papers will be required to sign a copyright form. Camera ready papers for accepted papers should be prepared and submitted according to the final instructions that will be sent by the publisher after notification of acceptance. Invited Speakers: Maria Paola Bonacina (Universit? degli Studi di Verona, Italy) Sumit Gulwani (Microsoft Research) Important Dates: # Submission: title and abstract: 15 March 2010 full paper: 21 March 2010 # Notification: 23 April 2010 # Final version: 12 May 2010 # Symposium: 26-28 July 2010 Programme Committee: Elvira Albert (Spain) Sergio Antoy (US) Frederic Blanqui (China) Michele Bugliesi (Italy) Giuseppe Castagna (France) Mariangiola Dezani (Italy) Francois Fages (France) Maribel Fernandez (UK), chair Joxan Jaffar (Singapore) Andy King (UK) Temur Kutsia (Austria) Francisco Lopez Fraguas (Spain) Ian Mackie (France) Henrik Nilsson (UK) Albert Rubio (Spain) Kazunori Ueda (Japan) Philip Wadler (UK) Symposium Chairs: Temur Kutsia and Wolfgang Schreiner (Austria) For more information, please contact the chairs: Maribel Fernandez King's College London, UK Email: Maribel.Fernandez at kcl.ac.uk Temur Kutsia and Wolfgang Schreiner Research Institute for Symbolic Computation Johannes Kepler University Linz Email: kutsia at risc.uni-linz.ac.at From venneri at dsi.unifi.it Tue Mar 2 04:02:15 2010 From: venneri at dsi.unifi.it (Betti Venneri) Date: Tue, 02 Mar 2010 10:02:15 +0100 Subject: [TYPES/announce] ITRS 2010 - 2nd CFP Message-ID: <4B8CD417.6080303@dsi.unifi.it> ========================================================================== 2nd CALL FOR PAPERS Deadline: March 31, 2010 **ITRS 2010** Fifth Workshop on Intersection Types and Related Systems (A FLoC workshop affiliated with LICS 2010) July 9, 2010, Edinburgh, UK http://gdn.dsi.unifi.it/itrs/ ========================================================================== Intersection types were introduced near the end of the 1970s to overcome the limitations of Curry's type assignment system and to provide a characterization of the strongly normalizing terms of the Lambda Calculus. They have been one of the first examples of behavioural type theory: namely, they provide an abstract specification of computational properties, by expressing a finer and more precise input/output relation than standard, commonly used, type systems can do. Although intersection types were initially intended for use in analysing and/or synthesizing lambda models as well as in analysing normalization properties, over the last twenty years the scope of the research on intersection types and related systems has broadened in many directions. Restricted (and more manageable) forms have been investigated, such as refinement types. Type systems based on intersection type theory have been extensively studied for practical purposes, such as program analysis. The dual notion of union types turned out to be quite useful for programming languages. Finally, the behavioural approach to types, which can give a static specification of computational properties, has become central in the most recent research on type theory. The ITRS 2010 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. TOPICS Possible topics for submitted papers include, but are not limited to: * Formal properties of systems with intersection types. * Results for related systems, such as union types, refinement types, or singleton types. * Applications to lambda calculus and similar systems. * Applications to pi-calculus and similar systems. * Applications for programming languages. * Applications for other areas, such as database query languages and program extraction from proofs. * Related approaches using behavioural types to characterize computational properties. SUBMISSIONS The submission is in two stages. (1) Before the workshop, authors are invited to submit an extended abstract (max. 10 pages) in PDF format, using the Easychair submission site http://www.easychair.org/conferences/?conf=itrs2010. Accepted papers will be presented at the workshop and included in the preliminary proceedings, which will made available in electronic form. (2) After the workshop, authors of accepted papers will be invited to submit full versions, which will be referred for inclusion in final post-proceedings. The post-proceedings will be published as a special issue of Electronic Proceedings in Theoretical Computer Science (EPTCS). Submissions must be prepared in LaTeX using the EPTCS macro package (http://style.eptcs.org/). IMPORTANT DATES Submission of extended abstracts: March 31, 2010 Author notification: April 30, 2010 Final version for preliminary proceedings: May 26, 2010 Workshop: July 9, 2010 Submission for EPTC Post-Proceedings: September 30, 2010 (TBC) PROGRAM COMMITTEE Mariangiola Dezani-Ciancaglini (Univ.di Torino) Joshua Dunfield (McGill Univ. Montreal) Silvia Ghilezan (Univ. of Novi Sad) Atsushi Igarashi (Kyoto Univ.) Elaine Pimentel (Belo Horizonte Univ.) Betti Venneri (Univ. di Firenze) Chair Joe Wells (Heriot-Watt Univ.Edinburgh). ______________________________________________ From kremer at lsv.ens-cachan.fr Tue Mar 2 07:48:05 2010 From: kremer at lsv.ens-cachan.fr (Steve Kremer) Date: Tue, 02 Mar 2010 13:48:05 +0100 Subject: [TYPES/announce] SecReT 2010 Message-ID: <4B8D0905.8010009@lsv.ens-cachan.fr> 5th International Workshop on Security and Rewriting Techniques (SecReT 2010) Valencia (Spain), June 18-20. Aims and Scope: We need to increase our confidence in security related applications. Formal verification is one of the most important methods of achieving this goal, and term rewriting has already played an important part. In particular, since the beginning of formal verification of security protocols, term rewriting has played a central role, both as a computation model and as a deduction strategy. Because of this, we believe that it can play an important role in solving other security-related formal verification problems as well. That is why it is important to bring together experts in term rewriting, constraint solving, equational reasoning on the one side and experts in security on the other side. This is precisely the aim of this workshop. A possible (non exhaustive) list of topics include application of rewriting or constraint solving to authentication, encryption, access control and authorization, protocol verification, specification and analysis of policies, intrusion detection, integrity of information, control of information leakage, control of distributed and mobile code, etc. Submission instructions: The workshop will have no formal proceedings. We therefore encourage submission of ongoing work as well as recently published work. Submissions should be 1 page abstract summarizing the work the authors would like to present. Detailed submission instructions will soon be available on the workshop's website. Important dates: - Submission deadline: April 2 - Notification: April 23 - Workshop: June 18-20 Invited speakers: - Bruno Blanchet - Ralf Kuesters - Catherine Meadows - Michael Rusinowith Program Committee: - Yannick Chevalier - Hubert Comon-Lundh - Dan Dougherty - Santiago Escobar - Steve Kremer (co-chair) - Chris Lynch - Jose Meseguer - Paliath Narendran (co-chair) From cesar.a.munoz at nasa.gov Tue Mar 2 11:44:32 2010 From: cesar.a.munoz at nasa.gov (Munoz, Cesar Augusto (LARC-D320)) Date: Tue, 2 Mar 2010 10:44:32 -0600 Subject: [TYPES/announce] Call for Participation NFM 2010 Message-ID: ---------------------------------------------------- CALL FOR PARTICIPATION: 2nd NASA Formal Methods Symposium ----------------------------------------------------- The NASA Formal Methods community invites you to attend the Second NASA Formal Methods Symposium (NFM 2010) http://shemesh.larc.nasa.gov/NFM2010 nfm2010 at lists.nasa.gov April 13-15, 2010 Washington D.C. Theme of Conference ---- The NASA Formal Methods Symposium is a forum for theoreticians and practitioners from academia and industry, with the goals of identifying challenges and providing solutions to achieving assurance in safety-critical systems. The focus of the symposium will be on formal techniques, their theory, current capabilities, and limitations, as well as their application to aerospace, robotics, and other safety-critical systems. Invited Speakers ---- Nikolaj Bjorner, Microsoft Guillaume Brat, NASA John Harrison, Intel John Kelly, NASA http://shemesh.larc.nasa.gov/NFM2010/speakers.html Program ---- The program committee selected 20 regular papers and 4 short papers for presentation, covering various aspects of the theory and practice of formal methods in safety-critical domains. http://shemesh.larc.nasa.gov/NFM2010/program.html Registration ---- Attendance to the symposium is free, but all attendees must register in order to participate. Registration closes April 9, 2010. http://shemesh.larc.nasa.gov/NFM2010/registration.html Travel and Local Information ---- The conference will take place in the James Webb Memorial Auditorium at NASA Headquarters in Washington D.C. http://shemesh.larc.nasa.gov/NFM2010/local.html Note that there are room blocks reserved at two hotels. These reservations will expire in the March 13-15 time frame. http://shemesh.larc.nasa.gov/NFM2010/travel.html Contact ---- Mike Hinchey, Conference Chair Cesar Munoz, Program Chair nfm2010 at lists.nasa.gov From kaufmann at cs.utexas.edu Tue Mar 2 11:42:58 2010 From: kaufmann at cs.utexas.edu (Matt Kaufmann) Date: Tue, 2 Mar 2010 10:42:58 -0600 Subject: [TYPES/announce] Result of Call for Votes on bids to host ITP-2011 Message-ID: <201003021642.o22GgwLQ013803@sundance.cs.utexas.edu> Hello -- Voting has closed for the Call for Votes on bids to host ITP-2011, as announced on Feb. 18 (see http://www.cs.utexas.edu/users/kaufmann/itp-2011-bids.html). The result was computed using VoteEngine 0.99, downloaded from http://vote.sourceforge.net/, and the output is shown below. (I also wrote my own little program to compute each round and checked that its results completely agreed with those of VoteEngine. I also checked and fixed spelling typos.) Congratulations to the team from The Netherlands on its winning bid! And thank you to all of those who submitted bids, which we found to be very impressive. In the output below, we have of course: C = China D = Denmark N = Netherlands S = Spain U = USA .......... VOTES 61 IRV Cand Plurality score N 12 S 9 C 17 D 9 U 14 Unresolved Tie .......... So I resolved the tie by branching: In one run, I removed Spain while in the other, I instead removed Denmark. The respective results are below. (Note: 3 people voted only for Denmark while 1 person voted only for Spain, which explains the discrepancy in "VOTES".) .......... removing Spain: .......... VOTES 60 IRV Cand Plurality score N 17 C 17 D 11 U 15 Cand Plurality score N 20 C 21 U 16 Cand Plurality score N 33 C 24 Winner N .......... removing Denmark: .......... VOTES 58 IRV Cand Plurality score N 13 S 11 C 19 U 15 Cand Plurality score N 20 C 21 U 16 Cand Plurality score N 33 C 24 Winner N .......... Regards, Matt Kaufmann (and Larry Paulson; ITP-10 co-chairs) From vs at ecs.soton.ac.uk Wed Mar 3 01:20:58 2010 From: vs at ecs.soton.ac.uk (Vladimiro Sassone) Date: Wed, 3 Mar 2010 06:20:58 +0000 Subject: [TYPES/announce] deadline extension: IFIP TCS 2010 References: <0F7D3114-86BE-4BCD-979C-BA305D68B7EA@ecs.soton.ac.uk> Message-ID: Dear colleagues, This is to announce a deadline extension for submissions of papers to 6th IFIP International Conference on Theoretical Computer Science a part of the IFIP World Computer Congress 2010 Brisbane, Australia 20-23 September 2010 www.wcc2010.com Please consider submitting your work by the new deadline: Deadline for abstracts: Mar 12th Deadline for papers: Mar 15th. The CfP is available at http://www.wcc2010.com/migrated/TCS2010/TCS2010_cfp.html (please ignore the old submission date on that page). Submission at https://www.easychair.org/login.cgi?conf=tcs2010 With best regards, V. Sassone PC chair From mtf at cs.rit.edu Wed Mar 3 10:08:48 2010 From: mtf at cs.rit.edu (Matthew Fluet) Date: Wed, 3 Mar 2010 10:08:48 -0500 (EST) Subject: [TYPES/announce] Workshop on ML 2010 - Call for Content Message-ID: The 2010 ACM SIGPLAN Workshop on ML http://www.cs.rit.edu/~mtf/ml2010 Baltimore, Maryland, United States Sunday, September 26, 2010 co-located with ICFP 2010 Call for Content ML is a family of programming languages that includes dialects known as Standard ML, Objective Caml, and F#. The development of these languages has inspired a large amount of computer science research, both practical and theoretical. This workshop aims to provide a forum to encourage discussion and research on ML and related technology (higher-order, typed, or strict languages). The format of the 2010 Workshop on ML will be different than that of recent years, returning to a more informal model: a workshop with presentations selected from submitted abstracts but without published proceedings. We hope that this format will encourage the presentation of more exciting (if unpolished) research and deliver a more lively workshop atmosphere. Important Dates ~~~~~~~~~~~~~~~ Submission: 25 June, 2010 Notification: 9 August, 2010 Format ~~~~~~ The workshop will consist of presentations by the participants, selected from submitted abstracts. Participants are invited to submit working drafts, source code, and/or extended abstracts for distribution on the workshop homepage and to the attendees, but as the workshop will have no formal proceedings, any contributions may be submitted for publication to other venues. (See the SIGPLAN republication policy for more details.) Scope ~~~~~ We primarily seek research presentations on topics related to ML, including (but not limited to): * applications: case studies, experience reports, pearls, etc. * extensions: higher forms of polymorphism, generic programming, objects, concurrency, distribution and mobility, semi-structured data handling, etc. * type systems: inference, effects, overloading, modules, contracts, specifications and assertions, dynamic typing, error reporting, etc. * implementation: compilers, interpreters, type checkers, partial evaluators, runtime systems, garbage collectors, etc. * environments: libraries, tools, editors, debuggers, cross-language interoperability, functional data structures, etc. * semantics: operational, denotational, program equivalence, parametricity, mechanization, etc. Research presentations should describe new ideas, experimental results, significant advances in ML-related projects, or informed positions regarding proposals for next-generation ML-style languages. We especially encourage presentations that describe work in progress, that outline a future research agenda, or that encourage lively discussion. In addition to research presentations, we seek both Status Reports and Demos that emphasize the practical application of ML research and technology. Status Reports: Status reports are intended as a way of informing others in the ML community about the status of ML-related research or implementation projects, as well as communicating insights gained from such projects. Status reports need not present original research, but should deliver new information. In the abstract submission, describe the project and the specific technical content to be presented. Demos: Live demonstrations or tutorials are intended to show new developments, interesting prototypes, or work in progress, in the form of tools, libraries, or application software built on or related to ML technology. In the abstract submission (which need only be about half a page), describe the demo and its technical content, and be sure to include the demo's title, authors, collaborators, references, and acknowledgments. A demonstration should take 10-15 minutes. The exact time per demo will be decided based on the number of accepted submissions. (Please note that you will need to provide all the hardware and software required for your demo; the workshop organizers are only able provide a projector.) Submission Guidelines and Instructions ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Email submissions to mtf AT cs.rit.edu. Submissions should be at most two pages, in PDF format, and printable on US Letter or A4 sized paper. Persons for whom this poses a hardship should contact the program chair. Submissions longer than a half a page should include a paragraph synopsis suitable for inclusion in the workshop program. Program Chair ~~~~~~~~~~~~~ Matthew Fluet Rochester Institute of Technology Program Committee ~~~~~~~~~~~~~~~~~ Kathleen Fisher AT&T Labs Research Adam Granicz IntelliFactory Daan Leijen Microsoft Research Johan Nordlander LuleÃ¥ University of Technology Sungwoo Park Pohang University of Science and Technology Daniel Spoonhower Google From Stephan.Merz at loria.fr Thu Mar 4 03:37:27 2010 From: Stephan.Merz at loria.fr (Stephan Merz) Date: Thu, 4 Mar 2010 09:37:27 +0100 Subject: [TYPES/announce] CFP: iFM 2010 Message-ID: <842A5E3A-FD6B-4316-8D1D-E86AD03AC22F@loria.fr> CALL FOR PAPERS 8th International Conference on Integrated Formal Methods (iFM 2010) October 11-14, 2010, Nancy, France http://ifm2010.loria.fr/ Applying formal methods may involve the modeling of different aspects of a system that are expressed through different paradigms. Correspondingly, different analysis techniques will be used to examine differently modeled system views, different kinds of properties, or simply in order to cope with the sheer complexity of the system. The iFM conference series seeks to further research into the combination of (formal and semi-formal) methods for system development, regarding modeling and analysis, and covering all aspects from language design through verification and analysis techniques to tools and their integration into software engineering practice. Areas of interest include but are not limited to: - Integration of formal modeling and analysis methods - Integration of formal and semi-formal modeling and analysis methods - Integration of formal methods into software engineering practice - Semantics, Logics, Type systems - Verification, Model checking, Static analysis, Theorem proving - Refinement, Model transformations - Tools, Experience reports, Case studies Invited Speakers: - Christel Baier, TU Dresden - John Fitzgerald, Newcastle University - Rajeev Joshi, Laboratory for Reliable Software, JPL iFM 2010 solicits high quality papers reporting research results and/or experience reports related to the overall theme of method integration. All papers must be original, unpublished, and not submitted for publication elsewhere. Submission will be electronically as PDF or Postscript, using the Springer LNCS format. Papers should not exceed 15 pages in length. Each paper will undergo a thorough review process. The conference proceedings will be published by Springer Verlag in the LNCS series. Important Dates: - Abstract submission: May 14, 2010 - Full paper submission: May 21, 2010 - Notification: July 4, 2010 - Final version: July 18, 2010 Contact: ifm2010 at loria.fr From michaelw at cs.utwente.nl Fri Mar 5 04:29:36 2010 From: michaelw at cs.utwente.nl (Michael Weber) Date: Fri, 5 Mar 2010 10:29:36 +0100 Subject: [TYPES/announce] SPIN 2010 2nd Call for Papers Message-ID: <6CE39F20-385C-4482-8704-1C45954A9799@cs.utwente.nl> 17th International SPIN Workshop on Model Checking of Software September 27--29, 2010, University of Twente, The Netherlands URL: Co-located with: ICGT 2010 , PDMC+HiBi 2010, NEWS ==== Invited speakers are confirmed: * Javier Esparza, Technical University of Munich, Germany (joint keynote speaker with ICGT 2010) * Alessandro Cimatti, FBK-IRST, Italy * Darren Cofer, Rockwell Collins, USA Aim and Scope ============= The SPIN workshop is a forum for practitioners and researchers interested in state space-based techniques for the validation and analysis of software systems. The focus of the workshop is on theoretical advances and empirical evaluations based on explicit representations of state spaces, as implemented in the SPIN model checker or other tools, or techniques based on combinations of explicit and other symbolic representations. We welcome papers describing the development and application of state-space and path-exploration techniques for the testing and the verification of security-critical software, enterprise and web applications, embedded software, and other interesting software platforms. The workshop aims to encourage interactions and exchanges of ideas with all related areas in software engineering. Topics of Interest include (but are not limited to): ==================================================== * Algorithms and storage methods for explicit-state model checking * Theoretical and algorithmic foundations of model-checking based analysis * Directed model checking using heuristics * Parallel or distributed model checking * Model checking of timed and probabilistic systems * Abstraction and symbolic execution techniques in relation to software verification * Static analysis for state space reduction * Combinations of enumerative and symbolic techniques * Analysis for modeling languages, such as UML/state charts * Property specification languages, including new forms of temporal logic * Model checking for various programming languages and code analysis * Automated testing using state space and/or path exploration techniques * Derivation of specifications, test cases, or other useful material from state spaces * Combination of model-checking techniques with other analysis techniques * Modularity and compositionality * Comparative studies, including comparisons with other model-checking techniques * Case studies of interesting systems or with interesting results * Engineering and implementation of model-checking tools and platforms * Benchmarks for software verification Solicited Contributions ======================= We solicit two kinds of papers: * TECHNICAL PAPERS. These papers should contain original work which has not been submitted or accepted for publication elsewhere. Submissions should adhere to the LNCS format and should be no longer than 18 pages. * TOOL PAPERS. These papers should describe novel tools or tool extensions. If previous versions of the described tool have been published before, the novel features of the tool should be explained clearly. These papers should also specify availability of the tool, number of users, and applications/case studies. Tool paper submissions should consist of two parts. The first part is at most 5 pages in LNCS format. The name "Tool Presentation" should appear in the title. If accepted, this 5 page paper will be published in the workshop proceedings. The second part should describe an informal plan for the oral presentation of the tool. This part will not be included in the proceedings. If accepted, both regular and tool papers will be presented at the conference and will be included in the workshop proceedings. At least one author of each accepted paper is expected to be present at the conference. Submissions are held confidential until publication. Submission and Publication ========================== As in previous years, the proceedings of this edition of the workshop will appear in Lecture Notes in Computer Science. Important Dates =============== Abstract submission: April 9, 2010 Paper submission: April 16, 2010 Notification of acceptance: June 7, 2010 Final papers due: June 28, 2010 Workshop: September 27--29, 2010 ORGANIZATION ============ Program Chairs: Jaco van de Pol, U Twente, Netherlands Michael Weber, U Twente, Netherlands Program Committee: Dragan Bosnacki (TU Eindhoven, The Netherlands) Jiri Barnat (Masaryk University Brno, Czech Republic) Stefan Edelkamp (University of Bremen, Germany) Patrice Godefroid (Microsoft Research, Redmond, USA) Ganesh Gopalakrishnan (University of Utah, USA) Jan Friso Groote (TU Eindhoven, The Netherlands) Orna Grumberg (Technion, Israel) Gerard Holzmann (NASA/JPL, USA) Radu Iosif (Verimag Grenoble, France) Stefan Leue (University of Konstanz, Germany) Rupak Majumdar (University of California at Berkeley, USA) Eric G. Mercer (Brigham Young University, USA) Albert Nymeyer (University of New South Wales, Australia) Dave Parker (Oxford Univerisity, UK) Corina Pasareanu (CMU/NASA Ames, USA) Doron Peled (Bar-Ilan University, Israel) Paul Pettersson (Malardalen University, Sweden) Scott Stoller (Stony Brook University, USA) Willem Visser (Stellenbosch University, South Africa) Tomohiro Yoneda (National Institute of Informatics, Japan) Steering Committee: Susanne Graf, VERIMAG, France Gerard Holzmann, JPL, USA Stefan Leue (chair), U Konstanz, Germany Pierre Wolper, U Liege, Belgium -- Michael Weber University of Twente, The Netherlands http://fmt.cs.utwente.nl/~michaelw/ From dg at cs.cmu.edu Sat Mar 6 10:58:18 2010 From: dg at cs.cmu.edu (Deepak Garg) Date: Sat, 06 Mar 2010 10:58:18 -0500 Subject: [TYPES/announce] PLAS 2010: Final call for papers Message-ID: <4B927B9A.8020800@cs.cmu.edu> *********************************************************************** Final Call for Papers Fifth ACM SIGPLAN Workshop on Programming Languages and Analysis for Security (PLAS 2010) http://software.imdea.org/events/plas2010/index.html June 10, 2010 Co-located with PLDI 2010, Toronto, Canada *********************************************************************** SCOPE PLAS aims to provide a forum for exploring and evaluating ideas on the use of programming language and program analysis techniques to improve the security of software systems. Strongly encouraged are proposals of new, speculative ideas, evaluations of new or known techniques in practical settings, and discussions of emerging threats and important problems. The scope of PLAS includes but is not limited to: * Compiler-based security mechanisms or runtime-based security mechanisms such as inline reference monitors * Program analysis techniques for discovering security vulnerabilities * Automated introduction and/or verification of security enforcement mechanisms * Language-based verification of security properties in software including verification of cryptographic protocols * Specifying and enforcing security policies for information flow and access control * Model-driven approaches to security * Security concerns for web programming languages * Language design for security in new domains such as cloud computing and embedded platforms * Applications, case studies, and implementations of these techniques IMPORTANT INFORMATION ***************************** Submissions due: Friday, March 12, 2010 Author notification: Friday, April 23, 2010 Revised papers due: Monday, May 10, 2010 PLAS 2010 workshop: Thursday, June 10, 2010 Submission URL: https://www.easychair.org/login.cgi?conf=plas2010 SUBMISSION GUIDELINES We invite papers in two categories: * Full papers should be at most 12 pages long including bibliography and appendices. Papers in this category are expected to have relatively mature content. Full paper presentations will be 25 minutes each. * Position papers should be at most 6 pages long including bibliography and appendices. Preliminary and exploratory work are welcome in this category. Position paper presentations will be 10 minutes each. Authors submitting papers in this category must prepend the phrase "Position Paper: " (without quotes) to the title of the submitted paper. Submissions should be PDF documents typeset in the ACM proceedings format using 10pt fonts. SIGPLAN-approved templates can be found at http://www.acm.org/sigs/sigplan/authorInformation.htm. We recommend using this format, which improves greatly on the ACM LaTeX format. All submissions must be in English. Page limits are strict. Both full and position papers must describe work not published in other refereed venues (see the SIGPLAN republication policy at http://www.acm.org/sigs/sigplan/republicationpolicy.htm for details). Accepted papers will appear in the workshop proceedings which will be distributed to workshop participants and be available in the ACM Digital Library. PROGRAM COMMITTEE Anindya Banerjee (IMDEA Software) (co-chair) Gilles Barthe (IMDEA Software) Avik Chaudhuri (University of Maryland) Veronique Cortier (LORIA, CNRS) Brendan Eich (Mozilla Corporation) Ulfar Erlingsson (Microsoft Research and Reykjavik University) Deepak Garg (Carnegie Mellon University) (co-chair) Andrew D. Gordon (Microsoft Research) Joshua Guttman (Worcester Polytechnic Institute) Shriram Krishnamurthi (Brown University) Sergio Maffeis (Imperial College London) Todd Millstein (University of California, Los Angeles) John Mitchell (Stanford University) Marco Pistoia (IBM TJ Watson Research Center) Andrei Sabelfeld (Chalmers University) Zhendong Su (University of California, Davis) From phil at site.uottawa.ca Sun Mar 7 18:58:07 2010 From: phil at site.uottawa.ca (Philip Scott) Date: Sun, 7 Mar 2010 18:58:07 -0500 Subject: [TYPES/announce] MFPS XXVI, in Ottawa (May 6--10): call for participation Message-ID: <3FBD50E4-2EA4-4244-BB56-22615E28773C@site.uottawa.ca> This is an early call for participation for MFPS XXVI (Mathematical Foundations of Programming Semantics), to be held at the University of Ottawa, May 6-10 2010 , partially sponsored by the US Office of Naval Research and the Fields Institute. Information on the aims and scope of the conference, as well as invited speakers, tutorials and special sessions can be found at: http://www.math.tulane.edu/~mfps/mfps26/MFPS_XXVI.html The list of accepted papers will be available roughly mid-March. The Fields registration webpage is at: http://www.fields.utoronto.ca/programs/scientific/09-10/MFPS26/ Registration and early requests for student support can be done online at the Fields Institute address above. Note: some money is available to partially support graduate students, postdocs and researchers without grants. Those who wish to apply for this support should do so right away on the Fields registration page (before March 31). In your application for support, please state clearly what your research program is, in what way MFPS is relevant to your research, and whether you have access to other funds. Priority will be given to students who do not have access to other funding for travel. Graduate students please note: there will be a special student session of short presentations, and students who wish to apply to speak should also tell us. There is a planned conference banquet, to be announced soon. Accommodation: we have reserved rooms in several hotels near campus, as well as in the university residence. The university residence suites are a very good deal: a two room suite and kitchen is $90. On the local web page of the event you will find more information on this. Please note that in order to take advantage of the discount rate most bookings have to be done before April. Here is the local web page: http://aix1.uottawa.ca/~mwarren/MFPS/index.html If you have any questions please do not hesitate to contact one of the organizers, Richard Blute rblute at uottawa.ca Philip Scott phil at site.uottawa.ca Michael Warren mwarren at uottawa.ca From bove at chalmers.se Tue Mar 9 06:29:11 2010 From: bove at chalmers.se (Ana Bove) Date: Tue, 9 Mar 2010 12:29:11 +0100 Subject: [TYPES/announce] PAR'10 at FLOC'10: 2nd CFP Message-ID: <4B963107.10402@chalmers.se> Please distribute to those you might think are interested. ======================================================================== 2nd Call for Papers PAR 2010 Workshop on Partiality And Recursion in Interactive Theorem Provers Edinburgh, UK, 15 July 2010 (satellite workshop of ITP'10) a mid-FLoC 2010 workshop > ======================================================================== Note the changes: # Second invited speaker is now confirmed: Alexander Krauss, Munich # Pre-proceedings will be published and maintained by EasyChair # Change in the deadline for the final version (will affect only accepted papers) PAR'10 workshop is a venue for researchers working on new approaches to cope with partial functions and terminating general (co)recursion in theorem provers. Theorem provers with inductive types provide a restricted programming language together with a formal meta-theory for reasoning about the language. When propositions are represented as types and proofs as programs, non-terminating proofs are disallowed for consistency and decidability of type checking. As a result, there is no trivial way to represent partial functions, and termination is syntactically ensured by imposing that the recursive calls must be made on structurally smaller arguments. Similar issues exist for productivity of functions on infinite objects where syntactic methods are used to ensure an infinite flow of data. The workshop aims to address these issues and various approaches for dealing with them. We invite submissions on all aspects of partiality and termination of general (co)recursive functions in a logical framework. The topics of this workshop include but are not limited to: * partial functions and functions over partial objects in theorem provers; * specialised type systems for general (co)recursion; * syntactical tests to guarantee termination of general recursive functions; * syntactical tests to guarantee productivity of functions on infinite objects; * methods to ensure termination of special classes of recursion definitions, eg nested recursion, simultaneous inductive-recursive data types and functions; * semantic approaches to termination and productivity, eg based on domain theory and topology; * categorical approaches to termination and productivity; * algebra of programming with partial functions and general (co)recursion. Description of software tools and case studies for dealing with the issues in the scope of the workshop are welcome. Submissions ----------- The articles will be evaluated by the Program Committee for publication in the proceedings of the workshop. In accordance with FLoC'10 requirements, PAR'10 proceedings will be published in an electronic collection available online and maintained by EasyChair. The USB memory sticks with accepted papers will be distributed during the workshop. The post-proceedings of PAR'10 will be published after the workshop as a special issue of EPTCS. Details on how and when to produce the post-workshop version of the articles will be communicated after the workshop to the authors of the accepted papers. The articles must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. Submissions should preferably not exceed 16 pages (excluding bibliography). Submissions must be prepared in LaTeX using the EasyChair latex package( http://www.easychair.org/easychair.zip). The web-based system EasyChair will be used for submission (). Important dates --------------- * 29 March 2010: Submission deadline * 29 April 2010: Notification of acceptance * 18 May 2010: Final version of accepted papers (Notice the slight change compared to previous announcements) * 15 July 2010: the workshop Invited Speakers ---------------- * Conor McBride (University of Strathclyde) * Alexander Krauss (Technical University of Munich) Programme Committee ------------------- Andreas Abel (Ludwig Maximilians University Munich, D) Yves Bertot (INRIA Sophia-Antipolis, FR) Ana Bove (Chalmers University of Technology, SE) Ekaterina Komendantskaya (University of St Andrews, UK) Ralph Matthes (IRIT Toulouse, FR) Milad Niqui (CWI, NL) Anton Setzer (Swansea University, UK) Organisers ---------- Ana Bove Ekaterina Komendantskaya Milad Niqui ________________________________ From Alex.Simpson at ed.ac.uk Tue Mar 9 10:42:21 2010 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Tue, 09 Mar 2010 15:42:21 +0000 Subject: [TYPES/announce] Proof Systems for Program Logics 2010: call for talks Message-ID: <20100309154221.i3wzk05mskwgog80@www.staffmail.ed.ac.uk> Proof Systems for Program Logics (PSPL 2010) Saturday 10th July 2010, Edinburgh, UK A LICS 2010-affiliated workshop at FLoC 2010 http://homepages.inf.ed.ac.uk/als/PSPL2010/ A new workshop bringing together researchers working on any aspect of the design, study and application of proof systems for program logics. Invited speakers: Andre Platzer (Carnegie Mellon University) Viktor Vafeiadis (University of Cambridge) CALL FOR CONTRIBUTED TALKS The emphasis of the workshop is on reporting current and ongoing research. 30-minute contributed talks will be selected on the basis of two-page abstracts. Submission deadline for two-page abstracts: Monday 12th April 2010. Author notification : Monday 26th April 2010. Possible topics include, but are not restricted to: * Proof systems for modular/compositional verification * Proof systems for substructural/spatial/nominal logics * Proof systems for concurrent/mobile/distributed systems * Proof systems for timed/continuous/probabilistic/stochastic/hybrid systems * Structural proof theory (e.g. natural deduction and sequent calculus systems) for program logics * Proof-theoretic mechanisms for induction/coinduction/fixed points * Proof systems formalizing operational semantics * Proof systems for program synthesis * Constructive type theories and logics for verification/synthesis * Curry-Howard and generalisations to non-functional computation * Proof-theoretic accounts of decidability/complexity results * Completeness and relative completeness proofs for program logics * Proof systems designed to facilitate proof search Abstracts will appear in the FLoC Workhops electronic proceedings. It is planned to follow the workshop with a journal special issue. For more details see: http://homepages.inf.ed.ac.uk/als/PSPL2010/ PROGRAMME COMMITTEE * Luis Caires (Universidade Nova de Lisboa) * Robert Harper (Carnegie Mellon University) * Peter O'Hearn (Queen Mary London) * Dale Miller (INRIA) * Matthew Parkinson (Microsoft Research Cambridge) * Dana Scott (Carnegie Mellon University, Emeritus) * Alex Simpson (Edinburgh) * Luca Vigano (Verona) -- Alex Simpson, LFCS, School of Informatics, Univ. of Edinburgh, UK Email: Alex.Simpson at ed.ac.uk Tel: +44 (0)131 650 5113 Web: http://homepages.inf.ed.ac.uk/als Fax: +44 (0)131 651 1426 -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From emilio at mcs.le.ac.uk Tue Mar 9 11:00:53 2010 From: emilio at mcs.le.ac.uk (Emilio Tuosto) Date: Tue, 9 Mar 2010 16:00:53 +0000 Subject: [TYPES/announce] GT-VMT 2010: cfp Message-ID: <201003091600.54239.emilio@mcs.le.ac.uk> ================================================================ Call for Participation 9th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2010) http://www.cs.le.ac.uk/events/gtvmt10/ Satellite Event of ETAPS 2010, Cyprus -- March 20-21, 2010 ============================================================== * Scope * GT-VMT 2010 is the ninth workshop of a series that serves as a forum for all researchers and practitioners interested in the use of graph-based notation, techniques, and tools for the specification, modeling, validation, manipulation and verification of complex systems. The aim of the workshop is to promote engineering approaches that provide effective sound tool support for visual modeling languages, enhancing formal reasoning at the semantic level (e.g., for model analysis, transformation, and consistency management) in different domains, such as UML, Petri nets, Graph Transformation or Business Process/Workflow Models. * Workshop Program SATURDAY 20 MARCH 2010 9:00-9:15 Opening 9:15-10:30 Invited talk: Fernando Orejas: Symbolic Attributed Graphs and Attributed Graph Transformation 10:30-11:00 Break 11:00-12:30 Session on Foundations Maarten de Mol and Arend Rensink. A Graph Representation for Ordered Edges. Davide Grohmann and Marino Miculan. Graph Algebras for Bigraphs. Christoph Blume, Sander Bruggink, and Barbara K?nig. Recognizable Graph Languages for Checking Invariants. 12:30-14:00 Lunch 14:00-15:30 Session on Modeling and Modeling Environments Frank Hermann, Andrea Corradini, Hartmut Ehrig, and Barbara K?nig. Efficient Process Analysis of Transformation Systems Based on Petri nets. Berthold Hoffmann and Mark Minas. Defining Models - Meta Models versus Graph Gammars. Torsten Strobl and Mark Minas. Specifying and generating editing environments for interactive animated visual models. 15:30-16:00 Break 16:00-17:00 Session on Interactions Vojtech Rehak, Petr Slovak, Jan Strejcek, and Loic Helouet. Decidable Race Condition and Open Coregions in HMSC. Abubakar Hassan, Ian Mackie, and Shinya Sato. A light-weight abstract machine for interaction nets. 17:00-17:30 Discussion SUNDAY 21 MARCH 2010 9:30-11:00 Session on Model Transformation Eugene Syriani and Hans Vangheluwe. De-/Re-constructing Model Transformation Languages. Bernhard Schaetz. Verification of Model Transformations. Paolo Bottoni, Andrew Fish, and Francesco Parisi-Presicce. Preserving constraints in horizontal model transformations. 11:00-11:30 Break 11:30-12:30 Session on Foundations Paolo Torrini, Reiko Heckel, Istvan Rath, and Gabor Bergmann. Stochastic Graph Transformation with Regions. Wolfram Kahl. Cotabulations, Bicolimits and Van-Kampen Squares in Collagories. 12:30-14:00 Lunch * Workshop organizers Jochen Kuester, IBM Research, Switzerland Emilio Tuosto, University of Leicester, UK * Program Committee Paolo Baldan (University of Padova, Italy) Artur Boronat (University of Leicester, UK) Andrea Corradini (University of Pisa, Italy) Claudia Ermel (TU Berlin, Germany) Gregor Engels (University of Paderborn, Germany) Reiko Heckel (University of Leicester, UK) Thomas Hildebrandt (ITU, Denmark) Holger Giese (HPI Potsdam, Germany) Barbara K?nig (University of Duisburg-Essen, Germany) Jochen K?ster (IBM Research - Zurich, Germany) Alberto Lluch Lafuente (IMT Institute for Advanced Studies Lucca, Italy) Juan de Lara (Universidad Aut?noma de Madrid, Spain) Mark Minas (Universit?t der Bundeswehr M?nchen, Germany) Francesco Parisi-Presicce (University of Rome, Italy) Arend Rensink (University of Twente, Netherlands) Gabriele Taentzer (University of Marburg, Germany) Emilio Tuosto (University of Leicester, UK) D?niel Varr? (TU Budapest, Hungary) Erhard Weinell (RWTH Aachen University, Germany) Albert Z?ndorf (University of Kassel, Germany) * More information on the workshop is available through the webpage: http://www.cs.le.ac.uk/events/gtvmt10/ -- *************************************************************** Emilio Tuosto Department of Computer Science University of Leicester Leicester, LE1 7RH United Kingdom Tel. +44 (0) 116 252 5392 Fax. +44 (0) 116 252 3915 homepage -> http://www.cs.le.ac.uk/people/et52 *************************************************************** -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100309/901fb8fd/attachment-0001.htm From thomas.ehrhard at pps.jussieu.fr Wed Mar 10 03:24:54 2010 From: thomas.ehrhard at pps.jussieu.fr (Thomas Ehrhard) Date: Wed, 10 Mar 2010 09:24:54 +0100 Subject: [TYPES/announce] Logic Colloquium 2010 Message-ID: <4B975756.6020002@pps.jussieu.fr> Logic Colloquium 2010 Paris 25 July - 31 July Deadline for submissions: 19 April, 2010 http://www.logic2010.org/ ********************************************************************* The Logic Colloquium is the annual European conference on logic, organised under the auspices of the Association for Symbolic Logic (ASL). This year, the Programme Committee consists of: A. Atserias, Z. Chatzidakis, T. Coquand, P.-L. Curien, M. Detlefsen, C. Dimitracopoulos, J. Floyd, I. Juhasz, M. Magidor, M. Rathjen, T. Scanlon, A. Soskova and Y. Venema. The main events in this year's conference are as follows. Tutorials: Uri Abraham (University Ben Gurion, Beer-Sheva ) Ted Slaman (University of California, Berkeley) Plenary talks: Fran?oise Delon (University Paris Diderot) Nicola Gambino (Palermo University) Mai Gehrke (Nijmegen University) Jean-Yves Girard (University Marseille M?diterran?e) Moti Gitik (Tel-Aviv University) Valentin Goranko (Technical University of Denmark, Lyngby) Leila Haaparanta (University of Helsinki) Ian Hodkinson (Imperial College) Julia Knight (University of Notre Dame) Piotr Koszmider (Technical University of Lodz) Jan Krajicek (Charles University in Prague) Angus MacIntyre (Queen Mary, University of London) Paulo Oliva (Queen Mary, University of London) Kobi Peterzil (Haifa University) Simon Thomas (Rutgers University) G?ran Sundholm (Leiden University) Andreas Weiermann (Ghent University) Thomas Wilke (Kiel University) Alex Wilkie (University of Manchester) Special sessions: * Model Theory. Co-chairs: Tom Scanlon (University of California, Berkeley) and Frank Wagner (University Lyon I) * Computability Theory. Co-chairs: Alexandra Soskova (Sofia University) and Andrea Sorbi (Siena University) * Set Theory. Co-chairs: Mirna Dzamonja (University of East Anglia), Istvan Juhasz (Hungarian Academy of Science) and Boban Velickovic (University Paris Diderot) * Symposium on the Beytr?ge of Bernard Bolzano. Co-chairs: Michael Detlefsen (University of Notre-Dame) et Juliet Floyd (Boston University) * Symposium on Simplicity (Complexity) of proofs: Mathematical and Philosophical Issues. Co-chairs: Michael Detlefsen (University of Notre-Dame), Juliet Floyd (Boston University) and Michael Rathjen (University of Leeds) The Programme Committee cordially invites all researchers to submit contributed papers that have logic research content that lies within the scope of the interests of the ASL. Submission Deadline: 19 April 2010 Notification of Authors: 4 May 2010 The rules for abstract submission can be found at the conference webpage http://www.logic2010.org The ASL will make available modest travel awards to graduate students in logic and to recent PhD's to attend the 2010 ASL European Summer Meeting in Paris. The European Summer Meeting is also supported by a grant from the US National Science Foundation; NSF funds may be awarded only to students at USA universities and to citizens and permanent residents of the USA. Applications and recommendations must be received before the deadline of March 30, 2010, by e-mail to application at logic2010.org or by surface mail to LC2010 Thomas Ehrhard Laboratoire PPS Universit? Paris Diderot - Paris 7 Case 7014 75205 PARIS Cedex 13 France Fax: (+33) 1 44 27 86 54 by the Organizing Committee: S. Abbes, O. Ainardi, V. Balat, T. Colcombet, R. Cori (chair), A. Durand, T. Ehrhard (co-chair), M. Hils, R. Labib-Sami, R. Lassaigne, Y. Legrandg?rard, G. Malod, A. Mansuet, S. P?rifel, J.-E. Pin (co-chair), F. Point, P. Rozi?re, T. Tsankov, B. Velikovic. From kohei at dcs.qmul.ac.uk Wed Mar 10 04:47:25 2010 From: kohei at dcs.qmul.ac.uk (Kohei Honda) Date: Wed, 10 Mar 2010 09:47:25 +0000 Subject: [TYPES/announce] PLACES'10: call for participation Message-ID: CALL FOR PARTICIPATION PLACES'10 Programming Language Approaches to Concurrency and communication-cEntric Software 21st March 2010, Paphos, Cyprus Affiliated with ETAPS 2010 http://places10.di.fc.ul.pt/ Dear colleagues, This is the call for participation for PLACES'2010, a workshop for foundations of concurrent and distributed programming. Applications on the web today are built using numerous interacting services; soon off-the-shelf CPUs will host hundreds of cores; and sensor networks will be composed from a large number of processing units. Many normal software, including applications and system-level services, will soon need to make effective use of thousands of computing nodes. At some level of granularity, computation in such systems will be inherently concurrent and communication-centred. To exploit and harness the richness of this computing environment, designers and programmers will utilise a rich variety of programming paradigms, depending on the shape of the data and control flow. Plausible candidates for such paradigms include structured imperative concurrent programming, stream- based programming, concurrent functions with asynchronous message passing, higher-order types for events, and the use of types for communications and data structures, to name but a few. Combinations of these abstractions will be used even in a single application, and the runtime environment needs to ensure seamless execution without relying on differences in available resources such as the number of cores. The development of effective programming methodologies for the coming computing paradigm demands exploration and understanding of a wide variety of ideas and techniques. This workshop aims to offer a forum where researchers from different fields exchange new ideas on one of the central challenges for programming in the near future, the development of programming methodologies and infrastructures where concurrency and distribution are the norm rather than a marginal concern. With these backgrounds, PLACES'10 is held welcoming as an invited speaker William Cook from Texas Austin, and excellent contributions from researchers from divsese fields of programming studies. We cordially invite your participation in this workshop. We attach the basic information below. Very best wishes, Alan and Kohei Co-Chairs of PLACES'10 * Invited Speaker William Cook (University of Texas, Austin) * Programme Morning (a) Type Inference for Communications: 9:00-10:30 Alastair Donaldson, Daniel Kroening and Philipp Ruemmer. Analysing DMA Races in Multicore Software Lu?sa Louren?o and Luis Caires. Type Inference for Conversation Types Keigo Imai, Shoji Yuen and Kiyoshi Agusa. Session Type Inference in Haskell (b) Controlling Imperative Concurrency: 11:00-12:30 Prodromos Gerakios, Nikolaos Papaspyrou and Konstantinos Sagonas. A Type System for Unstructured Locking that Guarantees Deadlock Freedom without Imposing a Lock Ordering Francisco Martins, Vasco Vasconcelos and Tiago Cogumbreiro. An Investigation on Types for X10 Clocks Joana Campos and Vasco T. Vasconcelos. Channels as Objects in Concurrent Object-Oriented Programming Lunch 12:30-14:00 Afternoon: invited talk: 14:00-15:00 William Cook (c) Language and Runtime Design: 15:00-16:00 Nuno Alves, Raymond Hu, Nobuko Yoshida and Pierre-Malo Deni?lou. Secure Execution of Distributed Session Programs Julien Lange and Emilio Tuosto. A Modular Toolkit for Theories of Distributed Interactions Break 16:00-16:30 (d) Logical and Semantic Foundations of Distributed Programming: 16:30-17:30 Marco Carbone, Thomas Hildebrandt and Hugo A. Lopez. Towards a Modal Logic for the Global Calculus Thomas Hildebrandt and Raghava Rao Mukkamala. Distributed Dynamic Condition Response Structures * Further Information For information on PLACES'10, please see: http://places10.di.fc.ul.pt/ For information on ETAPS'10, please see: http://www.etaps10.cs.ucy.ac.cy/ [end] From lengrand at lix.polytechnique.fr Wed Mar 10 05:34:23 2010 From: lengrand at lix.polytechnique.fr (Stephane Lengrand (Work)) Date: Wed, 10 Mar 2010 11:34:23 +0100 Subject: [TYPES/announce] CfP: Proof-Search in Type Theories (PSTT'10) Message-ID: <4B9775AF.7080903@lix.polytechnique.fr> Call for Papers PSTT 2010: International Workshop on Proof Search in Type Theories Edinburgh, Scotland July 15, 2010 http://www.lix.polytechnique.fr/~lengrand/Events/PSTT10/ Affiliated with FLOC, Edinburgh, Scotland IMPORTANT DATES Title + short abstract submission: April 10 Paper / long abstract submission: April 15 Notification: April 30 Final papers due: May 15 Workshop: July 15 DESCRIPTION: The PSTT workshop resumes a series of workshops on Proof Search in Type Theoretic Languages, in light of the progress that has been made over the last decade in e.g. the development of proof assistants or our understanding of proof theory. The declarative approach to programming has evolved two paradigms that are based on different aspects of the theories of proofs and types: Proof normalisation provides a foundation for functional programming and type systems --on which numerous proof assistants are based, while proof search provides a foundation for logic programming and other areas of automated deduction. On the one hand, proof search mechanisms and their automation are decisive features of proof assitants that have much to gain from a proper understanding and formalisation. On the other hand, the framework of logic programming has also extended to more expressive logics and more complex data structures, e.g. with bindings. Better specifying the proof search mechanisms in type theories is thus a key concern that brings both approaches forward, and closer together. This concern involves a wide range of issues and techniques (some of which directly arising from implementation) that both approaches share --or could share, and that form the scope of this workshop. TOPICS: Papers are solicited on topics including, but not limited to: - proof search strategies and tactics, complexity & completeness, - tactics specification language, - properties of inference systems, invertibility, polarity of connectives, - focusing, normal forms for proofs, - proof-term representation, - meta-variables, representation of partial proofs, - searching for proofs by induction, search for invariants, - unification, - variable binding, scoping management and freshness - logic programming and other paradigms based on proof search, termination & computational expressivity, - deduction-modulo, deduction vs. computation during search, - using failure in proof search, - model checking as deduction, - user interaction and interfaces, - systems implementing any of the above. SUBMISSIONS: Authors can submit either detailed and technical accounts of new research or work in progress. System descriptions are also welcome, with a demonstration on the day of the workshop. Surveys and comparative papers are also strongly encouraged. Papers / long abstracts are to be submitted electronically and are subject to a 12-page limit in LNCS format, including bibliography. They can be shorter. Authors are required to submit a title and a short abstract a few days before submitting the paper (see the dates section). At least one author of an accepted paper is expected to present that paper at the workshop. Informal proceedings will be distributed at the workshop. The possibility of having a special issue dedicated to the themes of this workshop is under consideration. For further information and submission instructions, see the PSTT web page: http://www.lix.polytechnique.fr/~lengrand/Events/PSTT10/. PROGRAM COMMITTEE: Claudio Sacerdoti Coen (Universita di Bologna) Stephane Lengrand (CNRS, Ecole Polytechnique) Gopalan Nadathur (University of Minnesota) From miculan at dimi.uniud.it Wed Mar 10 08:16:03 2010 From: miculan at dimi.uniud.it (Marino Miculan) Date: Wed, 10 Mar 2010 14:16:03 +0100 Subject: [TYPES/announce] LFMTP 2010 at FLoC: Call for Papers Message-ID: 5th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'10) http://lfmtp10.dimi.uniud.it July 14, 2010, Edinburgh, Scotland, UK Part of the Federated Logic Conference Affiliated with Logic in Computer Science (LICS 2010) CALL FOR PAPERS Important dates: --------------------------------------------------------------------- Abstract submission: 18 April 2010 Paper submission: 25 April 2010 Author notification: 30 May 2010 Final version: 13 June 2010 Workshop day: 14 July 2010 --------------------------------------------------------------------- The LFMTP workshop continues the International workshop on Logical Frameworks and Meta-languages (LFM) and the MERLIN workshop on MEchanized Reasoning about Languages with variable BIndingIN. 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 on the one hand and their applications in for example proof-carrying code have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors, and practitioners to discuss all aspects of logical frameworks and variable binding. The broad subject areas of LFMTP are: * The automation and implementation of the meta-theory of programming languages and related calculi, particularly work which involves variable binding and fresh name generation. * The theoretical and practical issues concerning the encoding of variable binding and fresh name generation, especially the representation of, and reasoning about, datatypes defined from binding signatures. * Case studies of meta-programming, and the mechanization of the (meta)theory of descriptions of programming languages and other calculi. Papers focusing on logic translations and on experiences with encoding programming languages theory are particularly welcome. Topics include, but are not limited to * logical framework design * meta-theoretic analysis * 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 * formal digital libraries Program Committee: Stefan Berghofer (TU Munich) Yves Bertot (INRIA Sophia-Antipolis) Karl Crary (Carnegie Mellon University, PC co-chair) Amy Felty (University of Ottawa) Marino Miculan (University of Udine, PC co-chair) Benjamin Pierce (University of Pennsylvania) Andrew Pitts (Cambridge University) Carsten Sch?rmann (IT University of Copenhagen) Steering Committee: Andreas Abel (INRIA) Karl Crary (Carnegie Mellon University) Amy Felty (University of Ottawa) Marino Miculan (University of Udine) Michael Norrish (NICTA) Brigitte Pientka (McGill University) Carsten Sch?rmann (IT University of Copenhagen) Paper Submission Submission of papers is electronic. Authors must submit the paper through the EasyChair server, at http://www.easychair.org/conferences/?conf=lfmtp10. Authors are required to submit a paper title and a short abstract before submitting the paper (see im- portant dates aside). Accepted papers will be presented at the workshop and included in the preliminary proceedings, which will be made available in electronic form. After the workshop, authors of accepted papers will be invited to submit revised versions for inclusion in final post-proceedings, which will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS) http://eptcs.org. Papers are to be submitted in PDF format, should not exceed 15 pages including references, and must be prepared in LATEX using the EPTCS macro package (http://style.eptcs.org). For further information and submission instructions, see the LFMTP 2010 web page. The organizers: Karl Crary Marino Miculan School of Computer Science Dept. of Mathematics and Computer Science Carnegie Mellon University University of Udine crary at cs.cmu.edu miculan at dimi.uniud.it From herman at cs.ru.nl Wed Mar 10 11:49:15 2010 From: herman at cs.ru.nl (Herman Geuvers) Date: Wed, 10 Mar 2010 17:49:15 +0100 Subject: [TYPES/announce] Scientific Programmer Vacancy Message-ID: <4B97CD8B.9050400@cs.ru.nl> Scientific Programmer for the Intelligent Systems Section of ICIS (1,0 fte) *Faculty of Science* *Maximum Salary: ? 3,755 gross/month* *Vacancy number: 62.10.10* *Closing date: 15 March 2010* *Job description* The Intelligent Systems Section of the Institute for Computing and Information Sciences (ICIS) at Radboud University Nijmegen has a vacancy for a Scientific Programmer. The job consists of two aspects, each being roughly 0.5 FTE (more details below): 1. Computer support for the section staff and, together with scientific programmers from other sections, computer support for ICIS as a whole ("Computer Support). 2. Programming support for the Section?s scientific research projects, in particular for the projects of the Foundations Group (Research Support). Further particulars: The Intelligent Systems Section of ICIS concerns itself with making computer systems more 'intelligent'. Research at the Section pursues both the connectionist and the symbolic approach. The connectionist approach adheres to the statistical view on knowledge; our specific expertise lies in Bayesian methods and machine learning with main applications in bioinformatics and neuroscience. The symbolic approach adheres to the (formal) logical view on knowledge; the specific expertise of the Foundations Group lies in type theory and proof assistants with applications in software verification and formalization of mathematics. The Section has an excellent international reputation, which is supported by the latest national research assessment. Keywords: type theory, lambda calculus, term rewriting, reflection, proof assistants, formalizing mathematics, machine learning, bioinformatics. As a Scientific Programmer, you will contribute to the two aspects of the work performed at the Section as indicated above. Research Support. The Section has developed and continues to further develop various tools and systems: CoRN (the Constructive Repository of formalized mathematics in the proof assistant Coq at Nijmegen), ProofWeb (a web interface for the proof assistant Coq, to teach logic and formalizing mathematics) and MathWiki (a generic Wikipedia-like web portal for formalized mathematics). The section staff are users of the proof assistants Coq, Mizar and Hol-light. You will be expected to support and contribute to these projects. Prior experience with these systems would be advantageous. Computer Support. You will: - give advice on purchase and install new computer software and hardware; - support and maintain these systems; - keep close contacts with the faculty computer support department C&CZ; - maintain the web pages and information databases; - provide computer support for educational purposes. *Requirements* You should meet the following requirements: - a Bachelor's degree (or equivalent) in Computer Science, with an interest in functional programming and formal methods; - commitment and a cooperative attitude; - proficiency in written and spoken English. *Organization* Radboud University Nijmegen is one of the leading academic communities in the Netherlands. Renowned for its green leafy campus, modern buildings, and state-of-the-art equipment, it has nine faculties and over 17,500 students enrolled in approximately 90 study programmes. The university is situated in the oldest Dutch city, close to the German border, on the banks of the river Waal. The city has a rich history and one of the liveliest city centres in the Netherlands. Website: http://www.ru.nl/icis/ *Conditions of employment* Employment: 1,0 fte Maximum salary per month, based on a fulltime employment: ? 3,755 gross/month Salary scale: 10 *Additional conditions of employment* The appointment is initially for a period of one year, at the end of which your performance will be evaluated. If the evaluation is positive, you will be offered a contract for a permanent position. *Additional Information* Herman Geuvers Telephone: +31 24 3652603 E-mail: herman at cs.ru.nl *Application* You can apply for the job (mention the vacancy number 62.10.10) before *15 March 2010* by sending your application -preferably by email- to: RU Nijmegen, FNWI, P&O, mrs. D. Reinders P.O. Box 9010, 6500 GL Nijmegen, NL Telephone: +31 24 3652027 E-mail: pz at science.ru.nl -- Herman Geuvers Professor of Computer Science Intelligent Systems, iCIS Faculty of Science Radboud University Nijmegen, NL From cbraga at ic.uff.br Wed Mar 10 16:34:55 2010 From: cbraga at ic.uff.br (Christiano Braga) Date: Wed, 10 Mar 2010 18:34:55 -0300 Subject: [TYPES/announce] ICTAC'10: Deadline extension Message-ID: ********************************************************************* Call for Papers - ICTAC 2010 International Colloquium on Theoretical Aspects of Computing Natal, Rio Grande do Norte, Brazil 1-3 September, 2010 http://www.ictac.net/ictac2010 ********************************************************************** ********************************************************************** * News *************************************************************** ** ** DEADLINE EXTENSION: ** SUBMISSION OF ABSTRACTS: 22 MARCH, 2010 ** SUBMISSION OF PAPERS: 29 MARCH, 2010 ** ** Submission site now open: ** http://www.easychair.org/conferences/?conf=ictac2010 ** ** Authors of a selection of the accepted papers will be invited to ** submit an extended version of their papers to a special issue of ** Elsevier's journal Theoretical Computer Science. * ** LNCS proceedings confirmed. * ********************************************************************** Background and Objectives ICTAC is an International Colloquium on Theoretical Aspects of Computing created by the International Institute for Software Technology of the United Nations University (UNU-IIST). The aim of the colloquium is to bring together practitioners and researchers from academia, industry and government to present research results, and exchange experience, ideas and solutions for their problems in theoretical aspects of computing. Beyond these scholarly goals, another main purpose of the conference is to promote cooperation in research and education between participants and their institutions, from developing and industrial countries, as in the mandate of the United Nations University. The previous six ICTAC events were held in Guiyang, China (2004), Hanoi, Vietnam (2005), Tunis, Tunisia (2006), Macau (2007), Istanbul, Turkey (2008) and Kuala Lumpur, Malaysia (2009). ICTAC 2010 includes two special tracks: a track on Formal Approaches to Testing, chaired by Marie-Claude Gaudel, and a track on the Grand Challenge in Verified Software, chaired by Jim Woodcock. The topics of the conference include, but are not limited to: - automata theory and formal languages - principles and semantics of programming languages - logics and their applications - software architectures and their description languages - software specification, refinement, verification and testing, - model checking and theorem proving - formal techniques in software testing - models of object and component systems - coordination and feature interaction - integration of theories, formal methods and tools for engineering computing systems - service-oriented development - service-oriented architectures: models and development methods - document-driven development - models of concurrency, security, and mobility - theory of parallel, distributed, and grid computing - real-time, embedded and hybrid systems - type and category theory in computer science - case studies, theories, tools and experiments of verified systems - domain-specific modeling and technology: examples, frameworks and experience ICTAC 2010 will be held in Brazil, in the city of Natal, Rio Grande do Norte. It will be organized jointly with the 3rd edition of the Pernambuco School on Software Engineering, to be held in Recife, Pernambuco, on the the topic of Formal Component Based Development and Coordination. ICTAC 2010 will include tutorials and technical sessions. Sponsors and Organisation ICTAC 2010 will be organized jointly by the Federal University of Rio Grande do Norte and UNU-IIST. They are also sponsors of ICTAC 2010. Invited Speakers Paulo Borba (Universidade Federal de Pernambuco, Brazil) Wolfram Schulte (Microsoft Research) Submission and Publication Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Papers should be written in English and not exceed 15 pages in LNCS format (see www.springer.de/comp/lncs/authors.html for details).Papers should be submitted at www.easychair.org/conferences/?conf=ictac2010. All queries should be sent to: ictac2010 at iist.unu.edu. Important Dates Submission of abstracts: 22 March, 2010 Submission deadline: 29 March, 2010 Notification of acceptance: 14 May, 2010 Final version: 30 May, 2010 Steering Committee John Fitzgerald, UK Martin Leucker, Germany Zhiming Liu (Chair), Macao Tobias Nipkow, Germany Augusto Sampaio, Brazil Natarajan Shankar, USA Jim Woodcock, UK Special Tracks Chairs Marie-Claude Gaudel, France Jim Woodcock, UK Program Committee Bernhard Aichernig, Austria Keijiro Araki, Japan Jonathan Bowen, UK Christiano Braga, Brazil Michael Butler, UK Andrew Butterfield, Ireland Ana Cavalcanti, UK (chair) Antonio Cerone, Macao Jim Davies, UK David Deharbe, Brazil (chair) John Fitzgerald, UK Wan Fokkink, Netherlands Pascal Fontaine, France Marcelo Frias, Argentina Lindsay Groves, New Zealand Michael Hansen, Denmark Robert Hierons, UK Monzoo Kim, South Korea Maciej Koutny, UK Pascale Le Gall, France Martin Leucker, Germany Zhiming Liu, Macao Patricia Machado, Brazil Marius Minea, Romania Ali Mili, USA Michael Mislove, USA Tobias Nipkow, Germany Jose Nuno Oliveira, Portugal Paritosh Pandya, India Alberto Pardo, Uruguay Anders P Ravn, Denmark Leila Ribeiro, Brazil Markus Roggenbach, UK Augusto Sampaio, Brazil Bernhard Schaetz, Germany Gerhard Schellhorn, Germany Emil Sekerinski, Canada Natarajan Shankar, USA Marjan Sirjani, Iran Jin Song Dong, Singapore Dang Van Hung, Vietnam Daniel Varro, Hungary Helmut Veith, Germany Ji Wang, China Martin Wirsing, Germany Burkhart Wolff, France Husnu Yenigun, Turkey Naijun Zhan, China Organising Committee David Deharbe, Brazil Anamaria Moreira, Brazil Martin Musicante, Brazil Marcel Oliveira, Brazil Bartira Rocha, Brazil From miculan at dimi.uniud.it Thu Mar 11 03:44:31 2010 From: miculan at dimi.uniud.it (Marino Miculan) Date: Thu, 11 Mar 2010 09:44:31 +0100 Subject: [TYPES/announce] LFMTP 2010 at FLoC: Call for Papers (CORRECT DATES) Message-ID: <5083E754-253F-4D2F-AAC5-DCB4540D025A@dimi.uniud.it> Apologies for the duplication, but the CFP circulated before contained wrong dates. New and corrected date are below. ======================================= 5th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'10) http://lfmtp10.dimi.uniud.it July 14, 2010, Edinburgh, Scotland, UK Part of the Federated Logic Conference Affiliated with Logic in Computer Science (LICS 2010) CALL FOR PAPERS Important dates (NEW): --------------------------------------------------------------------- Abstract submission: April 1, 2010 Submission deadline: April 4, 2010 Author notification: May 1, 2010 Pre-proceedings versions due: May 14, 2010 Workshop: July 14, 2010 --------------------------------------------------------------------- The LFMTP workshop continues the International workshop on Logical Frameworks and Meta-languages (LFM) and the MERLIN workshop on MEchanized Reasoning about Languages with variable BIndingIN. 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 on the one hand and their applications in for example proof-carrying code have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors, and practitioners to discuss all aspects of logical frameworks and variable binding. The broad subject areas of LFMTP are: * The automation and implementation of the meta-theory of programming languages and related calculi, particularly work which involves variable binding and fresh name generation. * The theoretical and practical issues concerning the encoding of variable binding and fresh name generation, especially the representation of, and reasoning about, datatypes defined from binding signatures. * Case studies of meta-programming, and the mechanization of the (meta)theory of descriptions of programming languages and other calculi. Papers focusing on logic translations and on experiences with encoding programming languages theory are particularly welcome. Topics include, but are not limited to * logical framework design * meta-theoretic analysis * 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 * formal digital libraries Program Committee: Stefan Berghofer (TU Munich) Yves Bertot (INRIA Sophia-Antipolis) Karl Crary (Carnegie Mellon University, PC co-chair) Amy Felty (University of Ottawa) Marino Miculan (University of Udine, PC co-chair) Benjamin Pierce (University of Pennsylvania) Andrew Pitts (Cambridge University) Carsten Sch?rmann (IT University of Copenhagen) Steering Committee: Andreas Abel (INRIA) Karl Crary (Carnegie Mellon University) Amy Felty (University of Ottawa) Marino Miculan (University of Udine) Michael Norrish (NICTA) Brigitte Pientka (McGill University) Carsten Sch?rmann (IT University of Copenhagen) Paper Submission Submission of papers is electronic. Authors must submit the paper through the EasyChair server, at http://www.easychair.org/conferences/?conf=lfmtp10. Authors are required to submit a paper title and a short abstract before submitting the paper (see im- portant dates aside). Accepted papers will be presented at the workshop and included in the preliminary proceedings, which will be made available in electronic form. After the workshop, authors of accepted papers will be invited to submit revised versions for inclusion in final post-proceedings, which will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS) http://eptcs.org. Papers are to be submitted in PDF format, should not exceed 15 pages including references, and must be prepared in LATEX using the EPTCS macro package (http://style.eptcs.org). For further information and submission instructions, see the LFMTP 2010 web page. The organizers: Karl Crary Marino Miculan School of Computer Science Dept. of Mathematics and Computer Science Carnegie Mellon University University of Udine crary at cs.cmu.edu miculan at dimi.uniud.it From Paul-Andre.Mellies at pps.jussieu.fr Thu Mar 11 12:59:20 2010 From: Paul-Andre.Mellies at pps.jussieu.fr (Paul-Andre Mellies) Date: Thu, 11 Mar 2010 18:59:20 +0100 (CET) Subject: [TYPES/announce] LOLA 2010 -- call for contributed talks Message-ID: ============================================================ *** CALL FOR CONTRIBUTED TALKS *** LOLA 2010 Syntax and Semantics of Low Level Languages Friday 9th July 2010, Edinburgh, UK A LICS 2010-affiliated workshop at FLoC 2010 http://lola.pps.jussieu.fr/ ============================================================ IMPORTANT DATES Submission deadline Monday 26th April 2010 Author notification Friday 14th May 2010 Workshop Friday 9th July 2010 SUBMISSION LINK The submissions will be made by easychair at http://www.easychair.org/conferences/?conf=lola2010 DESCRIPTION OF THE WORKSHOP It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in the various aspects of the relationship between logic and low level languages and programs. Topics of interest include, but are not limited to: - Typed assembly languages - Certified compilation - Proof-carrying code - Program optimization - Modal logic and realizability in machine code - Realizability and double orthogonality in assembly code, - Implicit complexity, sublinear programming and Turing machines - Parametricity, modules and existential types - General references, Kripke models and recursive types - Closures and explicit substitutions - Linear logic and separation logic - Game semantics, abstract machines and hardware synthesis - Monoidal and premonoidal categories, traces and effects PROGRAMME COMMITTEE * Amal Ahmed (Indiana University) * Nick Benton (MSR Cambridge, co-chair) * Lars Birkedal (IT University of Copenhagen) * Dan Ghica (University of Birmingham) * Paul-Andre Mellies (CNRS & University Paris Diderot, co-chair) * Fran?ois Pottier (INRIA Rocquencourt) * Ulrich Schoepp (LMU Munich) * Hayo Thielecke (University of Birmingham) SUBMISSION INSTRUCTIONS LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger programmes, position presentations and short tutorials as well as more traditional research talks describing new results. The programme committee will select the workshop presentations from submitted proposals, which may take the form either of a short abstract or of a longer (published or unpublished) paper describing completed work. The submissions should be made by easychair at http://www.easychair.org/conferences/?conf=lola2010 INVITED SPEAKERS To be announced soon. From gerwin.klein at nicta.com.au Fri Mar 12 02:44:02 2010 From: gerwin.klein at nicta.com.au (Gerwin Klein) Date: Fri, 12 Mar 2010 18:44:02 +1100 Subject: [TYPES/announce] CFP: SSV'10 @ USENIX OSDI 2010 Message-ID: Call for Papers 5th International Workshop on Systems Software Verification (SSV'10) Real Software, Real Problems, Real Solutions October 6-7, Vancouver, Canada co-located with OSDI'10 http://usenix.org/events/ssv10/ Industrial-strength software analysis and verification has advanced in recent years through the introduction of model checking, automated and interactive theorem proving, static analysis techniques, as well as correctness by design, correctness by contract, and model-driven development. However, many techniques are working under restrictive assumptions which are invalidated by complex embedded systems software such as operating system kernels, low-level device drivers or microcontroller code. The aim of this workshop is to bring together researchers and developers from both academia and industry, who are facing real software and real problems to find real, applicable solutions. By "real" we mean problems such as time-to-market or reliability that the industry is facing. A real solution is one that is applicable to the problem in industry and not one that only applies to an abstract, academic toy version of it. This forum discusses software analysis and development techniques and tools; it will serves as a platform to discuss open problems and future challenges in dealing with existing and upcoming systems level code. Topics include (but are not limited to): * model checking * automated and interactive theorem proving * static analysis * automated testing * model-driven development * embedded systems development * programming languages * verifying compilers * software certification * software tools * experience reports Interested speakers should submit their paper (at most 9 pages, 8.5" x 11", including figures, tables, and references, formatted in two columns, using 10 point type on 12 point (single-spaced) leading, with the text block being no more than 6.5" wide by 9" deep) to https://papers.usenix.org/hotcrp/ssv10/ by June 4th 2010 Samoan time. All papers will be subject to peer review under conference standards. Experience reports and papers on work in progress are welcome as long as there is a clear contribution. Accepted submissions are planned to be published online by USENIX. Submissions must be in pdf format and follow the USENIX style instructions above. Important dates 28.05.2010 Abstract Deadline 04.06.2010 Submission Deadline 20.07.2010 Notification of accepted papers 20.08.2010 Final version 06.10.2010 Workshop The workshop is organized as a 1.5-day workshop (Oct 6-7, 2010). Location The workshop will be held in Vancouver, Canada, co-located with OSDI'10. Program Chair Ralf Huuck (NICTA & UNSW, Australia) Gerwin Klein (NICTA & UNSW, Australia) Bastian Schlich (ABB Corporate Research, Germany) Program Committee Adam Chlipala (Harvard University, USA) Dino Distefano (Queen Mary University London, UK) Klaus Havelund (Jet Propulsion Laboratory, USA) Chris Hawblitzel (Microsoft Research, USA) Andy King (University of Kent, UK) Stefan Kowalewski (RWTH Aachen University, Germany) Kim Larsen (Aalborg University, Denmark) John Matthews (Galois Inc, USA) Thomas Noll (RWTH Aachen University, Germany) Wolfgang Paul (University of Saarbruecken, Germany) Jan Peleska (University of Bremen, Germany) John Regehr (University of Utah, USA) Wolfram Schulte (Microsoft Research, USA) Zhong Shao (Yale University, USA) Junfeng Yang (Columbia, USA) Kwangkeun Yi (Seoul National University, South Korea) We thank our sponsors NICTA and Microsoft Research for their support. From rlc3 at mcs.le.ac.uk Fri Mar 12 03:50:28 2010 From: rlc3 at mcs.le.ac.uk (Roy Crole) Date: Fri, 12 Mar 2010 08:50:28 +0000 Subject: [TYPES/announce] LECTURESHIPS IN (THEORETICAL) COMPUTER SCIENCE Message-ID: <4B9A0054.6010000@mcs.le.ac.uk> Dear Colleagues, I would be grateful if you could forward the lectureship advertisement below around your Department and to interested colleagues. Best Regards, Roy Crole. ======= * Lecturer in Computer Science (3 Posts) * * Department of Computer Science* * * *University of Leicester* * * *http://www.cs.le.ac.uk/* * * Salary Grade 8 - ?35,646 to ?43,840 pa Ref: SEN00056 The University of Leicester has an international reputation for its research and teaching. In order to build further on the recent successes of the Department of Computer Science, the University is making a strategic investment by creating three new lectureships in computer science. The successful candidates will have a strong research record, with a background in the theoretical foundations of computer science, and will be able to contribute to undergraduate and postgraduate teaching and supervision of mainstream projects in a broad range of topics. We are keen to make appointments that will contribute to our research excellence in either the foundations of computational models, processes or structures, or the way they support the engineering of software-intensive systems, including socio-technical systems. Ability to teach software re-engineering, software measurement and quality, or web technologies would be desirable. Ability to attract funding or engage with industry are other aspects that we will rate very highly. *Important dates* Closing date for applications: April 9th Invitations for the interview: after April 19th Interview: May 17th, 18th and 19th Start date: September 1st (or as close as possible) *Other information* A lecturer position in the UK is similar to an assistant professorship in the North-American system. Informal enquiries are welcome and should be made to Jos? Fiadeiro on jose at mcs.le.ac.uk For further information and to apply on-line, please visit our website: http://www2.le.ac.uk/jobs Candidates short-listed for interview will be contacted by the University. If you do not receive a communication from the University within 4 weeks of the closing date, please assume that your application has been unsuccessful. * * * * From prakash at cs.mcgill.ca Fri Mar 12 09:41:49 2010 From: prakash at cs.mcgill.ca (Prakash Panangaden) Date: Fri, 12 Mar 2010 09:41:49 -0500 Subject: [TYPES/announce] Call for Papers DCM 2010 Message-ID: <4B9A52AD.3010409@cs.mcgill.ca> ========================================================================= Second Call for Papers DCM 2010 6th International Workshop on Developments in Computational Models ** Causality, Computation, and Physics ** http://www.amsta.leeds.ac.uk/~pmt6sbc/DCM10/ Edinburgh, Scotland 9-10 July 2010 Deadline for extended abstracts: 01 April, 2010 A satellite event of FLoC - http://www.floc-conference.org/ ========================================================================= DCM 2010 is the sixth in a series of international workshops focusing on new computational models. It aims to bring together researchers who are currently developing new computational models or new features of a traditional one. And to foster interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. DCM 2010 will be a two-day satellite event of FLoC 2010, with a special focus on the theme 'Causality, Computation, and Physics'. Day 2 of the Workshop will have an emphasis on quantum computation and physics, held as Quantum Information Science Scotland (QUISCO), and is co-sponsored by Scottish Universities Physics Alliance (SUPA) and Scottish Informatics and Computer Science Alliance (SICSA). Topics of interest include all abstract models of computation and their properties, and their applications to the development of programming languages and systems: - quantum computation, including implementations and formal methods in quantum protocols; - probabilistic computation and verification in modelling situations; - chemical, biological and bio-inspired computation, including spatial models, self-assembly, growth models; - general concurrent models including the treatment of mobility, trust, and security; - information-theoretic ideas in computing. PLEASE SUBMIT an extended abstract (of around 12 pages or less) in PDF format to the conference EasyChair submission page: https://www.easychair.org/login.cgi?conf=dcm2010 by the deadline: 01 April, 2010. Accepted contributions will appear in a pre-proceedings special issue of the EPTCS (Electronic Proceedings in Theoretical Computer Science). After the workshop, full versions of selected papers will be invited for a special issue of the internationally leading journal Mathematical Structures in Computer Science (MSCS). IMPORTANT DATES: Submission deadline for extended abstracts: 01 April, 2010 Notification: 26 April Workshop: 9-10 July, 2010 CONFIRMED INVITED SPEAKERS: Cristian Calude (Auckland, New Zealand) Russ Harmer (Paris/Harvard) Gordon Plotkin (Edinburgh) Vlatko Vedral (Oxford) PROGRAMME COMMITTEE: S Barry Cooper (Leeds, Co-chair) Prakash Panangaden (McGill, Co-chair) Elham Kashefi (Edinburgh, Chair QUISCO 2010) Paola Bonizzoni (Milan) Olivier Bournez (Paris) Vincent Danos (Edinburgh, CNRS) Mariangiola Dezani (Torino) Andreas Doering (Oxford) Maribel FernC!ndez (London) Joseph Fitzsimons (Oxford) Ivette Fuentes-Schuller (Nottingham) Simon Gay (Glasgow) Jean Krivine (Paris) Ian Mackie (Ecole Polytechnique) Damian Markham (Paris) Daniel Oi (Strathclyde) Simon Perdrix (Edinburgh and Paris) Susan Stepney (York) John Tucker (Swansea) ========================================================================= Further information: Barry Cooper, pmt6sbc at leeds.ac.uk, Prakash Panangaden prakash at cs.mcgill.ca ========================================================================= From quaglia at disi.unitn.it Fri Mar 12 14:45:30 2010 From: quaglia at disi.unitn.it (Paola Quaglia) Date: Fri, 12 Mar 2010 20:45:30 +0100 Subject: [TYPES/announce] CMSB 2010 - Second Call For Papers Message-ID: <201003121945.o2CJjGjd022570@disi.unitn.it> _Apologies for multiple posting_ (NEW: submission guidelines) ================================================================ Second call for papers CMSB 2010 (8th Conference on Computational Methods in Systems Biology) in cooperation with ACM September 29 - October 1, 2010 Trento, Italy http://www.cosbi.eu/cmsb2010/ ================================================================ The CMSB series solicits innovative research focussing on the dynamics and on the analysis of biological systems, networks, and data. The Conference brings together computer scientists, biologists, mathematicians, engineers, and physicists interested in a system-level understanding of biological systems. CMSB 2010 invites submissions of both papers and posters covering a broad range of research in systems biology. Topics of interest include, but are not limited to: original models or paradigms for modelling biological processes together with their application domains; frameworks and techniques for verifying, validating, analyzing, and simulating biological systems; inference from high-throughput experimental data; model integration from biological databases. Contributions on modelling and analysis of relevant biological case studies are especially encouraged. PROGRAMME COMMITTEE: Erik de Vink - Technische Universiteit Eindhoven, NL Pierpaolo Degano - University of Pisa, Italy Diego Di Bernardo - TIGEM and University of Naples "Federico II", Italy Finn Drabl?s - Norwegian University of Science and Technology, Norway Fran?ois Fages - INRIA Rocquencourt, France Jasmin Fisher - Microsoft Research Cambridge, UK John Heath - University of Birmingham, UK Monika Heiner - TU Cottbus, Germany Ina Koch - Max Planck Institute for Molecular Genetics, Germany Marta Z. Kwiatkowska - Oxford University, UK Christopher Langmead - Carnegie Mellon University, USA Hiroshi Mamitsuka - Kyoto University, Japan Flemming Nielson - Technical University of Denmark, Lyngby, Denmark Ion Petre - ?bo Akademi University, Finland Gordon Plotkin - University of Edinburgh, UK Alberto Policriti - University of Udine, Italy Paola Quaglia (Chair) - CoSBi and University of Trento, Italy Scott A. Smolka - SUNY at Stony Brook, USA Adelinde M. Uhrmacher - University of Rostock, Germany Verena Wolf - Saarland University, Germany STEERING COMMITTEE: Finn Drabl?s - Norwegian University of Science and Technology, Norway Fran?ois Fages - INRIA Rocquencourt, France David Harel - Weizmann Institute of Science, Israel Monika Heiner - TU Cottbus, Germany Michael H?rnquist - Link?ping University, Sweden Satoru Miyano - University of Tokyo, Japan Gordon Plotkin - University of Edinburgh, UK Corrado Priami - CoSBi and University of Trento, Italy Adelinde M. Uhrmacher - University of Rostock, Germany IMPORTANT DATES: Abstract submission: April 25, 2010 Paper submission: May 02, 2010 Notification of paper acceptance: June 16, 2010 Poster submission: June 23, 2010 Notification of poster acceptance: July 07, 2010 Camera ready version of papers: July 07, 2010 SUBMISSION GUIDELINES: Paper submission: CMSB solicits the submission of papers describing original research not published nor currently under review for another conference or journal. Authors will have to submit their papers via EasyChair (https://www.easychair.org/login.cgi?conf=cmsb2010). All papers will be refereed by the Programme Committee. Submission implies the willingness of at least one of the authors to present the work described in the accepted paper at the conference. Papers should be in the standard two-column ACM conference format, and should not exceed 10 pages. Templates for the ACM style, as well as detailed guidelines for using them, can be found at http://www.acm.org/sigs/publications/proceedings-templates. Proceedings will be published in the ACM Digital Library, which requires a copyright transfer from the authors of accepted papers to ACM after the ACM copyright policy (http://www.acm.org/publications/policies/copyright_policy). Print-outs of the proceedings will be available at the conference. The templates for ACM conference style provide space for ACM Computing Classification categories and terms (see http://www.acm.org/about/class/1998). This indexing is not required of submissions. Accepted authors will receive suggestions and guidelines on categories and terms. Poster submission: To be announced at a later stage. AWARD: CMSB 2010 is organized by The Microsoft Research - University of Trento Centre for Computational and Systems Biology (CoSBi) that offers a 4000 EUR award to the best paper reporting on BlenX-based research results, and authored by people not affiliated with CoSBi. The award will be presented only if there are at least three competing eligible papers, and will be judged by the Programme Committee. From nswamy at microsoft.com Sat Mar 13 16:40:44 2010 From: nswamy at microsoft.com (Nikhil Swamy) Date: Sat, 13 Mar 2010 21:40:44 +0000 Subject: [TYPES/announce] Formal Techniques for Java-like Program (FTFJP) 2010 --- Call for Papers Message-ID: <095FBE2C2209B74DA465AC5C2815740724CBBC91@TK5EX14MBXC103.redmond.corp.microsoft.com> CALL FOR PAPERS 12th Workshop on Formal Techniques for Java-like Programs Co-located with ECOOP 2010 June, Maribor (Slovenia) URL: http://distrinet.cs.kuleuven.be/events/ftfjp10/ Overview Formal techniques can help analyze programs, precisely describe program behavior, and verify program properties. Newer languages such as Java and C# provide good platforms to bridge the gap between formal techniques and practical program development, because of their reasonably clear semantics and standardized libraries. Moreover, these languages are interesting targets for formal techniques, because the novel paradigm for program deployment introduced with Java, with its improved portability and mobility, opens up new possibilities for abuse and causes concern about security. Work on formal techniques and tools for programs and work on the formal underpinnings of programming languages themselves naturally complement each other. This workshop aims to bring together people working in both these fields, on topics such as: - formal techniques for Java, C#, Scala or similar languages - specification techniques and interface specification languages - specification of software components and library packages - automated checking and verification of program properties, - verification logics, - language semantics, - type systems, - dynamic linking and loading, - security. Call for contributions Contributions (of up to 6 pages in the ACM 2-column style) are sought on open questions, new developments, or interesting new applications of formal techniques in the context of Java or similar languages. Contributions should not merely present completely finished work, but also raise challenging open problems or propose speculative new approaches. We particularly welcome contributions that simply suggest good topics for discussion at the workshop, or raise issues that you feel deserve the attention of the research community. Contributions will be formally reviewed, for originality, relevance, and the potential to generate interesting discussions. The workshop is intended for around 25 participants. The workshop will be organized into four or more sessions, each focused on a specific topic, and initiated by a presentation of few related position papers by the respective participants, or the introduction of the specific topic by a single speaker, and followed by discussions. Depending on the nature of the contributions, we may be organising a special journal issue as a follow-up to the workshop, as has been done for some of the previous FTfJP workshops. Contributions must be in English, in pdf format, and are limited to 6 pages in ACM 2-column style. Papers must be submitted electronically via Easy Chair. A plain-text ASCII abstract must be submitted one week before the paper submission deadline. Submission site: http://www.easychair.org/conferences/?conf=ftfjp12 A PC member, other than the chair, may be an author or co-author on any paper under consideration but will be excluded from any evaluation or discussion of the paper, and will get access to reviews of the paper(s) only in the same manner and time as other authors. The ECOOP organisation is negotiating with the ACM for workshop proceedings to appear in ACM Digital Library. Important dates abstract submission: April 12, 2010 full paper submission: April 19, 2010 notification: May 5, 2010 workshop: June 21 or 22, 2010 Program Committee Bernhard Beckert, Karlsruhe Institute of Technology, Germany Lars Birkedal IT University of Copenhagen, Denmark Dino Distefano, Queen Mary University of London, UK Cl?ment Hurlin, INRIA Bordeaux, France Bart Jacobs, Katholieke Universiteit Leuven, Belgium (co-chair) Adriaan Moors, EPFL Lausanne, Switzerland Peter M?ller, ETH Zurich, Switzerland Frank Piessens Katholieke, Universiteit Leuven, Belgium (chair) Erik Poll, Radboud University Nijmegen, The Netherlands Robby, Kansas State University, US Wolfram Schulte, Microsoft Research, US Isabelle Simplot-Ryl, INRIA Lille, France Jan Smans, Katholieke Universiteit Leuven, Belgium Nikhil Swamy, Microsoft Research, US Viktor Vafeiadis, University of Cambridge, UK Organization Sophia Drossopoulou, Imperial College, London, Great Britain Susan Eisenbach, Imperial College, London, Great Britain Bart Jacobs, Katholieke Universiteit Leuven, Belgium (co-chair) Gary T. Leavens, University of Central Florida, Orlando, US Peter M?ller, ETH Zurich, Switzerland Frank Piessens, Katholieke Universiteit Leuven, Belgium (chair) Arnd Poetzsch-Heffter, Universit?t Kaiserlautern, Germany Erik Poll, Radboud University Nijmegen, The Netherlands -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100313/e759f5d7/attachment-0001.htm From kutsia at risc.uni-linz.ac.at Mon Mar 15 19:57:55 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Tue, 16 Mar 2010 00:57:55 +0100 Subject: [TYPES/announce] Deadline extension: PPDP'10 Message-ID: <4B9EC983.5020400@risc.uni-linz.ac.at> ====================================================================== PPDP 2010 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming Hagenberg, Austria, 26-28 July 2010 (co-located with LOPSTR 2010) http://www.risc.uni-linz.ac.at/conferences/ppdp2010/ ====================================================================== EXTENDED DEADLINES ----------------- Abstract submission: 21 March, 2010 Full paper: 25 March, 2010 ===================================================================== PPDP 2010 aims to bring together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, AI languages and knowledge representation languages used, for example, in the semantic web. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analysing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. The conference will take place in July 2010 in the Castle of Hagenberg, Austria, colocated with the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2010), organised by the Research Institute for Symbolic Computation (RISC) of the Johannes Kepler University Linz. Topics: * Logic, Constraint, and Functional Programming * Database, AI and Knowledge Representation Languages * Visual Programming * Executable Specification Languages * Applications of Declarative Programming * Methodologies: 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 * Programming Environments The list above is not exhaustive - submissions describing new and interesting ideas relating broadly to declarative programming are encouraged. Submission guidelines: Papers should be submitted via the Easychair submission website for PPDP 2010: http://www.easychair.org/conferences/?conf=ppdp2010 Papers should consist of the equivalent of 12 pages under the ACM formatting guidelines. These guidelines are available online, along with formatting templates or style files. 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. No simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Proceedings: The proceedings will be published by ACM Press. Authors of accepted papers will be required to sign a copyright form. Camera ready papers for accepted papers should be prepared and submitted according to the final instructions that will be sent by the publisher after notification of acceptance. Invited Speakers: Maria Paola Bonacina (Universit? degli Studi di Verona, Italy) Sumit Gulwani (Microsoft Research) Important Dates: # Submission: title and abstract: 21 March 2010 (extended) full paper: 25 March 2010 (extended) # Notification: 23 April 2010 # Final version: 12 May 2010 # Symposium: 26-28 July 2010 Programme Committee: Elvira Albert (Spain) Sergio Antoy (US) Frederic Blanqui (China) Michele Bugliesi (Italy) Giuseppe Castagna (France) Mariangiola Dezani (Italy) Francois Fages (France) Maribel Fernandez (UK), chair Joxan Jaffar (Singapore) Andy King (UK) Temur Kutsia (Austria) Francisco Lopez Fraguas (Spain) Ian Mackie (France) Henrik Nilsson (UK) Albert Rubio (Spain) Kazunori Ueda (Japan) Philip Wadler (UK) Symposium Chairs: Temur Kutsia and Wolfgang Schreiner (Austria) For more information, please contact the chairs: Maribel Fernandez King's College London, UK Email: Maribel.Fernandez at kcl.ac.uk Temur Kutsia and Wolfgang Schreiner Research Institute for Symbolic Computation Johannes Kepler University Linz Email: kutsia at risc.uni-linz.ac.at From mjas at imm.dtu.dk Tue Mar 16 09:49:22 2010 From: mjas at imm.dtu.dk (Michael Smith) Date: Tue, 16 Mar 2010 14:49:22 +0100 Subject: [TYPES/announce] Call for Posters: MLQA 2010 - Models and Logics for Quantitative Analysis Message-ID: Second Annual Meeting of the ERCIM Working Group on Models and Logics for Quantitative Analysis (MLQA 2010) http://wiki.ercim.eu/wg/MLQA/index.php/July_2010:_MLQA_meeting_at_FLoC_2010%2C_Edinburgh July 9th, 2010, Edinburgh, Scotland, UK Part of the Federated Logic Conference (FLoC 2010) Affiliated with Logic in Computer Science (LICS 2010) CALL FOR POSTERS Important dates: ----------------------------------------------------- Abstract submission: June 18th, 2010 Submission deadline: June 25th, 2010 Author notification: June 28th, 2010 Meeting: July 9th, 2010 ----------------------------------------------------- We invite posters under two categories: - Presentation of recent or on-going work relating to models, logics, tools, and/or applications with respect to discrete, stochastic and/or continuous systems and properties. - Overview of the recent research activities of a group, in relation to the themes of MLQA. We equally encourage submissions from both research leaders, and junior researchers and PhD students. Posters should be readable in size A3, and should be submitted in pdf format to mlqa at imm.dtu.dk. Notification of your intention to submit, along with a title and short description of the poster, should be sent by June 18th. We require that we receive the final poster no later than June 25th, in order to arrange their printing before the meeting. -- Flemming Nielson (acting chairman of MLQA) Michael Smith, Nataliya Skrupnyuk (poster session organisers) http://wiki.ercim.eu/wg/MLQA From troina at di.unito.it Tue Mar 16 10:14:23 2010 From: troina at di.unito.it (Angelo Troina) Date: Tue, 16 Mar 2010 15:14:23 +0100 Subject: [TYPES/announce] CS2Bio'10 - Final Call for Papers (Submission deadline extended) In-Reply-To: <035E6D3B-9859-4754-9F63-A4D33AA9590C@di.unito.it> References: <035E6D3B-9859-4754-9F63-A4D33AA9590C@di.unito.it> Message-ID: <4B9F923F.7010109@di.unito.it> ====================================================================== Final call for papers CS2Bio'10 1st International Workshop on Interactions between Computer Science and Biology Affiliated to DisCoTec'10 10th of June 2010 Amsterdam, Netherlands http://cs2bio10.di.unito.it/ ====================================================================== Systems Biology is a stimulating field of application for computer scientists and a promising resource for biologists. The scope of this workshop is to gather researchers in formal methods that are interested at the convergence between Computer Science with Biology and life sciences. In particular, we solicit contribution of original results that address on both theoretical (modelling, analysis, and validation techniques) and applied aspects of biological behaviour: from the representation of biological scenarios to the validation and testing of relevant biological properties and the related simulations and development tools. *** SCOPE *** The scope is to include theoretical and applied aspects of concurrent and distributed systems in the modelling, analysis, simulation and validation of biological properties. The workshop intends to attract researchers interested in models, verification, tools, and programming primitives concerning such complex interactions. We strongly encourage the submission of works carried on in collaboration between computer scientists and biologists. Topics of interest include, but shall not be limited to: Formal Biological Modelling: - Formal methods for the representation of biological systems (rewrite systems, process calculi, graph grammars, hybrid systems, etc.); - Theoretical links and comparisons between different formal models for the modelling of biological processes; - Quantitative (probabilistic, timed, stochastic, etc.) languages and calculi; - Spatial (geometrical, topological) languages and calculi. Formal Testing and Validation of Biological Properties: - Prediction of biological behaviour from incomplete information; - Model Checking, Abstract Interpretation, Type Systems, etc. Tools and Simulations: - Modelling, analysis and simulation tools for systems biology; - Emergence of properties in complex biological systems; - Tools for parallel, distributed, and multi-resolution simulation methods; - Detailed biological case-studies. *** INVITED SPEAKERS *** - Luca Cardelli (Microsoft Research - Cambridge, UK) - J?r?me Feret (INRIA and ?cole Normale Sup?rieure - Paris, France) *** SUBMISSION GUIDELINES *** Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Authors should submit their papers via EasyChair (http://www.easychair.org/conferences/?conf=cs2bio10). Papers should take the form of a pdf file in ENTCS style and should not exceed 12 pages. If necessary, detailed proofs or other additional material can be added in an appendix (referees might review it at their discretion). We also encourage the submission of short papers, limited to 7 pages, presenting new tools or platforms for the modelling of biological systems. *** DISSEMINATION *** The post-proceedings of the workshop will be published in a volume of the Electronic Notes on Theoretical Computer Science series (Elsevier ENTCS). The quality of the received papers permitting, publication in a special issue of Mathematical Structures in Computer Science, with a second round of reviews, is planned. *** IMPORTANT DATES *** - Submission deadline: 30 March 2010 - Reviews due: 30 April 2010 - Notification to authors: 06 May 2010 - Workshop: 10 June 2010 *** PROGRAM COMMITTEE *** - Luca Cardelli - Gabriel Ciobanu - Mario Coppo - Ferruccio Damiani - Vincent Danos - Erik de Vink - Mariangiola Dezani - Fran?ois Fages - J?r?me Feret - Walter Fontana - Russ Harmer - Jane Hillston - Jean Krivine (Co-chair) - Giancarlo Mauri - Emanuela Merelli - Paolo Milazzo - Gethin Norman - Ion Petre - Angelo Troina (Co-chair) - Verena Wolf - Gianluigi Zavattaro From Ralf.Gerstner at springer.com Tue Mar 16 12:41:07 2010 From: Ralf.Gerstner at springer.com (Gerstner, Ralf, Springer DE) Date: Tue, 16 Mar 2010 17:41:07 +0100 Subject: [TYPES/announce] New Book on "Parallel Programming" Message-ID: <5263A5E88D701F4883EEC88B0BA37810B9B0DA@SEDEHETI0035.springer-sbm.com> Rauber, Thomas; R?nger, Gudula Parallel Programming for Multicore and Cluster Systems 1st Edition., 2010, X, 450 p., Hardcover ISBN: 978-3-642-04817-3 Features and Benefits: + Broad coverage of all aspects of parallel programming + Special emphasis on runtime efficiency and memory organization + Presented material has been used in courses for many years + Complemented by many examples and an additional website with teaching material Innovations in hardware architecture, like hyper-threading or multicore processors, mean that parallel computing resources are available for inexpensive desktop computers. In only a few years, many standard software products will be based on concepts of parallel programming implemented on such hardware, and the range of applications will be much broader than that of scientific computing, up to now the main application area for parallel computing. Rauber and R?nger take up these recent developments in processor architecture by giving detailed descriptions of parallel programming techniques that are necessary for developing efficient programs for multicore processors as well as for parallel cluster systems and supercomputers. Their book is structured in three main parts, covering all areas of parallel computing: the architecture of parallel systems, parallel programming models and environments, and the implementation of efficient application algorithms. The emphasis lies on parallel programming techniques needed for different architectures. The main goal of the book is to present parallel programming techniques that can be used in many situations for many application areas and which enable the reader to develop correct and efficient parallel programs. Many examples and exercises are provided to show how to apply the techniques. The book can be used as both a textbook for students and a reference book for professionals. The presented material has been used for courses in parallel programming at different universities for many years. Keywords: Distributed Programming - Grid Computing - Multithreading - Networking - Parallel Programming - Scientific Programming Read more detailed information (including detailed table of contents and sample chapter): www.springer.com/978-3-642-04817-3 ORDER INFORMATION: Springer: www.springer.com/978-3-642-04817-3 Amazon: http://www.amazon.com/Parallel-Programming-Multicore-Cluster-Systems/dp/364204817X --- Ralf Gerstner Springer Senior Editor | Computer Science Editorial --- Tiergartenstrasse 17 | 69121 Heidelberg | Germany tel +49 (0)6221 / 487 8144 fax +49 (0)6221 / 487 6 8144 ralf.gerstner at springer.com www.springer.com --- -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100316/4a4b5e64/attachment-0001.htm From kutsia at risc.uni-linz.ac.at Tue Mar 16 15:39:48 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Tue, 16 Mar 2010 20:39:48 +0100 Subject: [TYPES/announce] Last CfP: LOPSTR'10 Message-ID: <20100316193948.GA23099@risc.uni-linz.ac.at> [Please distribute. Apologies for multiple copies.] ========================================================================= Call for papers 20th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2010 http://www.risc.uni-linz.ac.at/conferences/lopstr2010/ Hagenberg, Austria, July 23-25, 2010 (co-located with PPDP 2010) ========================================================================= Objectives: The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium, so authors can incorporate the feedback in the published papers. The 20th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2010) will be held in Hagenberg, Austria; previous symposia were held in Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester. LOPSTR 2010 will be co- located with PPDP 2010 (12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming). Topics: Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in- the-small and programming-in-the-large. Papers describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: specification synthesis verification transformation analysis optimisation specialization inversion composition program/model manipulation certification security transformational techniques in SE applications and tools Survey papers that present some aspect of the above topics from a new perspective, and application papers, that describe experience with industrial applications, 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. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. Following past editions, formal post-conference proceedings will be published by Springer-Verlag in the LNCS series. IMPORTANT DATES AND SUBMISSION GUIDELINES: Paper/extended abstract submission: March 25, 2010 Notification (for pre-proceedings): May 15, 2010 Camera-ready (for pre-proceedings): June 15, 2010 Symposium: July 23-25, 2010 Submissions can either be (short) extended abstracts or (full) papers whose length should not exceed 9 and 15 pages, respectively. Submissions must be formatted in the Springer LNCS style (excluding well-marked appendices not intended for publication). Referees are not required to read the appendices, and thus papers should be intelligible without them. Short papers may describe work-in-progress or tool demonstrations. Both short and full papers can be accepted for presentation at the symposium and will then appear in the LOPSTR 2010 pre-proceedings. Full papers can also be immediately accepted for publication in the formal proceedings published by Springer-Verlag in the LNCS series. In addition, after the symposium, the programme committee will select further short or full papers presented in LOPSTR 2010 to be considered for formal publication. These authors will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then after another round of reviewing, these revised papers can also be published in the formal post-proceedings. Papers should be submitted electronically via the submission page http://www.easychair.org/conferences/?conf=lopstr2010 They should be in PDF format and interpretable by Acrobat Reader. Invited Speakers: Bruno Buchberger RISC, Johannes Kepler University Linz, Austria Olivier Danvy University of Aarhus, Denmark Johann Schumann RIACS/NASA Ames Research Center, USA Program Committee: Maria Alpuente Tech. University of Valencia (Chair), Spain Sergio Antoy Portland State University, USA Gilles Barthe IMDEA Software, Madrid Manuel Carro Tech. University of Madrid, Spain Marco Comini University of Udine, Italy Danny De Schreye K.U.Leuven, Belgium Santiago Escobar Tech. University of Valencia, Spain Moreno Falaschi University of Siena, Italy Fabio Fioravanti University of Chieti - Pescara, Italy John Gallagher Roskilde University, Denmark Michael Hanus University of Kiel, Germany Patricia M Hill University of Parma, Italy Andy King University of Kent, UK Temur Kutsia Johannes Kepler University Linz, Austria Ralf Lämmel Universität Koblenz-Landau, Germany Michael Leuschel University of Southampton, UK Yanhong Annie Liu State University of New York at Stony Brook, USA Julio Mariño Tech. University of Madrid, Spain Ricardo Peña University Complutense of Madrid, Spain Peter Schneider-Kamp University of Southern Denmark Alicia Villanueva Tech. University of Valencia, Spain Contacts Program Chair Maria Alpuente DSIC - Technical University of Valencia Camino de Vera s/n Apdo. 22.012 E-46022 Valencia (Spain) Email: alpuente at dsic.upv.es Conference Chair Temur Kutsia Research Institute for Symbolic Computation Johannes Kepler University Linz Altenbergerstrasse 69 A-4040 Linz, Austria Email: kutsia at risc.uni-linz.ac.at From olivier.laurent at ens-lyon.fr Thu Mar 18 08:15:20 2010 From: olivier.laurent at ens-lyon.fr (Olivier Laurent) Date: Thu, 18 Mar 2010 13:15:20 +0100 Subject: [TYPES/announce] MALOA PhD position in logic at ENS Lyon Message-ID: <4BA21958.3080201@ens-lyon.fr> ********************************************************* * * * PhD Position in Logic at ENS Lyon (MALOA project) * * * * * * October 1st, 2010 -- September 30th, 2013 * * * ********************************************************* MALOA (From MAthematical LOgic to Applications) is a European Initial Training Network: http://www.logique.jussieu.fr/MALOA/ Amongst the proposed PhD positions, one will be open in the Plume team of the computer science laboratory of the ENS Lyon (France). http://www.ens-lyon.fr/LIP/PLUME/ The main research topics of the team are: * Proof theory and computer science * Curry-Howard correspondence * Programming languages semantics * Linear logic, game semantics, realisability * Implicit computational complexity * Concurrency theory * Computer assisted reasoning Applications are now open. Submissions including : * a detailed curriculum vitae * a list of topics of interest * the names and e-mail addresses of two references should be sent by e-mail to "olivier.laurent at ens-lyon.fr" by April 30th, 2010. Before applying, please check you satisfy the eligibility conditions: http://www.logique.jussieu.fr/MALOA/Eligibility.html Important dates: * applications: April 30th, 2010 * starting date: October 1st, 2010 Do not hesitate to contact us if you want some additional informations: Olivier.Laurent at ens-lyon.fr -- Olivier LAURENT e-mail : Olivier.Laurent at ens-lyon.fr www : http://perso.ens-lyon.fr/olivier.laurent/ From Yves.Bertot at sophia.inria.fr Thu Mar 18 09:58:28 2010 From: Yves.Bertot at sophia.inria.fr (Yves Bertot) Date: Thu, 18 Mar 2010 14:58:28 +0100 Subject: [TYPES/announce] CFP: Call for papers, Coq Workshop (deadline March 22nd) Message-ID: <4BA23184.4040904@sophia.inria.fr> lease help disseminate this call for papers Two changes in the call for papers: 1/ papers describing experiments in other type theory-based proof assistants are explicitly invited to this workshop, 2/ EPTCS (http://eptcs.org/) has agreed to host the proceedings. Call for papers The Coq workshop will bring together Coq users, developers and contributors. The workshop will be organized from submitted papers, invited talks and a plenary discussion on the evolution and design of Coq. Topics for submitting a paper include: * Experiments with type-theoretic proof assistants * Language or tactics features * Theory and implementation of the Calculus of Inductive Constructions * Applications and experience in education and industry * Tools, platforms built on Coq * Plugins, libraries for Coq * Interfacing with Coq * Formalization tricks and Coq pearls Authors should submit their paper through EasyChair at the following link: http://www.easychair.org/conferences/?conf=coq2 Submitted papers should be in (postscript or) portable document format. Papers should not exceed 12 pages in length in single-column full-page 11pt A4 style. If there is sufficient demand, we will try to organize a time slot for demonstrations. Similarly, we may also organize a session on the lessons learned from teaching Coq. If you are interested, please send a brief proposal. Venue FLoC 2010, Edinburgh, Scotland Important Dates * March 22nd: Deadline for submission of papers * May 1st: Acceptance Notification * May 31st: Final version of articles * July 9th: Workshop in Edinburgh Program Committee * Andrew Appel * Yves Bertot (Chair) * Adam Chlipala * Georges Gonthier * Benjamin Gr?goire * Hugo Herbelin * Micaela Mayero * Christine Paulin-Mohring * Bas Spitters Contact Yves.Bertot at sophia.inria.fr From pmt6sbc at maths.leeds.ac.uk Fri Mar 19 08:15:52 2010 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Fri, 19 Mar 2010 12:15:52 GMT Subject: [TYPES/announce] CiE 2010 - Call for Participation and Informal Presentations Message-ID: <201003191215.o2JCFqnr003883@amsta.leeds.ac.uk> COMPUTABILITY IN EUROPE 2010: Programs, Proofs, Processes Ponta Delgada (Azores), Portugal June 30 to July 4, 2010 http://www.cie2010.uac.pt/ ************************************************************ Call for Participation and Informal Presentations ************************************************************ CALL FOR INFORMAL PRESENTATIONS There is a remarkable difference in conference style between computer science and mathematics conferences. Mathematics conferences allow for informal presentations that are prepared very shortly before the conference and inform the participants about current research and work in progress. The format of computer science conferences with pre-conference proceedings is not able to accommodate this form of scientific communication. Again continuing the tradition of past CiE conferences, this year's CiE conference endeavours to get the best of both worlds. In addition to the formal presentations based on our LNCS proceedings volume, we invite researchers to present informal presentations. For this, please send us a brief description of your talk (between one paragraph and half a page) by the DEADLINE: MAY 15, 2010. Please submit your abstract electronically, via EasyChair, selecting the category "Informal Presentation". You will be notified whether your talk has been accepted for informal presentation usually within a week after your submission, so if you intend to apply for ASL ASL Student Travel Awards you should submit your abstract before March 23rd. Let us remind you that we are planning several post-conference publications, which will contain full articles of selected CiE 2010 presentations, including informal presentations. You can find these instructions at http://www.cie2010.uac.pt/contents/call_for_informal_presentations.html *********************************************************************** IMPORTANT DATES: Submission of applications for ASL Student Grants: MARCH 30 Early registration deadline: MAY 28 Submission of informal presentations: MAY 15 Late registration deadline: JUNE 20 *********************************************************************** DETAILS OF PROGRAMME: TUTORIALS: Jeffrey Bub (Information, Computation and Physics), Bruno Codenotti (Computational Game Theory). INVITED SPEAKERS: Eric Allender, Jose L. Balcazar, Shafi Goldwasser, Denis Hirschfeldt, Seth Lloyd, Sara Negri, Toniann Pitassi, and Ronald de Wolf. SPECIAL SESSIONS: Biological Computing, organizers: Paola Bonizzoni, Krishna Narayanan Invited speakers: Natasha Jonoska, Giancarlo Mauri, Yasubumi Sakakibara, Stephane Vialette Computational Complexity, organizers: Luis Antunes, Alan Selman Invited speakers: Eric Allender, Christian Glasser, John Hitchcock, Rahul Santhanam Computability of the Physical, organizers: Cris Calude, Barry Cooper Invited speakers: Giuseppe Longo, Yuri Manin, Cris Moore, David Wolpert Proof Theory and Computation, organizers: Fernando Ferreira, Martin Hyland Invited speakers: Thorsten Altenkirch, Samuel Mimram, Paulo Oliva, Lutz Strassburger Reasoning and Computation from Leibniz to Boole, organizers: Benedikt Loewe, Guglielmo Tamburrini Invited speakers: Nimrod Bar-Am, Michele Friend, Olga Pombo, Sara Uckelman Web Algorithms and Computation, organizers: Thomas Erlebach, Martin Olsen Invited speakers: Hannah Bast, Debora Donato, Alex Hall, Jeannette Janssen SPECIAL TRIBUTE TO MARIAN POUR-EL: Ning Zhong. *********************************************************************** PROGRAMME COMMITTEE: Klaus Ambos-Spies (Heidelberg), Luis Antunes (Porto), Arnold Beckmann (Swansea), Paola Bonizzoni (Milano), Alessandra Carbone (Paris), Steve Cook (Toronto ON), Barry Cooper (Leeds), Erzsebet Csuhaj-Varju (Budapest), Fernando Ferreira (Lisbon, co-chair), Nicola Galesi (Rome), Luis Mendes Gomes (Ponta Delgada), Rosalie Iemhoff (Utrecht), Achim Jung (Birmingham), Michael Kaminski (Haifa), Jarkko Kari (Turku), Viv Kendon (Leeds), James Ladyman (Bristol), Kamal Lodaya (Chennai), Giuseppe Longo (Paris), Benedikt Loewe (Amsterdam), Elvira Mayordomo (Zaragoza, co-chair), Wolfgang Merkle (Heidelberg), Russell Miller (New York NY), Dag Normann (Oslo), Isabel Oitavem (Lisbon), Joao Rasga (Lisbon), Nicole Schweikardt (Frankfurt), Alan Selman (Buffalo NY), Peter van Emde Boas (Amsterdam), Albert Visser (Utrecht) http://www.cie2010.uac.pt/ __________________________________________________________________________ ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk CiE Conference Series http://www.illc.uva.nl/CiE CiE 2010 http://www.cie2010.uac.pt/ CiE Membership Application Form http://www.cs.swan.ac.uk/acie CiE on Twitter http://twitter.com/AssociationCiE __________________________________________________________________________ From sobocinski at gmail.com Fri Mar 19 10:59:01 2010 From: sobocinski at gmail.com (Pawel Sobocinski) Date: Fri, 19 Mar 2010 15:59:01 +0100 Subject: [TYPES/announce] SOS `10 call for papers Message-ID: This workshop should be of interest to those members of the types mailing list who are interested in operational semantics. ********************************************************** SOS `10 - Structural Operational Semantics 2010 An Affiliated Workshop of CONCUR 2010 August 30, 2010, Paris, France http://www.ru.is/faculty/luca/SOS2010/ ********************************************************** Aim: Structural operational semantics (SOS) provides a framework for giving operational semantics to programming and specification languages. A growing number of programming languages from commercial and academic spheres have been given usable semantic descriptions by means of structural operational semantics. Because of its intuitive appeal and flexibility, structural operational semantics has found considerable application in the study of the semantics of concurrent processes. It is also a viable alternative to denotational semantics in the static analysis of programs, and in proving compiler correctness. Moreover, it has found application in emerging areas of computing such as probabilistic systems and systems biology. Structural operational semantics has been successfully applied as a formal tool to establish results that hold for classes of process description languages. This has allowed for the generalization of well-known results in the field of process algebra, and for the development of a meta-theory for process calculi based on the realization that many of the results in this field only depend upon general semantic properties of language constructs. This workshop aims at being a forum for researchers, students and practitioners interested in new developments, and directions for future investigation, in the field of structural operational semantics. One of the specific goals of the series of SOS workshops is to establish synergies between the concurrency and programming language communities working on the theory and practice of SOS. Specific topics of interest include (but are not limited to): - programming languages, process algebras and higher-order formalisms - foundations of SOS - conservative extensions and translations of SOS specifications - congruence results and their meta-theory - modal logics, program logics and SOS - ordered, modular, and other variants of SOS - SOS of probabilistic, timed, stochastic and hybrid systems - SOS and rewriting systems, reactive systems and other forms of operational specification - comparisons between denotational, axiomatic and structural operational semantics - software tools that automate, or are based on, SOS. Reports on applications of SOS to other fields, including: - modelling and analysis of biological systems, - security of computer systems, - programming, modelling and analysis of embedded systems, - specification of middle-ware and coordination languages, - programming language semantics and implementation, - static analysis, - software and hardware verification, are also most welcome. Paper submission ---------------- We solicit unpublished papers reporting on original research on the general theme of SOS. Prospective authors should submit a paper via Easychair by Wednesday, 2nd June 2010. (If you do not have an Easychair account, you can create it by following the link). Papers should take the form of a pdf file in EPTCS format, whose length should not exceed 15 pages (not including an optional "Appendix for referees" containing proofs that will not be included in the final paper). We will also consider 5-page papers describing tools to be demonstrated at the workshop. Proceedings ----------- Preliminary proceedings will be available at the meeting. The final proceedings of the workshop will appear as a volume in the EPTCS series. If the quality and quantity of the submissions warrant it, the co-chairs plan to arrange a special issue of an archival journal devoted to full versions of selected papers from the workshop. Invited speakers ---------------- MohammadReza Mousavi (Eindhoven, NL) Catuscia Palamidessi (INRIA Saclay and ?cole Polytechnique, FR) Program Committee ----------------- Luca Aceto (Reykjavik, IS, co-chair) Robert Amadio (Paris Diderot, FR) Wan Fokkink (Amsterdam, NL) Matthew Hennessy (Dublin, IE) Bartek Klin (Warsaw, PL and Cambridge, UK) Cosimo Laneve (Bologna, IT) Andrew Pitts (Cambridge, UK) Michel Reniers (Eindhoven, NL) Grigore Rosu (Urbana-Champaign IL, USA) Pawel Sobocinski (Southampton, UK, co-chair) Sam Staton (Cambridge, UK) Important Dates --------------- Submission of abstract: Friday 28th May 2010 Submission: Wednesday 2nd June 2010 Notification: Monday, 5th July 2010 Final version: Friday 16th July 2010 Workshop: Monday 30th August 2010 From A.M.Silva at cwi.nl Fri Mar 19 12:18:55 2010 From: A.M.Silva at cwi.nl (A.M.Silva@cwi.nl) Date: Fri, 19 Mar 2010 17:18:55 +0100 Subject: [TYPES/announce] ICE 2010: Final call for papers (Submission deadline extended) Message-ID: <20100319161855.GA31701@tetra.sen.cwi.nl> [- Apologies for cross-postings -] 3rd Interaction and Concurrency Experience ICE 2010: Guaranteed Interactions Satellite workshop of DisCoTec 2010 10th of June 2010 Amsterdam, The Netherlands http://www.artist-embedded.org/artist/-ICE-10-.html *************************************** *** Submission deadline extended! *** *************************************** === Highlights === - Invited talks by Tom A. Henzinger (IST, Austria) and Joost-Pieter Katoen (RWTH Aachen University, Germany) - Innovative selection procedure - Travel grants for young researchers === Important Dates === - Abstract submission: 29 March 2010 - Full paper submission: 05 April 2010 (hard deadline) - Reviews, rebuttal and PC discussion: 06-28 April 2010 - Notification to authors: 30 April 2010 === Scope === Interaction and Concurrency Experiences (ICEs) is a series of international scientific meetings oriented to theoretical computer science researchers with special interest in models, verification, tools and programming primitives for complex interactions. The general scope is to include theoretical and applied aspects of interactions and the synchronization mechanisms used among actors of concurrent/distributed systems, but every experience will focus on a different specific topic which affects several areas of computer science. The theme of ICE'10 is ***Guaranteed Interactions***, like guaranteeing safety, responsiveness, quality of service levels or satisfaction of analysis hypotheses. In this context, coordination can be viewed as imposing constraints on the interaction among the actors. Such constraints and guarantees of their satisfaction play an important role in the analysis of distributed systems. In order to provide such guarantees, a number of directions are being explored to develop appropriate models, methodologies and tools, like behavioural types, component-based model checking, assume-guarantee and ?by construction? techniques such as glue synthesis. Considering interaction as a first class entity is crucial for overcoming complexity issues of distributed systems, such as state space explosion. Topics of interest include, but shall not be limited to: - logic and types for interactions - concurrent models and semantics - techniques and tools for specification, analysis, verification of guaranteed interaction - programming primitives for interactions - languages, protocols and mechanisms for sound coordination - "by construction" guarantees for interaction - expressiveness results - formal contract languages - disciplined interactions inspired by emerging computational models (systems biology, quantum computing, etc.) === Selection Procedure === The workshop proposes an innovative paper selection mechanism based on an interactive discussion amongst authors and PC members. As witnessed by the past two editions of ICE, this considerably improves the accuracy of the feedback from reviews, the fairness of the selection, the quality of accepted papers, and the discussion during the workshop. During the review phase, each submitted paper is published on a Wiki and associated with a discussion forum whose access will be restricted to the authors and to all the PC members not in conflict of interests. The PC members post comments / questions which the authors shall reply to. === The Public Wiki === After the notification, the accepted papers will be published on a public forum, the rationale being to initiate public discussions that will trigger and stimulate the scientific debate of the workshop. We argue that this will drive the workshop discussions and let perspective participants to interact with each other well in advance with respect to the modus operandi of more traditional events. === Submission Guidelines === Papers must report previously unpublished work and not be simultaneously submitted to other conferences / workshops with refereed proceedings. The ICE'10 post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/). Depending on the quality of submissions a special issue in a journal will be considered. Submissions must be made electronically in PDF format via EasyChair (http://www.easychair.org/conferences/?conf=ice2010) and should not exceed 15 pages with EPTCS style (http://style.eptcs.org/). Accepted papers must be presented at the workshop by one of the authors. === Program Committee === - Paolo Baldan (University of Padova, Italy) - Ananda Basu (Verimag, France) - Karthik Bhargavan (INRIA, France) - Simon Bliudze (CEA LIST, France; co-chair) - Andrea Bracciali (CNR, Italy) - Roberto Bruni (University of Pisa, Italy; co-chair) - Pierre-Malo Deni?lou (Imperial College London, UK) - Erik de Vink (Technische Universiteit Eindhoven, Netherlands) - Laurent Doyen (ENS Cachan, France) - Carlo Furia (ETH Zurich, Switzerland) - Fabio Gadducci (University of Pisa, Italy) - Julian Gutierrez (University of Edinburgh, UK) - Thomas Hildebrandt (IT University of Copenhagen, Denmark) - Daniel Hirschkoff (ENS Lyon, France) - Barbara Jobstmann (CNRS/Verimag, France) - Ivan Lanese (University of Bologna, Italy) - Alberto Lluch Lafuente (IMT Lucca, Italy) - Hernan Melgratti (University of Buenos Aires, Argentina) - Madhavan Mukund (Chennai Mathematical Institute, India) - Dejan Nickovic (IST, Austria) - Sophie Quinton (Verimag, France) - Alexandra Silva (CWI, Netherlands) - Pawel Sobocinski (University of Southampton, UK) - Ana Sokolova (University of Salzburg, Austria) - Paola Spoletini (University of Insubria, Italy) - Emilio Tuosto (University of Leicester, UK) - Hugo Torres Vieira (New University of Lisbon, Portugal) === ICEcreamers === - Simon Bliudze (CEA LIST, France; co-chair) - Roberto Bruni (University of Pisa, Italy; co-chair) - Davide Grohmann (Universita' di Udine; website and discussion forum) - Alexandra Silva (CWI, Netherlands; local arrangements) === Contact === Please write to for any additional information you may need. === Previous editions === The previous two editions of ICE have been held in: - Reykjavik, Iceland, on July 6th, 2008, with focus on Synchronous and Asyn- chronous Interactions in Concurrent/Distributed Systems, co-located with ICALP?08 (http://ice08.dimi.uniud.it/). The post proceedings were published in ENTCS (vol.229-3). - Bologna, Italy, on August 31st, 2009, with focus on Structured Interactions, co-located with CONCUR?09 (http://ice09.dimi.uniud.it/). The post proceedings were published in EPTCS (vol.12) and a special issue of MSCS is now in preparation. === Sponsors === * CEA LIST (http://www-list.cea.fr) * ArtistDesign network of excellence (http://www.artist-embedded.org) * Institute for Programming research and Algorithmics (IPA - http://www2.win.tue.nl/ipa/) . From kos at informatik.uni-marburg.de Mon Mar 22 04:36:51 2010 From: kos at informatik.uni-marburg.de (Klaus Ostermann) Date: Mon, 22 Mar 2010 09:36:51 +0100 Subject: [TYPES/announce] Open Postdoc and PhD positions at University of Marburg, Germany Message-ID: <4ca09aca1003220136y979795et36545147889612e8@mail.gmail.com> There are open PostDoc and PhD positions in the "Programming Languages and Software Engineering" group at Philipps-Universit?t Marburg. Potential topics for these positions include, but are not limited to: - software architecture and design techniques - aspect-oriented and feature-oriented programming - code generation and compiler techniques - domain-specific languages - object-oriented programming - functional programming - program analysis and verification - compilers and virtual machines - type systems - mathematical foundations of programming Marburg is a beautiful small town in Hesse, Germany, with one of the oldest universities in Germany. The positions are well-paid (according to standard German scalary scales), have few (teaching) obligations, and include a lot of freedom to develop one's own research program. Fluency in German is not required. Please send informal enquiries to: Klaus Ostermann Contact data available at: http://www.informatik.uni-marburg.de/~kos/ From jfrazee at mail.utexas.edu Mon Mar 22 09:42:38 2010 From: jfrazee at mail.utexas.edu (Joey Frazee) Date: Mon, 22 Mar 2010 08:42:38 -0500 Subject: [TYPES/announce] NASSLLI 2010: Open for Registration Message-ID: <103f6a951003220642u56358974n878ff7d6f1886ef8@mail.gmail.com> NASSLLI 2010 is Open for Registration! Fourth North American Summer School in Logic, Language, and Information NASSLLI 2010 June 20-26, 2010 http://www.indiana.edu/~nasslli/ The North American Summer School in Logic, Language, and Information (NASSLLI) is a summer school with classes in the interface between computer science, linguistics, and logic. After previous editions at Stanford University, Indiana University, and UCLA, NASSLLI will return to Bloomington, Indiana, June 20?26, 2010. The summer school, loosely modeled on the long-running ESSLLI series in Europe, will consist of a number of courses and workshops, selected on the basis of the proposals. Courses and workshops meet for 90 or 120 minutes on each of five days, June 21?25, and there will be tutorials on June 20 and a day-long workshop on June 26. The instructors are prominent researchers who volunteer their time and energy to present basic work in their disciplines. Many are coming from Europe just to teach at NASSLLI. NASSLLI courses are aimed at graduate students and advanced undergraduates in wide variety of fields. The instructors know that people will be attending from a wide range of disciplines, and they all are pleased to be associated with an interdisciplinary school. The courses will also appeal to post-docs and researchers in all of the relevant fields. We hope to have 100-150 participants. In addition to classes in the daytime, the evenings will have social events and plenary lectures. Bloomington is a wonderful place to visit, known for arts, music, and ethnic restaurants. All of this is within 15 minutes walking from campus. We aim to make NASSLLI fun and exciting. Joey Frazee Student Program Committee From Richard.Moot at labri.fr Mon Mar 22 13:21:35 2010 From: Richard.Moot at labri.fr (Richard Moot) Date: Mon, 22 Mar 2010 18:21:35 +0100 Subject: [TYPES/announce] E. W. Beth Dissertation Prize: 2010 call for nominations Message-ID: <59271156-9580-48BA-9347-29A809B7B651@labri.fr> [ Please redistribute. Apologies for multiple postings. ] E. W. Beth Dissertation Prize: 2010 call for nominations Since 2002, FoLLI (the Association for Logic, Language, and Information, http://www.folli.org) awards the E.W. Beth Dissertation Prize to outstanding dissertations in the fields of Logic, Language, and Information. We invite submissions for the best dissertation which resulted in a Ph.D. degree in the year 2009. The dissertations will be judged on technical depth and strength, originality, and impact made in at least two of three fields of Logic, Language, and Computation. Interdisciplinarity is an important feature of the theses competing for the E.W. Beth Dissertation Prize. Who qualifies. Nominations of candidates are admitted who were awarded a Ph.D. degree in the areas of Logic, Language, or Information between January 1st, 2009 and December 31st, 2009. There is no restriction on the nationality of the candidate or the university where the Ph.D. was granted. After a careful consideration, FoLLI has decided to accept only dissertations written in English. Dissertations produced in 2009 but not written in English or not translated will be allowed for submission, after translation, also with the call next year (for 2010). The present call for nominations for the E.W. Beth Dissertation Award 2010 will also accept nominations of full English translations of theses originally written in another language than English and defended in 2008 or 2009. Prize. The prize consists of: -a certificate -a donation of 2500 euros provided by the E.W. Beth Foundation -an invitation to submit the thesis (or a revised version of it) to the FoLLI Publications on Logic, Language and Information (Springer). For further information on this series see the FoLLI site. How to submit. Only electronic submissions are accepted. The following documents are required: 1. The thesis in pdf or ps format (doc/rtf not accepted); 2. A ten page abstract of the dissertation in ascii or pdf format; 3. A letter of nomination from the thesis supervisor. Self-nominations are not admitted: each nomination must be sponsored by the thesis supervisor. The letter of nomination should concisely describe the scope and significance of the dissertation and state when the degree was officially awarded; 4. Two additional letters of support, including at least one letter from a referee not affiliated with the academic institution that awarded the Ph.D. degree. All documents must be submitted electronically to buszko at amu.edu.pl. Hard copy submissions are not admitted. In case of any problems with the email submission or a lack of notification within three working days, nominators should write to buszko at amu.edu.pl. Important dates: Deadline for Submissions: April 30, 2010. Notification of Decision: July 20, 2010. Committee : Natasha Alechina (Nottingham) Lev Beklemishev (Moscow) Wojciech Buszkowski (chair) (Poznan) Didier Caucal (IGM-CNRS) Nissim Francez (Haifa) Alexander Koller (Saarbruecken) Alberto Policriti (Udine) Ian Pratt-Hartmann (Manchester) Rob van der Sandt (Nijmegen) Colin Stirling (Edinburgh) Rineke Verbrugge (Groningen) Heinrich Wansing (Dresden) From eabonelli at gmail.com Mon Mar 22 17:03:22 2010 From: eabonelli at gmail.com (Eduardo Bonelli) Date: Mon, 22 Mar 2010 18:03:22 -0300 Subject: [TYPES/announce] HOR'2010 - Extended deadline Message-ID: ******************** extended deadline ******************** ******************** extended deadline ******************** ************************************** * * * HOR 2010 - CALL FOR ABSTRACTS * * (extended deadline) * ************************************** 5th International Workshop on Higher-Order Rewriting (Affiliated with RTA'2010) Wednesday July 14, 2010, Edinburgh, UK http://hor.pps.jussieu.fr/10/ IMPORTANT DATES: March 31, 2010 : deadline electronic submission of paper April 20, 2010 : notification of acceptance of papers May 17, 2010 : deadline for final version of accepted papers HOR 2010 is a forum to present work concerning all aspects of higher-order rewriting. The aim is to provide an informal and friendly setting to discuss recent work and work in progress. HOR 2010 is part of FLoC 2010 in Edinburgh. HOR 2007 was part of RDP 2007 in Paris, France. HOR 2006 was part of FLoC 2006 in Seattle, USA. HOR 2004 was part of RDP 2004 in Aachen, Germany. HOR 2002 was part of FLoC 2002 in Copenhagen, Denmark. TOPICS of interest include (but are not limited to): APPLICATIONS: proof checking, theorem proving, generic programming, declarative programming, program transformation, automated termination/confluence tools FOUNDATIONS: pattern matching, unification, strategies, narrowing, termination, syntactic properties, type theory, complexity of derivations. FRAMEWORKS: term rewriting, conditional rewriting, graph rewriting, net rewriting, comparisons of different frameworks. IMPLEMENTATION: explicit substitution, rewriting tools, compilation techniques. SEMANTICS: semantics of higher-order rewriting, categorical rewriting, higher-order abstract syntax, games and rewriting INVITED SPEAKERS: Maribel Fern?ndez King's College London, UK Silvia Ghilezan University of Novi Sad, Serbia PROGRAM COMMITTEE Zena Ariola University of Oregon, USA Fr?d?ric Blanqui INRIA & Tsinghua University, China Eduardo Bonelli Universidad Nacional de Quilmes, Argentina, chair Mariangiola Dezani-Ciancaglini Universit? di Torino, Italy Roel de Vrijer Vrije Universiteit, The Netherlands http://style.eptcs.org/ HOR 2010 SUBMISSIONS: Abstracts between 2 and 5 pages. As HOR is meant to be a platform to discuss ongoing research we are also interested in abstracts describing work in progress, or problems in higher-order rewriting. Please use the EasyChair page http://www.easychair.org/conferences/?conf=hor2010 to submit or update your paper (updates are always possible before the deadline). The suggested formatting style is that of EPTCS (cf. http://style.eptcs.org/). Please address your questions to the PC chair, under: ebonelli * gmail.com (where '*' is replaced by '@'). PROCEEDINGS: The proceedings of HOR 2010 will be made available on the HOR 2010 web page and copies will be distributed to the participants at the workshop. Post-workshop proceedings of extended abstracts of selected contributions will be published as a volume of EPTCS. STEERING COMMITTEE Delia Kesner Universit? Paris 7, France Femke van Raamsdonk Vrije Universiteit, The Netherlands LOCAL ARRANGEMENTS: Venue Coordinator of the local organizing committee of FLoC'2010: Floris Geerts (fgeerts at inf.ed.ac.uk) From icfp.publicity at googlemail.com Tue Mar 23 03:59:56 2010 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Tue, 23 Mar 2010 08:59:56 +0100 Subject: [TYPES/announce] ICFP 2010: Final Call for Papers Message-ID: <53ff55481003230059p2c790e66uc3b7767a5b3327e@mail.gmail.com> ===================================================================== Final Call for Papers ICFP 2010: International Conference on Functional Programming Baltimore, Maryland, 27 -- 29 September 2010 http://www.icfpconference.org/icfp2010 ===================================================================== Important Info ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Submission: 2 April 2010 Author response: 24 -- 25 May 2010 Notification: 7 June 2010 Final papers due: 12 July 2010 All deadlines are at 14:00 UTC. Submission is now open at http://icfp2010.seas.upenn.edu/ Scope ~~~~~ ICFP 2010 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects or concurrency. Particular topics of interest include * Language Design: type systems; concurrency and distribution; modules; components and composition; metaprogramming; relations to object-oriented or logic programming; interoperability * Implementation: abstract machines; compilation; compile-time and run-time optimization; memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components or low-level machine resources * Software-Development Techniques: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling * Foundations: formal semantics; lambda calculus; rewriting; type theory; monads; continuations; control; state; effects * Transformation and Analysis: abstract interpretation; partial evaluation; program transformation; program calculation; program proof * Applications and Domain-Specific Languages: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia programming; scripting; system administration; security; education * Functional Pearls: elegant, instructive, and fun essays on functional programming The conference also solicits Experience Reports, which are short papers that provide evidence that functional programming really works or describe obstacles that have kept it from working in a particular application. Abbreviated instructions for authors ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ By 2 April 2010, 14:00 UTC, submit an abstract of at most 300 words and a full paper of at most 12 pages (6 pages for an Experience Report), including bibliography and figures. The deadline will be strictly enforced and papers exceeding the page limits will be summarily rejected. Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. A submission will be evaluated according to its relevance, correctness, significance, originality, and clarity. It should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. Functional Pearls and Experience Reports are separate categories of papers that need not report original research results and must be marked as such at the time of submission. Detailed guidelines on both categories are on the conference web site. Each submission must adhere to SIGPLAN's republication policy, as explained on the web at http://www.acm.org/sigplan/republicationpolicy.htm. Proceedings will be published by ACM Press. Authors of accepted submissions are expected to transfer the copyright to the ACM. Presentations will be videotaped and released online if the presenter consents by signing an additional permission form at the time of the presentation. Formatting: Submissions must be in PDF format printable in black and white on US Letter sized paper and interpretable by Ghostscript. If this requirement is a hardship, make contact with the program chair at least one week before the deadline. Papers must adhere to the standard ACM conference format: two columns, nine-point font on a ten-point baseline, with columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). A suitable document template for LATEX is available from SIGPLAN at http://www.acm.org/sigs/sigplan/authorInformation.htm. Submission: Submissions will be accepted electronically at a URL to be named later. Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. Author response: Authors will have a 48-hour period, starting at 14:00 UTC on 24 May 2010, to read and respond to reviews. Special Journal Issue: There will be a special issue of the Journal of Functional Programming with papers from ICFP 2010. The program committee will invite the authors of select accepted papers to submit a journal version to this issue. Organization ~~~~~~~~~~~~ Conference Chair Paul Hudak, Yale University Program Chair Stephanie Weirich, University of Pennsylvania Program Committee: Umut Acar, Max Planck Institute for Software Systems Zena Ariola, University of Oregon James Cheney, University of Edinburgh Peter Dybjer, Chalmers University of Technology Robert Bruce Findler, Northwestern University Andy Gill, Kansas University Fritz Henglein, University of Copenhagen Michael Hicks, University of Maryland, College Park Patricia Johann, University of Strathclyde Andres L?h, Utrecht University Simon L. Peyton Jones, Microsoft Research Didier R?my, INRIA Paris-Rocquencourt John Reppy, University of Chicago Manuel Serrano, INRIA Sophia-Antipolis Matthieu Sozeau, Harvard University From chong at seas.harvard.edu Tue Mar 23 18:47:56 2010 From: chong at seas.harvard.edu (Stephen Chong) Date: Tue, 23 Mar 2010 18:47:56 -0400 Subject: [TYPES/announce] Final CFP: Analysis and Programming Languages for Web Apps and Cloud Apps 2010 In-Reply-To: <4B1006B3.3000602@seas.harvard.edu> References: <4AF313AD.60906@seas.harvard.edu> <4B022FBF.7020204@seas.harvard.edu> <4B0E11E6.5040903@seas.harvard.edu> <4B0E9C5B.7080303@seas.harvard.edu> <4B1006B3.3000602@seas.harvard.edu> Message-ID: <4BA9451C.8010603@seas.harvard.edu> CALL FOR PAPERS *Analysis and Programming Languages for Web Applications and Cloud Applications * (APLWACA 2010) http://research.microsoft.com/en-us/um/redmond/events/APLWACA2010 Toronto, Canada, Sunday June 6, 2010 Co-located with PLDI 2010 Submission due date: Friday March 26, 2010 Analysis and Programming Languages for Web Applications and Cloud Applications (APLWACA, pronounced "apple-whacka") is a new workshop that provides a forum for exploring and evaluating ideas on the use of program analysis and programming language techniques to improve web and cloud applications. Web applications are distributed systems that communicate using Web protocols, and contain client systems executing within commodity web browsers. Cloud applications are distributed systems that utilize cloud computing technologies. The focus of the workshop is primarily on reliability, security, and performance of web and cloud applications. Strongly encouraged are proposals of new, speculative ideas; evaluations of new or known techniques in practical settings; and discussions of important existing and emerging problems. The scope of APLWACA includes, but is not limited to: * Static analysis of web and cloud applications * Runtime analysis of web and cloud applications and enhanced web and cloud application runtimes * Program analysis techniques for discovering reliability issues, security vulnerabilities, or performance bottlenecks * Testing and model checking of web and cloud applications * Compiler- and language-based mechanisms for security and performance * New languages, techniques, and runtimes for programming web and cloud applications, including client-side programming * Characterizing web and cloud application workloads and benchmarks, especially as it comes to large distributed applications like Facebook or Hotmail More details can be found on the APLWACA website: http://research.microsoft.com/en-us/um/redmond/events/APLWACA2010 Important Dates Submission due date Friday, March 26, 2010 Author notification Friday, April 30, 2010 Revised papers due Friday, May 14, 2010 APLWACA 2010 workshop Sunday, June 6, 2010 Technical Program Committee Stephen Chong Harvard University (co-chair) Ranjit Jhala University of California San Diego Trevor Jim AT&T Labs Research Shriram Krishnamurthi Brown University Benjamin Livshits Microsoft Research (co-chair) Sergio Maffeis Imperial College London John C. Mitchell Stanford University Anders M?ller Aarhus University -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100323/982e9fa7/attachment-0001.htm From ueda at ueda.info.waseda.ac.jp Thu Mar 25 02:05:36 2010 From: ueda at ueda.info.waseda.ac.jp (Kazunori UEDA) Date: Thu, 25 Mar 2010 15:05:36 +0900 (JST) Subject: [TYPES/announce] APLAS 2010 Call For Papers Message-ID: <20100325.150536.41647511.ueda@ueda.info.waseda.ac.jp> CALL FOR PAPERS APLAS 2010 Eighth Asian Symposium on Programming Languages and Systems Shanghai, China November 28-December 1, 2010 http://basics.sjtu.edu.cn/conference/aplas2010/ BACKGROUND APLAS aims at stimulating programming language research by providing a forum for the presentation of latest results and the exchange of ideas in topics concerned with programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming language community. APLAS is sponsored by the Asian Association for Foundation of Software (AAFS) founded by Asian researchers in cooperation with many researchers from Europe and the USA. The past APLAS symposiums were successfully held in Seoul ('09), Bangalore ('08), Singapore ('07), Sydney ('06), Tsukuba ('05), Taipei ('04) and Beijing ('03) after three informal workshops held in Shanghai ('02), Daejeon ('01) and Singapore ('00). Proceedings of the past symposiums were published in Springer-Verlag's LNCS 2895, 3302, 3780, 4279, 4807, 5356, and 5904. The 2010 edition will be held at Shanghai Jiao Tong University, China. TOPICS The symposium is devoted to both foundational and practical issues in programming languages and systems. Papers are solicited on, but not limited to, the following topics: * semantics, logics, foundational theory; * design of languages and foundational calculi; * type systems; * compilers, interpreters, abstract machines; * program derivation, analysis, transformation; * software security, safety, verification; * concurrency, constraints, domain-specific languages; * tools for programming, verification, implementation. APLAS 2010 is not limited to topics discussed in previous symposiums. Papers identifying future directions of programming and those addressing the rapid changes of the underlying computing platforms are especially welcome. Demonstration of systems and tools in the scope of APLAS are welcome to the System and Tool presentations category. Authors concerned about the appropriateness of a topic are welcome to consult with Program Chair prior to submission. SUBMISSION INFORMATION We solicit submissions in two categories: 1. REGULAR RESEARCH PAPERS, describing original research results, including tool development and case studies, from a perspective of scientific research. Regular research papers should not exceed 16 pages in the Springer LNCS format, including bibliography and figures. They should clearly identify what has been accomplished and why it is significant. Submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity. In case of lack of space, proofs, experimental results, or any information supporting the technical results of the paper could be provided as Appendix or a link to a web page. 2. SYSTEM AND TOOL PRESENTATIONS, describing systems or tools that support theory, program construction, reasoning, and/or program execution in the scope of APLAS. Unlike presentations of regular research papers, presentation of accepted papers in this category is expected to be centered around a demonstration. The paper and the demonstration should identify the novelties of the tools and use motivating examples. System and Tool presentations papers should not exceed 8 pages in the Springer LNCS format, including bibliography and figures. Submissions will be judged based on both the papers and the systems or tools as described in the papers. It is highly desirable that the tools are available on the web. Papers should be submitted electronically via the submission web page at http://www.easychair.org/conferences/?conf=aplas2010. Acceptable formats are PostScript or PDF, viewable by Ghostview or Acrobat Reader. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers must be written in English. The proceedings are planned to be published as a volume in Springer-Verlag's Lecture Notes in Computer Science series. Accepted papers must be presented at the conference. INVITED SPEAKERS Gerwin Klein National ICT Australia Dale Miller INRIA Saclay - Ile-de-France Mingsheng Ying Tsinghua University, China and University of Technology Sydney ZHOU Chaochen Chinese Academy of Sciences IMPORTANT DATES Abstract Deadline: Monday, June 7, 2010 Submission Deadline: Monday, June 14, 2010 (Samoa Time) Notification: August 16, 2010 Camera-Ready: September 3, 2010 Symposium: November 28-December 1, 2010 GENERAL CHAIR Yuxi Fu Shanghai Jiao Tong University, China PROGRAM CHAIR Kazunori Ueda Waseda University, Japan PROGRAM COMMITTEE Roberto Amadio Universite Paris Diderot, France Lennart Beringer Princeton University, USA Dino Distefano Queen Mary, University of London, UK Yuxi Fu Shanghai Jiao Tong University, China Joxan Jaffar National University of Singapore, Singapore Yukiyoshi Kameyama University of Tsukuba, Japan Gabriele Keller University of New South Wales, Australia Ralf Laemmel University of Koblenz-Landau, Germany Aditya V. Nori Microsoft Research India, India Sungwoo Park Pohang University of Science and Technology, Korea Sanjiva Prasad Indian Institute of Technology Delhi, India Christian Schulte Royal Institute of Technology, Sweden Eijiro Sumii Tohoku University, Japan Alwen Tiu Australian National University, Australia Yih-Kuen Tsay National Taiwan University, Taiwan Kazunori Ueda Waseda University, Japan Hongwei Xi Boston University, USA Jian Zhang Chinese Academy of Sciences, China LOCAL ARRANGEMENTS CHAIR Xiaoju Dong Shanghai Jiao Tong University, China POSTER SESSION CHAIR Guoqiang Li Shanghai Jiao Tong University, China From bove at chalmers.se Thu Mar 25 05:24:04 2010 From: bove at chalmers.se (Ana Bove) Date: Thu, 25 Mar 2010 10:24:04 +0100 Subject: [TYPES/announce] PAR'10 at FLOC'10: -- Final CFP In-Reply-To: <59733.145.99.144.107.1269473637.squirrel@webmail.cwi.nl> References: <59733.145.99.144.107.1269473637.squirrel@webmail.cwi.nl> Message-ID: <4BAB2BB4.2030804@chalmers.se> ** Submission deadline on Monday 29th of March ** If you need a few days extension please send an email to Ana Bove with the request. A title and the abstract will still be required by the 29th of March. ======================================================================== Final Call for Papers PAR 2010 Workshop on Partiality And Recursion in Interactive Theorem Provers Edinburgh, UK, 15 July 2010 (satellite workshop of ITP'10) a mid-FLoC 2010 workshop ======================================================================== PAR'10 workshop is a venue for researchers working on new approaches to cope with partial functions and terminating general (co)recursion in theorem provers. Theorem provers with inductive types provide a restricted programming language together with a formal meta-theory for reasoning about the language. When propositions are represented as types and proofs as programs, non-terminating proofs are disallowed for consistency and decidability of type checking. As a result, there is no trivial way to represent partial functions, and termination is syntactically ensured by imposing that the recursive calls must be made on structurally smaller arguments. Similar issues exist for productivity of functions on infinite objects where syntactic methods are used to ensure an infinite flow of data. The workshop aims to address these issues and various approaches for dealing with them. We invite submissions on all aspects of partiality and termination of general (co)recursive functions in a logical framework. The topics of this workshop include but are not limited to: * partial functions and functions over partial objects in theorem provers; * specialised type systems for general (co)recursion; * syntactical tests to guarantee termination of general recursive functions; * syntactical tests to guarantee productivity of functions on infinite objects; * methods to ensure termination of special classes of recursion definitions, eg nested recursion, simultaneous inductive-recursive data types and functions; * semantic approaches to termination and productivity, eg based on domain theory and topology; * categorical approaches to termination and productivity; * algebra of programming with partial functions and general (co)recursion. Description of software tools and case studies for dealing with the issues in the scope of the workshop are welcome. Submissions ----------- The articles will be evaluated by the Program Committee for publication in the proceedings of the workshop. In accordance with FLoC'10 requirements, PAR'10 proceedings will be published in an electronic collection available online and maintained by EasyChair. The USB memory sticks with accepted papers will be distributed during the workshop. The post-proceedings of PAR'10 will be published after the workshop as a special issue of EPTCS. Details on how and when to produce the post-workshop version of the articles will be communicated after the workshop to the authors of the accepted papers. The articles must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. Submissions should preferably not exceed 16 pages (excluding bibliography). Submissions must be prepared in LaTeX using the EasyChair latex package (). The web-based system EasyChair will be used for submission (). Important dates --------------- * 29 March 2010: Submission deadline * 29 April 2010: Notification of acceptance * 18 May 2010: Final version of accepted papers (Notice the slight change compared to previous announcements) * 15 July 2010: the workshop Invited Speakers ---------------- * Conor McBride (University of Strathclyde) * Alexander Krauss (Technical University of Munich) Programme Committee ------------------- Andreas Abel (Ludwig Maximilians University Munich, D) Yves Bertot (INRIA Sophia-Antipolis, FR) Ana Bove (Chalmers University of Technology, SE) Ekaterina Komendantskaya (University of St Andrews, UK) Ralph Matthes (IRIT Toulouse, FR) Milad Niqui (CWI, NL) Anton Setzer (Swansea University, UK) Organisers ---------- Ana Bove Ekaterina Komendantskaya Milad Niqui ________________________________ From Alex.Simpson at ed.ac.uk Thu Mar 25 09:58:27 2010 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Thu, 25 Mar 2010 13:58:27 +0000 Subject: [TYPES/announce] Proof Systems for Program Logics 2010: student grants available Message-ID: <20100325135827.k9l721076scsksg0@www.staffmail.ed.ac.uk> Further to the CFP for PSPL2010, we are pleased to announce that a number of grants for PhD students to attend this workshop are available. For further information, please email: pspl2010 at easychair.org stating "Student grants" in the subject header. ----- Proof Systems for Program Logics (PSPL 2010) Saturday 10th July 2010, Edinburgh, UK A LICS 2010-affiliated workshop at FLoC 2010 http://homepages.inf.ed.ac.uk/als/PSPL2010/ A new workshop bringing together researchers working on any aspect of the design, study and application of proof systems for program logics. Invited speakers: Andre Platzer (Carnegie Mellon University) Viktor Vafeiadis (University of Cambridge) CALL FOR CONTRIBUTED TALKS The emphasis of the workshop is on reporting current and ongoing research. 30-minute contributed talks will be selected on the basis of two-page abstracts. Submission deadline for two-page abstracts: Monday 12th April 2010. Author notification : Monday 26th April 2010. For more details see: http://homepages.inf.ed.ac.uk/als/PSPL2010/ -- Alex Simpson, LFCS, School of Informatics, Univ. of Edinburgh, UK Email: Alex.Simpson at ed.ac.uk Tel: +44 (0)131 650 5113 Web: http://homepages.inf.ed.ac.uk/als Fax: +44 (0)131 651 1426 -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From kutsia at risc.uni-linz.ac.at Thu Mar 25 12:51:52 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Thu, 25 Mar 2010 17:51:52 +0100 Subject: [TYPES/announce] LOPSTR 2010: Deadline extension Message-ID: <4BAB94A8.6000402@risc.uni-linz.ac.at> ===================================================================== 20th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2010 http://www.risc.uni-linz.ac.at/conferences/lopstr2010/ Hagenberg, Austria, July 23-25, 2010 (co-located with PPDP 2010) ===================================================================== EXTENDED DEADLINE Paper (or extended abstract) submission: March 31, 2010 From cesar.a.munoz at nasa.gov Thu Mar 25 13:07:12 2010 From: cesar.a.munoz at nasa.gov (Munoz, Cesar Augusto (LARC-D320)) Date: Thu, 25 Mar 2010 12:07:12 -0500 Subject: [TYPES/announce] IWS 2010: Extended Deadline In-Reply-To: Message-ID: *** IWS 2010: Submissions will be open until April 2, 2010 *** LAST CALL FOR PAPERS International Workshop on Strategies in Rewriting, Proving, and Programming IWS 2010 iws2010.inria.fr (A satellite workshop of FLoC 2010) July 9 2010, Edinburgh, UK Abstract submission: March 26, 2010 (extended until April 2, 2010) Notification date: April 16, 2010 Abstract final version: April 30, 2010 Workshop: July 9, 2010 Submission of full paper for the proceedings: September 5, 2010 Possible topics to address in this workshop include: * Foundations for the definition and semantic description of strategies: models of search spaces, logical or mathematical formalisms to define strategies and prove properties about them. * Properties of strategies and corresponding computations: logical or mathematical formalisms to prove properties about them. * Analysis and optimization techniques for strategies: analysis of the search space, evaluation and comparison of strategies. * Integration of strategic deductions and/or strategic computations: interrelations, combinations and applications of deduction and computation under different strategies, control issues and strategies in the integration of systems, strategies in decision procedures for SMT. * Strategy languages: essential constructs, meta-level features. Definition, design, implementation and application. Comparison of strategies in (existing) systems. * Concrete types of (reduction/evaluation) strategies in rewriting and programming, lambda calculi, normalization, narrowing, constraint solving, as well as their properties and characteristics (complexity, decidability, ...). * Applications and case studies in which strategies play a major role. Invited Speakers ------------- Dan Dougherty, Worcester Polytechnic Institute http://web.cs.wpi.edu/~dd/ Assia Mahboubi, INRIA Saclay http://www.lix.polytechnique.fr/~assia/index-eng.html Submissions ---------- The submission process is in two stages. 1) Before the workshop, authors are invited to submit an extended abstract (max. 5 pages) to be formatted in the EasyChair class style http://www.easychair.org/easychair.zip through the EasyChair submission site: http://www.easychair.org/conferences/?conf=iws2010 Accepted abstracts will be presented at the workshop and included in the preliminary proceedings, available at the workshop. 2) After the workshop, authors will be invited to submit a full paper of their presentation (typically a 15-pages paper), which will be refereed and considered for publication in the electronic journal: Electronic Proceedings in Theoretical Computer Science (http://eptcs.org). Beyond original ideas and recent results not published nor submitted elsewhere, we also invite authors to submit a 5-pages abstract describing relevant work that has been or will be published elsewhere, or work in progress. These submissions will be only considered for presentation at the workshop and inclusion in the preliminary proceedings but not in the final proceedings. Organizers --------- Helene Kirchner, INRIA Bordeaux - Sud-Ouest, France Cesar Munoz, NASA Langley Research Center, Hampton, USA Program Committee ----------------- Maria Paola Bonacina, Univ. degli Studi di Verona, Italy Jean-Christophe Filliatre, CNRS, France Bernhard Gramlich, Technische Universitat Wien, Austria Salvador Lucas, Universidad Politecnica de Valencia, Spain Pierre-Etienne Moreau, LORIA-INRIA Nancy, France Natarajan Shankar, SRI International, Menlo Park, CA, USA Eelco Visser, Delft Univ. of Technology, The Netherlands Christoph Weidenbach, MPI-INF, Saarbrucken, Germany Web: iws2010.inria.fr Email: iws2010 at inria.fr From lengrand at lix.polytechnique.fr Thu Mar 25 17:26:48 2010 From: lengrand at lix.polytechnique.fr (Stephane Lengrand (Work)) Date: Thu, 25 Mar 2010 22:26:48 +0100 Subject: [TYPES/announce] 1 PhD and 1 Post-Doc at CNRS - Ecole Polytechnique Message-ID: <4BABD518.1090302@lix.polytechnique.fr> The Laboratoire d'Informatique de l'Ecole Polytechnique, France, offers 1 doctoral and 1 postdoctoral positions within the PSI project dedicated to "Proof Search control in Interaction with domain-specific methods" The doctoral position is funded for 3 years while the post-doc position is funded for 1 year, both starting in September 2010 or soon after. We are particularly interested in applicants with a background in one or several of the following fields: -Proof Theory -Logic Programming, in particular with constraints -Automated or Interactive Theorem Proving -Proof search in Type Theory and First-order logic -Sat Modulo Theory For more details please see http://lix.polytechnique.fr/~lengrand/PSI For the application procedure, please contact Stephane Lengrand at lengrand at lix.polytechnique.fr, as soon as possible and BEFORE 1st MAY 2010. Indeed, the deadline for the formal application procedure will be a few weeks later. Stephane Lengrand CNRS - Ecole Polytechnique From adg at microsoft.com Fri Mar 26 01:40:27 2010 From: adg at microsoft.com (Andy Gordon (MSR)) Date: Fri, 26 Mar 2010 05:40:27 +0000 Subject: [TYPES/announce] RADICAL: workshop on data, types, languages at MSR Cambridge, May 10-11 Message-ID: <7FB3CBF7E3BB674BAFF6AC938A13226323E3A135@DB3EX14MBXC315.europe.corp.microsoft.com> Dear colleagues, We're putting together an informal workshop on data, types, and languages, at MSR Cambridge in May. RADICAL: Relations and Data Integrity Constraints and Languages http://research.microsoft.com/~adg/RADICAL2010/ As of mid-March, we are delighted and excited to have gathered a fairly full programme of 30 minute talks, and we have only a few slots left. We aim to have a late-afternoon session of lightning announcements of recent work, position statements, or provocations, so we hope to fit in everyone who wants to speak, on a relevant topic, either as a 30 minute or lightning talk. If you'd like to speak at or attend the workshop, please mail me as soon as possible, please, and no later than one week's time, April 1. Please include title and short abstract. Regards, Andy (on behalf of the other organisers David Langworthy, Microsoft SQL Server, and Philip Wadler, University of Edinburgh) -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100326/2acf3a71/attachment.htm From Cedric.Lhoussaine at lifl.fr Fri Mar 26 08:25:15 2010 From: Cedric.Lhoussaine at lifl.fr (Cedric Lhoussaine) Date: Fri, 26 Mar 2010 13:25:15 +0100 Subject: [TYPES/announce] 3 years PhD position at CNRS in Computational Biology Message-ID: <1269606315.2182.28.camel@silencieuse> We are seeking candidates for a PhD position with backgrounds in programming language semantics and/or probabilistic model-checking to work on the design and analysis of new programming languages tailored for biological modeling and simulation. Please find here: http://www2.lifl.fr/BioComputing/developPhD2010/0.html the more detailed advertisement for this 3 years PhD position funded by the CNRS in the BioComputing group of the LIFL in Lille, France. The deadline for application is 30th April 2010 but a preliminary contact at bio-computing-apply at lists.gforge.inria.fr as soon as possible (and for application details) is strongly recommended. best regards, -- Cedric Lhoussaine LIFL, UMR 8022 CNRS, USTL Batiment M3, 59655 Villeneuve d'Ascq Cedex FRANCE Phone (Lifl) : +33 (0)3 28 77 85 70 , Fax: 03 28 77 85 37 Phone (IRI): +33 (0)3 62 53 17 09 Web: www.lifl.fr/~lhoussai From Bob.Coecke at comlab.ox.ac.uk Fri Mar 26 21:07:15 2010 From: Bob.Coecke at comlab.ox.ac.uk (Bob Coecke) Date: Sat, 27 Mar 2010 01:07:15 +0000 (GMT) Subject: [TYPES/announce] QICS School: Foundational Structures in Quantum Comp & Inf, May 24-28, Oxford (followed by Quantum Physics and Logic workshop) Message-ID: Spring School that marks the end of an EU FP6 FET STREP on: Foundational Structures in Quantum Computation and Information May 24-28, 2010, Oxford University, UK http://web.comlab.ox.ac.uk/people/Bob.Coecke/QICS_School.html It consists on extended tutorials on the main research strands within QICS, namely: * Structures and methods for measurement-based quantum computation * Categorical semantics, logics, diagrammatic methods * Classical-quantum interaction and information flow * Quantum automata, machines, calculi Topics that will be covered include: * measurement-based quantum computing (MBQC); properties of graph states; MBQC and condensed matter physics; blind quantum computation; determinism in MBQC; measurement-based classical computation and non-locality; * monoidal categories, Frobenius algebras, and their graphical calculus; (co)algebra of complementary observables and multipartite quantum entanglement, and applications to MBQC; phase groups and non-locality; * classical simulation of quantum circuits; categorical topological quantum computation; graphical calculus for measurements and channels; generalized probabilistic theories; convex operational models and non-locality; * quantum cellular automata (QCA); QCAs and causality; higher types in quantum computing; quantum logics and quantum machines; colagebraic methods; Confirmed lecturers include (more to be announced closer to date): Samson Abramsky (Oxford), Pablo Arrighi (Grenoble), Howard Barnum (Perimeter), Jonathan Barrett (Bristol, TBC), Dan Browne (UCL - London), Bob Coecke (Oxford), Ross Duncan (Oxford), Joe Fitzsimons (Oxford), Akimasa Miyake (Perimeter), Prakash Panangaden (McGill), Simon Perdrix (Grenoble), Peter Selinger (Dalhousie), Maarten van den Nest (Max-Planck, TBC), Reinhard F. Werner (Hannover) If you are interested in attending the QICS School please write Ross Duncan . Please feel free to forward this message to your group or on relevant local mailing lists. --------- Satellite workshop: Quantum Physics and Logic, May 29-30. http://web.comlab.ox.ac.uk/people/Bob.Coecke/QPL_10.html Invited speakers: - John Baez (UCR & Singapore) - Louis Crane (Kansas State) - Benjamin Schumacher (Kenyon College) PC chairs: - Bob Coecke (Oxford) - Prakash Panangaden (McGill) - Peter Selinger (Dalhousie) From txa at Cs.Nott.AC.UK Sun Mar 28 17:37:37 2010 From: txa at Cs.Nott.AC.UK (Thorsten Altenkirch) Date: Mon, 29 Mar 2010 06:37:37 +0900 Subject: [TYPES/announce] DEPENDENTLY TYPED PROGRAMMING 2010 (CFP) Message-ID: <0AFC538B-B8C2-4C97-B67C-0C42842A0EAA@Cs.Nott.AC.UK> (s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)-> DTP 2010 --- 2nd Call for Talks Workshop on DEPENDENTLY TYPED PROGRAMMING Edinburgh, Scotland, 9&10 July 2010 (a FLoC workshop, affiliated with LICS) http://sneezy.cs.nott.ac.uk/darcs/dtp10/ NOTE: EARLIER DEADLINE FOR TALK TITLES (FRIDAY 16 APRIL) (s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)-> Dependently typed programming is here today: where will it go tomorrow? We invite contributed talks for the latest in a series of workshops on dependently typed programming which started in 1999. The workshop will have two invited talks --- from Ana Bove and Matthieu Sozeau --- and however many contributed talks you contribute. We expect there will be plenty of provocation, and plenty of time for discussion. If you want to volunteer a talk or a demo at the workshop, please send us a title and abstract before Friday 16 April 2010 at dtp10 at cs.nott.ac.uk. PLEASE LET US KNOW BEFORE 16 APRIL WHETHER YOU WANT TO GIVE A TALK (IF POSSIBLE WITH TITLE). Slots will be at least 30 minutes (unless you ask for less), and we hope to fit everyone in. Clearly, if we're overwhelmed, we'll be very pleased, and we'll have to think again. We've moved the deadline forward to get as much information as possible into the general FLoC programme, but we still want to give space to as many fresh ideas as possible. We'll correspondingly schedule plenty of time for structured discussion and continue to respond constructively to proposals for provocation which reach us by our original deadline of Friday 4 June. We plan to organize a special issue of Fundamenta Informaticae to contain refereed papers related to the topic of the workshop. In a nutshell, what: Dependently Typed Programming 2010 where: Edinburgh, Scotland when: 9&10 July, 2010 invited: Ana Bove, Matthieu Sozeau requested: titles and abstracts for contributed talks and demos slot time: 30 minutes deadlines: 16 April 2010 (for inclusion in FLoC programme), 4 June 2010 (for last minute inspiration) afterwards: refereed selected postproceedings in FI We look forward to an exciting two days exploring the very latest activity in this growing and challenging field. In fact, in type-theoretic style, we can hardly contain ourselves. All the best Thorsten and Conor -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100328/22372907/attachment.htm From laurent.vigneron at loria.fr Mon Mar 29 08:25:11 2010 From: laurent.vigneron at loria.fr (Laurent Vigneron) Date: Mon, 29 Mar 2010 14:25:11 +0200 Subject: [TYPES/announce] UNIF 2010: submission deadline extended Message-ID: <4BB09C27.50208@loria.fr> Dear colleagues, As requested by several authors, the submission deadline of the 24th International Workshop on Unification has been extended to 4 April. So, you have one more week for submitting a 5 pages abstract related to one of the following topics: * General E-unification and calculi * Narrowing * Matching algorithms * Special unification algorithms * Higher-order and nominal unification * Constraint solving * Disunification * Combination problems * Complexity analysis * Implementation techniques * Applications: type checking and reconstruction, automated theorem proving, programming language design, etc. For submission (and workshop information), http://www.dcs.kcl.ac.uk/staff/maribel/UNIF.html Best regards, Laurent Vigneron. UNIF 2010 PC member From francesco.zappa.nardelli at gmail.com Tue Mar 30 02:51:02 2010 From: francesco.zappa.nardelli at gmail.com (Francesco Zappa Nardelli) Date: Tue, 30 Mar 2010 08:51:02 +0200 Subject: [TYPES/announce] summer school on Coq In-Reply-To: <15d5f0d81003290644n1e244444rf1f56c408ea33e92@mail.gmail.com> References: <15d5f0d81003290644n1e244444rf1f56c408ea33e92@mail.gmail.com> Message-ID: <15d5f0d81003292351w594729c8naf41f841d7a34c19@mail.gmail.com> Dear all, I'd like to announce a CEA-EDF-INRIA summer school on: ? ?Modelling and verifying algorithms in Coq: an introduction 7- 11 juin 2010 - INRIA Paris, France. Objectives The Coq system provides a functional programming language and a reasoning framework based on higher order logic to perform proofs on the programs. The expressive power of the language is such that advanced notions of mathematics (such as the graph theory in the four color theorem) or programs of high complexity (such as a compiler for a significant kernel of the C Programming language) can be described formally. In this school, we address the basic programming techniques and approaches to prove properties of the programs. The covered notions involve structural recursive programming, list and integer handling, proof by induction, in the key definition of data-types, pattern matching constructs and case-based reasoning, and inductive properties. Audience This school is a 5 days course for students, researchers and engineers. Participants should be familiar with programming (in C, Java, or ML). Participants are invited to bring their own laptop to profit of the afternoon exercise sessions. Speakers Yves Bertot ? ? INRIA Pierre Cast?ran ?LABRI, Universit? de Bordeaux Pierre Letouzey Universit? de Paris VII et INRIA Assia Mahboubi ?INRIA Venue The school will be held in Paris, France at the new "Antenne Parisienne" of INRIA (23, avenue d'Italie, 75013 Paris). ?The school fees include lunches but no accommodation in provided. ?A list of hotels is available upon request. On the web http://www.inria.fr/actualites/colloques/cea-edf-inria/2010/model-algo/index.en.html http://www.inria.fr/actualites/colloques/cea-edf-inria/2010/model-algo/programme.en.html For information, please contact symposia at inria.fr. Best regards ?Francesco Zappa Nardelli From venneri at dsi.unifi.it Tue Mar 30 05:37:36 2010 From: venneri at dsi.unifi.it (Betti Venneri) Date: Tue, 30 Mar 2010 11:37:36 +0200 Subject: [TYPES/announce] Extended Deadline: ITRS 2010 Message-ID: <4BB1C660.4030400@dsi.unifi.it> ========================================================================== ***Submission deadline extended to April 12, 2010*** **ITRS 2010** Fifth Workshop on Intersection Types and Related Systems (A FLoC workshop affiliated with LICS 2010) July 9, 2010, Edinburgh, UK http://gdn.dsi.unifi.it/itrs/ ========================================================================== Call for papers: http://gdn.dsi.unifi.it/itrs/index.php/call-for-papers/ TOPICS Possible topics for submitted papers include, but are not limited to: * Formal properties of systems with intersection types. * Results for related systems, such as union types, refinement types, or singleton types. * Applications to lambda calculus and similar systems. * Applications to pi-calculus and similar systems. * Applications for programming languages. * Applications for other areas, such as database query languages and program extraction from proofs. * Related approaches using behavioural types to characterize computational properties. SUBMISSIONS The submission is in two stages. (1) Before the workshop, authors are invited to submit an extended abstract (max. 10 pages) in PDF format, using the Easychair submission site http://www.easychair.org/conferences/?conf=itrs2010. Accepted papers will be presented at the workshop and included in the preliminary proceedings, which will made available in electronic form. (2) After the workshop, authors of accepted papers will be invited to submit full versions, which will be referred for inclusion in final post-proceedings. The post-proceedings will be published as a special issue of Electronic Proceedings in Theoretical Computer Science (EPTCS). Submissions must be prepared in LaTeX using the EPTCS macro package (http://style.eptcs.org/). IMPORTANT DATES Submission deadline (extended): April 12, 2010 Author notification: April 30, 2010 Final version for preliminary proceedings: May 26, 2010 Workshop: July 9, 2010 Submission for EPTC Post-Proceedings: September 30, 2010 (TBC) PROGRAM COMMITTEE Mariangiola Dezani-Ciancaglini (Univ.di Torino) Joshua Dunfield (McGill Univ. Montreal) Silvia Ghilezan (Univ. of Novi Sad) Atsushi Igarashi (Kyoto Univ.) Elaine Pimentel (Belo Horizonte Univ.) Betti Venneri (Univ. di Firenze) Chair Joe Wells (Heriot-Watt Univ.Edinburgh). ______________________________________________ From icfp.publicity at googlemail.com Tue Mar 30 08:34:10 2010 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Tue, 30 Mar 2010 14:34:10 +0200 Subject: [TYPES/announce] ICFP 2010 deadline Message-ID: <53ff55481003300534g4c12aaafw4630ce1798c0e74f@mail.gmail.com> On behalf of Stephanie Weirich, this year's PC Chair, I would like to emphasize that the deadline for ICFP this year is at *14:00 UTC*. You may want to double check what time this is using the following link: http://www.timeanddate.com/worldclock/fixedtime.html?day=2&month=4&year=2010&hour=14&min=0&sec=0&p1=0 Submission is already open through: http://icfp2010.seas.upenn.edu/ All the best, Wouter From pmt6sbc at maths.leeds.ac.uk Wed Mar 31 04:48:02 2010 From: pmt6sbc at maths.leeds.ac.uk (S Barry Cooper) Date: Wed, 31 Mar 2010 09:48:02 +0100 (BST) Subject: [TYPES/announce] Funding opportunity - Foundational Questions Message-ID: ___________________________________________________________________________ Foundational Questions in the Mathematical Sciences There is a grant opportunity in: A) foundations of: mathematics, mathematical sciences, computer science; B) artificial intelligence; C) closely related fields. The John Templeton Foundation accepts research proposals that directly or indirectly address one of the following questions: (1) What are the limits of mathematics in advancing human knowledge? (2) What have the difficulties of AI taught us about the nature of mind and intelligence? Deadline for the initial inquiry is April 15, 2010. For more information, please visit http://www.amsta.leeds.ac.uk/~pmt6sbc/templeton.pdf or http://bit.ly/aMwinQ Please feel free to pass the information on to others who might be interested in the grant opportunity. ___________________________________________________________________________ From prakash at cs.mcgill.ca Wed Mar 31 08:29:45 2010 From: prakash at cs.mcgill.ca (Prakash Panangaden) Date: Wed, 31 Mar 2010 08:29:45 -0400 Subject: [TYPES/announce] Deadline Extension for DCM 2010, FLoC affiliated workshop Message-ID: <4BB34039.1010501@cs.mcgill.ca> ========================================================================= ** DCM 2010 - EXTENSION OF DEADLINE * DCM 2010 - EXTENSION OF DEADLINE ** ========================================================================= Final Call for Papers DCM 2010 6th International Workshop on Developments in Computational Models ** Causality, Computation, and Physics ** http://www.amsta.leeds.ac.uk/~pmt6sbc/DCM10/ Edinburgh, Scotland 9-10 July 2010 EXTENDED DEADLINE FOR SUBMISSIONS: FRIDAY 9th APRIL, 2010 A satellite event of FLoC - http://www.floc-conference.org/ ========================================================================= INVITED SPEAKERS: Cristian Calude (Auckland, New Zealand) Lucien Hardy (Perimeter Institute, Canada) Russ Harmer (Paris/Harvard) Gordon Plotkin (Edinburgh) Vlatko Vedral (Oxford) IMPORTANT DATES: Submission deadline for extended abstracts: 9th April, 2010 Notification: 26 April Workshop: 9-10 July, 2010 After the workshop, full versions of selected papers will be invited for a special issue of the internationally leading journal Mathematical Structures in Computer Science (MSCS). ========================================================================= DCM 2010 is the sixth in a series of international workshops focusing on new computational models. It aims to bring together researchers who are currently developing new computational models or new features of a traditional one. And to foster interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. DCM 2010 will be a two-day satellite event of FLoC 2010, with a special focus on the theme 'Causality, Computation, and Physics'. Day 2 of the Workshop will have an emphasis on quantum computation and physics, held as Quantum Information Science Scotland (QUISCO), and is co-sponsored by Scottish Universities Physics Alliance (SUPA) and Scottish Informatics and Computer Science Alliance (SICSA). Topics of interest include all abstract models of computation and their properties, and their applications to the development of programming languages and systems: - quantum computation, including implementations and formal methods in quantum protocols; - probabilistic computation and verification in modelling situations; - chemical, biological and bio-inspired computation, including spatial models, self-assembly, growth models; - general concurrent models including the treatment of mobility, trust, and security; - information-theoretic ideas in computing. ========================================================================= PLEASE SUBMIT an extended abstract (of around 12 pages or less) in PDF format to the conference EasyChair submission page: https://www.easychair.org/login.cgi?conf=dcm2010 by the deadline: 9th April, 2010. Accepted contributions will appear in a pre-proceedings special issue of the EPTCS (Electronic Proceedings in Theoretical Computer Science). ========================================================================= PROGRAMME COMMITTEE: S Barry Cooper (Leeds, Co-chair) Prakash Panangaden (McGill, Co-chair) Elham Kashefi (Edinburgh, Chair QUISCO 2010) Paola Bonizzoni (Milan) Olivier Bournez (Paris) Vincent Danos (Edinburgh, CNRS) Mariangiola Dezani (Torino) Andreas Doering (Oxford) Maribel FernC!ndez (London) Joseph Fitzsimons (Oxford) Ivette Fuentes-Schuller (Nottingham) Simon Gay (Glasgow) Jean Krivine (Paris) Ian Mackie (Ecole Polytechnique) Damian Markham (Paris) Daniel Oi (Strathclyde) Simon Perdrix (Edinburgh and Paris) Susan Stepney (York) John Tucker (Swansea) ========================================================================= Further information: Barry Cooper, pmt6sbc at leeds.ac.uk, Prakash Panangaden prakash at cs.mcgill.ca ========================================================================= From mwh at cs.umd.edu Wed Mar 31 16:53:26 2010 From: mwh at cs.umd.edu (Michael Hicks) Date: Wed, 31 Mar 2010 16:53:26 -0400 Subject: [TYPES/announce] Program Director positions (programming languages & formal methods) application deadline May 3, 2010 References: <121A92FE9A85CD458BF1825AAFB7B29C031CAA08@NSF-BE-03.ad.nsf.gov> Message-ID: <908873E4-6932-42A1-9901-9425F8E80713@cs.umd.edu> The US National Science Foundation funds much of the research in the US on programming languages and type systems. Per the e-mail below (which Dr. Greenspan agreed that I could forward), the NSF is looking to hire new program directors in this area. If US readers of this list are interested in serving the research community in this capacity, that would be great! Cheers, -Mike Begin forwarded message: > From: "Greenspan, Sol J." > Date: March 28, 2010 4:13:24 PM EDT > To: > Subject: Program Director positions (programming languages & formal methods) application deadline May 3, 2010 > > Dear Mike, > > I want to call your attention to a new job posting at http://jobview.usajobs.gov/GetJob.aspx?OPMControl=1832220 which seeks three program directors for the Software and Hardware Foundations program. As stated there: ?While the SHF program covers a number of topic areas, we are currently seeking 3 Program Directors, one with expertise in the area of Computer Architecture, one in Software Engineering with an emphasis on Formal Methods, and one with expertise in Programming Languages and Compilers.? > > Serving as a program director at NSF is an opportunity for a productive/successful researcher to expand horizons by serving the research community and influence future directions of the field. Program directors tend to meet a lot of people and learn about a wide variety of research activities and funding mechanisms. It?s a lot of fun, and the more you take on, the more fun it is. > > The application deadline is May 03, 2010. An application is simple to submit: just a CV with a cover letter stating your interest in a position. > > It is extremely important to find members of the community who want to serve and will do a good job. Please forward this email to friends and colleagues. > > > If anyone reading this message has questions, feel free to call me or send me an email. > > > Thanks. > > Sol > > Sol J. Greenspan, PhD > > Program Director > > Division of Computing and Communication Foundations > > Directorate for Computer and Information Science and Engineering (CISE) > > sgreensp at nsf.gov > > 703-292-7841 > -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100331/9984a8e3/attachment-0001.htm From gmb at microsoft.com Thu Apr 1 09:26:45 2010 From: gmb at microsoft.com (Gavin Bierman) Date: Thu, 1 Apr 2010 13:26:45 +0000 Subject: [TYPES/announce] Multiparadigm Programming with OO Languages (MPOOL) Workshop - Call for papers Message-ID: We apologize if you receive this CfP multiple times ---------------------------------------------------- SECOND CALL FOR CONTRIBUTIONS AND PARTICIPATION Workshop on MULTIPARADIGM PROGRAMMING WITH OO LANGUAGES (MPOOL 2010) at the EUROPEAN CONFERENCE ON OBJECT-ORIENTED PROGRAMMING (ECOOP 2010) 21 or 22 July 2010, Maribor, Slovenia While OO has become ubiquitously employed for design, implementation, and even conceptualization, many practitioners recognize the concomitant need for other programming paradigms according to problem domain. We seek answers to the question of how to address the need for other programming paradigms--or even domain specific languages--in the general context of OO languages. Can OO programming languages effectively support other programming paradigms or the embedding of other languages? The answer seems to be affirmative, at least for some paradigms. For example, significant progress has been made for the case of functional programming in C++. Additionally, several efforts have been made to integrate support for other paradigms as a front-end for OO languages (the Pizza language, extending Java, is a prominent example). Libraries and extensions for concurrency are also being developed for new and upcoming multi-core and heterogeneous architectures. This workshop seeks to bring together practitioners and researchers in this developing field to `compare notes' on their work--describe existing, developing, or proposed techniques, idioms, methodologies, language extensions, or software for expressing non-OO paradigms in OO languages; or theoretical work supporting or defining the same. High-level presentations of position are welcome, and reports of work in progress, are welcome. Specific areas of interest include, but are not limited to: - non-OO programming with OO languages; - merging functional/logic/OO/other programs (language crossbinding); - non-OO programming at the meta level (e.g. template metaprogramming); - techniques for language embeddings (e.g. multistage programming); - language embedding in OO languages (domain specific languages - DSLs) - module systems vs. object systems; - OO design patterns and their relation to functional patterns; - multiparadigm and multilingual programming in the .NET framework; - type system relationships across languages; - theoretical foundations of multiparadigm programming with OO languages; - multiparadigm approaches to support emerging hardware architectures (e.g. multi/many-core CPUs, GPGPUs, IBM Cell, etc). The workshop will consist of short presentations with interspersed discussion sessions, and longer general discussions of themes or topics derived from some common element of subsets of presentations. We expect the majority of the participants to give presentations. Prospective participants may submit either presentation abstracts or full papers. All accepted materials will be distributed at the workshop, made available at the MPOOL 2010 Web site and will nbe published by the ACM Digital Library. Papers need to be formatted accordingly -- see http://www.acm.org/sigs/publications/proceedings-templates for details. For authors of accepted presentations who require justification for travel the organizers can provide official letters of invitation. SUBMISSION PROCEDURE Prospective authors are invited to submit abstracts or full papers in PDF, postscript, or Microsoft Word. Authors of accepted papers are responsible for submitting the final version using an appropriate ACM template to ensure inclusion in the proceedings. Submission and email correspondence to mpool10 at multiparadigm.net . AUTHORS' SCHEDULE May 4th, 2008: Abstracts due. May 19th, 2008: Notification of acceptance. ORGANIZATION This workshop is a joint organization by the University of Applied Sciences, Regensburg, Germany, and the Los Alamos National Laboratory, USA. ORGANIZERS / PROGRAMME COMMITTEE Gerald Baumgartner (Louisiana State University, Louisiana, USA) Gavin Bierman (Microsoft Research, UK) Kei Davis (Los Alamos National Laboratory, New Mexico, USA) Zoltan Horvath (University Eotvos Lorand of Sciences, Budapest, Hungary) Jaakko Jarvi (Texas A&M University, Texas, USA) Herbert Kuchen (University of Muenster, Germany) Philippe Narbel (University of Bordeaux I, France) Joerg Striegnitz (University Of Applied Sciences Regensburg, Germany) FURTHER INFORMATION More information is available at http://www.multiparadigm.net From tfpc at bachman.cs.ou.edu Fri Apr 2 13:32:34 2010 From: tfpc at bachman.cs.ou.edu (TFP 2010) Date: Fri, 2 Apr 2010 12:32:34 -0500 (CDT) Subject: [TYPES/announce] TFP 2010 - Final Call: Submission deadline one week away, April 9 Message-ID: TFP 2010: 11th SYMPOSIUM ON TRENDS IN FUNCTIONAL PROGRAMMING May 17-19, 2010 University of Oklahoma http://www.cs.ou.edu/tfp2010/ (web search: "tfp 2010") TFP 2010 is an international forum for researchers with interests in any aspect of functional programming. Papers must be submitted by April 9, one week from today. Acceptance notifications will go out April 15. Early (reduced rate) registration closes April 16, two weeks from today. SUBMISSION and REGISTRATION DEADLINES April 9: Submission deadline April 15: Acceptance notification April 16: Early registration closes ($350, $200 for students) May 7: Late registration deadline ($425) May 17-19: TFP Symposium POST-SYMPOSIUM PROCEEDINGS Springer series: Lecture Notes in Computer Science Details about the event schedule, symposium scope, submissions, and registration may be found on the symposium website. http://www.cs.ou.edu/tfp2010/ (Web search: "tfp 2010") In addition to the symposium's stimulating presentations and discussions, highlights include an invited talk by J Strother Moore, an outing to view the superb collection of art of the American West at the Cowboy Hall of Fame, and a festive banquet. Submitted papers and extended abstracts are reviewed for presentation at the symposium, and a formal refereeing process after the symposium selects the best presentations for publication in the Springer series, Lecture Notes in Computer Science. We invite you to participate in TFP 2010. REGISTRATION IS OPEN! Register now at reduced rates, and reserve your accommodations. - Rex Page, University of Oklahoma, Program Chair - Viktia Zs and Zolt Horvath, Ev Lord University, Symposium Co-Chairs Sponsors: Erlang Solutions Ltd The University of Oklahoma, School of Computer Science From kutsia at risc.uni-linz.ac.at Fri Apr 2 14:30:24 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Fri, 2 Apr 2010 20:30:24 +0200 Subject: [TYPES/announce] LOPSTR'10: New deadline for extended abstract submission Message-ID: <20100402183024.GA23813@risc.uni-linz.ac.at> ========================================================================= 20th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2010 http://www.risc.uni-linz.ac.at/conferences/lopstr2010/ Hagenberg, Austria, July 23-25, 2010 (co-located with PPDP 2010) ========================================================================= New deadline for extended abstract submission: April 7, 2010 From vxc at Cs.Nott.AC.UK Sat Apr 3 04:03:38 2010 From: vxc at Cs.Nott.AC.UK (Venanzio Capretta) Date: Sat, 03 Apr 2010 09:03:38 +0100 Subject: [TYPES/announce] MSFP: last call for papers Message-ID: <4BB6F65A.8080807@cs.nott.ac.uk> FINAL CALL FOR PAPERS Third Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING 25 September 2010, Baltimore, USA A satellite workshop of ICFP 2010 PRESENTATION The workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Monadic programming in Haskell is the paradigmatic example, but there are many more mathematical insights manifest in programs and in programming language design: Freyd-categories in reactive programming, symbolic differentiation yielding context structures, and comonadic presentations of dataflow, to name but three. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006. Selected papers were published as a special issue of the Journal of Functional Programming (volume 19, issue 3-4). The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP 2008. INVITED SPEAKERS Martin Escardo, University of Birmingham, UK Amy Felty, University of Ottawa, Canada SUBMISSIONS Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Programme Committee members, barring the co-chairs, may (and indeed are encouraged to) contribute. Accepted papers must be presented at the workshop by one of the authors. There is no specific page limit, but authors should strive for brevity. We are using the EasyChair software to manage submissions. To submit a paper, please log in at: http://www.easychair.org/conferences/?conf=msfp2010 The workshop proceedings will be published by ACM. TIMELINE: Submission of abstracts: 9 April Submission of papers: 16 April Notification: 28 May Final versions due: 25 June Workshop: 25 September For more information about the workshop, go to: http://cs.ioc.ee/msfp/msfp2010/ Programme Committee * Andreas Abel, LMU Munich, Germany * Ana Bove, Chalmers University of Technology, Gothenburg, Sweden * Andrej Bauer, University of Ljubljana, Slovenia * Venanzio Capretta (co-chair), University of Nottingham, UK * James Chapman (co-chair), Institute of Cybernetics, Tallinn, Estonia * Adam Chlipala, Harvard University, Cambridge, MA, USA * Catarina Coquand, Chalmers University of Technology, Gothenburg, Sweden * Manuel Alcino Cunha, Universidade do Minho, Braga, Portugal * Andy Gill, University of Kansas, USA * Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina * Oleg Kiselyov, FNMOC, Monterey, California, USA * Lionel Elie Mamane, Radboud University Nijmegen, The Netherlands * Conor McBride, University of Strathclyde, Glasgow, UK * Greg Morrisett, Harvard University, Cambridge, MA, USA * Russell O'Connor, McMaster University, Hamilton, Ontario, Canada * Benoit Razet, TIFR (Tata Institute of Fundamental research), India * Carsten Schrmann, IT University of Copenhagen, Denmark * Wouter Swierstra, Chalmers University of Technology, Gothenburg, Sweden * Tarmo Uustalu, Institute of Cybernetics, Tallinn, Estonia * Varmo Vene, University of Tartu, Estonia From miculan at dimi.uniud.it Sat Apr 3 04:55:29 2010 From: miculan at dimi.uniud.it (Marino Miculan) Date: Sat, 3 Apr 2010 10:55:29 +0200 Subject: [TYPES/announce] LFMTP 2010 at FLoC: extended deadline Message-ID: <7A396F34-DE8A-490D-919E-A81DB19743E9@dimi.uniud.it> [Apologies for multiple copies] 5th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'10) July 14, 2010, Edinburgh, Scotland, UK Part of the Federated Logic Conference Affiliated with Logic in Computer Science (LICS 2010) *** New submission deadline: April 7, 2010 *** More details at http://lfmtp10.dimi.uniud.it -- Marino Miculan - Dept Math Compu Sci, University of Udine miculan at dimi.uniud.it http://www.dimi.uniud.it/miculan/ From zambon at cs.utwente.nl Sat Apr 3 11:32:28 2010 From: zambon at cs.utwente.nl (Eduardo Zambon) Date: Sat, 03 Apr 2010 17:32:28 +0200 Subject: [TYPES/announce] Final Call for Papers: ICGT 2010 -- Abstract submission: 9 Apr '10 Message-ID: <4BB75F8C.9070007@cs.utwente.nl> [Our apologies for multiple receptions of this message.] -------------------------------------------------------------------------------- 5th International Conference on Graph Transformation (ICGT 2010) University of Twente, Enschede, The Netherlands 29 September - 1 October 2010 ---------------------------------------------- Final Call for Papers The 5th International Conference on Graph Transformation (ICGT 2010) will be held at the University of Twente in Enschede (The Netherlands) in the last week of September 2010. It continues the line of conferences previously held in Barcelona (Spain) in 2002, Rome (Italy) in 2004, Natal (Brazil) in 2006 and Leicester (UK) in 2008, as well as a series of six International Workshops on Graph Transformation with Applications in Computer Science between 1978 and 1998. The conference takes place under the auspices of EATCS, EASST, and IFIP WG 1.3. Awards will be given by EATCS and EASST for the best theoretical and application-oriented papers. Proceedings will be published by Springer in the Lecture Notes in Computer Science series (http://www.springer.com/lncs). ICGT 2010 will be colocated with the SPIN 2010 workshop on Software Model Checking, and will also host several satellite events. Invited Speakers ================ We are pleased to announce the following invited speakers: - Javier Esparza, University of Munich (joint keynote speaker with SPIN 2010) - Krzysztof Czarnecki, University of Waterloo - Christoph Brandt, University of Luxembourg Satellite events ================ The following workshops will take place as ICGT satellite events: - 3rd Workshop on Graph Computation Models (GCM 2010) - 6th International Workshop on Graph-Based Tools (GraBaTs 2010) - 4th Workshop on Petri Nets and Graph Transformations (PNGT 2010) - Workshop and Tutorial on Natural Computing (WTNC 2010) Scope ===== Graphs are among the simplest and most universal models for a variety of systems, not just in computer science, but throughout engineering and the life sciences. When systems evolve we are interested in the way they change, to predict, support, or react to their evolution. Graph transformation combines the idea of graphs as a universal modelling paradigm with a rule-based approach to specify evolution. The area is concerned with both the theory of graph transformation and their application to a variety of domains. The conference aims at bringing together researchers and practitioners interested in the foundations and application of graph transformation to a variety of areas. Topics of interest include, but are not limited to * Foundations and theory of o General models of graph transformation o High-level and adhesive replacement systems o Node-, edge-, and hyperedge replacement grammars o Parallel, concurrent, and distributed graph transformation o Term graph rewriting o Hierarchical graphs and decompositions of graphs o Graph theoretical properties of graph languages o Geometrical and topological aspects of graph transformation o Automata on graphs and parsing of graph languages o Analysis and verification of graph transformation systems o Structuring and modularization concepts for transformation systems o Graph transformation and Petri nets * Languages, tool support and applications in o Software architecture o Workflows and business processes o Software quality, testing and evolution o Access control and security models o Aspect-oriented development o Model-driven development, especially model transformations o Domain-specific languages o Implementation of programming languages o Bioinformatics and system biology o Natural computing o Image generation and pattern recognition techniques o Massively parallel computing o Self-adaptive systems and ubiquitous computing o Service-oriented applications and semantic web Paper submission is at http://www.easychair.org/conferences/?conf=icgt2010. Submitted papers may not exceed fifteen (15) pages using Springer's LNCS format (http://www.springer.com/lncs), and should contain original research. Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. Selected papers will be invited for submission to special issues of Fundamenta Informaticae (for theoretically oriented papers) and Software and Systems Modeling (for application-oriented papers). Important Dates: ================ Abstract submission: 9 April 2010 Full paper submission: 16 April 2010 Notification of acceptance: 7 June 2010 Final version due: 28 June 2010 Main conference: 29 September - 1 October 2010 Satellite events: 28 September and 2 October 2010 Venue: ====== The University of Twente is located in a beautiful green area between the cities of Hengelo and Enschede, in the eastern part of The Netherlands. It has good connections to the airports of Schiphol (Amsterdam, The Netherlands) and M?nster (Germany). The main town, Enschede, lies directly on the Dutch/German border, and it is a characteristic, modern and lively university town. Elegant historic buildings in the town and surrounding area are evocative of Enschede's rich textile past. Some of the town's most notable monuments are the beautiful town hall, several beautiful churches and a unique synagogue. The University of Twente is an entrepreneurial research university. It was founded in 1961 and offers education and research in areas ranging from public policy studies and applied physics to biomedical technology. The UT is the Netherlands' only campus university. It counts in the order of 10,000 students. Programme Committee: ==================== - Paolo Baldan, University of Padova (Italy) - Luciano Baresi, University of Milano (Italy) - Michel Bauderon, University of Bordeaux (France) - Artur Boronat, University of Leicester (UK) - Paolo Bottoni, University of Rome La Sapienza (Italy) - Andrea Corradini, University of Pisa (Italy) - Juan de Lara, Autonomous University of Madrid (Spain) - Hartmut Ehrig, Technical University of Berlin (Germany) - Gregor Engels, University of Paderborn (Germany) - Claudia Ermel Technical University of Berlin (Germany) - Holger Giese, University of Potsdam (Germany) - Annegret Habel, University of Oldenburg (Germany) - Reiko Heckel, University of Leicester (UK) - Dirk Janssens, University of Antwerp (Belgium) - Garbor Karsai, Vanderbilt University (USA) - Ekkart Kindler, Technical University of Denmark (Denmark) - Barbara Koenig, University of Duisburg-Essen (Germany) - Hans-J?rg Kreowski, University of Bremen (Germany) - Ralf L?mmel, University of Koblenz (Germany) - Mark Minas, Universit?t der Bundeswehr M?nchen (Germany) - Ugo Montanari, University of Pisa (Italy) - Mohamed Mosbah, University of Bordeau (France) - Manfred Nagl, RWTH Aachen University (Germany) - Fernando Orejas, Technical University of Catalonia (Spain) - Francesco Parisi-Presicce, University of Rome La Sapienza (Italy) - Rinus Plasmeijer, Radboud University (The Netherlands) - Detlef Plump, University of York (UK) - Arend Rensink (PC co-chair), University of Twente (The Netherlands) - Leila Ribeiro, Federal University of Rio Grande do Sul (Brazil) - Andy Sch?rr (PC co-chair), Technische Universit?t Darmstadt (Germany) - Gabriele Taentzer, University of Marburg (Germany) - Pieter Van Gorp, Technical University of Eindhoven (The Netherlands) - D?niel Varr?, Budapest University of Technology and Economics (Hungary) - Gergely Varr?, Budapest University of Technology and Economics (Hungary) - Jens-Holger Weber-Jahnke, University of Victoria (USA) - Albert Z?ndorf, University of Kassel (Germany) Organisation ============ Program Chairs - Arend Rensink , University of Twente, The Netherlands - Andy Sch?rr , Technische Universit?t Darmstadt, Germany Local Organisation - Maarten de Mol , University of Twente, The Netherlands Publicity Chair: - Eduardo Zambon , University of Twente, The Netherlands Workshop Chair: - Amir Ghamarian , University of Twente, The Netherlands Further information can be found at: http://www.utwente.nl/icgt2010 -------------------------------------------------------------------------------- From michaelw at cs.utwente.nl Tue Apr 6 05:26:04 2010 From: michaelw at cs.utwente.nl (Michael Weber) Date: Tue, 6 Apr 2010 11:26:04 +0200 Subject: [TYPES/announce] SPIN 2010 Last Call for Papers Message-ID: <4A478930-927C-4C8C-9078-0611E5598FB2@cs.utwente.nl> 17th International SPIN Workshop on Model Checking of Software September 27--29, 2010, University of Twente, The Netherlands URL: Co-located with: ICGT 2010 , PDMC+HiBi 2010, NEWS ==== Invited speakers are confirmed: * Javier Esparza, Technical University of Munich, Germany (joint keynote speaker with ICGT 2010) * Alessandro Cimatti, FBK-IRST, Italy * Darren Cofer, Rockwell Collins, USA Aim and Scope ============= The SPIN workshop is a forum for practitioners and researchers interested in state space-based techniques for the validation and analysis of software systems. The focus of the workshop is on theoretical advances and empirical evaluations based on explicit representations of state spaces, as implemented in the SPIN model checker or other tools, or techniques based on combinations of explicit and other symbolic representations. We welcome papers describing the development and application of state-space and path-exploration techniques for the testing and the verification of security-critical software, enterprise and web applications, embedded software, and other interesting software platforms. The workshop aims to encourage interactions and exchanges of ideas with all related areas in software engineering. Topics of Interest include (but are not limited to): ==================================================== * Algorithms and storage methods for explicit-state model checking * Theoretical and algorithmic foundations of model-checking based analysis * Directed model checking using heuristics * Parallel or distributed model checking * Model checking of timed and probabilistic systems * Abstraction and symbolic execution techniques in relation to software verification * Static analysis for state space reduction * Combinations of enumerative and symbolic techniques * Analysis for modeling languages, such as UML/state charts * Property specification languages, including new forms of temporal logic * Model checking for various programming languages and code analysis * Automated testing using state space and/or path exploration techniques * Derivation of specifications, test cases, or other useful material from state spaces * Combination of model-checking techniques with other analysis techniques * Modularity and compositionality * Comparative studies, including comparisons with other model-checking techniques * Case studies of interesting systems or with interesting results * Engineering and implementation of model-checking tools and platforms * Benchmarks for software verification Solicited Contributions ======================= We solicit two kinds of papers: * TECHNICAL PAPERS. These papers should contain original work which has not been submitted or accepted for publication elsewhere. Submissions should adhere to the LNCS format and should be no longer than 18 pages. * TOOL PAPERS. These papers should describe novel tools or tool extensions. If previous versions of the described tool have been published before, the novel features of the tool should be explained clearly. These papers should also specify availability of the tool, number of users, and applications/case studies. Tool paper submissions should consist of two parts. The first part is at most 5 pages in LNCS format. The name "Tool Presentation" should appear in the title. If accepted, this 5 page paper will be published in the workshop proceedings. The second part should describe an informal plan for the oral presentation of the tool. This part will not be included in the proceedings. If accepted, both regular and tool papers will be presented at the conference and will be included in the workshop proceedings. At least one author of each accepted paper is expected to be present at the conference. Submissions are held confidential until publication. Submission and Publication ========================== As in previous years, the proceedings of this edition of the workshop will appear in Lecture Notes in Computer Science. Important Dates =============== Abstract submission: April 9, 2010 Paper submission: April 16, 2010 Notification of acceptance: June 7, 2010 Final papers due: June 28, 2010 Workshop: September 27--29, 2010 ORGANIZATION ============ Program Chairs: Jaco van de Pol, U Twente, Netherlands Michael Weber, U Twente, Netherlands Program Committee: Dragan Bosnacki (TU Eindhoven, The Netherlands) Jiri Barnat (Masaryk University Brno, Czech Republic) Stefan Edelkamp (University of Bremen, Germany) Patrice Godefroid (Microsoft Research, Redmond, USA) Ganesh Gopalakrishnan (University of Utah, USA) Jan Friso Groote (TU Eindhoven, The Netherlands) Orna Grumberg (Technion, Israel) Gerard Holzmann (NASA/JPL, USA) Radu Iosif (Verimag Grenoble, France) Stefan Leue (University of Konstanz, Germany) Rupak Majumdar (University of California at Berkeley, USA) Eric G. Mercer (Brigham Young University, USA) Albert Nymeyer (University of New South Wales, Australia) Dave Parker (Oxford Univerisity, UK) Corina Pasareanu (CMU/NASA Ames, USA) Doron Peled (Bar-Ilan University, Israel) Paul Pettersson (Malardalen University, Sweden) Scott Stoller (Stony Brook University, USA) Willem Visser (Stellenbosch University, South Africa) Tomohiro Yoneda (National Institute of Informatics, Japan) Steering Committee: Susanne Graf, VERIMAG, France Gerard Holzmann, JPL, USA Stefan Leue (chair), U Konstanz, Germany Pierre Wolper, U Liege, Belgium -- Michael Weber University of Twente, The Netherlands http://fmt.cs.utwente.nl/~michaelw/ From bengt at chalmers.se Tue Apr 6 10:47:23 2010 From: bengt at chalmers.se (Bengt Nordstrom) Date: Tue, 6 Apr 2010 16:47:23 +0200 Subject: [TYPES/announce] Assistant professorship in Natural Language Technology in Gothenburg, Sweden Message-ID: The following position should be interesting for people in the Types community interested in type theory, language technology and functional programming. * ** * *Assistant Professor * Computer Science, Gothenburg University, Sweden *Deadline for application:* 2010-04-27 The Department of Computer Science and Engineering (CSE, http://www.chalmers.se/cse/EN/) at Chalmers University of Technology and University of Gothenburg announces a position of Assistant Professor with tenure track (Swedish "bitr?dande lektor") in the area of Natural Language Technology ( http://www.cse.chalmers.se/research/group/Language-technology/). The position is associated with the Centre of Language Technology (CLT, http://www.clt.gu.se/), which is a focus area of research of the University of Gothenburg, and affiliated at the CSE Department at the University of Gothenburg and Chalmers University of Technology. Extent of employment The position is for 4 years. Before the end of the 4-year period, the position holder will be evaluated for a tenure as Associate Professor ("lektor"). A suggested start date for the position is September 2010, but can be negotiated with the appointed candidate. Requirements The qualifications for the position include: - PhD in computer science, computational linguistics, or related subject, in 2005 or later - excellent research record in Natural Language Technology - documented experience in university-level teaching - good ability to use English as working language Job description The research in CLT is performed in three areas: grammar technology (including syntax, semantics, machine translation, authoring support, and logic), text technology (including information extraction, lexicology, and corpus studies), and dialogue technology (including speech-based interaction and speech technology). The full CLT has ca 30 members, divided between the departments of CSE, Swedish Language, and Linguistics and Philosophy. The language technology research group at CSE has ca. 10 members. Its focus is on grammar-based methods for machine translation, multilingual resources, localization, and human-computer interaction. The group traditionally works in close connection to type theory, functional programming, and compiler construction. But we are also interested in applicants with strong profiles in statistical methods or speech technology. In addition to a strong publication record, we appreciate the ability to create software. The announced position involves, in the first 4 years, 75% research time in the CSE language technology group and the CLT, plus 25% teaching in computer science on BSc and/or MSc level. In the tenured phase, research and teaching time is dependent on available funding. We follow an equal opportunities policy and will in particular encourage female applicants. Further information of the position can be obtained from Professor Aarne Ranta, email: aarne dot chalmers dot se Application procedure The application shall be written in English and include the following items: 1. A first page containing name, reference number E333 5550/09 and a list of all documents that have been enclosed. 2. Description of the applicant's research and pedagogical qualifications, as well as other qualifications. 3. Curriculum Vitae (CV). 4. Complete list of publications. 5. Plans for future work within the area of the announced position, both scientific and educational, if appointed. 6. Two reference persons who can be contacted by the University of Gothenburg (describe association with them and give their contact addresses). 7. Copies of the applicant's best scientific publications (not more than 5). 8. Documents about software created by the applicant. 9. Copies of a maximum of 5 other publications (such as pedagogy, and popular science) in support of pedagogical and other merits. The applications should be marked with ref no E333 5550/09. Application together with all additional documents must arrive not later than 27 April 2010 and should be addressed to University of Gothenburg, Registrator, Box 100, SE-405 30 G?teborg, Sweden Trade Union Representatives OFR-S Astrid Igerud, +46-31-786 1167, SACO Martin Selander +46-31-786 1987, SEKO Lennart Olsson +46-31786 1173 -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100406/97701c71/attachment.htm From cbraga at ic.uff.br Tue Apr 6 16:24:48 2010 From: cbraga at ic.uff.br (Christiano Braga) Date: Tue, 6 Apr 2010 17:24:48 -0300 Subject: [TYPES/announce] SBLP 2010 Message-ID: <3D41E400-69C2-4E17-BD39-0182865F3A2C@ic.uff.br> [We apologize in advance if you receive multiple copies of this CFP] ============================================================= CALL FOR PAPERS 14th BRAZILIAN SYMPOSIUM ON PROGRAMMING LANGUAGES Salvador, Bahia, Brazil September 27-29, 2010 http://wiki.dcc.ufba.br/CBSOFT/SBLP2010 Abstract Submission: May 17, 2010 Paper Submission: May 24, 2010 ============================================================= The 14th Brazilian Symposium on Programming Languages, SBLP 2010, will be held in Salvador, Bahia, Brazil, on September 27-29, 2010. SBLP provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. This year the symposium will be part of the 1st Brazilian Conference on Software: Theory and Practice, CBSoft 2010, http://wiki.dcc.ufba.br/CBSOFT, which will host three traditional, well-established symposia: * IV Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) * XIV Brazilian Symposium on Programming Languages (SBLP) * XXIV Brazilian Symposium on Software Engineering (SBES) SBLP 2010 invites authors to contribute with Technical Papers and Tutorial Proposals related (but not limited) to: * Programming language design and implementation * Formal semantics of programming languages * Theoretical foundations of programming languages * Design and implementation of programming language environments * Object-oriented programming languages * Functional programming * Aspect-oriented programming languages * Scripting languages * Domain-specific languages * Programming languages for mobile, web and network computing * New programming models * Program transformations * Program analysis and verification * Compilation and interpretation techniques Contributions can be written in Portuguese or English. Papers should have at most 14 pages. All accepted papers will be published in the conference proceedings. Selected papers written in English should be invited for a journal publication. * Best papers will be published as a special issue of the * * Elsevier Journal of Science of Computing Programming * Papers should be presented in the language of submission. Detailed submission guidelines will be available at http://wiki.dcc.ufba.br/CBSOFT/PaperSubmission IMPORTANT DATES Paper abstract submission (15 lines): May 17, 2010 Full paper submission: May 24, 2010 Notification of acceptance: July 09, 2010 Final papers due: August 02, 2010 BEST PAPER AWARD Awards will be given for the best papers at the symposium. GENERAL CHAIR Rita Suzana Pitangueira Maciel, UFBA, Brazil PROGRAMME CHAIR Ricardo Massa F. Lima, UFPE, Brazil Jonathan Aldrich, Carnegie Mellon University, USA PROGRAMME COMMITTEE Alberto Pardo, Univ. de La Republica Alex Garcia, IME Alfio Martini, PUC-RS Alvaro Freitas Moreira, UFRGS Andre Rauber Du Bois, UFPEL Andr? Santos, UFPE Carlos Camarao, UFMG Christiano Braga, UFF Cristiano Damiani, UFPEL Edward Hermann Haeusler, PUC-Rio Fernando Castor Filho, UFPE Francisco Heron de Carvalho Junior, UFC Isabel Cafezeiro, UFF Jo?o Saraiva, Universidade do Minho Johan Jeuring, Utrecht Univ. Jose Guimaraes, UFSCAR Jose E. Labra Gayo, Univ. of Oviedo Jose Luiz Fiadeiro, Univ. of Leicester Lucilia Figueiredo, UFOP Luis Soares Barbosa, Univ. do Minho Luis Carlos Meneses, UPE Marcelo A. Maia, UFU Marco Tulio Valente, UFMG Mariza A. S. Bigonha, UFMG Martin A. Musicante, UFRN Noemi Rodriguez, PUC-Rio Paulo Borba, UFPE Peter Mosses, Swansea University Renato Cerqueira, PUC-Rio Roberto S. Bigonha, UFMG Roberto Ierusalimschy, PUC-Rio Rodolfo Jardim de Azevedo, UNICAMP Sandro Rigo, UNICAMP Sergio Soares, UFPE Sergiu Dascalu, Univ. of Nevada Simon Thompson, Univ. of Kent Varmo Vene, Univ. de Tartu Vladimir Di Iorio, UFV Vitor Santos Costa, UFRJ ORGANIZATION Brazilian Computer Society and Universidade Federal da Bahia From ronchi at di.unito.it Wed Apr 7 05:52:59 2010 From: ronchi at di.unito.it (Ronchi Della Rocca Simona) Date: Wed, 7 Apr 2010 11:52:59 +0200 Subject: [TYPES/announce] Workshop on Logic and Computational Complexity (LCC '10) Message-ID: = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = ======================================================================== call for papers 11th International Workshop on Logic and Computational Complexity LCC '10 http://web.comlab.ox.ac.uk/people/stephan.kreutzer/lcc10/index.html Edinburgh , July 10, 2010 affiliated to LICS 201 ATTENTION : DEADLINE CHANGED!!!!! = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = ======================================================================== The Eleventh International Workshop on Logic and Computational Complexity (LCC'10) will be held in Edinburgh on 10th July 2010, as an affiliated meeting of Logic in Computer Science (LiCS) 2010 as part of the 2010 Federated Logic Conference (FLoC). LCC meetings are aimed at the foundational interconnections between logic and computational complexity, as present, for example, in implicit computational complexity (descriptive and type-theoretic methods); deductive formalisms as they relate to complexity (e.g. ramification, weak comprehension, bounded arithmetic, linear logic and resource logics); complexity aspects of finite model theory and databases; complexity-mindful program derivation and verification; computational complexity at higher type; and proof complexity. The LCC'10 program consists of invited lectures as well as contributed papers selected by the program committee. Invited Speakers There will be two invited 1-hour lectures. Ugo Dal Lago, Bologna Albert Atserias, Barcelona Submissions Submissions must be in English and in the form of abstracts of about 3-4 pages. Submissions published elsewhere or which are simultaneously being submitted to another conference or workshop are welcome, as well as work in progress or not yet completely developed ideas. There will be no proceedings for this edition of LCC. LCC 10 uses the EasyChair system for managing the submission process. Submissions must be made electronically using the easychair system at http://www.easychair.org/conferences/?conf=lcc10 . Important dates Submission deadline: Revised earlier deadline: 18 April 2010, 1am CET (GMT +1). The submission server will remain open till approximately 7am CET. Author notification: Beginning of May 2010 Program Committee Andrei Bulatov (Vancouver) Phokion Kolaitis (Santa Cruz) Jan Krajicek (Prague) Stephan Kreutzer (Oxford, co-chair) Olivier Laurent (Lyon) Jean Yves Moyen (Paris 13) Damian Niwinski (Warsaw) Simona Ronchi Della Rocca (Torino, co-chair) Steering Committee Michael Benedikt (Oxford) (Co-chair) Robert Constable (Cornell) Anuj Dawar (Cambridge) Fernando Ferreira (Lisbon) Martin Hofmann (U Munich) Neil Immerman (U Mass. Amherst) Neil Jones (Copenhagen) Bruce Kapron (U Victoria) Daniel Leivant (Indiana U) (Co-chair) Jean-Yves Marion (LORIA Nancy) Luke Ong (Oxford) Martin Otto (Darmstadt) James Royer (Syracuse) Helmut Schwichtenberg (U Munich) Pawel Urzyczyn (Warsaw) _____________________ Simona Ronchi Della Rocca full professor of "Foundations of Computer Science" Dipartimento di Informatica Universit? di Torino c. Svizzera 185, 10149 Torino e-mail: ronchi at di.unito.it phone:+39-011-6706734 fax: +39-011-751603 mobile: +39-320-4205121 -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100407/3e7c085a/attachment-0001.htm From sunj at comp.nus.edu.sg Wed Apr 7 07:40:28 2010 From: sunj at comp.nus.edu.sg (jun sun) Date: Wed, 7 Apr 2010 19:40:28 +0800 Subject: [TYPES/announce] Deadline Extended: 8th International Symposium on Automated Technology for Verification and Analysis (ATVA 2010) Message-ID: Final CALL FOR PAPERS ===================== 8th International Symposium on Automated Technology for Verification and Analysis (ATVA 2010) 21 - 24 September 2010, SINGAPORE http://atva10.comp.nus.edu.sg/ Final DEADLINE extended to: Abstract Due : 8 April 2010 (23:59 Apia-time) Full Paper Due : 15 April 2010 (23:59 Apia-time) The purpose of ATVA is to promote research on theoretical and practical aspects of automated analysis, verification and synthesis in East Asia by providing a forum for interaction between the regional and the international research communities and industry in the field. The previous six events were held in Taiwan (2003-5), Beijing (2006), Tokyo (2007), Seoul (2008) and Macao (2009). The proceedings of ATVA 2010 will be published by Springer as a volume in the LNCS series. SCOPE ----- The scope of interest is intentionally kept broad; it includes: Theories useful for providing designers with automated support for obtaining correct software or hardware systems, including both functional and non functional aspects, such as: theory of (timed and hybrid) automata, process calculi, Petri-nets, concurrency theory, compositionality, model-checking, automated theorem proving, synthesis, performance analysis, correctness-by-construction, infinite state systems, abstract interpretation, decidability results, parametric analysis or synthesis. Applications of theory in engineering methods and other particular domains and handling of practical problems occurring in tools, such as analysis and verification tools, synthesis tools, model transformation tools. Techniques of reducing complexity of verification by abstraction, improved representations. Methods and tools in handling user level notations, such as UML. Practice in industrial applications to hardware, software or real-time and embedded systems. Case studies, illustrating the usefulness of tools or a particular approach are also welcome. Theory papers should be motivated by practical problems and applications should be rooted in sound theory. We are interested both in algorithms and in methods and tools for integrating formal approaches into industrial practice. SUBMISSION ---------- Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. ATVA 2010 calls for two types of contributions: RESEARCH PAPERS and TOOL DEMONSTRATION PAPERS. Both types of contributions will appear in the proceedings and have oral presentations at the conference. Papers should be written in English in LNCS format. Research papers: Research papers should contain original research, and sufficient detail to assess the merits and relevance of the contribution. Submissions reporting on industrial case studies are welcome, and should describe both strengths and weaknesses in sufficient depth. Research papers should be no more than 15 pages. Tool demonstration papers: Tool demonstration papers present tools based on aforementioned theories or fall into the above application areas. Tool demonstration papers allow researchers to stress the technical and practical side, illustrating how one can apply the theoretic contributions in practice. Tool demonstration papers should be no more than 6 pages. Further information and instruction about submission can be found at the conference website http://atva10.comp.nus.edu.sg. -- yours, Sun Jun -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100407/ffcb42cc/attachment.htm From lengrand at lix.polytechnique.fr Wed Apr 7 23:37:17 2010 From: lengrand at lix.polytechnique.fr (Stephane Lengrand (Work)) Date: Thu, 08 Apr 2010 05:37:17 +0200 Subject: [TYPES/announce] CfP: Proof-Search in Type Theories (PSTT'10) Message-ID: <4BBD4F6D.3080500@lix.polytechnique.fr> Call for Papers PSTT 2010: International Workshop on Proof Search in Type Theories Edinburgh, Scotland July 15, 2010 http://www.lix.polytechnique.fr/~lengrand/Events/PSTT10/ Affiliated with FLOC, Edinburgh, Scotland IMPORTANT DATES Title + short abstract submission: April 10 Paper / long abstract submission: April 15 Notification: April 30 Final papers due: May 15 Workshop: July 15 DESCRIPTION: The PSTT workshop resumes a series of workshops on Proof Search in Type Theoretic Languages, in light of the progress that has been made over the last decade in e.g. the development of proof assistants or our understanding of proof theory. The declarative approach to programming has evolved two paradigms that are based on different aspects of the theories of proofs and types: Proof normalisation provides a foundation for functional programming and type systems --on which numerous proof assistants are based, while proof search provides a foundation for logic programming and other areas of automated deduction. On the one hand, proof search mechanisms and their automation are decisive features of proof assitants that have much to gain from a proper understanding and formalisation. On the other hand, the framework of logic programming has also extended to more expressive logics and more complex data structures, e.g. with bindings. Better specifying the proof search mechanisms in type theories is thus a key concern that brings both approaches forward, and closer together. This concern involves a wide range of issues and techniques (some of which directly arising from implementation) that both approaches share --or could share, and that form the scope of this workshop. TOPICS: Papers are solicited on topics including, but not limited to: - proof search strategies and tactics, complexity & completeness, - tactics specification language, - properties of inference systems, invertibility, polarity of connectives, - focusing, normal forms for proofs, - proof-term representation, - meta-variables, representation of partial proofs, - searching for proofs by induction, search for invariants, - unification, - variable binding, scoping management and freshness - logic programming and other paradigms based on proof search, termination & computational expressivity, - deduction-modulo, deduction vs. computation during search, - using failure in proof search, - model checking as deduction, - user interaction and interfaces, - systems implementing any of the above. SUBMISSIONS: Authors can submit either detailed and technical accounts of new research or work in progress. System descriptions are also welcome, with a demonstration on the day of the workshop. Surveys and comparative papers are also strongly encouraged. Papers / long abstracts are to be submitted electronically and are subject to a 12-page limit in LNCS format, including bibliography. They can be shorter. Authors are required to submit a title and a short abstract a few days before submitting the paper (see the dates section). At least one author of an accepted paper is expected to present that paper at the workshop. Informal proceedings will be distributed at the workshop. The possibility of having a special issue dedicated to the themes of this workshop is under consideration. For further information and submission instructions, see the PSTT web page: http://www.lix.polytechnique.fr/~lengrand/Events/PSTT10/. PROGRAM COMMITTEE: Claudio Sacerdoti Coen (Universita di Bologna) Stephane Lengrand (CNRS, Ecole Polytechnique) James McKinna (Radboud University, Nijmegen) Gopalan Nadathur (University of Minnesota) From cconway at cs.nyu.edu Thu Apr 8 16:19:15 2010 From: cconway at cs.nyu.edu (Christopher L Conway) Date: Thu, 8 Apr 2010 16:19:15 -0400 Subject: [TYPES/announce] Amir Pnueli Memorial Symposium, NYU, May 7-9, 2010 Message-ID: ======================================================================= Amir Pnueli Memorial Symposium New York University New York, New York, USA May 7-9, 2010 ======================================================================= Amir Pnueli was one of the most influential computer scientists of our time. He published more than 250 papers, many of them groundbreaking, including the 1977 paper, "The Temporal Logic of Programs," for which he won the 1996 ACM Turing Award. On November 2, 2009, Amir unexpectedly passed away. His loss is felt deeply by friends and colleagues around the world. The Amir Pnueli Memorial Symposium is an opportunity for the computer science community to remember Amir by revisiting the ideas and challenges which inspired and defined his life's work. It will feature talks by a select group of internationally acclaimed researchers, including colleagues and former students of Amir. The symposium will take place at New York University on May 7-9, 2010. It is open to all who wish to attend. For more information and to register, please visit http://www.cs.nyu.edu/acsys/pnueli. ================== Schedule ================== May 7 4:00 PM Remembering Amir Pnueli, with tributes from his family, friends, colleagues, and students. 6:00 PM Receptionm, 13th floor of Courant building. May 8 08:15 AM Welcome 08:30 AM Moshe Vardi, From L?wenheim to Pnueli, from Pnueli to PSL and SVA 09:00 AM Krzysztof Apt, Juggling using Temporal Logic 09:30 AM Willem-Paul De Roever, What is in a Step: New Perspectives on a Classical Question 10:00 AM Break 10:30 AM Egon B?rger, Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy, Realizability of System Interface Specifications 11:30 AM Ofer Strichman, Proving Equivalence between Similar Programs: A Progress Report 12:00 PM Jayadev Misra, An Operational/Denotational Semantics of Orc 12:30 PM Lunch 02:00 PM Robert Kurshan, Verification-Guided Hierarchical Design 02:30 PM Werner Damm, Towards Component Based Design of Hybrid Systems 03:00 PM Ken McMillan, TBA 03:30 PM Break 04:00 PM E. Allen Emerson, Time for Time 04:30 PM Leslie Lamport, Temporal Logic: The Lesser of Three Evils 05:00 PM Stephan Merz, A Mechanized Proof System for TLA+ Specifications 05:30 PM Giora Slutzki, Inverting Proof Systems for Secrecy under OWA May 9 08:30 AM David Harel, Can we Verify an Elephant? 09:00 AM Tom Henzinger, Quantitative Modeling and Verification 09:30 AM Patrick Cousot, A Scalable Segmented Decision Tree Abstract Domain 10:00 AM Break 10:30 AM Oded Maler, Properties and Verification in the Continuous Domain 11:00 AM Roni Rosner, New Challenges for the Verification Community 11:30 AM Javier Esparza, Newtonian Program Analysis: Solving Sharir and Pnueli's Equations. 12:00 PM Nir Piterman, p-Automata: New Foundations for Discrete-Time Probabilistic Verification 12:30 PM Lunch 02:00 PM Catuscia Palamidessi, Information-Theoretic Approaches to Information Flow and Model Checking Techniques to Measure It 02:30 PM Rajeev Alur, List Processing Programs as Regular Word Transducers 03:00 PM Doron Peled, TBA 03:30 PM Break 04:00 PM Muli Safra, TBA 04:30 PM Krishna Palem, TBA 05:00 PM Lenore Zuck, TBA From eernst at cs.au.dk Sat Apr 10 18:31:26 2010 From: eernst at cs.au.dk (Erik Ernst) Date: Sun, 11 Apr 2010 00:31:26 +0200 Subject: [TYPES/announce] CFP - MASPEGHI 2010 (1 Week) Message-ID: [Apologies if you receive multiple copies of this] ** NB: Deadline in approximately ONE WEEK ** Call for Papers for the MASPEGHI 2010 Workshop MechAnisms for SPEcialization, Generalization and inHerItance Associated with ECOOP 2010, Maribor, Slovenia MASPEGHI 2010 invites papers suitable for generating insight and discussion about mechanisms for specialization, generalization, code reuse, and inheritance, with the following important dates: - Paper submission: April 19, 2010 - Notification of acceptance: May 5, 2010 - ECOOP early registration deadline: May 10, 2010 - Workshop: June 22 Please note that registration must be done with ECOOP itself. For more information, please visit the workshop web site: http://www.i3s.unice.fr/maspeghi2010/ -- Erik Ernst - eernst at cs.au.dk Department of Computer Science, Aarhus University IT-parken, Aabogade 34, DK-8200 Aarhus N, Denmark From kutsia at risc.uni-linz.ac.at Tue Apr 13 06:39:10 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Tue, 13 Apr 2010 12:39:10 +0200 Subject: [TYPES/announce] WWV'10: Deadline extension Message-ID: <4BC449CE.8070406@risc.uni-linz.ac.at> [Apologies if you receive multiple copies] *********************************************************** * CALL FOR PAPERS * * * * WWV 2010 * * Automated Specification and Verification of Web Systems * * 6th International Workshop * * * * Vienna University of Technology, Austria * * July 30-31, 2010 * * http://www.complang.tuwien.ac.at/WWV2010/ * *********************************************************** *************** EXTENDED DEADLINES *************** Abstract Submission April 26, 2010 Full Paper Submission May 3, 2010 From tom.hirschowitz at univ-savoie.fr Tue Apr 13 08:40:54 2010 From: tom.hirschowitz at univ-savoie.fr (Tom Hirschowitz) Date: Tue, 13 Apr 2010 14:40:54 +0200 Subject: [TYPES/announce] 2nd CFP Types postproceedings Message-ID: <4CD591F7-9313-4973-85ED-5B3BE4A64FF2@univ-savoie.fr> Post-Proceedings of TYPES 2009 The Post-Proceedings of the TYPES 2009 Annual Workshop http://lama.univ-savoie.fr/types09/ will be published, after a formal referee process, as a volume of the Electronic Proceedings in Theoretical Computer Science (EPTCS) series http://eptcs.org/ . Submissions are not restricted to works presented at the workshop, nor are authors expected to be formally involved in the Types project. Deadlines - abstract submission: Wednesday, May 19th, 2010, 12:00 Paris time, - paper submission: Wednesday, May 26th, 2010, 12:00 Paris time. We encourage submissions on the themes of the Types Project http://www.cs.chalmers.se/Cs/Research/Logic/Types/ . The aim of Types is to develop the technology of formal reasoning and computer programming based on Type Theory. This is done by improving the languages and computerised tools for reasoning, and by applying the technology in several domains such as analysis of programming languages, certified software, formalisation of mathematics and mathematics education. We invite submission of high quality papers, written in English and typeset in LaTeX2e using the EPTCS style: http://style.eptcs.org/ . Submissions should not have been published and should not be under consideration for publication elsewhere. We encourage authors to keep their submissions below 30 pages. Authors should submit their papers electronically to Tom Hirschowitz. The guest editors, Thorsten Altenkirch, Tom Hirshowitz, Christophe Raffalli, and Alan Schmitt. From Alex.Simpson at ed.ac.uk Tue Apr 13 09:29:08 2010 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Tue, 13 Apr 2010 14:29:08 +0100 Subject: [TYPES/announce] 2nd Scottish Category Theory Seminar Message-ID: <20100413142908.r8zljoa42sg040kk@www.staffmail.ed.ac.uk> Talks on topics related to types would be very welcome at the seminar announced below. --- ******************************************************************** *** Scottish Category Theory Seminar *** Second Meeting *** Friday 21st May 2010, 2-5.30pm *** University of Edinburgh, Scotland *** http://personal.cis.strath.ac.uk/~ng/sct.html ******************************************************************** We are pleased to announce the second meeting of the Scottish Category Theory Seminar, which is a forum for discussion of all aspects of category theory, be they straight category theory or applications to computer science or physics etc. We request offers for contributed talks at this meeting. Meetings are open, and all are welcome to attend. The second meeting will take place on Friday 21st May at the Informatics Forum, University of Edinburgh from 2-5.30pm. Refreshments will be available from 1pm. As at the first meeting, there will be two 1-hour invited talks. We also invite offers for two contributed half-hour talks. We intend the meeting to be attractive to mathematicians, computer scientists and physicists working in topics related to category theory. Accordingly, offers of talks that would interest a broad audience are particularly encouraged. Straight category theory talks, and talks on applications of category theory are also welcome. Please send offers of talks, preferably accompanied by a title and short abstract, to scotcats at cis.strath.ac.uk, by Friday 23rd April. We aim to have the final programme decided by Friday 30th April. This meeting will receive financial support from the Edinburgh Mathematical Society. More details can be found at http://personal.cis.strath.ac.uk/~ng/sct.html If you would like more information about the Scottish Category Theory Seminar, please email scotcats at cis.strath.ac.uk Scottish Category Theory Seminar organisers: Neil Ghani Tom Leinster Alex Simpson -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From ross.duncan at comlab.ox.ac.uk Tue Apr 13 10:22:07 2010 From: ross.duncan at comlab.ox.ac.uk (Ross Duncan) Date: Tue, 13 Apr 2010 15:22:07 +0100 Subject: [TYPES/announce] Call for participation: QICS School, May 24-28, Oxford Message-ID: Apologies for multiple copies: ========================================== CALL FOR PARTICIPATION - QICS Spring School Foundational Structures in Quantum Computation and Information May 24-28, Oxford - http://web.comlab.ox.ac.uk/people/Bob.Coecke/QICS_School.html =========================================== If you wish to attend the QICS school PLEASE REGISTER. Places are limited! The QICS Spring School consists of extended tutorials on: * Structures and methods for measurement-based quantum computation * Categorical semantics, logics, diagrammatic methods * Classical-quantum interaction and information flow * Quantum automata, machines, calculi Topics that will be covered include: * measurement-based quantum computing (MBQC); properties of graph states; MBQC and condensed matter physics; blind quantum computation; determinism in MBQC; measurement-based classical computation and non- locality; * monoidal categories, Frobenius algebras, and their graphical calculus; (co)algebra of complementary observables and multipartite quantum entanglement, and applications to MBQC; phase groups and non- locality; * classical simulation of quantum circuits; categorical topological quantum computation; graphical calculus for measurements and channels; generalized probabilistic theories; convex operational models and non- locality; * quantum cellular automata (QCA); QCAs and causality; higher types in quantum computing; quantum logics and quantum machines; colagebraic methods; Confirmed lecturers: Samson Abramsky (Oxford), Pablo Arrighi (Grenoble), Howard Barnum (Perimeter), Jonathan Barrett (Bristol, TBC), Dan Browne (UCL - London), Bob Coecke (Oxford), Ross Duncan (Oxford), Bill Edwards (Oxford), Joe Fitzsimons (Oxford), Ottfried G?hne (Innsbruck), Chris Heunen (Oxford), Peter Hines (York), Richard Jozsa (Cambridge), Aleks Kissinger (Oxford), Akimasa Miyake (Perimeter), Prakash Panangaden (McGill), Simon Perdrix (Grenoble), Sandu Popescu (Bristol), Mehrnoosh Sadrzadeh (Oxford), Peter Selinger (Dalhousie), Maarten van den Nest (Max-Planck), Jamie Vicary (Oxford), Reinhard F. Werner (Hannover), Andreas Winter (Bristol). A full schedule is available on the school webpage: http://web.comlab.ox.ac.uk/people/Bob.Coecke/QICS_School.html The QICS Spring immediately precedes the Quantum Physics and Logic workshop, happening at the same location. --->http://web.comlab.ox.ac.uk/people/Bob.Coecke/QPL_10.html FEES and SUPPORT: For students there will be no registration fees; for others we ask that you bring ?35 in cash toward the costs of food and drink at the school. We will provide free youth hostel accommodation for a limited number of students. Please email ross.duncan at comlab.ox.ac.uk as soon as possible if you would like to take advantage of this. Places will be allocated on a first come first served basis. TO REGISTER: Email ross.duncan at comlab.ox.ac.uk. Please indicate whether or not you are a student, and whether you will also attend the QPL workshop. Best wishes, Ross Duncan Local Organiser QICS Spring School Oxford University Computing Laboratory From rwh at cs.cmu.edu Tue Apr 13 15:00:20 2010 From: rwh at cs.cmu.edu (Robert Harper) Date: Tue, 13 Apr 2010 15:00:20 -0400 Subject: [TYPES/announce] Oregon Programming Languages Summer School : Expanded Enrollment and Extended Deadline Message-ID: Due to very high demand, we are expanding the enrollment for this year's summer school, and will consider applications up to April 30, 2010. The annual University of Oregon Programming Languages Summer School will be held June 15-25, 2010 in Eugene, Oregon. This year's theme is Logic, Languages, Compilation, and Verification, and features an impressive roster of speakers, including Robert Constable (Cornell), Anupam Datta (Carnegie Mellon), Robert Harper (Carnegie Mellon), Xavier Leroy (INRIA), Conor McBride (Strathclyde), Greg Morrisett (Harvard), Frank Pfenning (Carnegie Mellon), Benjamin Pierce (Penn), and Andrew Tolmach (Portland State). Please see http://www.cs.uoregon.edu/Activities/summerschool/summer10/ for complete information about this year's summer school. We look forward to a great program! Zena Ariola Pierre-Louis Curien Robert Harper Hugo Herbelin -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 3910 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100413/f716b7bd/smime.p7s From nick at microsoft.com Wed Apr 14 13:17:27 2010 From: nick at microsoft.com (Nick Benton) Date: Wed, 14 Apr 2010 17:17:27 +0000 Subject: [TYPES/announce] LOLA 2010 -- final call for contributed talks Message-ID: <829B73AE2485A845AD2F3EEA8C98E2381416F267@TK5EX14MBXC138.redmond.corp.microsoft.com> ============================================================ *** FINAL CALL FOR CONTRIBUTED TALKS *** LOLA 2010 Syntax and Semantics of Low Level Languages Friday 9th July 2010, Edinburgh, UK A LICS 2010-affiliated workshop at FLoC 2010 http://lola.pps.jussieu.fr/ **NEW** Invited speakers: G?rard Berry, Alex Simpson **NEW** Invited tutorial: Dan Ghica **NOTE** Submission deadline is earlier than in first call ============================================================ IMPORTANT DATES Submission deadline Monday 19th April 2010 ** REVISED (EARLIER) ** Author notification Saturday 1st May 2010 Workshop Friday 9th July 2010 SUBMISSION LINK The submissions will be made by easychair at http://www.easychair.org/conferences/?conf=lola2010 DESCRIPTION OF THE WORKSHOP It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. >From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in the various aspects of the relationship between logic and low level languages and programs. Topics of interest include, but are not limited to: - Typed assembly languages - Certified compilation - Proof-carrying code - Program optimization - Modal logic and realizability in machine code - Realizability and double orthogonality in assembly code, - Implicit complexity, sublinear programming and Turing machines - Parametricity, modules and existential types - General references, Kripke models and recursive types - Closures and explicit substitutions - Linear logic and separation logic - Game semantics, abstract machines and hardware synthesis - Monoidal and premonoidal categories, traces and effects INVITED SPEAKERS - G?rard Berry (INRIA Sophia) "What could be the right balance between abstract and fine-grain computational properties?" - Alex Simpson (LFCS, Edinburgh University) TBA INVITED TUTORIALS (preliminary) - Dan Ghica (University of Birmingham) Game Semantics and Hardware Synthesis PROGRAMME COMMITTEE * Amal Ahmed (Indiana University) * Nick Benton (MSR Cambridge, co-chair) * Lars Birkedal (IT University of Copenhagen) * Dan Ghica (University of Birmingham) * Paul-Andre Mellies (CNRS & University Paris Diderot, co-chair) * Fran?ois Pottier (INRIA Rocquencourt) * Ulrich Schoepp (LMU Munich) * Hayo Thielecke (University of Birmingham) SUBMISSION INSTRUCTIONS LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger programmes, position presentations and short tutorials as well as more traditional research talks describing new results. The programme committee will select the workshop presentations from submitted proposals, which may take the form either of a short abstract or of a longer (published or unpublished) paper describing completed work. The submissions should be made by easychair at http://www.easychair.org/conferences/?conf=lola2010 From lengrand at lix.polytechnique.fr Wed Apr 14 14:00:00 2010 From: lengrand at lix.polytechnique.fr (Stephane Lengrand (Work)) Date: Wed, 14 Apr 2010 20:00:00 +0200 Subject: [TYPES/announce] Deadline Extension!! Proof-Search in Type Theories (PSTT'10) Message-ID: <4BC602A0.8060108@lix.polytechnique.fr> Call for Papers PSTT 2010: International Workshop on Proof Search in Type Theories Edinburgh, Scotland July 15, 2010 http://www.lix.polytechnique.fr/~lengrand/Events/PSTT10/ Affiliated with FLOC, Edinburgh, Scotland IMPORTANT DATES Paper / long abstract submission: April 23 !! DEADLINE EXTENSION !! Notification: April 30 Final papers due: May 15 Workshop: July 15 PROGRAM COMMITTEE: Claudio Sacerdoti Coen (Universita di Bologna) Stephane Lengrand (CNRS, Ecole Polytechnique) James McKinna (Radboud University, Nijmegen) Gopalan Nadathur (University of Minnesota) DESCRIPTION: The PSTT workshop resumes a series of workshops on Proof Search in Type Theoretic Languages, in light of the progress that has been made over the last decade in e.g. the development of proof assistants or our understanding of proof theory. The declarative approach to programming has evolved two paradigms that are based on different aspects of the theories of proofs and types: Proof normalisation provides a foundation for functional programming and type systems --on which numerous proof assistants are based, while proof search provides a foundation for logic programming and other areas of automated deduction. On the one hand, proof search mechanisms and their automation are decisive features of proof assitants that have much to gain from a proper understanding and formalisation. On the other hand, the framework of logic programming has also extended to more expressive logics and more complex data structures, e.g. with bindings. Better specifying the proof search mechanisms in type theories is thus a key concern that brings both approaches forward, and closer together. This concern involves a wide range of issues and techniques (some of which directly arising from implementation) that both approaches share --or could share, and that form the scope of this workshop. TOPICS: Papers are solicited on topics including, but not limited to: - proof search strategies and tactics, complexity & completeness, - tactics specification language, - properties of inference systems, invertibility, polarity of connectives, - focusing, normal forms for proofs, - proof-term representation, - meta-variables, representation of partial proofs, - searching for proofs by induction, search for invariants, - unification, - variable binding, scoping management and freshness - logic programming and other paradigms based on proof search, termination & computational expressivity, - deduction-modulo, deduction vs. computation during search, - using failure in proof search, - model checking as deduction, - user interaction and interfaces, - systems implementing any of the above. SUBMISSIONS: Authors can submit either detailed and technical accounts of new research or work in progress. System descriptions are also welcome, with a demonstration on the day of the workshop. Surveys and comparative papers are also strongly encouraged. Papers / long abstracts are to be submitted electronically and are subject to a 12-page limit in LNCS format, including bibliography. They can be shorter. Authors are required to submit a title and a short abstract a few days before submitting the paper (see the dates section). At least one author of an accepted paper is expected to present that paper at the workshop. Informal proceedings will be distributed at the workshop. The possibility of having a special issue dedicated to the themes of this workshop is under consideration. For further information and submission instructions, see the PSTT web page: http://www.lix.polytechnique.fr/~lengrand/Events/PSTT10/. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100414/203cd5b7/attachment.htm From bove at chalmers.se Thu Apr 15 06:34:04 2010 From: bove at chalmers.se (Ana Bove) Date: Thu, 15 Apr 2010 12:34:04 +0200 Subject: [TYPES/announce] PAR-10 call for participation and informal presentations In-Reply-To: References: <4BC62D53.5070702@chalmers.se> Message-ID: <4BC6EB9C.6050605@chalmers.se> ======================================================================== Call for Informal Presentations and Participation PAR 2010 Workshop on Partiality And Recursion in Interactive Theorem Provers Edinburgh, UK, 15 July 2010 (satellite workshop of ITP'10) a mid-FLoC 2010 workshop ======================================================================== PAR'10 is a one-day workshop organised as a part of FLoC'10. It is a venue for researchers working on new approaches to cope with partial recursive or corecursive functions in interactive theorem provers. See for further details. The programme of the workshop will comprise of two invited talks, and several regular paper presentations. Additionally, we wish to provide an opportunity for informal discussion of ongoing research on partial recursion and co-recursion in interactive theorem provers. If you wish to contribute an informal presentation, please upload a title and an abstract by *28 April 2010* to EasyChair via . We will try to accommodate as many short presentations as our schedule allows. We take the opportunity to remind you that the early registration to FLoC and its workshops is open until the 17th of May. Please register and participate in PAR'10 even if you do not wish to submit any talks. -- PAR'10 organising committee From rpollack at inf.ed.ac.uk Fri Apr 16 14:11:30 2010 From: rpollack at inf.ed.ac.uk (Randy Pollack) Date: Fri, 16 Apr 2010 19:11:30 +0100 Subject: [TYPES/announce] PhD position in programming languages and formal proof Message-ID: <19400.43090.497848.507700@locatelli.inf.ed.ac.uk> Certified Complexity Preserving Compiler (CerCo): Programming and proving a compiler in Type Theory For details contact Randy Pollack . ** This is restricted to EU students. ** A 3 year PhD studentship is available in a project titled "A Certified Complexity Preserving Compiler" (CerCo), funded by the European Commission under "Future and Emerging Technologies" (FET). The studentship will be held within the Laboratory for Foundations of Computer Science, at the School of Informatics, University of Edinburgh, to begin in 2010, start date flexible. The CerCo project aims at the construction of a formally verified complexity preserving compiler from a large subset of the C programming language to some typical micro-controller assembly language of the kind used in embedded systems. The work comprises the definition of cost models for the input and target languages, coding the compiler in Type Theory and the machine-checked proof of preservation of complexity (concrete, not asymptotic) along compilation, using the *Matita* proof tool. The compiler will return certified cost annotations for the source program, providing a reliable infrastructure to draw temporal assertions on the executable code while reasoning on the source. The compiler will be open source, and all proofs will be public domain. The permanent researchers involved in the CerCo project are Randy Pollack in Edinburgh, Andrea Asperti and Claudio Sacerdoti-Coen in Bologna and Roberto Amadio and Yann Regis-Gianas in Paris. The Edinburgh site will focus on the compiler front end. We are interested in use of dependent types in programming as well as in proof. Suitable candidates will have a strong first degree in Computer Science and a strong interest in formal proof and type theory. Candidates are encouraged to contact Randy Pollack to informally discuss the project further. Formal application will be through the School's normal PhD application process: -- Randy Pollack Phone: +44 131 650 5145 URL: http://homepages.inf.ed.ac.uk/rpollack Edinburgh University, Informatics Forum, 10 Crichton Street, Edinburgh EH8 9AB -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From pierre.hyvernat at univ-savoie.fr Fri Apr 16 16:46:29 2010 From: pierre.hyvernat at univ-savoie.fr (Pierre Hyvernat) Date: Fri, 16 Apr 2010 22:46:29 +0200 Subject: [TYPES/announce] =?iso-8859-1?q?Workshop_=22Realizability_in_Cham?= =?iso-8859-1?q?b=E9ry=22?= Message-ID: <20100416204629.GB31527@noisette> Greetings to all! This is the first official announcement for the third workshop "R?alisabilit? ? Chamb?ry". This year's workshop will take place during week 22, that is Tuesday 1st of June -- Friday 4th of June. If enough participants express interest for it, Monday the 31st of May will be used for a preliminary course before the actual workshop. Partial information can already be found on the web page: http://www.lama.univ-savoie.fr/~hyvernat/Realisabilite2010/ and you can register for the workshop there: http://www.lama.univ-savoie.fr/~hyvernat/Realisabilite2010/index.php?page=registration There will be an invited "course" given by Martin Hyland as well as two invited seminars by Thomas Streicher and Jaap van Oosten. There will be 2 sessions for contributed talks, and PhD students are particularly encouraged to submit a talk. (There will be no official proceedings though.) More details about contents of invited talks and schedule will be added to the web page when available. Meanwhile, feel free to register (via the web page), submit talks or contact me for additional details (or comments). Note: the workshop will be similar in spirit to the last one. The intention is to have a nice and friendly week without all the glitter of big conferences. There is no registration fee, but the organizing committee doesn't organize much besides the actual workshop. There is a possibility to get a student room (on campus, very cheap, but only a bare room). Students will of course be given priority for those, but anyone can ask for one... Other possibilities for accommodation are given on the web page: http://www.lama.univ-savoie.fr/~hyvernat/Realisabilite2010/index.php?page=location Pierre Hyvernat -- I don't quite hear what you say, but I beg to differ entirely with you. -- Augustus De Morgan From schaefer at chalmers.se Sat Apr 17 09:43:42 2010 From: schaefer at chalmers.se (Ina Schaefer) Date: Sat, 17 Apr 2010 15:43:42 +0200 Subject: [TYPES/announce] FMSPLE 2010 - First Call for Papers Message-ID: <4BC9BB0E.4000106@chalmers.se> Please accept our apologies if you receive multiple copies of this CFP. FIRST CALL FOR PAPERS First Workshop on Formal Methods in Software Product Line Engineering (FMSPLE 2010) http://www.iese.fraunhofer.de/de/veranstaltungen_messen/fmsple/ Co-located with the 14th International Software Product Line Conference (SPLC 2010) http://splc2010.postech.ac.kr/ BACKGROUND AND OBJECTIVES Software product line engineering (SPLE) aims at developing a family of systems by reuse in order to reduce time to market and to increase product quality. The correctness of the development artifacts intended for reuse as well as the correctness of the developed products is of crucial interest for many safety-critical or business-critical applications. Formal methods have been successfully applied in single system engineering over the last years in order to rigorously establish critical system requirements. However, in SPLE, formal methods are not broadly applied yet, despite their potential to improve product quality. One of the reasons is that existing formal approaches from single system engineering do not consider variability, an essential aspect of product lines. The objective of the workshop ?Formal Methods in Software Product Line Engineering (FMSPLE)? is to bring together researchers and practitioners from the SPLE community with researchers and practitioners working in the area of formal methods. So far, both communities have only been loosely connected, despite very promising initial work on formal analysis techniques for software product lines. The workshop aims at reviewing the state of the art and the state of the practice in which formal methods are currently applied in SPLE. This leads to a discussion of a research agenda for the extension of existing formal approaches and the development of new formal techniques for dealing with the particular needs of SPLE. To achieve the above objectives, the workshop is intended as a highly interactive event fostering discussion and initiating collaborations between the participants from both communities. TOPICS The FMSPLE workshop focuses on the application of formal methods in all phases of SPLE, including family and application engineering, and on formal methods for ensuring the correctness and consistency of the artifacts considered in all phases of SPLE. The topics of interest include, but are not limited to: - Formal methods for variability modeling and analysis of feature models - Formal methods in domain analysis and scoping - Formal methods for product line architectures - Formal methods for component-based product line development - Formal methods for product line implementation, such as programming languages, formal language semantics, type systems - Formal verification of product lines and product line artifacts, including theorem proving, model checking, and static analysis techniques - Correctness-by-construction techniques applied in SPLE - Formal methods for non-functional properties in SPLE - Automated test case generation and formal testing in SPLE - Formal methods for product derivation and application engineering - Formal methods in model-based development of product lines - Tools and applications of formal methods in SPLE - Empirical evaluation and industrial experiences of applying formal methods in SPLE - Integration of formal methods into the software product line life-cycle - Formal methods for product line evolution LOCATION The conference will be held at Jeju Island (South Korea), co-located with the SPLC conference from 13 - 17 September 2010. http://splc2010.postech.ac.kr/ FORMAT The FMSPLE workshop will be a full-day event, starting with a keynote presentation by an expert in the area of formal methods applied in SPLE. (Keynote speaker to be confirmed). The keynote will be followed by presentations of selected peer-reviewed papers. To foster interaction within the workshop, a discussant will be assigned to each presented paper. The task of the discussant will be to prepare a summary of the paper and initiate the discussion of its results.The workshop will close with a panel discussion moderated by the organizers to summarize the state of the art and the state of the practice as presented in the workshop, to collect research challenges for the application of formal methods in SPLE and to identify research topics for future workshops. SUBMISSION AND PUBLICATION The contributed papers are expected to comprise research papers containing novel and previously unpublished results, experience reports, reports of industrial case studies, tool descriptions, and short papers describing work in progress or exploratory ideas. All papers have to follow the IEEE two-column conference proceedings format (Letter) and be 4 - 8 pages of length. For formatting instructions consult http://www.computer.org/portal/web/cscps/formatting The papers will be submitted via the EasyChair conference management system and reviewed by at least three members of the program committee. The program committee will select the best papers based on quality, relevance to the workshop, and potential to initiate discussions for presentation. The workshop proceedings will be published in the second volume of the SPLC proceedings. The submission page can be found at http://www.easychair.org/conferences/?conf=fmsple2010 IMPORTANT DATES - Workshop Paper Submission: June 7 - Workshop Paper Notification: July 1 - Camera-ready Copy of Papers: July 15 PROGRAM COMMITTEE (to be confirmed) Ina Schaefer (Chalmers, SE) (Co-Chair) Gerardo Schneider (U Gothenburg, SE) Martin Becker (IESE, DE) Ralf Carbon (IESE, DE) (Co-Chair) Sven Apel (U Passau, DE) Dirk Muthig (Lufthansa Systems, DE) Frank van der Linden (Philips, NL) Frank de Boer (CWI, NL) Dave Clarke (KU Leuven, BE) Patrick Heymans (Namur, BE) Manfred Broy (TU Munich, DE) Tomoji Kishi (Waseda University, JP) John McGregor (Clemson University, US) Mark Staples (NICTA, AU) David Benavides (U Seville, ES) ORGANIZING COMMITTEE Ina Schaefer (Chalmers, SE) Martin Becker (IESE, DE) Ralf Carbon (IESE, DE) Sven Apel (U Passau, DE) -- Dr.-Ing. Ina Schaefer Chalmers University of Technology Department of Computer Science and Engineering 412 96 Gothenburg, Sweden Phone: +46 - 31 - 772 - 1072 Email: schaefer at chalmers.se From beatrice at dsv.su.se Sun Apr 18 16:51:29 2010 From: beatrice at dsv.su.se (=?iso-8859-1?Q?Beatrice_=C5kerblom?=) Date: Sun, 18 Apr 2010 22:51:29 +0200 Subject: [TYPES/announce] Final Call For Submissions Doctoral Symposium and PhD Students Workshop ECOOP 2010 Message-ID: This is the final call for submissions to the ECOOP'10 Doctoral Symposium in Maribor, Slovenia. The deadline has been extended until the 30th of April to encourage additional submissions and because we are pleased to announce that AITO will once again be supporting the participants by subsidising their travel costs. Please remind any PhD students that might be interested that this is an excellent way to get valuable feedback on their work from both their peers and from leading researchers in their field, and also to attend a world-class conference. Regards, Beatrice ?kerblom Stockholm University, Sweden Call For Submissions -------------------- 20th Doctoral Symposium and PhD Students Workshop at ECOOP'10 Monday, June 21st, 2010, Maribor, Slovenia http://ecoop2010.uni-mb.si/doctoral_symposium.html Goals ----- The 2010 Doctoral Symposium and PhD Student Workshop provides a forum for both early and late-stage PhD students to present their research and get detailed feedback and advice. The main objectives of this event are: * to allow PhD students to practice writing clearly and to effectively present their research proposal * to get constructive feedback from other researchers * to build bridges for potential research collaboration * to contribute to the conference goals through interaction with other researchers at the main conference. The 20th edition of the Doctoral Symposium and PhD Workshop will be held as part of ECOOP 2010, Maribor, Slovenia. As the name suggests, this is a two-session event: a Doctoral Symposium and a PhD Students Workshop. Please be advised that AITO has once again generously offered to subsidise the travel costs for attendees. Event Format ------------ This is a full-day event of interactive presentations. Morning and early afternoon will be dedicated to the Doctoral Symposium, with late afternoon dedicated to the PhD Workshop. Besides the formal presentations, there will be plenty of opportunities for informal interactions during lunch and (possibly) dinner. It is planned that, like in 2009, members of the academic panel will give short presentations on a variety of topics related to doing research. Important Dates --------------- Paper submission deadline: April 30th, 2010 Notification of acceptance: May 13th, 2010 Doctoral Symposium and PhD Workshop June 21, 2010 If accepted for presentation, the student's advisor must email the chair no later than June 14th and confirm that the advisor attended at least one of the student's presentation rehearsals. Call For Papers --------------- Potential topics are those of the main ECOOP'10 conference, i.e. all topics related to object technology including but not restricted to: * Architecture, Design Patterns * Aspects, Components, Modularity, Separation of Concerns * Collaboration, Workflow * Concurrency, Real-time, Embeddedness, Mobility, Distribution * Databases, Persistence, Transactions * Domain Specific Languages, Language Workbenches * Dynamicity, Adaptability, Reflection * Frameworks, Product Lines, Generative Programming * HCI, User Interfaces * Language Design, Language Constructs, Static Analysis * Language Implementation, Virtual Machines, Partial Evaluation * Methodology, Process, Practices, Metrics * Model Engineering, Design Languages, Transformations * Requirements Analysis, Business Modeling * Software Evolution, Versioning * Theoretical Foundations, Formal methods * Tools, Programming environments Doctoral Symposium ------------------ The goal of the doctoral symposium session is to provide PhD students with useful feedback towards the successful completion of their dissertation research. Each student is assigned an academic panel, based on the specifics of that student's research. The student will give a presentation of 15-20 minutes (exact time will be announced later), followed by 15-20 minutes of questions and feedback. The experience is meant to mimic a "mini-" defense interview. Aside from the actual feedback, this helps the student gain familiarity with the style and mechanics of such an interview (advisors of student presenters will not be allowed to attend their student's presentations). To participate, the students should be far enough in their research to be able to present: * the importance of the problem * a clear research proposal * some preliminary work/results * an evaluation plan The students should still have at least 12 months before defending their dissertation. We believe that students that are defending within a year would not be able to incorporate the feedback they receive. To participate, please submit: * a 3-4 page abstract in the llncs format. * a letter from your advisor. This letter should include an assessment of the current status of your dissertation research and an expected date for dissertation submission. The advisor should e-mail this letter to Beatrice ?kerblom (beatrice at dsv.su.se). Abstracts should be sumbitted to: http://www.easychair.org/conferences/?conf=dsecoop10 The abstract should focus on the following: * Problem Description - what is the problem? - what is the significance of this problem? - why the current state of the art can not solve this problem? * Goal Statement - what is the goal of your research? - what artifacts (tools, theories, methods) will be produced, and how do they address the stated problem? How are the artifacts going to help reach the stated goal? * Method - what experiments, prototypes, or studies need to be produced/executed? - what is the validation strategy? How will it demonstrate that the goal was reached? Note that this is not a typical technical paper submission, and that the focus is not on technical details, but rather on research method. Each submission will be reviewed by at least three members of the committee. Phd Students Workshop --------------------- This session is addressed primarily to PhD students in the early stages of their PhD work. The goal is to allow participants to present their research ideas and obtain feedback from the rest of the workshop attendees. Each participant will give a 10-15 minute presentation, followed by 10-15 minutes of discussions (exact times will be announced later). To participate, please submit: * 6-10 page position paper in the llncs format, presenting your idea or current work; * a support letter from your advisor. The advisor should e-mail this letter to Beatrice ?kerblom (beatrice at dsv.su.se). Position papers should be submitted to: http://www.easychair.org/conferences/?conf=dsecoop10 The position paper should contain (at least): * a problem description; * a detailed sketch of a proposed approach; * related work. As this is earlier-stage research, it is not necessary to have concrete results from this research presented in the paper. Instead, the goal of the paper is to inform the reader of a (well-motivated) problem and to present a high level (possible) solution. Committee --------- * Zaid Altahat * Cristian Dittamo, University of Pisa, Italy * Antonio Cuni, University of Genova, Italy * Salman Mirghasemi, EPFL, Switzerland * Khan Muhammad, INRIA Sophia, France * Marco Servetto * Beatrice ??kerblom (chair), Stockholm University, Sweden Academic panel: TBA Previous Experiences The ECOOP Doctoral Symposium is an excellent place to meet many interesting people and discuss new ideas related to your research topic. It has a friendly atmosphere which makes everybody welcomed and relaxed. By attending the PhD symposium last year, I had the opportunity to engage in new collaborations with researchers from different institutions. I also received feedback from both well-established researchers and fellow PhD students which had a great positive effect on my thesis. I would certainly recommend all PhD students to attend the ECOOP PhD Symposium and Workshop. Eduardo Figueiredo, participant DS ECOOP'08 The ECOOP Doctoral Symposium was a remarkable event. It was an honor to get feedback on my personal thesis topic from such well-established researchers in the field. Their comments not only encouraged me to continue with my thesis work but also gave me valuable feedback on how to refine my concrete topic and bring the overall topic into shape. In addition, I found the other students' talks to be some of the most interesting ones at ECOOP. Some of them were very inspiring even for my own work. Overall, my participation in the symposium will certainly have a great positive effect on my thesis. Apart from that it was a fun day which made me meet many interesting people. Eric Bodden, participant DS ECOOP'07 More information ---------------- Visit the event's page at: http://ecoop2010.uni-mb.si/doctoral_symposium.html From Yves.Bertot at sophia.inria.fr Mon Apr 19 05:06:10 2010 From: Yves.Bertot at sophia.inria.fr (Yves Bertot) Date: Mon, 19 Apr 2010 11:06:10 +0200 Subject: [TYPES/announce] Coq-workshop: Call for informal presentations Message-ID: <4BCC1D02.4080904@sophia.inria.fr> Coq Workshop Call for informal presentations and demonstrations The Coq workshop will bring together Coq users, developers and contributors. The workshop will be organized from submitted, informal presentations, invited talks and a plenary discussion on the evolution and design of Coq. Topics of presentations may include any of the following ones: * Experiments with type-theoretic proof assistants * Language or tactics features * Theory and implementation of the Calculus of Inductive Constructions * Applications and experience in education and industry * Tools, platforms built on Coq * Plugins, libraries for Coq * Interfacing with Coq * Formalization tricks and Coq pearls Topics that have been experimented with in any flavor of type theory-based theorem proving and are relevant to the evolution of Coq may also be discussed during these informal presentations. Speakers wishing to present a demonstration should bring their own laptop computer or contact the program chair to arrange for a computer to host the demonstration. Descriptions of the proposed informal presentations should be uploaded to the easychair system before May 10th. For further questions, please contact Yves Bertot. Yves.Bertot at sophia.inria.fr From eernst at cs.au.dk Mon Apr 19 17:57:12 2010 From: eernst at cs.au.dk (Erik Ernst) Date: Mon, 19 Apr 2010 23:57:12 +0200 Subject: [TYPES/announce] CFP - MASPEGHI 2010 - 1 week extension Message-ID: [Apologies if you receive multiple copies of this] Following other ECOOP workshops we have postponed the submission deadline from today until April 26, more precisely to 24:00 Central European daylight-saving time (22:00 UTC). Hence: ** NB: The new deadline is in approximately ONE WEEK ** Call for Papers for the MASPEGHI 2010 Workshop MechAnisms for SPEcialization, Generalization and inHerItance Associated with ECOOP 2010, Maribor, Slovenia MASPEGHI 2010 invites papers suitable for generating insight and discussion about mechanisms for specialization, generalization, code reuse, and inheritance, with the following important dates: - Paper submission: April 26, 2010 - Notification of acceptance: May 5, 2010 - ECOOP early registration deadline: May 10, 2010 - Workshop: June 22 Please note that registration must be done with ECOOP itself. For more information, please visit the workshop web site: http://www.i3s.unice.fr/maspeghi2010/ Our apologies to those authors who have worked hard in order to submit a paper by the originally announced deadline. They may submit an updated version until the extended deadline. -- Erik Ernst - eernst at cs.au.dk Department of Computer Science, Aarhus University IT-parken, Aabogade 34, DK-8200 Aarhus N, Denmark From ldixon at inf.ed.ac.uk Tue Apr 20 04:47:36 2010 From: ldixon at inf.ed.ac.uk (Lucas Dixon) Date: Tue, 20 Apr 2010 09:47:36 +0100 Subject: [TYPES/announce] Automatheo 2010 at FLoC: Final Call for Papers, Talks, and System Demonstrations Message-ID: <4BCD6A28.9060404@inf.ed.ac.uk> CALL FOR PAPERS, TALKS, and SYSTEM DEMONSTRATIONS AUTOMATHEO 2010 The 2010 Workshop on Automated Mathematical Theory Exploration http://dream.inf.ed.ac.uk/events/automatheo-2010/ 14-15 July 2010, Edinburgh, UK a FLoC 2010 affiliated workshop of IJCAR and ITP. Important Dates: Wed. 5 May 2010 - Extended abstract and demo submission deadline Wed. 2 June 2010 - Acceptance notification Wed. 16 June 2010 - Final version of extended abstracts due Wed 14 - Thu 15 July 2010 - Workshop About the Automatheo workshop: Automated mathematical theory exploration is an exciting emerging research topic for mathematicians, developers of formalised mathematics, and those working on verified software. This topic concerns the theory and practice of developing software systems that support the automated development of mathematical theories, including the invention of definitions, theorems, conjectures, problems, examples and algorithms. The workshop aims to highlight the research area and foster collaboration amongst those working in software verification, formalised mathematics, and mathematical research, as well as help provide a shared understanding of the theory and tools for automated invention and discovery of mathematical theories. In this workshop, we want to encourage dissemination of knowledge as well as interaction between researchers. To facilitate this, the programme will start with talks and be followed by demo and tutorial sessions in smaller groups. Participants will experiment with and use the various systems, pose challenge problems, and develop a clear understanding of the available technologies and concepts. Invited Speakers: John Harrison and Dana S. Scott Call for Participation and Submissions: We invite proposals to give a talk and/or to provide a demo. Topics and demonstrations of interest include all aspects of mathematical theory exploration, especially the invention and discovery steps in the development of mathematical theories. This includes, but is not limited to position statements, descriptions of important features, theories of theory exploration, and systems descriptions. We also welcome contributions on the application of theory exploration to other parts of mathematics, computer science and software engineering, as well as to other sciences such as physics and biology. Submissions will be accepted based on light reviewing of extended abstracts by a review panel of researchers interested in the area. The extended abstracts will not be archival publications, but will be published online. Accepted submissions will also be disseminated in an informal proceedings which will be available during the workshop. Please submit extended abstracts and demo proposals by easychair: https://www.easychair.org/login.cgi?conf=automatheo2010 These should not be longer than 15 pages and can be as short as 1 page. We suggest, but do not require, that you use the easychair style for formatting submissions. This is available from: http://www.easychair.org/easychair.zip We will also have a published post-proceedings some time after the workshop. Programme Commitee: Jacques Calmet Jacques Carette Adrian Craciun Lucas Dixon (co-chair) Bogdan Grechuk Moa Johansson Temur Kutsia Roy McCasland (co-chair) Alison Pease Florina Piroi Alan Smaill (co-chair) David Stanovsky Cristian Urban Wolfgang Windsteiger -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From Ralph.Matthes at irit.fr Tue Apr 20 10:50:14 2010 From: Ralph.Matthes at irit.fr (Ralph Matthes) Date: Tue, 20 Apr 2010 16:50:14 +0200 Subject: [TYPES/announce] ESSLLI 2011 Call for Course and Workshop Proposals Message-ID: <1271775014.6067.50.camel@amelior> --------------------------------------------------------------------- 23rd European Summer School in Logic, Language and Information ESSLLI 2011 August 1-12, 2011 Ljubljana, Slovenia Call for Course and Workshop Proposals --------------------------------------------------------------------- The European Summer School in Logic, Language and Information (ESSLLI) is organized every year by the Association for Logic, Language and Information (FoLLI, http://www.folli.org/) in different sites around Europe. The main focus of ESSLLI is on the interface between linguistics, logic and computer science. ESSLLI offers foundational, introductory and advanced courses, as well as workshops, covering a wide variety of topics within or around the three main areas of interest: Language and Computation, Language and Logic, and Logic and Computation. Previous summer schools have been highly successful, attracting up to 500 students from Europe and elsewhere. The school has developed into an important meeting place and forum for discussion for students and researchers interested in the interdisciplinary study of Logic, Language and Information. For more information, visit the FoLLI website, as well as the ESSLLI 2010 website: http://esslli2010cph.info/. CALL FOR COURSE AND WORKSHOP PROPOSALS The ESSLLI 2011 Program Committee invites proposals for foundational, introductory, and advanced courses, and for workshops for the 23rd annual Summer School on important topics of active research in the broad interdisciplinary area connecting logic, linguistics, computer science and the cognitive sciences. All proposals should be submitted, using a prescribed form that will be available soon on the ESSLLI 2011 website, no later than: June 14, 2010 Authors of proposals will be notified of the committee's decision by September 15, 2010. GUIDELINES FOR SUBMISSION Proposers of courses and workshops should follow the guidelines below while preparing their submissions; proposals that do not conform with these guidelines may not be considered. Courses are taught by 1 or max. 2 lecturers, and workshops are organized by 1 or max. 2 organizers. Lecturers and organizers must have obtained a Ph.D. or an equivalent degree at the time of the submission deadline. Courses and workshops run over one week (Monday-Friday) and consist of five 90-minute sessions. Lecturers who want to offer a long, two-week course should submit two independent one-week courses (for example, an introductory course in the first week and an advance course in the second). The ESSLLI program committee has the right to select only one of the two proposed courses. FOUNDATIONAL COURSES These are strictly elementary courses not assuming any background knowledge. They are intended for people who wish to get acquainted with the problems and techniques of areas new to them. Ideally, they should allow researchers from other fields to acquire the key competencies of neighboring disciplines, thus encouraging the development of a truly interdisciplinary research community. Foundational courses should have no special prerequisites, but may presuppose some experience with scientific methods and general appreciation of the field of the course. INTRODUCTORY COURSES Introductory courses are central to the activities of the Summer School. They are intended to provide an introduction to the (interdisciplinary) field for students, young researchers, and other non-specialists, and to equip them with a good understanding of the field's basic methods and techniques. Such courses should enable experienced researchers from other fields to acquire the key competencies of neighboring disciplines, thus encouraging the development of a truly interdisciplinary research community. Introductory courses in a topic at the interface of two fields can build on some knowledge of the component fields; e.g., an introductory course in computational linguistics should address an audience which is familiar with the basics of linguistics and computation. Proposals for introductory courses should indicate the level of the course as compared to standard texts in the area (if available). ADVANCED COURSES Advanced courses should be pitched at an audience of advanced Masters or Ph.D. students. Proposals for advanced courses should specify the prerequisites in detail. TIMETABLE FOR COURSE PROPOSAL SUBMISSION: Jun 14, 2010: Proposal Submission Deadline Sep 15, 2010: Notification Deadline Jun 1, 2011: Deadline for receipt of camera-ready course material by the ESSLLI 2011 local organizers WORKSHOPS The aim of the workshops is to provide a forum for advanced Ph.D. students and other researchers to present and discuss their work. Workshops should have a well-defined theme, and workshop organizers should be specialists in the theme of the workshop. The proposals for workshops should justify the choice of topic, give an estimate of the number of attendants and expected submissions, and provide a list of at least 15 potential submitters working in the field of the workshop. The organizers are required to give a general introduction to the theme during the first session of the workshop. They are also responsible for various organizational matters, including soliciting submissions, reviewing, drawing up the program, taking care of expenses of invited speakers, etc. In particular, each workshop organizer will be responsible for sending out a Call for Papers for the workshop and to organize the selection of the submissions by the deadlines specified below. The call for workshop submissions must make it clear that the workshop is open to all members of the ESSLLI community and should indicate that all workshop contributors must register for the Summer School. TIMETABLE FOR WORKSHOP PROPOSAL SUBMISSIONS: Jun 14, 2010: Proposal Submission Deadline Sep 15, 2010: Notification Deadline Oct 15, 2010: Deadline for submission of the Calls for Papers to ESSLLI 2011 PC chair Nov 1, 2010: Workshop organizers send out First Call for Papers Dec 15, 2010: Workshop organizers send out Second Call for Papers Jan 15, 2011: Workshop organizers send out Third Call for Papers Feb 15, 2011: Deadline for submissions to the workshops Apr 15, 2011: Suggested deadline for notification of workshop contributors Jun 1, 2011: Deadline for submission of camera-ready copy of workshop proceedings to the ESSLLI 2011 Local Organizers. Workshop speakers will be required to register for the Summer School; however, they will be able to register at a reduced rate to be determined by the Local Organizers. FORMAT FOR PROPOSALS A form for submitting course and workshop proposals will be available soon on the ESSLLI 2011 web site: http://esslli2011.ijs.si/. The proposers are required to submit the following information: * Contact address and fax number * Name, email, affiliation, homepage of each lecturer / workshop organizer (at most two per course or workshop) * Title of proposed course/workshop * Abstract (abstract of the proposal, max 150 words) * Type (workshop, foundational, introductory, or advanced course) * Areas (one or more of: Computation, Language, Logic, or Other) * Description (describe the proposed contents of the course and substantiate timeliness and relevance to ESSLLI in at most one A4 page) * Tentative outline of the course / expected participation in the workshop * External funding (whether the proposers will be able to obtain external funding for travel and accommodation expenses) * Further particulars (e.g., course prerequisites, previous teaching experiences, etc.) FINANCIAL ASPECTS Prospective lecturers and workshop organizers should be aware that all teaching and organizing at the summer schools is done on a voluntary basis in order to keep the participants' fees as low as possible. Lecturers and organizers are not paid for their contribution, but are reimbursed for travel and accommodation expenses (up to fixed maximum amounts, which will be communicated to the lecturers upon notification). Lecturers and workshop organizers will have their registration fee waived. In case a course or workshop is to be taught/organized by two people, a lump sum will be reimbursed to cover travel and accommodation expenses for one of them; the splitting of the sum is up to the lecturers/organizers. It should be stressed that while proposals from all over the world are welcomed, the School cannot guarantee full reimbursement of travel costs, especially from destinations outside Europe. The local organizers would highly appreciate it if, whenever possible, lecturers and workshop organizers find alternative funding to cover travel and accommodation expenses, as that would help us keep the cost of attending ESSLLI 2011 lower. ESSLLI 2011 PROGRAM COMMITTEE Chair: Makoto Kanazawa (National Institute of Informatics, Tokyo) Local Co-chair: Andrej Bauer (University of Ljubljana) Area specialists: Language and Computation: Markus Egg (Humboldt-Universitaet zu Berlin) Aline Villavicencio (Federal University of Rio Grande do Sul, Brazil) Language and Logic: Hans-Christian Schmitz (Fraunhofer FIT, Sankt Augustin) Louise McNally (UPF, Barcelona) Logic and Computation: Ralph Matthes (IRIT, CNRS and University of Toulouse) Eric Pacuit (Center for Logic and Philosophy of Science, Tilburg) ESSLLI 2011 ORGANIZING COMMITTEE: Chair: Darja Fiser (University of Ljubljana) ESSLLI 2011 website: http://esslli2011.ijs.si/ From Ewen.W.Denney at nasa.gov Tue Apr 20 23:05:45 2010 From: Ewen.W.Denney at nasa.gov (Ewen Denney) Date: Tue, 20 Apr 2010 20:05:45 -0700 Subject: [TYPES/announce] Positions in formal methods at NASA Message-ID: <4BCE6B89.5080804@nasa.gov> Two positions in formal methods at NASA (one postdoc, one research software engineer) are available on "Automating the Generation of Heterogeneous Aviation Safety Cases". The goal of the project is to develop formal techniques to develop safety cases for software-intensive systems looking, in particular, at combining evidence from a range of different sources. Candidates should have experience in formal methods, software assurance techniques, theorem proving. Knowledge of aeronautics an advantage. Based at NASA Ames Research Center in Silicon Valley, California. US permanent residence or citizenship preferred. Openings are also available for postgrad summer internships. Please contact Ewen.Denney at nasa.gov for further information. From Yves.Bertot at sophia.inria.fr Wed Apr 21 09:41:14 2010 From: Yves.Bertot at sophia.inria.fr (Yves Bertot) Date: Wed, 21 Apr 2010 15:41:14 +0200 Subject: [TYPES/announce] Coq-Workshop: Call for informal presentations (updated information) Message-ID: <4BCF007A.8030903@sophia.inria.fr> Coq Workshop Second Call for informal presentations and demonstrations The Coq workshop will take place on July 9th, as part as the FLoC federated conference in Edinburgh, Scotland. The Coq workshop will bring together Coq users, developers and contributors. The workshop will be organized from submitted, informal presentations, invited talks and a plenary discussion on the evolution and design of Coq. Topics of presentations may include any of the following ones: * Experiments with type-theoretic proof assistants * Language or tactics features * Theory and implementation of the Calculus of Inductive Constructions * Applications and experience in education and industry * Tools, platforms built on Coq * Plugins, libraries for Coq * Interfacing with Coq * Formalization tricks and Coq pearls Topics that have been experimented with in any flavor of type theory-based theorem proving and are relevant to the evolution of Coq may also be discussed during these informal presentations. Speakers wishing to present a demonstration should bring their own laptop computer or contact the program chair to arrange for a computer to host the demonstration. Descriptions of the proposed informal presentations should consist of abstracts of approximately 1000 words and be uploaded to the easychair system before May 10th. For further questions, please contact Yves Bertot. Yves.Bertot at sophia.inria.fr From till at informatik.uni-bremen.de Thu Apr 22 08:07:28 2010 From: till at informatik.uni-bremen.de (Till Mossakowski) Date: Thu, 22 Apr 2010 14:07:28 +0200 Subject: [TYPES/announce] 2nd CfP: 20th WADT - deadline April, 30th Message-ID: [sorry if you receive this more than once] CALL FOR PAPERS WADT 2010 20th International Workshop on Algebraic Development Techniques July 1-4, 2010, Etelsen, Germany http://www.informatik.uni-bremen.de/WADT2010/ Aims and Scope: The algebraic approach to system specification encompasses many aspects of the formal design of software systems. Originally born as formal method for reasoning about abstract data types, it now covers new specification frameworks and programming paradigms (such as object-oriented, aspect-oriented, agent-oriented, logic and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed and mobile systems). The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends. Topics of interest: Typical, but not exclusive topics of interest are: - Foundations of algebraic specification - Other approaches to formal specification, including process calculi and models of concurrent, distributed and mobile computing - Specification languages, methods, and environments - Semantics of conceptual modelling methods and techniques - Model-driven development - Graph transformations, term rewriting and proof systems - Integration of formal specification techniques - Formal testing and quality assurance, validation, and verification INVITED SPEAKERS Hans-Dieter Ehrich, Institut f\"ur Informationssysteme, Braunschweig Frantisek Plasil, Charles University, Prague Martin Wirsing, Ludwig-Maximilians-Universit\"at, M\"unchen IMPORTANT DATES Submission deadline for abstracts: April 30, 2010 Notification of acceptance: May 23, 2010 Final abstract due: June 13, 2010 Workshop: July 1-4, 2010 Workshop Format and Location: The workshop will take place over four days, Thursday to Sunday, at Schloss Etelsen, www.schloss-etelsen.de, a castle located near Bremen. Presentations will be selected on the basis of submitted abstracts. Three talks will be given by invited speakers. Submissions: The scientific program of the workshop will include presentations of recent results and ongoing research. The presentations will be selected by the Steering Committee on the basis of the submitted abstracts according to originality, significance, and general interest. The abstracts have to be submitted electronically according to the instructions published on the workshop web site. The final versions of the selected abstracts will be included in a hand-out for the workshop participants. After the workshop, selected authors will be invited to submit full papers for the refereed proceedings, which is expected to be published as a volume of Lecture Notes in Computer Science (Springer Verlag). Sponsorship: The workshop takes place under the auspices of IFIP WG 1.3, and is sponsored by IFIP TC1, University of Bremen, and DFKI GmbH. The event is organized by the Computer Science Department of the University of Bremen and the DFKI Bremen group Safe and Secure Cognitive Systems. WADT Steering Committee: Michel Bidoit (France) Andrea Corradini (Italy) Jos\'e Fiadeiro (UK) Rolf Hennicker (Germany) Hans-J\"org Kreowski (Germany) Till Mossakowski (Germany) [chair] Fernando Orejas (Spain) Francesco Parisi-Presicce (Italy) Andrzej Tarlecki (Poland) PROCEEDINGS The abstracts accepted for presentation will be available at the workshop. Refereed LNCS proceedings are planned for full versions of submissions solicited after the workshop. CONTACT WADT 2010 Fachbereich 3 Mathematik und Informatik Enrique-Schmidt-Str. 5 D-28359 Bremen, Germany Phone: +49 421 218 64226 Fax: +49 421 218 98 64226 Email: wadt2010 at informatik.uni-bremen.de From peterol at ifi.uio.no Fri Apr 23 07:19:30 2010 From: peterol at ifi.uio.no (=?ISO-8859-1?Q?Peter_Csaba_=D6lveczky?=) Date: Fri, 23 Apr 2010 13:19:30 +0200 Subject: [TYPES/announce] University of Oslo: PhD Position in Formal Methods. Message-ID: <7EFC9C03-46D2-4BBA-8F76-901DCD95ADDC@ifi.uio.no> The Formal Methods group at the Department of Informatics, University of Oslo, has available 1 PhD position. * The starting date of the employment should be no later than October 1, 2010. * The applicants should preferably have completed a Master's degree (or similar), or being on the verge of completing one. * The candidate should preferably have a background in formal methods (including type theory), concurrency and distributed systems, real- time systems, or probabilistic systems. * Applications must be received no later than May 15, 2010. The intended topic for the PhD project is modeling of Probabilistic Real-Time Systems in Rewriting Logic. This includes theoretical and practical investigations as well as tool implementation. The tool development will build on Real-Time Maude and Probabilistic Maude. (Information about rewriting logic and Maude can be found at http://maude.cs.uiuc.edu/). Applicants may submit a project proposal related to the research challenges outlined above, including a description of main approach, a more detailed outline of research topics, and proposals for choice of theory and method. The fellowship is for a period of up to 4 years, with 25 % compulsory work, and should lead to a PhD thesis at the University of Oslo *** Applications must be received no later than May 15, 2010! *** Information about how to apply is given in the following link: http://uio.easycruit.com/vacancy/401037/64290?iso=no The research group for formal methods ------------------------------------- The Formal Methods group at the Department of Informatics, University of Oslo, Norway, is working on tools and languages for object-oriented and component-based software development. Our current research focus includes * formal specification and analysis of real-time systems * object-orientation and open distributed systems * rewriting logic * specification and verification of OO-programs Our research combines theoretical foundations with the goal to develop practical tools and languages to capture software adaptability. The group's activities include both theoretical, foundational, and experimental work within formal methods, semantics, and language design. For more information, see the following web-page: http://www.ifi.uio.no/forskning/grupper/pma/index_e.html Terms of employment ------------------- The salary and terms at the University of Oslo are in accordance with Norwegian state regulations. Salary is in the range NOK 355,400 ? 394,200 (currently EUR 45.100 - 50.000 and USD 59.800 - 66.300) per year, depending on relevant work experience. Further details --------------- For further information about the position, informal requests, etc., please contact Professor Peter ?lveczky, email peterol AT ifi.uio.no, How to apply ------------ As mentioned, all information about how to apply can be found at http://uio.easycruit.com/vacancy/401037/64290?iso=no In addition to those requirements, an electronic copy of the application must be sent to Peter ?lveczky at e-mail peterol AT ifi.uio.no. Please make sure that you mention the reference number 2010/4800 in your aplications and inquiries. From kai at iam.unibe.ch Fri Apr 23 09:28:31 2010 From: kai at iam.unibe.ch (=?ISO-8859-1?Q?Kai_Br=FCnnler?=) Date: Fri, 23 Apr 2010 15:28:31 +0200 Subject: [TYPES/announce] PCC 2010 Second Call for Papers Message-ID: =============================== 2nd CALL FOR PAPERS 9th Proof, Computation and Complexity PCC 2010 June 18-19, 2010 Bern, Switzerland http://pcc2010.unibe.ch/ =============================== Please note that the submission deadline is May 1st. Aim and scope -------------------- The aim of PCC is to stimulate research in proof theory, computation, and complexity, focusing on issues which combine logical and computational aspects. Topics may include applications of formal inference systems in computer science, as well as new developments in proof theory motivated by computer science demands. Specific areas of interest are (non-exhaustively listed) foundations for specification and programming languages, logical methods in specification and program development including program extraction from proofs, type theory, new developments in structural proof theory, and implicit computational complexity. Organisers ---------------- * Kai Br?nnler, Bern (co-chair) * Alessio Guglielmi, Loria Nancy & University of Bath * Reinhard Kahle, Coimbra * Thomas Studer, Bern (co-chair) Invited Speakers (confirmed) ---------------------------------------------- * Lev Beklemishev (Moscow) * Agata Ciabattoni (Vienna) * Rosalie Iemhoff (Utrecht) Contributions ------------------ PCC is intended to be a lively forum for presenting and discussing recent work. Participants who want to contribute a talk are asked to submit an abstract (Pdf, 1-2 pages) to pcc2010.workshop at gmail.com. The collection of abstracts will be available at the meeting. Important Dates ---------------------- Submission deadline : May 1, 2010 Notification to authors : May 15, 2010 Workshop: June 18-19, 2010 =============================== From lerner at cs.ucsd.edu Fri Apr 23 16:55:07 2010 From: lerner at cs.ucsd.edu (Sorin Lerner) Date: Fri, 23 Apr 2010 13:55:07 -0700 (PDT) Subject: [TYPES/announce] PASTE 2010 Call for Participation Message-ID: <830133128.810981272056107574.JavaMail.root@csemailbox.ucsd.edu> ***************************************** *** PASTE 2010 CALL FOR PARTICIPATION *** *** (co-located with PLDI 2010) *** ***************************************** We invite you to attend the 9th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, held on June 5-6 in Toronto, Canada (co-located with PLDI 2010). PASTE 2010 will feature 12 technical presentations and 2 keynote talks, together with opportunities for all attendees to make short presentations/demos and to participate in group discussions. For more details, please see the full program available at http://cseweb.ucsd.edu/paste2010 Register by *May 10* to take advantage of the early registration rate. We hope you will join us in Toronto! Sorin Lerner and Atanas Rountev PASTE 2010 Co-chairs From Vincent.vanOostrom at phil.uu.nl Sat Apr 24 14:43:41 2010 From: Vincent.vanOostrom at phil.uu.nl (Vincent van Oostrom) Date: Sat, 24 Apr 2010 20:43:41 +0200 Subject: [TYPES/announce] 5th International School on Rewriting, Call for Participation Message-ID: <4BD33BDD.4010008@phil.uu.nl> Call for Participation ********** I S R 2010 ********** http://www.phil.uu.nl/isr2010/ 5th International School on Rewriting July 3-8, 2010, Utrecht, The Netherlands Background and Organisation --------------------------- Term rewriting is a powerful model of computation underlying much of declarative programming, which is heavily used in symbolic computation in logic and computer science. Applications can be found in theorem proving and protocol verification, but also in fields as diverse as mathematics, philosophy and biology. Following the editions in Nancy (twice, France), Obergurgl (Austria), and Brasilia (Brazil), the 5th International School on Rewriting takes place in Utrecht, The Netherlands. The school is aimed at master and PhD students, researchers and practitioners interested in the study of rewriting concepts and their applications. To accommodate the different backgrounds, we offer two tracks: (Basic) A full-fledged introductory course at master/PhD level accompanied with exercise sessions for students without previous exposure to term rewriting; (Advanced) A series of more advanced lectures at PhD/researcher level on recent developments and applications. Master students can obtain 3ECs for successfully participating in the Basic track. The school is organised under the auspices of IFIP WG 1.6 and takes place as part (course H16) of Utrecht Summer School 2010. The school is planned such that participants can subsequently attend the major yearly conference on rewriting, RTA 2010, or other conferences that are part of the federated logic conference, FLoC 2010, in Edinburgh. Lectures and lecturers ---------------------- Introduction to Term Rewriting (B) Aart Middeldorp, Univ. of Innsbruck, Austria Femke van Raamsdonk, VU Amsterdam, The Netherlands Applications of Rewriting in Design and Analysis of Algorithms (B & A) Ashish Tiwari, SRI International, Menlo Park, CA, USA Tree Automata and Rewriting (A) Ralf Treinen, PPS, Univ. Paris-Diderot, France Complexity Analysis of Term Rewrite Systems (A) Georg Moser, Univ. of Innsbruck, Austria Termination of Programs (A) Peter Schneider-Kamp, Univ. of Southern Denmark, Odense, Denmark Productivity (A) Joerg Endrullis, VU Amsterdam, The Netherlands Dimitri Hendriks, VU Amsterdam, The Netherlands Clemens Grabmayer, Utrecht Univ., The Netherlands SAT solving for term rewriting (A) Hans Zantema, Eindhoven Univ. of Tech., Radboud Univ. Nijmegen Coq and rewriting (A) Adam Koprowski, R&D MLstate, Paris, France Complete program and ISR 2010 brochure at http://www.phil.uu.nl/isr2010/ Location and Registration ------------------------- The school takes place in the historical city centre of Utrecht. Utrecht is located in the centre of the Netherlands, and is known for its university, its treaty, the 112m high Dom tower dating back to 1321, its wharves and its canal side terraces. The Netherlands has a sea climate and the average temperature in July is between 20 and 25 degrees Celsius. Utrecht has excellent public transport connections to the rest of the country and to the major international airports of Amsterdam (Schiphol, 30 minutes by train, every 15 minutes) and Frankfurt (3.5 hours by train, 8 times per day). Registration via the link to the program above or via *Courses* -> *Start data* -> *01-15 July 2010* at http://www.utrechtsummerschool.nl/ Basic track: 175 euro, Advanced track: 225 euro, Housing: 200 euro. Fees include participation, course material for both tracks, the ISR dinner event, and the Social Programme as offered by the Utrecht Summer School, e.g. world cup semi-finals, but do not include meals. We have grants available to cover the registration fee for a number of exceptional students. See the registration and/or ISR2010 site for details. From pschust at mathematik.uni-muenchen.de Mon Apr 26 13:46:05 2010 From: pschust at mathematik.uni-muenchen.de (Peter Schuster) Date: Mon, 26 Apr 2010 19:46:05 +0200 (CEST) Subject: [TYPES/announce] Initial MALOA Training Workshop September 2010, Fischbachau Message-ID: -------------------------------------------------------------------------- MALOA - From MAthematical LOgic to Applications Marie Curie Initial Training Network, PITN-GA-2009-238381 http://www.logique.jussieu.fr/MALOA/ --------------------------------------------------------------------------- Initial MALOA Training Workshop September 2010, Fischbachau, Germany --------------------------------------------------------------------------- Dates: Arrival Sunday, 5 September 2010. Departure Saturday, 11 September 2010 after noon. Scope of the Workshop: The workshop consists of main lecture courses and contributed talks across a range of logic as well as informal discussion groups in the evenings. It is intended particularly for PhD students and postdoctoral researchers working in or around mathematical logic and applications. It is primarily aimed at members of the involved research centres of the MALOA network, but participants from external sites are welcome as well. Location: The workshop is being held at the Hotel Aurachhof in Fischbachau, a picturesque small village outside of Munich. Costs: Full board accommodation is available from EUR 50 to EUR 80 per person and day, depending on the room type and includes the workshop costs. Further information: For more information, including a full timetable of lecture courses and talks, please see the website http://www.mathematik.uni-muenchen.de/~jberger/fisch.html If interested in participating, please email Emma Jones e.j.jones at leeds.ac.uk as soon as possible, and by Monday May 3 at absolute latest, as we need to make the accommodation booking in Fischbachau. ---------------------------------------------------------------------------- From kurz at mcs.le.ac.uk Tue Apr 27 03:50:03 2010 From: kurz at mcs.le.ac.uk (Alexander Kurz) Date: Tue, 27 Apr 2010 08:50:03 +0100 Subject: [TYPES/announce] CfP: WORKSHOP RP'2010 Message-ID: <4BD6972B.2080809@mcs.le.ac.uk> ================= Call for Papers ================= 4th WORKSHOP ON REACHABILITY PROBLEMS, RP'2010 (August 27-29, 2010, Masaryk University, Brno, Czech Republic) co-located with MFCS & CSL 2010 http://www.csc.liv.ac.uk/~rp2010/ --------------------------------------------------- Deadline for submissions is EXTENDED: May 11, 2010 Proceedings will be published in the Springer LNCS --------------------------------------------------- The Workshop on Reachability Problems will be hosted by the Faculty of Informatics, Masaryk University, Brno, Czech Republic and co-located with Joint MFCS and CSL 2010. RP'10 is the fourth in the series of workshops following three successful meetings at Ecole Polytechnique, France in 2009 at University of Liverpool, UK in 2008 and at Turku University, Finland in 2007. Scope: The Reachability Workshop is specifically aimed at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in - Algebraic structures - Computational models - Hybrid systems - Logic and Verification Invited Speakers: ================= - Markus Holzer (Giessen University, Germany) - Kim Guldstrand Larsen (Aalborg University, Denmark) - Alexander Rabinovich (Tel Aviv University, Israel) - Philippe Schnoebelen (ENS Cachan, France) Important dates: ================= Submission: May 11, 2010 Notification: June 3, 2010 Final version: June 10, 2010 Conference dates: Aug. 27-29, 2010 Topics of interest: ====================== Papers presenting original contributions related to reachability problems in different computational models and systems are being sought. Topics of interest include (but are not limited to): Reachability for infinite state systems, rewriting systems; Reachability analysis in counter/ timed/ cellular/ communicating automata; Petri-Nets; computational aspects of semigroups, groups and rings; Reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps and new computational paradigms The reachability problems are in the core of many questions of computer science and mathematics. This topic covers many aspects about the analysis of computational traces/paths in classical and unconventional computational models, logic, algebraic structures as well as in mathematical systems and control theory. The classical reachability can be formulated as follows: Given a computational system or model with a set of allowed transformations (functions). Decide whether a certain state of a system is reachable from a given initial state by a set of allowed transformations. The same questions can be asked not only about reachability of exact states of the system but also about a set of states expressed in term of some property as a parameterized reachability problem. Another set of predictability questions can be seen in terms of reachability of eligible traces of computations, their equivalence; unavoidability of some dynamics and a possibility to avoid undesirable dynamic using a limited control. Proceedings =========== The Conference Proceedings will be published as the volume of the Springer Verlag Lecture Notes in Computer Science (LNCS) series www.springer.com/lncs and distributed at the Conference. We plan also to publish selected papers in a special issue of a high quality journal following the regular referee procedure. Submissions: ============ Authors are invited to submit a draft of a full paper with at most 12 pages (in LaTeX, formatted according to LNCS guidelines) via the conference web page. Proofs omitted due to space constraints must be put into an appendix to be read by the program committee members at their discretion. Submissions deviating from these guidelines risk rejection. Electronic submissions should be formatted in postscript or pdf. Simultaneous submission to other conferences or workshops with published proceedings is not allowed. Program Committee: ================== - Parosh Aziz Abdulla, Uppsala - Eugene Asarin, Paris - Christel Baier, Bonn - Bernard Boigelot, Liege - Olivier Bournez, Palaiseau - Cristian S. Calude, Auckland - Stephane Demri, Cachan - Javier Esparza, Munich - Laurent Fribourg, Cachan - Vesa Halava, Turku - Oscar Ibarra, Santa Barbara - Franjo Ivancic, Princeton - Juhani Karhumaki, Turku - Joost-Pieter Katoen, Aachen - Antonin Kucera, Brno - Michal Kunc, Brno - Alexander Kurz, Leicester - Slawomir Lasota, Warsaw - Alexei Lisitsa, Liverpool - Luke Ong, Oxford - Igor Potapov, Liverpool - Wolfgang Thomas, Aachen - Hsu-Chun Yen, Taipei Organizing Committee: ===================== - Antonin Kucera (Masaryk University) - Igor Potapov (University of Liverpool) Contact details: RP'2010 Faculty of Informatics, Masaryk University, Emails: Antonin Kucera tony at fi.muni.cz Igor Potapov potapov at liverpool.ac.uk From Richard.Moot at labri.fr Tue Apr 27 08:09:17 2010 From: Richard.Moot at labri.fr (Richard Moot) Date: Tue, 27 Apr 2010 14:09:17 +0200 Subject: [TYPES/announce] E.W. Beth Dissertation Award 2010 - deadline extended Message-ID: <35770D94-61B3-4EA8-869F-3BA5219AEA5A@labri.fr> E. W. Beth Dissertation Prize: 2010 call for nominations Deadline extended: May 16, 2010 !!! Since 2002, FoLLI (the Association for Logic, Language, and Information, http://www.folli.org) awards the E.W. Beth Dissertation Prize to outstanding dissertations in the fields of Logic, Language, and Information. We invite submissions for the best dissertation which resulted in a Ph.D. degree in the year 2009. The dissertations will be judged on technical depth and strength, originality, and impact made in at least two of three fields of Logic, Language, and Computation. Interdisciplinarity is an important feature of the theses competing for the E.W. Beth Dissertation Prize. Who qualifies. Nominations of candidates are admitted who were awarded a Ph.D. degree in the areas of Logic, Language, or Information between January 1st, 2009 and December 31st, 2009. There is no restriction on the nationality of the candidate or the university where the Ph.D. was granted. After a careful consideration, FoLLI has decided to accept only dissertations written in English. Dissertations produced in 2009 but not written in English or not translated will be allowed for submission, after translation, also with the call next year (for 2010). The present call for nominations for the E.W. Beth Dissertation Award 2010 will also accept nominations of full English translations of theses originally written in another language than English and defended in 2008 or 2009. Prize. The prize consists of: -a certificate -a donation of 2500 euros provided by the E.W. Beth Foundation -an invitation to submit the thesis (or a revised version of it) to the FoLLI Publications on Logic, Language and Information (Springer). For further information on this series see the FoLLI site. How to submit. Only electronic submissions are accepted. The following documents are required: 1. The thesis in pdf or ps format (doc/rtf not accepted); 2. A ten page abstract of the dissertation in ascii or pdf format; 3. A letter of nomination from the thesis supervisor. Self-nominations are not admitted: each nomination must be sponsored by the thesis supervisor. The letter of nomination should concisely describe the scope and significance of the dissertation and state when the degree was officially awarded; 4. Two additional letters of support, including at least one letter from a referee not affiliated with the academic institution that awarded the Ph.D. degree. All documents must be submitted electronically to buszko at amu.edu.pl. Hard copy submissions are not admitted. In case of any problems with the email submission or a lack of notification within three working days, nominators should write to buszko at amu.edu.pl. Important dates: Deadline for Submissions: April 30, 2010 (extended: May 16, 2010) Notification of Decision: July 20, 2010. Committee : Natasha Alechina (Nottingham) Lev Beklemishev (Moscow) Wojciech Buszkowski (chair) (Poznan) Didier Caucal (IGM-CNRS) Nissim Francez (Haifa) Alexander Koller (Saarbruecken) Alberto Policriti (Udine) Ian Pratt-Hartmann (Manchester) Rob van der Sandt (Nijmegen) Colin Stirling (Edinburgh) Rineke Verbrugge (Groningen) Heinrich Wansing (Dresden) From stefano at di.unito.it Tue Apr 27 11:12:03 2010 From: stefano at di.unito.it (Stefano Berardi) Date: Tue, 27 Apr 2010 17:12:03 +0200 Subject: [TYPES/announce] First Call for papers for the workshop Classical Logic and Computation (CL&C'10) - 21-22 August 2010 - Brno, Czech Republic Message-ID: <4BD6FEC3.4020500@di.unito.it> As usual, apologies for multiple copies. This is the first call for papers for: International Workshop on Classical Logic and Computation (CL&C'10) http://www.doc.ic.ac.uk/~svb/CLaC10 21-22 August 2010 Brno, Czech Republic CL&C'10 is a joint workshop with PECP and a satellite of the federated conferences: CSL and MFCS IMPORTANT DATES Deadline for abstract: June, 13, 2010 Deadline for submission: June, 27, 2010 Notification of acceptance: July, 17, 2008 Final version due: July, 27, 2010 Workshop date: August, 21-22, 2010 INTRODUCTION CL&C'10 is the third of a conference series on "Classical Logic and Computation". It intends to cover all work aiming to explore computational aspects of classical logic and mathematics. This year CL&C will be held as part of CSL and MFCS, jointly with PECP (Program Extraction and Constructive Proofs): http://www.cs.swansea.ac.uk/~csmona/pecp.html Through these two workshops we wish to honour Prof. Helmut Schwichtenberg's many important contributions to both fields. CL&C is focused on the interplay between program extraction from classical proofs and computer science, while PECP will focus on recent developments in Applied Proof Theory and Constructive Mathematics. The two fields have a substantial common interest, namely the exploration of the computational content of mathematical and logical principles. The scientific aim of this workshop is to bring together researchers from both fields and exchange ideas. SCOPE OF CL&C This workshop aims to support a fruitful exchange of ideas between the various lines of research on Classical Logic and Computation. Topics of interest include, but are not limited to, - version of lambda calculi adapted to represent classical logic, - design of programming languages inspired by classical logic, - cut-elimination for classical systems, - proof representation and proof search for classical logic, - translations of classical to intuitionistic proofs, - constructive interpretation of non-constructive principles, - witness extraction from classical proofs, - constructive semantics for classical logic (e.g. game semantics), - case studies (for any of the previous points). SUBMISSION AND PUBLICATION, This is intended to be an informal workshop. Participants are encouraged to present work in progress, overviews of more extensive work, and programmatic/position papers, as well as completed projects. We therefore ask for submission both of short abstracts and of longer papers. Post-proceedings of CL&C?06 and CL&C?08 were published as special issues of APAL. A special issue of a journal, with the post-proceedings of CL&C ?10, is being considered. It will contain full versions of selected papers. In order to make a submission: - Format your file using the LNCS guidelines; there is a 15 page limit. - Use the submission instructions at http://www.easychair.org/conferences/?conf=clac10 Submissions will be refereed according to interest and originality of the idea. A participants' proceedings will be distributed at the workshop. INVITED SPEAKERS Joint with PECP (see the PECP web page) http://www.cs.swansea.ac.uk/~csmona/pecp.html CONTACT u.berger at swansea.ac.uk (This message is sent through the types net and types forum to all former participants of the types project and all former types sites.) From f.rabe at jacobs-university.de Wed Apr 28 07:37:59 2010 From: f.rabe at jacobs-university.de (Florian Rabe) Date: Wed, 28 Apr 2010 13:37:59 +0200 Subject: [TYPES/announce] Call for Participation: FLoC Workshop on Modules and Libraries for Proof Assistants Message-ID: Call for Participation Second International Workshop on Modules and Libraries for Proof Assistants (MLPA'10) July 15, 2010 http://kwarc.info/frabe/events/mlpa-10.html Affiliated with FLoC Edinburgh, Scotland, July 9-21, 2010 EARLY REGISTRATION DEADLINE: May 17 Program: The formal part of the workshop program will consist of invited talks by * Adam Chlipala http://adam.chlipala.net/ A Bottom-Up Approach to Safe Low-Level Programming * Gerwin Klein http://www.cse.unsw.edu.au/~kleing/ Large-scale proof and libraries in Isabelle * Ulf Norell http://www.cse.chalmers.se/~ulfn/ TBA * Don Sannella http://homepages.inf.ed.ac.uk/dts/ TBA * Andrzej Trybulec http://math.uwb.edu.pl/~trybulec/ TBA See http://kwarc.info/frabe/events/mlpa-10.html for details. Description: This is the second workshop on module systems and libraries for proof assistants, which succeeds MLPA-09 held during CADE-22. It aims to attract and bring together researchers and practitioners with background and experience in module systems from different logic based systems, such as theorem provers, proof assistants, and programming languages. It will provide a fertile venue for the exchange of ideas and experiences and has the potential to impact the way we organize proofs and programs in the future. Program Committee: * Stefan Berghofer, Institut f?r Informatik, Technische Universit?t M?nchen * Derek Dreyer, Max Planck Institute for Software Systems, Saarbr?cken * Georges Gonthier, Microsoft Research, Cambridge * Zhaohui Luo, Royal Holloway, University of London, * Till Mossakowski, German research center for artificial intelligence, Bremen, * Scott Owens, Computer Laboratory, University of Cambridge * Florian Rabe, Jacobs University Bremen (chair) * Carsten Sch?rmann, IT University of Copenhagen (chair) Organizers: Florian Rabe Carsten Schuermann f.rabe at jacobs-university.de carsten at itu.dk Jacobs University IT University of Copenhagen Bremen, Germany Copenhagen, Denmark From cbraga at ic.uff.br Wed Apr 28 14:36:52 2010 From: cbraga at ic.uff.br (Christiano Braga) Date: Wed, 28 Apr 2010 15:36:52 -0300 Subject: [TYPES/announce] LSFA 2010 - Call for papers Message-ID: <40BE4C00-CF93-4176-B5B3-567000CC7E05@ic.uff.br> [Apologies for multilple copies of this CFP.] --- LSFA 2010 - 5th Workshop on Logical and Semantic Frameworks, with Applications Call for Papers Scope Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for formal specification of systems and programming languages, supporting tool development and reasoning. The objective of this one-day workshop is to put together theoreticians and practitioners to promote new techniques and results, from the theoretical side, and feedback on the implementation and use of such techniques and results, from the practical side. In this fifth edition, the workshop will be on August 31st, jointly with ICTAC (http://www.iist.unu.edu/ICTAC/ictac2010/) in Natal-Rn, Brasil. Topics of interest to this forum include, but are not limited to: * Logical frameworks * Proof theory * Type theory * Automated deduction * Semantic frameworks * Specification languages and meta-languages * Formal semantics of languages and systems * Computational and logical properties of semantic frameworks * Implementation of logical and/or semantic frameworks * Applications of logical and/or semantic frameworks LSFA'10 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. Submissions to the workshop will be in the form of full papers. The proceedings are produced only after the meeting, so that authors can incorporate this feedback in the published papers. The publication of LSFA proceedings is planned to be a volume of ENTCS (under consideration by ENTCS editorial board). Selected papers, will be published in a special volume by ISTE (http://www.iste.co.uk/) Program Committee * Fl?vio Leonardo Cavalcanti de Moura (General Chair, UnB-Brasil) * Luis Farinas del Cerro (Program co-chair, IRIT, France) * Edward Hermann Haeusler (Program co-chair, PUC-Rio, Brasil) * Jonathan Seldin (Univ-Lethbridge , Canada) TBC * Maur?cio Ayala-Rinc?n (UnB, Brasil) * Christiano de Oliveira Braga (UFF, Brasil) * Mario Benevides (Coppe-UFRJ, Brasil) * Eduardo Bonelli ( UNLP, Argentina) * Marcelo Corr?a (IM-UFF, Brasil) * Clare Dixon (Liverpool, UK) * Gilles Dowek (Polytechnique-Paris, France) * William Farmer (Mcmaster, Canada) * Maribel Fern?ndez (King's College, UK) * Marcelo Finger (IME-USP, Brasil) * Fairouz Kamareddine (Heriot-Watt Univ, UK) * Delia Kesner (Paris-Jussieu, France) * Luis da Cunha Lamb (UFRGS, Brasil) * Joao Marcos (UFRN, Brasil) * Ana Teresa Martins (UFC, Brasil) * Martin Musicante (UFRN, Brasil) * Cl?udia Nalon (UnB, Brasil) * Luca Paolini (Universit? di Torino, Italy) * Elaine Pimentel (UFMG, Brasil) Important dates: * Submission 31th May 2010 * Author's notification 1st July * Camera-ready: 30th July * Workshop : 31 August Contributions should be written in English and submitted in the form of full papers with at most 16 pages. They must be unpublished and not submitted simultaneously for publication elsewhere. The submission should be in the form of a PDF file uploaded to LSFA2010 page at EasyChair(https://www.easychair.org/account/signin.cgi?conf=lsfa10) until the submission deadline by midnight, Central European Standard Time (GMT+1). The papers should be prepared in latex using Elsevier ENTCS style. Please see the Instructions for Preparing Files for Preliminary Versions Instructions for styles and examples. Instructions and the Latex package used to format your submission can be found in http://www.entcs.org/prelim.html Organizing Committee * Fl?vio Leonardo Cavalcanti de Moura (General Chair, UnB-Brasil) * Martin Musicante (UFRN, Brasil) * Edward Hermann Haeusler (PUC-Rio, Brasil) * Cl?udia Nalon (UnB, Brasil) * Marcelo Corr?a (IM-UFF, Brasil) From A.M.Silva at cwi.nl Thu Apr 29 12:35:13 2010 From: A.M.Silva at cwi.nl (A.M.Silva@cwi.nl) Date: Thu, 29 Apr 2010 18:35:13 +0200 Subject: [TYPES/announce] ICE 2010: Call for short contributions and participation Message-ID: <20100429163513.GA9529@ludwig.sen.cwi.nl> [- Apologies for multiple copies -] *** Call for short contributions & participation *** 3rd Interaction and Concurrency Experience ICE 2010: Guaranteed Interactions Satellite workshop of DisCoTec 2010 10th of June 2010 Amsterdam, The Netherlands http://www.artist-embedded.org/artist/-ICE-10-.html === Highlights === - Invited talks by Tom A. Henzinger (IST, Austria) and Joost-Pieter Katoen (RWTH Aachen University, Germany) - Travel grants for young researchers === Important Dates === - Submission of short contributions: 10 May 2010 - Notification to authors: 13 May 2010 === Scope === Interaction and Concurrency Experiences (ICEs) is a series of international scientific meetings oriented to theoretical computer science researchers with special interest in models, verification, tools and programming primitives for complex interactions. The general scope is to include theoretical and applied aspects of interactions and the synchronization mechanisms used among actors of concurrent/distributed systems, but every experience will focus on a different specific topic which affects several areas of computer science. The theme of ICE'10 is ***Guaranteed Interactions***, like guaranteeing safety, responsiveness, quality of service levels or satisfaction of analysis hypotheses. In this context, coordination can be viewed as imposing constraints on the interaction among the actors. Such constraints and guarantees of their satisfaction play an important role in the analysis of distributed systems. In order to provide such guarantees, a number of directions are being explored to develop appropriate models, methodologies and tools, like behavioural types, component-based model checking, assume-guarantee and ?by construction? techniques such as glue synthesis. Considering interaction as a first class entity is crucial for overcoming complexity issues of distributed systems, such as state space explosion. Topics of interest include, but shall not be limited to: - logic and types for interactions - concurrent models and semantics - techniques and tools for specification, analysis, verification of guaranteed interaction - programming primitives for interactions - languages, protocols and mechanisms for sound coordination - "by construction" guarantees for interaction - expressiveness results - formal contract languages - disciplined interactions inspired by emerging computational models (systems biology, quantum computing, etc.) === Selection Procedure For Short Contributions === The workshop proposes an innovative paper selection mechanism based on an interactive discussion amongst authors and PC members. Selection of regular papers has been closed on April 30, after which we decided to reserve some additional slots for presentation of recent work in progress or visionary innovative ideas and approaches. === The Public Wiki === After the notification, the accepted papers will be published on a public forum, the rationale being to initiate public discussions that will trigger and stimulate the scientific debate of the workshop. We argue that this will drive the workshop discussions and let perspective participants to interact with each other well in advance with respect to the modus operandi of more traditional events. === Submission Guidelines === Short papers must report previously unpublished work although it is allowed that some extended versions are simultaneously submitted to other conferences / workshops with proceedings. Accepted short papers will be considered for inclusion in the ICE'10 post-proceedings either in form of extended abstracts or as full papers. ICE'10 post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/). Submissions of short papers must be made electronically in PDF format via EasyChair (http://www.easychair.org/conferences/?conf=ice2010) and should not exceed 4 pages with EPTCS style (http://style.eptcs.org/). Accepted short papers must be presented at the workshop by one of the authors. === Program Committee === - Paolo Baldan (University of Padova, Italy) - Ananda Basu (Verimag, France) - Karthik Bhargavan (INRIA, France) - Simon Bliudze (CEA LIST, France; co-chair) - Andrea Bracciali (University of Pisa, Italy) - Roberto Bruni (University of Pisa, Italy; co-chair) - Pierre-Malo Deni?lou (Imperial College London, UK) - Erik de Vink (Technische Universiteit Eindhoven, Netherlands) - Laurent Doyen (ENS Cachan, France) - Carlo Furia (ETH Zurich, Switzerland) - Fabio Gadducci (University of Pisa, Italy) - Julian Gutierrez (University of Edinburgh, UK) - Thomas Hildebrandt (IT University of Copenhagen, Denmark) - Daniel Hirschkoff (ENS Lyon, France) - Barbara Jobstmann (CNRS/Verimag, France) - Ivan Lanese (University of Bologna, Italy) - Alberto Lluch Lafuente (IMT Lucca, Italy) - Hernan Melgratti (University of Buenos Aires, Argentina) - Madhavan Mukund (Chennai Mathematical Institute, India) - Dejan Nickovic (IST, Austria) - Sophie Quinton (Verimag, France) - Alexandra Silva (CWI, Netherlands) - Pawel Sobocinski (University of Southampton, UK) - Ana Sokolova (University of Salzburg, Austria) - Paola Spoletini (University of Insubria, Italy) - Emilio Tuosto (University of Leicester, UK) - Hugo Torres Vieira (New University of Lisbon, Portugal) === ICEcreamers === - Simon Bliudze (CEA LIST, France; co-chair) - Roberto Bruni (University of Pisa, Italy; co-chair) - Davide Grohmann (Universita' di Udine; website and discussion forum) - Alexandra Silva (CWI, Netherlands; local arrangements) === Contact === Please write to for any additional information you may need. === Previous editions === The previous two editions of ICE have been held in: ? Reykjavik, Iceland, on July 6th, 2008, with focus on Synchronous and Asyn- chronous Interactions in Concurrent/Distributed Systems, co-located with ICALP?08 (http://ice08.dimi.uniud.it/). The post proceedings were published in ENTCS (vol.229-3). ? Bologna, Italy, on August 31st, 2009, with focus on Structured Interactions, co-located with CONCUR?09 (http://ice09.dimi.uniud.it/). The post proceedings were published in EPTCS (vol.12) and a special issue of MSCS is now in preparation. === Sponsors === * CEA LIST (http://www-list.cea.fr) * ArtistDesign network of excellence (http://www.artist-embedded.org) * Institute for Programming research and Algorithmics (IPA - http://www2.win.tue.nl/ipa/) . From christian.retore at labri.fr Thu Apr 29 18:50:29 2010 From: christian.retore at labri.fr (retore) Date: Fri, 30 Apr 2010 00:50:29 +0200 Subject: [TYPES/announce] PhD offer on categorical logic (University of Bordeaux, INRIA Grant) Message-ID: The following topic is eligible for a PhD grant funded by INRIA (details and application online): Categorical interpretations of first order linear logic ? with application to ontological aspects of lexical semantics http://www.labri.fr/perso/retore/SUJETS/semantique_categorique_LL.html (supervised by Christian Retor? INRIA & LaBRI and Jean Gillibert IMB ? universit? de Bordeaux) This subject involves mathematical logic, theoretical computer science, category theory and topology, with some applications to the semantics of natural language. Please forward this announcement to every student that may be interested. Jean Gillibert http://www.math.u-bordeaux1.fr/~gilliber/ Christian Retor? http://www.labri.fr/perso/retore/ -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100429/89e5ad7a/attachment.htm From luigi.santocanale at lif.univ-mrs.fr Sat May 1 02:56:54 2010 From: luigi.santocanale at lif.univ-mrs.fr (Luigi Santocanale) Date: Sat, 01 May 2010 08:56:54 +0200 Subject: [TYPES/announce] FICS 2010: 2nd Call for Contributions Message-ID: <4BDBD0B6.6080709@lif.univ-mrs.fr> [* Apologies for multiple copies *] 2nd Call for Papers (Extended Abstracts) 7th Workshop on Fixed Points in Computer Science, FICS 2010 Brno, Czech Republic, August 21-22 2010 a satellite workshop to MFCS & CSL 2010 http://www.lif.univ-mrs.fr/fics2010/ Background Fixed points play a fundamental role in several areas of computer science and logic by justifying induction and recursive definitions. The construction and properties of fixed points have been investigated in many different frameworks such as: design and implementation of programming languages, program logics, databases. The aim of the workshop is to provide a forum for researchers to present their results to those members of the computer science and logic communities who study or apply the theory of fixed points. Previous workshops were held in Brno (1998, MFCS/CSL workshop), Paris (2000, LC workshop), Florence (2001, PLI workshop), Copenhagen (2002, LICS (FLoC) workshop), Warsaw (2003, ETAPS workshop), Coimbra (2009, CSL workshop). Topics include, but are not restricted to: * categorical, metric and ordered fixed point models * fixed points in algebra and coalgebra * fixed points in languages and automata * fixed points in programming language semantics * the mu-calculus and fixed points in modal logic * fixed points in process algebras and process calculi * fixed points in the lambda-calculus, functional programming and type theory * fixed points in relation to dataflow and circuits * fixed points in logic programming and theorem proving * finite model theory, descriptive complexity theory, fixed points in databases Invited speakers * Arnaud Carayol, Laboratoire d'informatique Gaspard-Monge. * Panos Rondogiannis, University of Athens. * Dale Miller, INRIA and LIX. Contributed talks Selection of contributed talks is based on extended abstracts/short papers of 3...6 pp formatted with easychair.cls. Submission is via EasyChair, by June 13 2010. The authors will be notified of acceptance/rejection by July 10 2010. Camera-ready versions of the accepted contributions will be published for distribution at the workshop as a technical report. Journal publication If the number and quality of submissions and accepted talks warrant this, EDP Sciences will publish a special issue of Theoretical Informatics and Applications. With one exception, the special issues of the previous FICS editions appeared in this journal. The special issue of FICS 2009 will also appear there. FICS Program Committee Thorsten Altenkirch (University of Nottingham) Giovanna d'Agostino (University of Udine) Peter Dybjer (Chalmers University of Technology) Zolt?n ?sik (University of Szeged) Anna Ing?lfsd?ttir (Reykjav?k University) Gerhard J?ger (University of Bern) Ralph Matthes (IRIT, Toulouse) Andrzej Murawski (University of Oxford) Damian Niwinski (Warsaw University) Luigi Santocanale (LIF, Marseille) Alex Simpson (University of Edinburgh) Jean-Marc Talbot (LIF, Marseille) Tarmo Uustalu (Institute of Cybernetics, Tallinn) Yde Venema (University of Amsterdam) Igor Walukiewicz (LaBRI, Bordeaux) Sponsors Laboratoire d'Informatique Fondamentale de Marseille Universit? de Provence -- Luigi Santocanale LIF/CMI Marseille T?l: 04 91 11 35 74 http://www.cmi.univ-mrs.fr/~lsantoca/ Fax: 04 91 11 36 02 From till at informatik.uni-bremen.de Sat May 1 04:52:57 2010 From: till at informatik.uni-bremen.de (Till Mossakowski) Date: Sat, 01 May 2010 10:52:57 +0200 Subject: [TYPES/announce] CfP: 20th WADT - deadline extended to May, 10th Message-ID: [sorry if you receive this more than once] CALL FOR PAPERS DEADLINE FOR TWO-PAGE ABSTRACTS EXTENDED TO MAY, 10th WADT 2010 20th International Workshop on Algebraic Development Techniques July 1-4, 2010, Etelsen, Germany http://www.informatik.uni-bremen.de/WADT2010/ Aims and Scope: The algebraic approach to system specification encompasses many aspects of the formal design of software systems. Originally born as formal method for reasoning about abstract data types, it now covers new specification frameworks and programming paradigms (such as object-oriented, aspect-oriented, agent-oriented, logic and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed and mobile systems). The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends. Topics of interest: Typical, but not exclusive topics of interest are: - Foundations of algebraic specification - Other approaches to formal specification, including process calculi and models of concurrent, distributed and mobile computing - Specification languages, methods, and environments - Semantics of conceptual modelling methods and techniques - Model-driven development - Graph transformations, term rewriting and proof systems - Integration of formal specification techniques - Formal testing and quality assurance, validation, and verification INVITED SPEAKERS Hans-Dieter Ehrich, Institut f\"ur Informationssysteme, Braunschweig Frantisek Plasil, Charles University, Prague Martin Wirsing, Ludwig-Maximilians-Universit\"at, M\"unchen IMPORTANT DATES Submission deadline for abstracts: May 10, 2010 Notification of acceptance: May 23, 2010 Final abstract due: June 13, 2010 Workshop: July 1-4, 2010 Workshop Format and Location: The workshop will take place over four days, Thursday to Sunday, at Schloss Etelsen, www.schloss-etelsen.de, a castle located near Bremen. Presentations will be selected on the basis of submitted abstracts. Three talks will be given by invited speakers. Submissions: The scientific program of the workshop will include presentations of recent results and ongoing research. The presentations will be selected by the Steering Committee on the basis of the submitted abstracts according to originality, significance, and general interest. The abstracts have to be submitted electronically according to the instructions published on the workshop web site. The final versions of the selected abstracts will be included in a hand-out for the workshop participants. After the workshop, selected authors will be invited to submit full papers for the refereed proceedings, which is expected to be published as a volume of Lecture Notes in Computer Science (Springer Verlag). Sponsorship: The workshop takes place under the auspices of IFIP WG 1.3, and is sponsored by IFIP TC1, University of Bremen, and DFKI GmbH. The event is organized by the Computer Science Department of the University of Bremen and the DFKI Bremen group Safe and Secure Cognitive Systems. WADT Steering Committee: Michel Bidoit (France) Andrea Corradini (Italy) Jos\'e Fiadeiro (UK) Rolf Hennicker (Germany) Hans-J\"org Kreowski (Germany) Till Mossakowski (Germany) [chair] Fernando Orejas (Spain) Francesco Parisi-Presicce (Italy) Andrzej Tarlecki (Poland) PROCEEDINGS The abstracts accepted for presentation will be available at the workshop. Refereed LNCS proceedings are planned for full versions of submissions solicited after the workshop. CONTACT WADT 2010 Fachbereich 3 Mathematik und Informatik Enrique-Schmidt-Str. 5 D-28359 Bremen, Germany Phone: +49 421 218 64226 Fax: +49 421 218 98 64226 Email: wadt2010 at informatik.uni-bremen.de From gabriel at info.uaic.ro Sat May 1 11:53:20 2010 From: gabriel at info.uaic.ro (Gabriel Ciobanu) Date: Sat, 1 May 2010 18:53:20 +0300 (EEST) Subject: [TYPES/announce] MeCBIC 2010: 4th Workshop on Membrane Computing and Biologically Inspired Process Calculi Message-ID: Call for Papers MeCBIC 2010 4th Workshop on Membrane Computing and Biologically Inspired Process Calculi http://www.info.uaic.ro/~mecbic/mecbic2010/ Jena, Germany, 23-24 August 2010 Affiliated to CMC11, Conference on Membrane Computing http://cmc11.uni-jena.de/index.html ====================================================================== *** IMPORTANT DATES *** Title and Abstract: 7 June, 2010 Paper Submission: 12 June, 2010 Notification: 31 July, 2010 Pre-EPTCS version: 12 Aug., 2010 Biological membranes play a fundamental role in the complex reactions which take place in cells of living organisms. The importance of this role has been considered in two different types of formalisms recently introduced. Membrane systems were introduced as a class of distributed parallel computing devices inspired by the observation that any biological system is a complex hierarchical structure, with a flow of materials and information that underlies their functioning. The modeling and the analysis of biological systems has also attracted the interest of the process algebra research community. Thus the notions of membranes and compartments have been explicitly represented in a family of calculi, such as Ambients and Brane Calculi. A cross fertilization of the two research areas has recently started. A deeper investigation of the relations between these related formalisms is interesting, as it is important to understand the similarities and the differences. The main aim of the workshop is to bring together researchers working in membrane computing, in biologically inspired process calculi (ambients, brane calculi, etc.) and in other related fields to present recent results and to discuss new ideas concerning such formalisms, their properties and relationships. Original research papers (including significant work-in-progress) on the membrane systems or biologically inspired process calculi are sought. Papers on the relationship between membrane systems and biologically inspired process calculi are particularly welcome. Related formal approaches in which cell compartments play an important role are also within the scope of the workshop. Topics of interest include (but are not limited to): * Biologically inspired models and calculi; * Biologically inspired systems and their applications; * Analysis of properties of biologically inspired models and languages; * Theoretical links and comparison between different models/systems. *** SUBMISSION GUIDELINES *** Authors are invited to submit a PDF version of their papers (of about 15 pages) using the EPTCS style (http://www.eptcs.org/). Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Authors should submit their papers via EasyChair (http://www.easychair.org/conferences/?conf=mecbic2010). We also encourage the submission of short papers, limited to 8 pages, presenting new tools or platforms related to the topics of MeCBIC 2010. *** DISSEMINATION *** The workshop proceedings will be available electronically, and then published in the Electronic Proceedings in Theoretical Computer Science. After the workshop, extended and additionally refereed papers will be published in a special issue of Theoretical Computer Science including selected papers of both MeCBIC 2009 and MeCBIC 2010. *** PROGRAM COMMITTEE *** * Joern Behre Friedrich Schiller University, Jena, DE * Luca Cardelli, Microsoft Research, Cambridge, UK * Matteo Cavaliere, CSIC-CNB, Madrid, Spain * Gabriel Ciobanu, ICS, Romanian Academy, Iasi, RO (co-chair) * Federica Ciocchetta, CoSBi, Trento, Italy * Flavio Corradini, University of Camerino, Italy * Erzsebet Csuhaj-Varju, CARI, Hungarian Academy, Budapest, HU * Erik de Vink, Technische Universiteit Eindhoven, NL * Marian Gheorghe, University of Sheffield, UK * Jean-Louis Giavitto, University of Evry, France * Thomas Hinze, Friedrich Schiller University, Jena, DE * Maciej Koutny, Newcastle University, UK (co-chair) * Paolo Milazzo, University of Pisa, Italy * Angelo Troina, University of Torino, Italy * Claudio Zandron, University of Milano-Bicocca, Italy * Gianluigi Zavattaro, University of Bologna, Italy From brunocdsoliveira at googlemail.com Sun May 2 05:06:32 2010 From: brunocdsoliveira at googlemail.com (Bruno Oliveira) Date: Sun, 2 May 2010 18:06:32 +0900 Subject: [TYPES/announce] WGP 2010 Second Call for Papers Message-ID: ====================================================================== CALL FOR PAPERS WGP 2010 6th ACM SIGPLAN Workshop on Generic Programming Baltimore, Maryland, US Sunday, September 26th, 2010 http://osl.iu.edu/wgp2010 Collocated with the International Conference on Functional Programming (ICFP 2010) ====================================================================== Goals of the workshop --------------------- Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, and, for at least 20 years, generic programming techniques have been a specific focus of research in the functional and object-oriented programming communities. Generic programming has gradually spread to more and more mainstream languages, and today is widely used in industry. This workshop brings together leading researchers and practitioners in generic programming from around the world, and features papers capturing the state of the art in this important area. We welcome contributions on all aspects, theoretical as well as practical, of * polytypic programming, * programming with dependent types, * programming with type classes, * programming with (C++) concepts, * generic programming, * programming with modules, * meta-programming, * adaptive object-oriented programming, * component-based programming, * strategic programming, * aspect-oriented programming, * family polymorphism, * object-oriented generic programming, * and so on. Organizers ---------- Co-Chair Bruno C. d. S. Oliveira, Seoul National University Co-Chair Marcin Zalewski, Indiana University Programme Committee ------------------- Alley Stoughton, Kansas State University Andrei Alexandrescu, Facebook Bruno C. d. S. Oliveira (Co-Chair), Seoul National University Doug Gregor, Apple Gilad Bracha, I am a Computational Theologist Emeritus Magne Haveraaen, Universitetet i Bergen Marcin Zalewski (Co-Chair), Indiana University Neil Mitchell, Standard Chartered Ralf L?mmel, University of Koblenz-Landau Shin-Cheng Mu, Academia Sinica Thorsten Altenkirch, University of Nottingham Ulf Norell, Chalmers University Important Information --------------------- We plan to have formal proceedings, published by the ACM. Submission details Deadline for submission: Sunday 2010-06-13 Notification of acceptance: Monday 2010-07-12 Final submission due: Tuesday 2010-07-27 Workshop: Sunday 2010-09-26 Authors should submit papers, in postscript or PDF format, formatted for A4 paper, to the WGP09 EasyChair instance by 13th of June 2010. The length should be restricted to 12 pages in standard (two-column, 9pt) ACM format. Accepted papers are published by the ACM and will additionally appear in the ACM digital library. History of the Workshop on Generic Programming ---------------------------------------------- This year: * Baltimore, Maryland, US 2010 (affiliated with ICFP10) Earlier Workshops on Generic Programming have been held in * Edinburgh, UK 2009 (affiliated with ICFP09) * Victoria, BC, Canada 2008 (affiliated with ICFP), * Portland 2006 (affiliated with ICFP), * Ponte de Lima 2000 (affiliated with MPC), * Marstrand 1998 (affiliated with MPC). Furthermore, there were a few informal workshops * Utrecht 2005 (informal workshop), * Dagstuhl 2002 (IFIP WG2.1 Working Conference), * Nottingham 2001 (informal workshop), There were also (closely related) DGP workshops in Oxford (June 3-4 2004), and a Spring School on DGP in Nottingham (April 24-27 2006, which had a half-day workshop attached). Additional information: The WGP steering committee consists of J Gibbons, R Hinze, P Jansson, J Jarvi, J Jeuring, B Oliveira, S Schupp and M Zalewski -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100502/3ed1be57/attachment.htm From phil at site.uottawa.ca Sun May 2 13:11:59 2010 From: phil at site.uottawa.ca (Phil Scott) Date: Sun, 2 May 2010 13:11:59 -0400 (EDT) Subject: [TYPES/announce] PCAs 2010: a LICS-FLoC 2010 workshop Message-ID: This is to announce: Partial Combinatory Algebras in Realizability and Computability (PCAs 2010) Friday 9th July 2010, Edinburgh, UK A LICS 2010-affiliated workshop at FLoC 2010 http://www.mathstat.uottawa.ca/~phofstra/FLoC2010/workshop.html A workshop bringing together researchers working on all aspects of partial combinatory algebras (PCAs) in realizability and computability. Invited speakers: Andrej Bauer (Ljubljana) Inge Bethke (Amsterdam) John Longley (Edinburgh) Jaap van Oosten (Utrecht) Pino Rosolini (Genova) Thomas Streicher (Darmstadt) CALL FOR CONTRIBUTED TALKS There are (a limited number) of slots for contributed talks: if you would like to contribute a talk to this workshop please contact one of the organizers (Robin Cockett or Pieter Hofstra) with a title and a short abstract and we will try to accommodate you. It is intended to have a special issue of MSCS dedicated to the general theme of the workshop which will be open to contributions from the participants of the workshops and others with interest in this area. From moggi at disi.unige.it Mon May 3 10:58:50 2010 From: moggi at disi.unige.it (moggi@disi.unige.it) Date: Mon, 3 May 2010 16:58:50 +0200 (CEST) Subject: [TYPES/announce] ICTCS 2010 last CFP Message-ID: <20100503145850.BB1EE35DC5@mailstore.csita.unige.it> Last Call for Papers 12th Italian Conference on Theoretical Computer Science (ICTCS 2010) Camerino, Italy, September 15-17, 2010 http://www.cs.unicam.it/ictcs2010 ICTCS 2010 provides a forum for the exchange of ideas among researchers, and it aims to foster an environment, where junior researchers and PhD students can gain experience in presenting their work, broaden their views on the subject, and benefit from contact with more established researchers. Also researchers from outside Italy are welcome to submit papers and attend the Conference. The Scientific and Organizing Committee welcomes contributions in any area of Theoretical Computer Science. These contributions could describe - original works, that the authors may want to submit to a post-conference special issue; - original works submitted or accepted somewhere else, that the authors wish to publicize at ICTCS; - works in progress, on which the authors wish to get feedback at ICTCS. IMPORTANT DATES Submission Deadline: - May 20 (for entering title and text abstract) - May 27 (for adding pdf and attachments) Notification of Acceptance: June 20 Early registration deadline: July 30 Conference: September 15-17 SUBMISSIONS. Authors are invited to submit electronically an extended abstract (in pdf format), NOT EXCEEDING FOUR SINGLE spaced pages. The Scientific and Organizing Committee is considering the publication of a postconference special issue in the Journal Theoretical Informatics and Applications. For additional information, please refer to the conference web page. Further queries concerning submissions for presentation at ICTCS or to the special issue can be sent to ictcs2010 at easychair.org INVITED SPEAKERS Marco Bernardo (Univ. di Urbino) Stefano Crespi-Reghizzi (Poli. di Milano) Rossella Petreschi (Sapienza Univ. di Roma) ICTCS is hosted by Camerino University. Camerino is an historical town in the Center of Italy, known and respected since Roman times, which became particularly important in the middle-age. Camerino is located in hilly surroundings (Marche Region), between the spectacular Appennini mountains and the pleasant Adriatic coast. CO-LOCATED EVENT. The last meeting of PRIN national project PaCo: Performability-aware Computing http://www.sti.uniurb.it/paco/ is organised at Camerino, Italy on September 13-14, 2010. Ongoing work and final results of the research units will be presented by the involved researchers. SCIENTIFIC AND ORGANIZING COMMITTEE Marcella Anselmo (Univ. di Salerno) Tiziana Calamoneri (Sapienza Univ. di Roma) Flavio Corradini (Univ. di Camerino) Emanuela Merelli (Univ. di Camerino) Eugenio Moggi (Univ. di Genova) From bove at chalmers.se Mon May 3 13:10:47 2010 From: bove at chalmers.se (Ana Bove) Date: Mon, 3 May 2010 19:10:47 +0200 Subject: [TYPES/announce] PAR'10: Call for Participation Message-ID: <4BDF0397.7080501@chalmers.se> ======================================================================== Call for Participation PAR 2010 Workshop on Partiality And Recursion in Interactive Theorem Provers Edinburgh, UK, 15 July 2010 (satellite workshop of ITP'10) a mid-FLoC 2010 workshop ======================================================================== PAR'10 is a one-day workshop organised as a part of FLoC'10. It is a venue for researchers working on new approaches to cope with partial functions and terminating general recursion in (interactive) theorem provers. See for further details. Registration is now open via FLoC 2010 registration form Early registration is open until May 17th. The programme of the workshop will comprise: Invited Speakers: 1. Alexander Krauss (Technische Universitat Muenchen): Recursive Definitions of Monadic Functions. 2. Conor McBride (University of Strathclyde): Djinn, monotonic. Contributed Talks: 1. Andreas Abel: Integrating Sized and Dependent Types. 2. Nils Anders Danielsson: Beating the Productivity Checker Using Embedded Languages. 3. Issam Maamria and Michael Butler: Rewriting and Well-Definedness within a Proof System. 4. Claudio Sacerdoti Coen and Silvio Valentini: General Recursion and Formal Topology. 5. Aaron Stump, Vilhelm Sj?berg and Stephanie Weirich: Termination Casts: A Flexible Approach to Termination with General Recursion. Informal presentations: 1. Thorsten Altenkirch and Nils Anders Danielsson: Termination Checking Nested Inductive and Coinductive Types. 2. Gavin Mendel-Gleason and Geoff Hamilton. Inhabitation of (Co)-inductive Types using Transition Systems. 3. Tarmo Uustalu. Antifounded coinduction in type theory. See also the workshop program at At PAR'10, we envisage an open, friendly, and inspiring discussion of the latest trends and achievements in the area. Looking forward to seeing you in Edinburgh, -- PAR'10 organising committee From Alex.Simpson at ed.ac.uk Tue May 4 15:39:13 2010 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Tue, 04 May 2010 20:39:13 +0100 Subject: [TYPES/announce] PSPL 2010: Programme, registration and student grants Message-ID: <20100504203913.ij2j424n34ks408c@www.staffmail.ed.ac.uk> Proof Systems for Program Logics (PSPL 2010) Saturday 10th July 2010, Edinburgh, UK A LICS 2010-affiliated workshop at FLoC 2010 http://homepages.inf.ed.ac.uk/als/PSPL2010/ REGISTRATION: Now open. (Early registration discounts apply until May 17th.) STUDENT GRANTS: Still available. Enquiries to pspl2010 at easychair.org PROGRAMME: Invited talks: * Recent developments in concurrent program logics Viktor Vafeiadis (University of Cambridge) * Proof Systems for Hybrid System Logics Andre Platzer (Carnegie Mellon University) Discussion session: * Challenge topics in PSPL Led by Peter O'Hearn and Alex Simpson Contributed talks: * A simple proof system for lock-free concurrency Luis Caires, Carla Ferreira and Antonio Ravara (Universidade Nova de Lisboa) * Tableau-like automata-based axiomatization for Propositional Linear Temporal Logic Nikolay Shilov (Ershov Institute of Informatics Systems, Novosibirsk) * Towards a Cut-free Sequent Calculus for Boolean BI Sungwoo Park and Jonghyun Park (Pohang University of Science and Technology) * A Developer-oriented Hoare Logic Holger Gast (University of Tuebingen) * A Proof System for Reasoning about Probabilistic Concurrent Processes Matteo Mio (University of Edinburgh) * A multi-modal dependent type theory for representing data accessibility in a network Giuseppe Primierio (Ghent University) -- Alex Simpson, LFCS, School of Informatics, Univ. of Edinburgh, UK Email: Alex.Simpson at ed.ac.uk Tel: +44 (0)131 650 5113 Web: http://homepages.inf.ed.ac.uk/als Fax: +44 (0)131 651 1426 -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From asperti at cs.unibo.it Wed May 5 03:31:18 2010 From: asperti at cs.unibo.it (Andrea Asperti) Date: Wed, 05 May 2010 09:31:18 +0200 Subject: [TYPES/announce] MSCS Special Issue - Mechanization of Mathematics (second call) Message-ID: <4BE11EC6.6020501@cs.unibo.it> Mathematical Structures in Computer Science Special Issue on Advances and Perspectives in the Mechanization of Mathematics Guest Editors: Andrea Asperti and Jeremy Avigad Call for contributions Recent advances in automated reasoning and interactive theorem proving have made it possible to formalize and mechanically check substantial mathematical theorems, such as the prime number theorem, the four color theorem, and the Jordan curve theorem. In particular, a number of interactive proof assistants have been developed to help users manage libraries of definitions and theorems, and fill in the inferential details of a mathematical argument. Automated methods are also often used to verify calculations that are too long and complex to check by hand. As mathematical proofs become more complicated and, increasingly, rely on extensive calculation, this gives rise to an exciting interaction between traditional methods and computational means of verifying mathematical claims. The present issue is devoted to recent advances and new perspectives in this field, including descriptions of formalizations, thoughtful reflection on the future of the discipline, novel insights, innovative research directions, and critical assessments of the current state of the art. Deadlines Deadline for submissions: June 28, 2010 Author's notification: September 27, 2010 Submissions: All papers should be written in pdf and submitted via the EasyChair system, accessible at the following address: https://www.easychair.org/login.cgi?conf=mscsadvancesandperspectivesint Authors are invited to write their papers following the mscs instructions available in the MSCS guide for contributors downloadable here: http://assets.cambridge.org/MSC/MSC_ifc.pdf. Extended versions of work previously published in conference proceedings are eligible for submission but authors should make it clear how their submission improves upon the conference publication; in those cases where Cambridge University Press is not the publisher of the original conference proceedings, authors should take care to avoid infringing that publisher's copyright. Authors who wish to discuss potential submissions are encouraged to contact the guest editors. Papers should not be longer than 35 pages; shorter papers are obviously welcome. ------------------------------------------------------------ All informations can be found at the following web page: http://www.cs.unibo.it/~asperti/mscs -- Andrea Asperti & Jeremy Avigad From Alex.Simpson at ed.ac.uk Wed May 5 07:59:33 2010 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Wed, 05 May 2010 12:59:33 +0100 Subject: [TYPES/announce] SCTS (Edinburgh, 21st May): Programme and call for participation Message-ID: <20100505125933.8c3d959i6oc0ogc8@www.staffmail.ed.ac.uk> At the meeting announced below, a well-known type theorist promises to overturn an established mathematical definition. -- ******************************************************************** *** Scottish Category Theory Seminar *** Second Meeting *** Friday 21st May 2010, 2-5.30pm *** Informatics Forum, University of Edinburgh, Scotland *** http://homepages.inf.ed.ac.uk/als/SCT/sct100521.html ******************************************************************** We are pleased to announce the programme of the Second Scottish Category Theory Seminar. The meetings is open, and all are welcome to attend. * Invited talk: Antony Maciocia (University of Edinburgh) Triangulated Categories in Algebraic Geometry * Thorsten Altenkirch (University of Nottingham) Monads Need Not Be Endofunctors * Peter Kropholler (University of Glasgow) My Favourite Adjunctions * Invited talk: Dirk Pattinson (Imperial College London) Category-theoretic Proof Theory of Modal Logics For more information see webpage: http://homepages.inf.ed.ac.uk/als/SCT/sct100521.html -- Alex Simpson, LFCS, School of Informatics, Univ. of Edinburgh, UK Email: Alex.Simpson at ed.ac.uk Tel: +44 (0)131 650 5113 Web: http://homepages.inf.ed.ac.uk/als Fax: +44 (0)131 651 1426 -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From cesar.a.munoz at nasa.gov Wed May 5 12:05:38 2010 From: cesar.a.munoz at nasa.gov (Munoz, Cesar Augusto (LARC-D320)) Date: Wed, 5 May 2010 11:05:38 -0500 Subject: [TYPES/announce] IWS 2010: Call for Participation In-Reply-To: Message-ID: ------------------------------------------------------------- CALL FOR PARTICIPATION: IWS 2010 International Workshop on Strategies in Rewriting, Proving, and Programming Edinburgh, Scotland, July 9, 2010 http://iws2010.inria.fr iws2010 AT inria DOT fr Affiliated with FLoC (July 9-21, 2010) http://www.floc-conference.org EARLY REGISTRATION DEADLINE: May 17 ------------------------------------------------------------- Strategies are ubiquitous in programming languages, automated deduction and reasoning systems. In the two communities of Rewriting and Programming on one side, and of Deduction and Proof engines (Provers, Assistants, Solvers) on the other side, workshops have been launched to make progress towards a deeper understanding of the nature of strategies, their descriptions, their properties, and their usage, in all kinds of computing and reasoning systems. Since more recently, strategies are also playing an important role in rewrite-based programming languages, verification tools and techniques like SAT/SMT engines or termination provers. Moreover strategies have come to be viewed more generally as expressing complex designs for control in computing, modeling, proof search, program transformation, and access control. FLoC 2010 provides an excellent opportunity to foster exchanges between the communities of Rewriting and Programming on one side, and of Deduction and Proof engines on the other side. This workshop is a joint follow-up of two series of workshops, held since 1997: the Strategies workshops held by the CADE-IJCAR community and the Workshops on Reduction Strategies (WRS) held by the RTA-RDP community. INVITED TALKS Dan Dougherty, Worcester Polytechnic Institute: Game Strategies and Rule-Based Systems Assia Mahboubi, INRIA: Organizing and Using Algebraic Structures in Large Developments of Formalized Mathematics TECHNICAL PROGRAM Pascal Fradet, Jean-Louis Giavitto and Marnes Hoff: Refinement of Chemical Programs Using Strategies Alvaro Garcia, Pablo Nogueira and Emilio Jesus Gallego Arias: The Beta Cube Alex Gerdes, Bastiaan Heeren and Johan Jeuring: Properties of Exercise Strategies Bernhard Gramlich and Felix Schernhammer: Termination of Rewriting with - and Automated Synthesis of - Forbidden Patterns Ian Mackie: Closed Cut-Elimination in Linear Logic Olivier Namet and Maribel Fernandez: A Strategy Language for Graph Rewriting Systems Detlef Plump: Graph Programs Rene Thiemann, Jurgen Giesl, Peter Schneider-Kamp and Christian Sternagel: Loops under Strategies ... Continued PROGRAM COMMITTEE Maria Paola Bonacina, Universita degli Studi di Verona, Italy Jean-Christophe Filliatre, CNRS, France Bernhard Gramlich, Technische Universitaet Wien, Austria Salvador Lucas, Universidad Politecnica de Valencia, Spain Pierre-Etienne Moreau, INRIA-LORIA Nancy, France Natarajan Shankar, SRI International, United States Eelco Visser, Delft University of Technology, Netherlands Christoph Weidenbach, Max Planck Institute for Informatics, Germany ORGANIZERS and CHAIRS Helene Kirchner, INRIA, France Cesar Munoz, NASA, US REGISTRATION (Through FLoC 2010) http://www.floc-conference.org/registration.html From eabonelli at gmail.com Wed May 5 13:21:28 2010 From: eabonelli at gmail.com (Eduardo Bonelli) Date: Wed, 5 May 2010 14:21:28 -0300 Subject: [TYPES/announce] HOR'2010 (Affiliated with RTA'2010) - Call for participation Message-ID: 5th International Workshop on Higher-Order Rewriting (Affiliated with RTA'2010) Wednesday July 14, 2010, Edinburgh, UK http://hor.pps.jussieu.fr/10/ DESCRIPTION HOR 2010 is a forum to present work concerning all aspects of higher-order rewriting. The aim is to provide an informal and friendly setting to discuss recent work and work in progress. The following is a non-exhaustive list of topics for the workshop: * Applications: proof checking, theorem proving, generic programming, declarative programming, program transformation, automated termination/confluence tools. * Foundations: pattern matching, unification, strategies, narrowing, termination, syntactic properties, type theory, complexity of derivations. * Frameworks: term rewriting, conditional rewriting, graph rewriting, net rewriting, comparisons of different frameworks. Implementation: explicit substitution, rewriting tools, compilation techniques. * Semantics: semantics of higher-order rewriting, categorical rewriting, higher-order abstract syntax, games and rewriting INVITED TALKS Closed nominal rewriting: properties and applications Maribel Fern?ndez (King's College London, UK) Computational interpretations of logic Silvia Ghilezan (University of Novi Sad, Serbia) CONTRIBUTED TALKS * Equivalence of algebraic lambda-calculi Alejandro D?az-caro, Simon Perdrix, Christine Tasson and Beno?t Valiron * Uncurrying for Innermost Termination and Derivational Complexity Harald Zankl, Nao Hirokawa and Aart Middeldorp * A Calculus of Coercions Proving the Strong Normalization of MLF Giulio Manzonetto and Paolo Tranquilli * A new formalism for higher-order rewriting Cynthia Kop * On the Implementation of Dynamic Patterns Thibaut Balabonski * Higher-order Rewriting for Executable Compiler Specifications Kristoffer Rose * Swapping: a natural bridge between named and indexed explicit substitution calculi Ariel Mendelzon, Alejandro R?os and Beta Ziliani * Standardisation for constructor based pattern calculi Delia Kesner, Carlos Lombardi and Alejandro R?os From venneri at dsi.unifi.it Thu May 6 04:19:42 2010 From: venneri at dsi.unifi.it (Betti Venneri) Date: Thu, 06 May 2010 10:19:42 +0200 Subject: [TYPES/announce] ITRS 2010: Call for Participation and Programme Message-ID: <4BE27B9E.2070300@dsi.unifi.it> ======================================================================== CALL FOR PARTICIPATION **ITRS 2010** Fifth Workshop on Intersection Types and Related Systems Edinburgh, UK, 9 July 2010 http://gdn.dsi.unifi.it/itrs/ affiliated with LICS 2010 pre-FLoC'10 workshop ======================================================================== ITRS 2010 is a venue for researchers working on both the theory and practical applications of systems based on intersection types and related approaches. You are invited to participate. REGISTRATION: use FLoC registration page http://www.floc-conference.org/registration.html EARLY REGISTRATION is open and lasts until May 17. WORKSHOP PROGRAMME: Invited Talks * Adriana Compagnoni (Stevens Inst. of Technology, New-Jersey) Church-style and Curry-style Subtyping * Simona Ronchi Della Rocca (Univ. degli Studi di Torino) A Logic Foundation for Intersection and Union Types Contributed Talks *Steffen van Bakel Sound and Complete Typing for Lambda-Mu *Joshua Dunfield Untangling Typechecking of Intersections and Unions *Elena Giachino On Semantic Subtyping and Safe Object-Oriented Sessions *Paola Giannini, Mariangiola Dezani-Ciancaglini and Elena Zucca Intersection types for unbind and rebind *Luca Padovani Session Types = Intersection Types + Union Types *Vilhelm Sj?berg and Aaron Stump Equality, Quasi-Implicit Products, and Large Eliminations For program schedule and more information: http://gdn.dsi.unifi.it/itrs/ -- Betti Venneri Dipartimento di Sistemi e Informatica Universita' di Firenze Viale Morgagni, 65 -50134 Firenze (Italy) http://www.dsi.unifi.it/~venneri From txa at Cs.Nott.AC.UK Thu May 6 08:28:56 2010 From: txa at Cs.Nott.AC.UK (Thorsten Altenkirch) Date: Thu, 6 May 2010 13:28:56 +0100 Subject: [TYPES/announce] DTP 2010: call for participation Message-ID: <8F80FEEA-880C-4013-A46B-BCF7C90B9306@Cs.Nott.AC.UK> (s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)-> DTP 2010 --- Call for Participation EARLY REGISTRATION ENDS 17 MAY 2010 Workshop on DEPENDENTLY TYPED PROGRAMMING Edinburgh, Scotland, 9&10 July 2010 (a FLoC workshop, affiliated with LICS) http://sneezy.cs.nott.ac.uk/darcs/dtp10/ (s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)-> Roll up! Roll up! Register early, register often! http://www.floc-conference.org/registration.html Attendance at DTP10 can be yours at a BARGAIN price if you register BEFORE 17 MAY 2010. The preliminary programme for DTP10 is here: http://sneezy.cs.nott.ac.uk/darcs/dtp10/programme.html Invited Talks: Ana Bove, Chalmers University, "10 Years of Partiality and General Recursion" Matthieu Sozeau, Harvard University, "Elaborations in Type Theory" Contributed Talks: Edwin Brady, "Practical, efficient programming with dependent types" James Caldwell, "Extracting Monadic Programs form Proofs", (joint work with Josef Pohl) Adam Chlipala, "Generating Pieces of Web Applications with Type-Level Programming" Nils Anders Danielsson, TBA Larry Diehl, "Unit & integration test composition via lemmas" Makoto Hamana, "Another Initial Algebra Semantics of Inductive Families for Programming" Hugo Herbelin, "A sequent calculus presentation of the Calculus of Inductive Constructions" (joint work with Jeffrey Sarnat, Vincent Siles) Karim Kariso, "Integrating Agda and Automated Theorem Proving Techniques" (joint work with Anton Setzer) Dan Licata, "Security-Typed Programming within Dependently Typed Programming" (joint work with Jamie Morgenstern) Ulf Norell, TBA Carsten Schuermann, "The HOL-Nuprl connection in Delphin", (joint work with Adam Poswolsky) Anton Setzer, "Coalgebras in dependent type theory" Antonis Stampoulis, "VeriML: Type-safe computation of logical terms inside a language with effects" Tarmo Uustalu, TBA Sean Wilson, "Supporting Dependently Typed Functional Programming with Proof Automation and Testing" If, by some chance, you are interested in talking at DTP10, please do get in touch. Space in the programme is now very tight, but we remain open to proposals. See you in Edinburgh in July! Thorsten and Conor From dg at cs.cmu.edu Thu May 6 14:35:14 2010 From: dg at cs.cmu.edu (Deepak Garg) Date: Thu, 06 May 2010 14:35:14 -0400 Subject: [TYPES/announce] PLAS 2010: Call for participation Message-ID: <4BE30BE2.7060203@cs.cmu.edu> *********************************************************************** Call for Participation ACM SIGPLAN Fifth Workshop on Programming Languages and Analysis for Security (PLAS 2010) http://software.imdea.org/events/plas2010/index.html June 10, 2010 Co-located with PLDI 2010, Toronto, Canada *********************************************************************** IMPORTANT INFORMATION Early registration deadline: May 10, 2010 Hotel reduced rate deadline: May 15, 2010 Register at the PLDI website: http://www.cs.stanford.edu/pldi10/ INVITED SPEAKERS * Ranjit Jhala (University of California, San Diego) * Nikhil Swamy (Microsoft Research) ABOUT PLAS PLAS aims to provide a forum for exploring and evaluating ideas on the use of programming language and program analysis techniques to improve the security of software systems. Strongly encouraged are proposals of new, speculative ideas, evaluations of new or known techniques in practical settings, and discussions of emerging threats and important problems. Areas of interest include: * Compiler-based security mechanisms or runtime-based security mechanisms such as inline reference monitors * Program analysis techniques for discovering security vulnerabilities * Automated introduction and/or verification of security enforcement mechanisms * Language-based verification of security properties in software including verification of cryptographic protocols * Specifying and enforcing security policies for information flow and access control * Model-driven approaches to security * Security concerns for web programming languages * Language design for security in new domains such as cloud computing and embedded platforms * Applications, case studies, and implementations of these techniques STUDENT TRAVEL GRANTS PLAS 2010 is pleased to offer a limited number of travel grants to student attendees thanks to our sponsors. For details, please visit the PLAS website. PRELIMINARY PROGRAM Efficient, Context-Sensitive Detection for Real-World Semantic Attacks Michael D Bond, Varun Srivastava, Kathryn Mckinley and Vitaly Shmatikov. Permissive Dynamic Information Flow Analysis Tom Austin and Cormac Flanagan. Attack Model for Verification of Interval Security Properties for Smart Card C Codes Pascal Berthom?, Karine Heydemann, Xavier Kauffman-Tourkestansky and Jean-Francois Lalande. A More Precise Security Type System for Dynamic Security Tests Gregory Malecha and Stephen Chong. Position Paper: The Case for JavaScript Transactions Mohan Dhawan, Chung-Chieh Shan and Vinod Ganapathy. Position Paper: Secure Information Flow Analysis for Hardware Design: Using the Right Abstraction for the Job Xun Li, Mohit Tiwari, Ben Hardekopf, Timothy Sherwood and Frederic T Chong. Short Paper: Marker Interfaces and Overlay Type Systems Adrian Mettler and David Wagner. Restricted Delegation and Revocation in Language-Based Security (Position Paper) Doaa Hassan, Mohammadreza Mousavi and Michel Reniers. PROGRAM COMMITTEE Anindya Banerjee (IMDEA Software Institute) (co-chair) Gilles Barthe (IMDEA Software Institute) Avik Chaudhuri (University of Maryland) Veronique Cortier (LORIA, CNRS) Brendan Eich (Mozilla Corporation) Ulfar Erlingsson (Microsoft Research and Reykjavik University) Deepak Garg (Carnegie Mellon University) (co-chair) Andrew D. Gordon (Microsoft Research) Joshua Guttman (Worcester Polytechnic Institute) Shriram Krishnamurthi (Brown University) Sergio Maffeis (Imperial College London) Todd Millstein (University of California, Los Angeles) John Mitchell (Stanford University) Marco Pistoia (IBM TJ Watson Research Center) Andrei Sabelfeld (Chalmers University) Zhendong Su (University of California, Davis) SPONSORS IBM Research IMDEA Software Institute Microsoft Research Mozilla Corporation From Yves.Bertot at sophia.inria.fr Thu May 6 16:40:59 2010 From: Yves.Bertot at sophia.inria.fr (Yves Bertot) Date: Thu, 06 May 2010 22:40:59 +0200 Subject: [TYPES/announce] Coq-Workshop: Call for informal presentations (updated information) Message-ID: <4BE3295B.9040300@sophia.inria.fr> Coq Workshop Second Call for informal presentations and demonstrations The Coq workshop will take place on July 9th, as part as the FLoC federated conference in Edinburgh, Scotland. The Coq workshop will bring together Coq users, developers and contributors. The workshop will be organized from submitted, informal presentations, invited talks and a plenary discussion on the evolution and design of Coq. Topics of presentations may include any of the following ones: * Experiments with type-theoretic proof assistants * Language or tactics features * Theory and implementation of the Calculus of Inductive Constructions * Applications and experience in education and industry * Tools, platforms built on Coq * Plugins, libraries for Coq * Interfacing with Coq * Formalization tricks and Coq pearls Topics that have been experimented with in any flavor of type theory-based theorem proving and are relevant to the evolution of Coq may also be discussed during these informal presentations. Speakers wishing to present a demonstration should bring their own laptop computer or contact the program chair to arrange for a computer to host the demonstration. Descriptions of the proposed informal presentations should consist of abstracts of approximately 1000 words and be uploaded to the easychair system before May 10th. For further questions, please contact Yves Bertot. Yves.Bertot at sophia.inria.fr From sobocinski at gmail.com Fri May 7 12:20:06 2010 From: sobocinski at gmail.com (Pawel Sobocinski) Date: Fri, 7 May 2010 17:20:06 +0100 Subject: [TYPES/announce] *SOS 2010* 2nd call for papers Message-ID: ********************************************************** SOS `10 - Structural Operational Semantics 2010 An Affiliated Workshop of CONCUR 2010 August 30, 2010, Paris, France http://www.ru.is/faculty/luca/SOS2010/ ********************************************************** 2nd CALL FOR PAPERS ********************************************************** Submission of abstract: Friday 28th May 2010 Submission: Wednesday 2nd June 2010 ********************************************************** Aim: Structural operational semantics (SOS) provides a framework for giving operational semantics to programming and specification languages. A growing number of programming languages from commercial and academic spheres have been given usable semantic descriptions by means of structural operational semantics. Because of its intuitive appeal and flexibility, structural operational semantics has found considerable application in the study of the semantics of concurrent processes. It is also a viable alternative to denotational semantics in the static analysis of programs, and in proving compiler correctness. Moreover, it has found application in emerging areas of computing such as probabilistic systems and systems biology. Structural operational semantics has been successfully applied as a formal tool to establish results that hold for classes of process description languages. This has allowed for the generalization of well-known results in the field of process algebra, and for the development of a meta-theory for process calculi based on the realization that many of the results in this field only depend upon general semantic properties of language constructs. This workshop aims at being a forum for researchers, students and practitioners interested in new developments, and directions for future investigation, in the field of structural operational semantics. One of the specific goals of the series of SOS workshops is to establish synergies between the concurrency and programming language communities working on the theory and practice of SOS. Specific topics of interest include (but are not limited to): - programming languages, process algebras and higher-order formalisms - foundations of SOS - conservative extensions and translations of SOS specifications - congruence results and their meta-theory - modal logics, program logics and SOS - ordered, modular, and other variants of SOS - SOS of probabilistic, timed, stochastic and hybrid systems - SOS and rewriting systems, reactive systems and other forms of operational specification - comparisons between denotational, axiomatic and structural operational semantics - software tools that automate, or are based on, SOS. Reports on applications of SOS to other fields, including: - modelling and analysis of biological systems, - security of computer systems, - programming, modelling and analysis of embedded systems, - specification of middle-ware and coordination languages, - programming language semantics and implementation, - static analysis, - software and hardware verification, are also most welcome. Paper submission ---------------- We solicit unpublished papers reporting on original research on the general theme of SOS. Prospective authors should submit a paper via Easychair by Wednesday, 2nd June 2010. (If you do not have an Easychair account, you can create it by following the link). Papers should take the form of a pdf file in EPTCS format, whose length should not exceed 15 pages (not including an optional "Appendix for referees" containing proofs that will not be included in the final paper). We will also consider 5-page papers describing tools to be demonstrated at the workshop. Proceedings ----------- Preliminary proceedings will be available at the meeting. The final proceedings of the workshop will appear as a volume in the EPTCS series. If the quality and quantity of the submissions warrant it, the co-chairs plan to arrange a special issue of an archival journal devoted to full versions of selected papers from the workshop. Invited speakers ---------------- MohammadReza Mousavi (Eindhoven, NL) Catuscia Palamidessi (INRIA Saclay and ?cole Polytechnique, FR) Program Committee ----------------- Luca Aceto (Reykjavik, IS, co-chair) Robert Amadio (Paris Diderot, FR) Wan Fokkink (Amsterdam, NL) Matthew Hennessy (Dublin, IE) Bartek Klin (Warsaw, PL and Cambridge, UK) Cosimo Laneve (Bologna, IT) Andrew Pitts (Cambridge, UK) Michel Reniers (Eindhoven, NL) Grigore Rosu (Urbana-Champaign IL, USA) Pawel Sobocinski (Southampton, UK, co-chair) Sam Staton (Cambridge, UK) Important Dates --------------- Submission of abstract: Friday 28th May 2010 Submission: Wednesday 2nd June 2010 Notification: Monday, 5th July 2010 Final version: Friday 16th July 2010 Workshop: Monday 30th August 2010 From marino.miculan at uniud.it Fri May 7 13:22:32 2010 From: marino.miculan at uniud.it (Marino Miculan) Date: Fri, 7 May 2010 19:22:32 +0200 Subject: [TYPES/announce] LFMTP 2010 at FLoC: Call for participation Message-ID: <56060F80-3664-4507-A801-C2F5ECE0AE02@uniud.it> ----------------------------------------------------------------------------------------------------- CALL FOR Participation Logical Frameworks and Meta-languages: Theory and Practice (LFMTP 2010) Wednesday, July 14, 2010, Edinburgh, UK A LICS 2010-affiliated workshop at FLoC 2010 http://lfmtp10.dimi.uniud.it/ ----------------------------------------------------------------------------------------------------- EARLY REGISTRATION until 17 MAY 2010 INVITED SPEAKERS: Frank Pfenning (Carnegie Mellon University) Chung-chieh Shan (Rutgers, The State University of New Jersey) CONTRIBUTED TALKS: A Monadic Formalization of ML5 Dan Licata and Robert Harper Pure Type Systems without Explicit Contexts Herman Geuvers, Robbert Krebbers, James McKinna and Freek Wiedijk Representing Isabelle in LF Florian Rabe Explicit substitutions for contextual type theory Andreas Abel and Brigitte Pientka Pattern Unification for the Lambda Calculus with Linear and Affine Types Anders Schack-Nielsen and Carsten Schuermann Closed nominal rewriting and efficiently computable nominal algebra equality Maribel Fernandez and Murdoch Gabbay Generating Bijections between HOAS and the Natural Numbers John Boyland See you in Edinburgh in July! Karl and Marino -- Marino Miculan - Dept Math Compu Sci, University of Udine miculan at dimi.uniud.it http://www.dimi.uniud.it/miculan/ From bpientka at cs.mcgill.ca Mon May 10 06:01:36 2010 From: bpientka at cs.mcgill.ca (Brigitte Pientka) Date: Mon, 10 May 2010 12:01:36 +0200 Subject: [TYPES/announce] Postdoc / PhD position in Computer Science, McGill University Message-ID: ================================================== POSTDOC / PHD POSITION IN COMPUTER SCIENCE School of Computer Science McGill University, Montreal, Canada ================================================= We have one 2-year postdoc position and one funded PhD position in the area of of logical frameworks, type theory, and programming languages. Applicants should have a background in at least one of the following areas: logic, type systems, logical frameworks, theorem proving and/or design and implementation of functional programming languages. McGill University is the top research university in Canada (tied with U. of Toronto, based Macleans's 2005 rankings) and is the only Canadian university to rank consistently among the top 25 universities in the world (most recently it was ranked 12th in Times Higher-QS ranking). McGill is an English language university located in the heart of Montreal, the second largest French-speaking city in the world. Montreal has a reputation for its cosmopolitan atmosphere, history, cultural and sport activities, and excellent restaurants. The city consistently ranks among the most livable cities in world, and the cost of living is among the lowest for cities of its size. For more information concerning the projects we are working on, please see Computation and Logic Group http://complogic.cs.mcgill.ca For more information for prospective students: http://www.cs.mcgill.ca/prospective-students/graduate/GeneralInfo If interested, please contact for more information Brigitte Pientka (bpientka at cs.mcgill.ca) together with a brief research statement and CV. From pmt6sbc at maths.leeds.ac.uk Mon May 10 06:25:28 2010 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Mon, 10 May 2010 11:25:28 +0100 (BST) Subject: [TYPES/announce] CiE 2010 - Call for Participation and Informal Presentations Message-ID: <201005101025.o4AAPS5q003983@amsta.leeds.ac.uk> *********************************************************************** Call for Participation and Informal Presentations *********************************************************************** CALL FOR INFORMAL PRESENTATIONS There is a remarkable difference in conference style between computer science and mathematics conferences. Mathematics conferences allow for informal presentations that are prepared very shortly before the conference and inform the participants about current research and work in progress. The format of computer science conferences with pre-conference proceedings is not able to accommodate this form of scientific communication. Again continuing the tradition of past CiE conferences, this year's CiE conference endeavours to get the best of both worlds. In addition to the formal presentations based on our LNCS proceedings volume, we invite researchers to present informal presentations. For this, please send us a brief description of your talk (between one paragraph and half a page) by the DEADLINE: MAY 15, 2010. Please submit your abstract electronically, via EasyChair You will be notified whether your talk has been accepted for informal presentation usually within a week after your submission. Let us remind you that we are planning several post-conference publications, which will contain full articles of selected CiE 2010 presentations, including informal presentations. You can find these instructions at http://www.cie2010.uac.pt/contents/call_for_informal_presentations.html We also want to draw attention to the various funding opportunities still available. Please consult http://www.cie2010.uac.pt/contents/student_opportunities.html *********************************************************************** IMPORTANT DATES: Submission of informal presentations: MAY 15 Early registration deadline: MAY 28 Late registration deadline: JUNE 20 *********************************************************************** DETAILS OF PROGRAMME: TUTORIALS: Jeffrey Bub (Information, Computation and Physics), Bruno Codenotti (Computational Game Theory). INVITED SPEAKERS: Eric Allender, Jose L. Balcazar, Shafi Goldwasser, Denis Hirschfeldt, Seth Lloyd, Sara Negri, Toniann Pitassi, and Ronald de Wolf. SPECIAL SESSIONS: Biological Computing, organizers: Paola Bonizzoni, Krishna Narayanan Invited speakers: Natasha Jonoska, Giancarlo Mauri, Yasubumi Sakakibara, Stephane Vialette Computational Complexity, organizers: Luis Antunes, Alan Selman Invited speakers: Eric Allender, Christian Glasser, John Hitchcock, Rahul Santhanam Computability of the Physical, organizers: Cris Calude, Barry Cooper Invited speakers: Giuseppe Longo, Yuri Manin, Cris Moore, David Wolpert Proof Theory and Computation, organizers: Fernando Ferreira, Martin Hyland Invited speakers: Thorsten Altenkirch, Samuel Mimram, Paulo Oliva, Lutz Strassburger Reasoning and Computation from Leibniz to Boole, organizers: Benedikt Loewe, Guglielmo Tamburrini Invited speakers: Nimrod Bar-Am, Michele Friend, Olga Pombo, Sara Uckelman Web Algorithms and Computation, organizers: Thomas Erlebach, Martin Olsen Invited speakers: Hannah Bast, Debora Donato, Alex Hall, Jeannette Janssen SPECIAL TRIBUTE TO MARIAN POUR-EL: Ning Zhong. *********************************************************************** PROGRAMME COMMITTEE: Klaus Ambos-Spies (Heidelberg), Luis Antunes (Porto), Arnold Beckmann (Swansea), Paola Bonizzoni (Milano), Alessandra Carbone (Paris), Steve Cook (Toronto ON), Barry Cooper (Leeds), Erzsebet Csuhaj-Varju (Budapest), Fernando Ferreira (Lisbon, co-chair), Nicola Galesi (Rome), Luis Mendes Gomes (Ponta Delgada), Rosalie Iemhoff (Utrecht), Achim Jung (Birmingham), Michael Kaminski (Haifa), Jarkko Kari (Turku), Viv Kendon (Leeds), James Ladyman (Bristol), Kamal Lodaya (Chennai), Giuseppe Longo (Paris), Benedikt Loewe (Amsterdam), Elvira Mayordomo (Zaragoza, co-chair), Wolfgang Merkle (Heidelberg), Russell Miller (New York NY), Dag Normann (Oslo), Isabel Oitavem (Lisbon), Joao Rasga (Lisbon), Nicole Schweikardt (Frankfurt), Alan Selman (Buffalo NY), Peter van Emde Boas (Amsterdam), Albert Visser (Utrecht) http://www.cie2010.uac.pt/ __________________________________________________________________________ ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk CiE Conference Series http://www.illc.uva.nl/CiE CiE 2010 http://www.cie2010.uac.pt/ CiE Membership Application Form http://www.cs.swan.ac.uk/acie CiE on Twitter http://twitter.com/AssociationCiE __________________________________________________________________________ From kremer at lsv.ens-cachan.fr Mon May 10 15:50:20 2010 From: kremer at lsv.ens-cachan.fr (Steve Kremer) Date: Mon, 10 May 2010 21:50:20 +0200 Subject: [TYPES/announce] SecReT 2010 Call for Participation Message-ID: <4BE8637C.8080306@lsv.ens-cachan.fr> *********************************************************************** Call for Participation 5th International Workshop on Security and Rewriting Techniques (SecReT 2010) http://users.dsic.upv.es/workshops/secret2010/ Valencia (Spain), June 18-20. *********************************************************************** IMPORTANT INFORMATION Early registration deadline: June 6, 2010 INVITED SPEAKERS - Bruno Blanchet (LIENS, France) - Ralf Kuesters (Univ. Trier, Germany) - Catherine Meadows (NRL, USA) - Micha?l Rusinowitch (INRIA, France) AIMS AND SCOPE We need to increase our confidence in security related applications. Formal verification is one of the most important methods of achieving this goal, and term rewriting has already played an important part. In particular, since the beginning of formal verification of security protocols, term rewriting has played a central role, both as a computation model and as a deduction strategy. Because of this, we believe that it can play an important role in solving other security-related formal verification problems as well. That is why it is important to bring together experts in term rewriting, constraint solving, equational reasoning on the one side and experts in security on the other side. This is precisely the aim of this workshop. A possible (non exhaustive) list of topics include application of rewriting or constraint solving to authentication, encryption, access control and authorization, protocol verification, specification and analysis of policies, intrusion detection, integrity of information, control of information leakage, control of distributed and mobile code, etc. ACCEPTED PAPERS Automating security analysis: symbolic equivalence of constraint systems Vincent Cheval, Hubert Comon-Lundh and Stephanie Delaune Deducibility constraints Sergiu Bursuc, Hubert Comon-Lundh and Stephanie Delaune Semi-Automatic Synthesis of Security Policies by Invariant-Guided Abduction Cl?ment Hurlin and Helene Kirchner Efficient XOR Unification Zhiqiang Liu and Christopher Lynch Sequential Protocol Composition in Maude-NPA Santiago Escobar, Catherine Meadows, Jose Meseguer and Sonia Santiago Rule-based Specification and Analysis of Security Policies Tony Bourdier, Horatiu Cirstea, Mathieu Jaume and Helene Kirchner. Maude-NPA Tool Demo Santiago Escobar, Catherine Meadows and Jose Meseguer Automated Abstract Certification of Global Non-interference in Rewriting Logic Mauricio Alba-Castro, Mar?a Alpuente and Santiago Escobar Finitary Deduction Systems Yannick Chevalier and Mounira Kourjieh Geometric Logic and Strand Spaces Daniel Dougherty and Joshua Guttman Deciding trace equivalence for finite cryptographic process calculi Rohit Chadha, Stefan Ciobaca and Steve Kremer Abstractions for Verifying Key Management APIs Graham Steel PROGRAM COMMITTEE Yannick Chevalier (IRIT, Toulouse, France) Hubert Comon-Lundh (LSV, Cachan, France) Daniel Dougherty (WPI, Worcester, USA) Santiago Escobar (Univ. Polit?cnica Valencia, Spain) Steve Kremer (LSV, Cachan, France) - co-chair Christopher Lynch (Clarkson Univ., USA) Jos? Meseguer (Univ. Illinois, USA) Paliath Narendran (SUNY Albany, USA) - co-chair From Stephan.Merz at loria.fr Tue May 11 11:24:45 2010 From: Stephan.Merz at loria.fr (Stephan Merz) Date: Tue, 11 May 2010 11:24:45 -0400 Subject: [TYPES/announce] iFM 2010: final CFP and deadline extension Message-ID: [New information: extended deadlines, invited speakers, satellite events] Apologies for multiple copies of this CFP ---------------------------------------------------------------------------------------------------- CALL FOR PAPERS 8th International Conference on Integrated Formal Methods (iFM 2010) October 11-14, 2010, Nancy, France http://ifm2010.loria.fr/ Applying formal methods may involve the modeling of different aspects of a system that are expressed through different paradigms. Correspondingly, different analysis techniques will be used to examine differently modeled system views, different kinds of properties, or simply in order to cope with the sheer complexity of the system. The iFM conference series seeks to further research into the combination of (formal and semi-formal) methods for system development, regarding modeling and analysis, and covering all aspects from language design through verification and analysis techniques to tools and their integration into software engineering practice. Areas of interest include but are not limited to: - Integration of formal modeling and analysis methods - Integration of formal and semi-formal modeling and analysis methods - Integration of formal methods into software engineering practice - Semantics, Logics, Type systems - Verification, Model checking, Static analysis, Theorem proving - Refinement, Model transformations - Tools, Experience reports, Case studies Invited Speakers: - Christel Baier, TU Dresden - John Fitzgerald, Newcastle University - Rajeev Joshi, Laboratory for Reliable Software, JPL iFM 2010 solicits high quality papers reporting research results and/or experience reports related to the overall theme of method integration. All papers must be original, unpublished, and not submitted for publication elsewhere. Submission will be electronically as PDF or Postscript, using the Springer LNCS format. Papers should not exceed 15 pages in length. Each paper will undergo a thorough review process. The conference proceedings will be published by Springer Verlag in the LNCS series. Important Dates: - Abstract submission: May 21, 2010 (* extended *) - Full paper submission: May 28, 2010 (*extended *) - Notification: July 4, 2010 - Final version: July 18, 2010 Satellite events: - Workshop "Formal Methods for Web Data Trust and Security" (WTS 2010) http://acxml.gforge.inria.fr/WTS10 - Tutorial "Verification of C# programs using Spec# and Boogie 2" by Rosemary Monahan - Tutorial "The TLA+ Proof System" by Denis Cousineau and Stephan Merz Contact: ifm2010 at loria.fr From david.delahaye at cnam.fr Tue May 11 18:55:31 2010 From: david.delahaye at cnam.fr (david.delahaye@cnam.fr) Date: Wed, 12 May 2010 00:55:31 +0200 (CEST) Subject: [TYPES/announce] Calculemus 2010: Deadline Extension for Emerging Trends Message-ID: <60899.87.231.38.95.1273618531.squirrel@webmail.cnam.fr> [Apologies for cross-postings.] ---------------------------------------------------------- CALCULEMUS 2010 - Deadline Extension for Emerging Trends ---------------------------------------------------------- 17th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning CNAM, Paris, France, July 6-7, 2010 http://cicm2010.cnam.fr/calculemus/ *********************************** >>>> DEADLINE EXTENSION <<<< Submission deadline: May 19, 2010 *********************************** Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and systems for mechanised reasoning, the interactive theorem provers or proof assistants (PA) and the automated theorem provers (ATP). Currently, symbolic computation is divided into several (more or less) independent branches: traditional ones (e.g., computer algebra and mechanised reasoning) as well as newly emerging ones (on user interfaces, knowledge management, theory exploration, etc.) The main concern of the Calculemus community is to bring these developments together in order to facilitate the theory, design, and implementation of integrated systems for computer mathematics that will routinely be used by mathematicians, computer scientists and engineers in their every day business. We seek original research papers for the upcoming Calculemus meeting, which will be held jointly with AISC 2010 and MKM 2010 (confederated in the Conferences on Intelligent Computer Mathematics, CICM 2010) in Paris (France). Topics of Interest ================== The scope of Calculemus covers all aspects of the interplay of mechanised reasoning and computer algebra, including cross-fertilisation between those two research areas, as well as the development of integrated systems that transcend both computer algebra and theorem proving. Potential topics of interest include: * Theorem proving in computer algebra (CAS) * Computer algebra in theorem proving (PA and ATP) * Case studies and applications that both involve computer algebra and mechanised reasoning * Representation of mathematics in computer algebra * Adding computational capabilities to PA and ATP * Formal methods requiring mixed computing and proving * Combining methods of symbolic computation and formal deduction * Mathematical computation in PA and ATP * Theory, design and implementation of interdisciplinary systems for computer mathematics * Infrastructure for mathematical services * Theory exploration techniques Papers on other topics closely related to the above research areas will also be welcomed for consideration. Submission ========== Theoretical and applied research papers on all topics within the scope of the symposium are invited. Submitted papers must be in English and we suggest 10 pages for emerging trends extended abstracts (the upper limit is 20 pages, authors must provide at least a title and 200 word abstract). The title page should contain the title, author(s) with affiliation(s), e-mail address(es), listing of keywords and abstract. The program committee will subject all emerging trends papers to a (light) peer review. Results must be unpublished. Papers should be prepared in LaTeX and formatted according to the requirements of the Springer's LNAI series (the corresponding style files can be downloaded from http://www.springer.de/comp/lncs/authors.html and are the same for LNCS and LNAI). The web page for electronic submission is: http://www.easychair.org/conferences/?conf=calculemus2010 Proceedings =========== Extended abstracts on emerging trends will be published as a technical report of CEDRIC (CNAM/ENSIIE) and will be electronically available. These papers are expected to be describing work in progress. Important Dates =============== For extended abstracts on emerging trends: Submission deadline: May 19, 2010 Notification of acceptance: May 30, 2010 Camera ready copies due: June 7, 2010 The Calculemus conference is on July 6-7, 2010. Programme Committee =================== Markus Aderhold (TU Darmstadt, Germany) Arjeh Cohen (Eindhoven University of Technology, The Netherlands) Thierry Coquand (Chalmers University of Technology, Sweden) James H. Davenport (University of Bath, UK) David Delahaye (CNAM, France), Chair Lucas Dixon (University of Edinburgh, UK) William M. Farmer (McMaster University, Canada) Temur Kutsia (RISC, Austria) Assia Mahboubi (INRIA Saclay, France) Renaud Rioboo (ENSIIE, France), Chair Julio Rubio (Universidad de La Rioja, Spain) Volker Sorge (University of Birmingham, UK) Stephen M. Watt (University of Western Ontario, Canada) Freek Wiedijk (Radboud University Nijmegen, The Netherlands) Wolfgang Windsteiger (RISC, Austria) From gvidal at dsic.upv.es Wed May 12 03:47:46 2010 From: gvidal at dsic.upv.es (German Vidal) Date: Wed, 12 May 2010 09:47:46 +0200 Subject: [TYPES/announce] CICLOPS-WLPE 2010 at FLoC: Call for Participation Message-ID: <2C9ABE28-BCA5-4DAA-93F8-8C250A34BA00@dsic.upv.es> [Apologies for multiple copies of this announcement] ******************************************************************* Call For Participation CICLOPS-WLPE 2010 Joint Workshop on Implementation of Constraint Logic Programming Systems and Logic-based Methods in Programming Environments Edinburgh, Scotland, U.K. July 15, 2010 http://users.dsic.upv.es/~ciclops-wlpe10/ Satellite event of the 26th International Conference on Logic Programming (ICLP 2010) http://www.floc-conference.org/ICLP-home.html ******************************************************************* IMPORTANT DEADLINES: * early registration deadline: 17 May 2010 * standard registration: 18 May 2010 - 30 June 2010 * late registration: after 30 June 2010 Registration, accomodation, and travel/visa information for all FLoC conferences and workshops is on the FLoC 2010 web pages: http://www.floc-conference.org/ INVITED TALKS: Programming with Boolean Satisfaction Michael Codish, Ben-Gurion University of the Negev (Israel) Solving Constraint Satisfaction Problems by a SAT Solver Naoyuki Tamura, Kobe University (Japan) ACCEPTED PAPERS: - Peter Biener, Fran?ois Degrave and Wim Vanhoof A Test Automation Framework for Mercury - Petra Hofstedt Realizing evaluation strategies by hierarchical graph rewriting - Nicos Angelopoulos and Paul Taylor An extensible web interface for databases and its application to storing biochemical data - Paulo Moura Meta-Predicate Semantics - Jan Wielemaker and V?tor Santos Costa Portability of Prolog programs: theory and case-studies - Dimitar Shterionov, Angelika Kimmig, Theofrastos Mantadelis and Gerda Janssens DNF Sampling for ProbLog Inference - Vasco Pedro and Salvador Abreu Distributed Work Stealing for Constraint Solving - Paulo Andr? and Salvador Abreu Casting the WAM as an EAM Workshop organizers: German Vidal DSIC, Universidad Politecnica de Valencia Camino de Vera S/N, 46022 Valencia, Spain http://www.dsic.upv.es/~gvidal/ Neng-Fa Zhou Department of Computer and Information Science, Brooklyn College The City University of New York 2900 Bedford Avenue, Brooklyn, NY 11210-2889 http://www.sci.brooklyn.cuny.edu/~zhou/ From mjas at imm.dtu.dk Wed May 12 10:47:51 2010 From: mjas at imm.dtu.dk (Michael Smith) Date: Wed, 12 May 2010 16:47:51 +0200 Subject: [TYPES/announce] MLQA 2010 - Models and Logics for Quantitative Analysis: Call for Posters and Participation Message-ID: Second Annual Meeting of the ERCIM Working Group on Models and Logics for Quantitative Analysis (MLQA 2010) http://wiki.ercim.eu/wg/MLQA/index.php/July_2010:_MLQA_meeting_at_FLoC_2010%2C_Edinburgh July 9th, 2010, Edinburgh, Scotland, UK Part of the Federated Logic Conference (FLoC 2010) Affiliated with Logic in Computer Science (LICS 2010) *** CALL FOR PARTICIPATION *** We invite all interested researchers and PhD students to participate at MLQA 2010. Registration is via the FLoC website: http://www.floc-conference.org/registration.html Note that the deadline for early registration is 17th May. *** CALL FOR POSTERS *** Important dates: ----------------------------------------------------- Abstract submission: June 18th, 2010 Submission deadline (strict): June 25th, 2010 Author notification: June 28th, 2010 Meeting: July 9th, 2010 ----------------------------------------------------- We invite posters under two categories: - Presentation of recent or on-going work relating to models, logics, tools, and/or applications with respect to discrete, stochastic and/or continuous systems and properties. - Overview of the recent research activities of a group, in relation to the themes of MLQA. We equally encourage submissions from both research leaders, and junior researchers and PhD students. Posters should be readable in size A3, and should be submitted in pdf format to mlqa at imm.dtu.dk. They will be printed in size A1, if the FLoC organisers permit. Notification of your intention to submit, along with a title and short description of the poster, should be sent by June 18th. We require that we receive the final poster no later than June 25th, in order for us to print it before the meeting. We will print and transport every accepted poster, although if a poster does not print as expected, we may require you to print it yourself. -- Flemming Nielson (acting chairman of MLQA) Michael Smith, Nataliya Skrupnyuk (poster session organisers) http://wiki.ercim.eu/wg/MLQA From Yves.Bertot at sophia.inria.fr Thu May 13 12:51:06 2010 From: Yves.Bertot at sophia.inria.fr (Yves Bertot) Date: Thu, 13 May 2010 18:51:06 +0200 Subject: [TYPES/announce] [Cfp] Coq Workshop, Edinburgh, July 9, Program and call for participation Message-ID: <4BEC2DFA.6090407@sophia.inria.fr> Dear Colleague, Please consider attending the Federated Logic Conference (FLoC) and especially the Coq Workshop (Coq-2) Edinburgh, July 9th, 2010 The early registration deadline is May 17th. http://www.floc-conference.org http://coq.inria.fr/coq-workshop/2010 The Coq workshop will bring together Coq users, developers and contributors. It will be organized from submitted and refereed presentations and more informal presentations. Please register and come participate in the discussions, even if you do not wish to submit any talks. The workshop organizers PROGRAM FOR THE COQ WORKSHOP ============================ Inductive Proof Automation for Coq by Sean Wilson, Jacques Fleuriot and Alan Smaill Heq: A Coq library for Heterogeneous Equality by Chung-Kil Hur Proof Trick: small Inversions by Jean-Fran?ois Monin Strengthening the inversion Tactic in Coq by anne mulhern Mixed induction-coinduction at work for Coq by Keiko Nakata and Tarmo Uustalu Certification of a chain for deductive program verification by Paolo Herms Invited talk (title to be announced later) by Hugo Herbelin Rewriting Modulo Associativity and Commutativity by Thomas Braibant and Damien Pous Developing the algebraic hierarchy with type classes in Coq by Bas Spitters, Eelis van der Weegen Experience of interfacing Coq+SSReflect and GAP by Vladimir Komendantsky, Alexander Konovalov and Steve Linton Root isolation for one-variable polynomials by Yves Bertot and Assia Mahboubi From nick at microsoft.com Fri May 14 11:09:06 2010 From: nick at microsoft.com (Nick Benton) Date: Fri, 14 May 2010 15:09:06 +0000 Subject: [TYPES/announce] LOLA 2010 Programme and call for participation Message-ID: <829B73AE2485A845AD2F3EEA8C98E238141C6584@TK5EX14MBXC136.redmond.corp.microsoft.com> ============================================================ *** CALL FOR PARTICIPATION *** LOLA 2010 Syntax and Semantics of Low Level Languages Friday 9th July 2010, Edinburgh, UK A LICS 2010-affiliated workshop at FLoC 2010 http://lola.pps.jussieu.fr/ ============================================================ IMPORTANT DEADLINES: * early registration deadline: 17 May 2010 * standard registration: 18 May 2010 - 30 June 2010 * late registration: after 30 June 2010 Registration, accomodation, and travel/visa information for all FLoC conferences and workshops is on the FLoC 2010 web pages: http://www.floc-conference.org/ WORKSHOP PROGRAMME: INVITED TALKS: * G?rard Berry (INRIA, Coll?ge de France). What could be the right balance between abstract and fine-grain computational properties? * Dan Ghica (University of Birmingham). Geometry of Synthesis: Semantics-directed hardware compilation. * Alex Simpson (LFCS, University of Edinburgh). Linear types for continuations. CONTRIBUTED TALKS: * Magnus O. Myreen & Michael J. C. Gordon. Machine code: architecture-independent formal verification and proof-producing compilation. * Ugo Dal Lago On the Role of Interaction in Implicit Computational Complexity. * Nick Benton & Chung-Kil Hur. Step-Indexing: The Good, the Bad and the Ugly. * Guilhem Jaber & Nicolas Tabareau. Krivine realizability for compiler correctness. * Shin-ya Katsumata & Rasmus Mogelberg. Fullness of monadic translation by TT-lifting. * Rasmus Mogelberg & Sam Staton. Full abstraction in a metalanguage for state. * Antoine Madet & Roberto Amadio & Patrick Baillot. An Affine-Intuitionistic System of Types and Effects: Confluence and Termination. * Nathaniel Charlton & Bernhard Reus. A deeper understanding of the deep frame axiom. ALL THIS, PLUS: a thrilling panel discussion! DESCRIPTION OF THE WORKSHOP: It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in the various aspects of the relationship between logic and low level languages and programs. LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants. PROGRAMME COMMITTEE: * Amal Ahmed (Indiana University) * Nick Benton (MSR Cambridge, co-chair) * Lars Birkedal (IT University of Copenhagen) * Dan Ghica (University of Birmingham) * Paul-Andre Mellies (CNRS & University Paris Diderot, co-chair) * Fran?ois Pottier (INRIA Rocquencourt) * Ulrich Schoepp (LMU Munich) * Hayo Thielecke (University of Birmingham) From Maribel.Fernandez at kcl.ac.uk Sun May 16 13:54:00 2010 From: Maribel.Fernandez at kcl.ac.uk (Maribel Fernandez) Date: Sun, 16 May 2010 18:54:00 +0100 Subject: [TYPES/announce] UNIF 2010 at FLoC - 14 July 2010 - Call for participation Message-ID: <4BF03138.8040109@kcl.ac.uk> CALL FOR PARTICIPATION UNIF 2010 24th International Workshop on Unification 14 July 2010 Edinburgh, UK A FLoC workshop associated to RTA and IJCAR http://www.dcs.kcl.ac.uk/staff/maribel/UNIF.html ================================================================== This workshop promotes research and collaboration in the area of unification theory and related fields, including constraint solving and applications of unification to theorem proving and programming languages. Invited Speakers: Claude Kirchner, France Christian Urban, Germany Programme: ---------------------------------- Session 1 - 9.00-10.00 Claude Kirchner (Invited Speaker) Antipatterns: how to say what you don't want to match to 10.00-10.30 Coffee Break Session 2 - 10.30-11.00 Sunil Kothari and James Caldwell. A Machine Checked Model of Idempotent MGU Axioms For a List of Equational Constraints 11.00-11.30 Franz Baader and Barbara Morawska. SAT Encoding of Unification in EL 11.30-12.00 Deepak Kapur, Andrew Marshall and Paliath Narendran. Unification modulo a partial theory of exponentiation 12.00-12.30 Conrad Rau and Manfred Schmidt-Schauss. Towards Correctness of Program Transformations Through Unification and Critical Pair Computation 12.30-14.00 Lunch Session 3 - 14.00-15.00 Christian Urban (Invited Speaker). Nominal Unification - Hitting a Sweet Spot 15.00-15.30 Coffee Break Session 4 - 15.30-16.00 Christophe Calv?s. Nominal Theory as an Extension of First-Order Theory 16.00-16.30 Sergiu Bursuc and Cristian Prisacariu. Unification and matching in separable theories 16.30-17.00 Zhiqiang Liu and Christopher Lynch. Efficient XOR Unification 17.00-17.30 Paliath Narendran, Andrew Marshall and Bibhu Mahapatra. On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity ------------------------------- Programme Committee: Maribel Fern?ndez, UK (chair) Temur Kutsia, Austria Jordi Levy, Spain Christopher Lynch, US Cathy Meadows, US Gianfranco Rossi, Italy Laurent Vigneron, France For more information and registration details please see the workshop webpage: http://www.dcs.kcl.ac.uk/staff/maribel/UNIF.html -------------------------------------------------------------- From gerwin.klein at nicta.com.au Sun May 16 19:51:00 2010 From: gerwin.klein at nicta.com.au (Gerwin Klein) Date: Sun, 16 May 2010 19:51:00 -0400 Subject: [TYPES/announce] 2nd CFP: SSV'10 @ USENIX OSDI 2010 Message-ID: The deadline is drawing closer: 2nd Call for Papers 5th International Workshop on Systems Software Verification (SSV'10) Real Software, Real Problems, Real Solutions October 6-7, Vancouver, Canada co-located with OSDI'10 http://usenix.org/events/ssv10/ Industrial-strength software analysis and verification has advanced in recent years through the introduction of model checking, automated and interactive theorem proving, static analysis techniques, as well as correctness by design, correctness by contract, and model-driven development. However, many techniques are working under restrictive assumptions which are invalidated by complex embedded systems software such as operating system kernels, low-level device drivers or microcontroller code. The aim of this workshop is to bring together researchers and developers from both academia and industry, who are facing real software and real problems to find real, applicable solutions. By "real" we mean problems such as time-to-market or reliability that the industry is facing. A real solution is one that is applicable to the problem in industry and not one that only applies to an abstract, academic toy version of it. This forum discusses software analysis and development techniques and tools; it will serves as a platform to discuss open problems and future challenges in dealing with existing and upcoming systems level code. Topics include (but are not limited to): * model checking * automated and interactive theorem proving * static analysis * automated testing * model-driven development * embedded systems development * programming languages * verifying compilers * software certification * software tools * experience reports Interested speakers should submit their paper (at most 9 pages, 8.5" x 11", including figures, tables, and references, formatted in two columns, using 10 point type on 12 point (single-spaced) leading, with the text block being no more than 6.5" wide by 9" deep) to https://papers.usenix.org/hotcrp/ssv10/ by June 4th 2010 Samoan time. All papers will be subject to peer review under conference standards. Experience reports and papers on work in progress are welcome as long as there is a clear contribution. Accepted submissions are planned to be published online by USENIX. Submissions must be in pdf format and follow the USENIX style instructions above. Important dates 28.05.2010 Abstract Deadline 04.06.2010 Submission Deadline 20.07.2010 Notification of accepted papers 20.08.2010 Final version 06.10.2010 Workshop The workshop is organized as a 1.5-day workshop (Oct 6-7, 2010). Location The workshop will be held in Vancouver, Canada, co-located with OSDI'10. Program Chair Ralf Huuck (NICTA & UNSW, Australia) Gerwin Klein (NICTA & UNSW, Australia) Bastian Schlich (ABB Corporate Research, Germany) Program Committee Adam Chlipala (Harvard University, USA) Dino Distefano (Queen Mary University London, UK) Klaus Havelund (Jet Propulsion Laboratory, USA) Chris Hawblitzel (Microsoft Research, USA) Andy King (University of Kent, UK) Stefan Kowalewski (RWTH Aachen University, Germany) Kim Larsen (Aalborg University, Denmark) John Matthews (Galois Inc, USA) Thomas Noll (RWTH Aachen University, Germany) Wolfgang Paul (University of Saarbruecken, Germany) Jan Peleska (University of Bremen, Germany) John Regehr (University of Utah, USA) Wolfram Schulte (Microsoft Research, USA) Zhong Shao (Yale University, USA) Junfeng Yang (Columbia, USA) Kwangkeun Yi (Seoul National University, South Korea) We thank our sponsors NICTA and Microsoft Research for their support. From pangjun at gmail.com Mon May 17 05:23:44 2010 From: pangjun at gmail.com (Jun PANG) Date: Mon, 17 May 2010 11:23:44 +0200 Subject: [TYPES/announce] Call for participation: VTSA 2010 Summer School on Verification Technology, Systems & Applications Message-ID: **************************************************************** Summer School on Verification Technology, Systems & Applications http://www.mpi-inf.mpg.de/VTSA10/ Application Deadline: 07/23/2010 Notification until: 08/06/2010 Summer School: 09/06/2010 - 09/10/2010 **************************************************************** A summer school on verification technology, systems and applications will be organized by the Interdisciplinary Centre for Security, Reliability and Trust at the University of Luxemburg, in cooperation with the Max-Planck Institute f?r Informatik in Saarbr?cken and the INRIA research center in Nancy. The school will take place from September 6th to 10th 2010 in Luxembourg. The following speakers have accepted to give courses: Javier Esparza: Building a Software Model-Checker Wan Fokkink: Protocol Validation with mCRL Marta Kwiatkowska: Probabilistic Model Checking Markus M?ller-Olm: Fundamentals of Software Model Checking Wang Yi: Modeling and Analysis of Timed Systems Participation is free (except for travel and accommodation costs) and open to anybody holding at least a Bachelor degree (or equivalent) in computer science. The number of participants is limited. Please apply electronically by *July 23th, 2010* by sending - a one-page CV, - an application letter explaining your interest in the school and your experience in the area, - a copy of your b