[TYPES/announce] postdoc position in Lille (France) on type systems and logical methods
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Applications are invited for a postdoc position at the University of Lille, France. The successful candidate will work under the supervision of Patrick Baillot, on research topics related to type systems and logical methods in one of the following areas (non exclusive list): - timing or complexity analysis for sequential, parallel or concurrent systems (e.g. for process calculi or session types); - privacy properties of programs (sensitivity analysis, differential privacy…) - typing methods for synchronous languages (e.g. static analysis and clock calculus). Candidates should have, or expect shortly to obtain, a PhD in Computer Science, with expertise in programming languages, logic or formal methods. The position is for one year. The starting date could be June 2022. There is no teaching load. Knowledge of French is not required. The candidate will join the SyCoMoRES team (https://urldefense.com/v3/__https://www.cristal.univ-lille.fr/en/teams/sycomores/?force_lang=true__;!!IBzWLUs!HggkZOp9ERXT8-2F41p5ejd_OCyQcj_15NrgIKnkEMLkjUrNkN8aRXhksgksQmiqv_KvRf66QsSAIA$ ), which is a joint project team between Inria, CNRS and University of Lille. It belongs to the CRIStAL research center (https://urldefense.com/v3/__https://www.cristal.univ-lille.fr/en/__;!!IBzWLUs!HggkZOp9ERXT8-2F41p5ejd_OCyQcj_15NrgIKnkEMLkjUrNkN8aRXhksgksQmiqv_KvRf5_xU4NAQ$ ). The position is funded by I-site Université Lille Nord-Europe. Lille is a youthful and dynamic city, located in the north of France, at the crossroads of Europe, close to Paris (1h10 by train), Brussels and London. If you are interested please contact me as soon as possible, with a brief outline of your academic background and research interests. As a second step, a complete application will consist of + a cover letter; + a detailed CV including a list of publications and a summary of research; + contact information for two or three academic references; This application should be sent by email to patrick.bail...@univ-lille.fr . The applications will be reviewed as soon as they are received and until the position is filled. Patrick Baillot (https://urldefense.com/v3/__https://pro.univ-lille.fr/patrick-baillot/__;!!IBzWLUs!HggkZOp9ERXT8-2F41p5ejd_OCyQcj_15NrgIKnkEMLkjUrNkN8aRXhksgksQmiqv_KvRf7dGYLD7A$ )
[TYPES/announce] LCC 2022 workshop Final call for participation
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] = Final Call for Participation LCC 2022 22nd International Workshop on Logic and Computational Complexity February 20, 2022, Online Collocated with CSL 2022 https://urldefense.com/v3/__http://www.cs.swansea.ac.uk/lcc/__;!!IBzWLUs!CYaEPTE8kKWOWW6UKDFcv_P1JDrZiDAfqoUWDNXS1U7nBZZwn5yKextE0zP4QLfb7aGcd0UIBVR_Cw$ = * The programme is now available online on the workshop’s web page: https://urldefense.com/v3/__http://www.cs.swansea.ac.uk/lcc/__;!!IBzWLUs!CYaEPTE8kKWOWW6UKDFcv_P1JDrZiDAfqoUWDNXS1U7nBZZwn5yKextE0zP4QLfb7aGcd0UIBVR_Cw$ * Invited speakers: Stephan Kreutzer (TU Berlin) Carsten Lutz (University of Bremen) Isabel Oitavem (Nova University Lisbon) * Registration is free, but necessary for organisation reasons. Please register on CSL’s website: https://urldefense.com/v3/__http://csl2022.uni-goettingen.de/__;!!IBzWLUs!CYaEPTE8kKWOWW6UKDFcv_P1JDrZiDAfqoUWDNXS1U7nBZZwn5yKextE0zP4QLfb7aGcd0U4OrO8xA$ 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 program will consist of invited lectures as well as contributed talks selected by the Program Committee. PROGRAM COMMITTEE: Patrick Baillot (CNRS, University of Lille, France, co-chair) Meghyn Bienvenu (CNRS, University of Bordeaux, France) Juha Kontinen (University of Helsinki, Finland, co-chair) Cynthia Kop (Radboud University Nijmegen, The Netherlands) Barnaby Martin (Durhan University, UK) Nicole Schweikardt (Humboldt-University Berlin, Germany) CONTACT: To contact the workshop organizers, please send e-mail to lc...@easychair.org
[TYPES/announce] postdoc position in Lille (France) on type systems and logical methods
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Applications are invited for a postdoc position at the University of Lille, France. The successful candidate will work under the supervision of Patrick Baillot, on research topics related to type systems and logical methods in one of the following areas (non exclusive list): timing analysis for sequential, parallel or concurrent systems ; privacy properties of programs (sensitivity, differential privacy…) ; typing methods for synchronous languages (e.g. static analysis for clock assignment). Candidates should have, or expect shortly to obtain, a PhD in Computer Science, with expertise in programming languages, logic or formal methods. The position is for one year. The starting date would be at the beginning of 2022 but is negociable. There is no teaching load. Knowledge of French is not required. The candidate will join the SyCoMoRES team (https://urldefense.com/v3/__https://www.cristal.univ-lille.fr/en/teams/sycomores/?force_lang=true__;!!IBzWLUs!F-NQSW8QIIvOoBOvgM0TAKrSixOOksZrCRmqvMQ5sJ1Ez_u_CxbUhSs0brVMpgvO8RZtbPQyth0LcA$ ), within the CRIStAL research center (https://urldefense.com/v3/__https://www.cristal.univ-lille.fr/en/__;!!IBzWLUs!F-NQSW8QIIvOoBOvgM0TAKrSixOOksZrCRmqvMQ5sJ1Ez_u_CxbUhSs0brVMpgvO8RZtbPQIu1IuCw$ ). The position is funded by I-site Université Lille Nord-Europe. If you are interested please contact me as soon as possible, with a brief outline of your academic background and research interests. As a second step, a complete application will consist of + a cover letter; + a detailed CV including a list of publications and a summary of research; + contact information for two or three academic references; This application should be sent by email to patrick.bail...@univ-lille.fr . The review of applications will begin on December 6 and continue until the position is filled. Patrick Baillot (https://urldefense.com/v3/__https://pro.univ-lille.fr/patrick-baillot/__;!!IBzWLUs!F-NQSW8QIIvOoBOvgM0TAKrSixOOksZrCRmqvMQ5sJ1Ez_u_CxbUhSs0brVMpgvO8RZtbPQc0FGwiw$ )
[TYPES/announce] First CFP Logic and Complexity (LCC 2022) workshop
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] = First Call for Contributions LCC 2022 22nd International Workshop on Logic and Computational Complexity February 20, 2022, Online Collocated with CSL 2022 https://urldefense.com/v3/__http://www.cs.swansea.ac.uk/lcc/__;!!IBzWLUs!CcZMd1Il2UAQnt3zbkY7sxgcGCBwt-cWJsjcCcZft_UtZZjQw7tMwKwH_tCLylfgxXBvB-H9Z8HOng$ = 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 program will consist of invited lectures as well as contributed talks selected by the Program Committee. IMPORTANT DATES: * submission December 12, 2021 * notification January 3, 2022 * workshop February 20, 2022 SUBMISSION: Submissions must be in English and in the form of an abstract of about 3-4 pages. All submissions should be submitted through Easychair at: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=lcc22__;!!IBzWLUs!CcZMd1Il2UAQnt3zbkY7sxgcGCBwt-cWJsjcCcZft_UtZZjQw7tMwKwH_tCLylfgxXBvB-HR4HFe_g$ We also welcome submissions of abstracts based on work submitted or published elsewhere, provided that all pertinent information is disclosed at submission time. There will be no formal reviewing as is usually understood in peer-reviewed conferences with published proceedings. The program committee checks relevance and may provide additional feedback. PROGRAM COMMITTEE: Patrick Baillot (CNRS, University of Lille, France, co-chair) Meghyn Bienvenu (CNRS, University of Bordeaux, France) Juha Kontinen (University of Helsinki, Finland, co-chair) Cynthia Kop (Radboud University Nijmegen, The Netherlands) Barnaby Martin (Durhan University, UK) Nicole Schweikardt (Humboldt-University Berlin, Germany) CONTACT: To contact the workshop organizers, please send e-mail to lc...@easychair.org
[TYPES/announce] webinar by Martin Avanzini as part of SCOT seminar: On Continuation-Passing Transformations and Expected Cost Analysis : Nov 9th 2021, 3pm-4pm (CET)
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Dear colleagues, The next talk of the Semantic and Formal Approaches to Complexity (SCOT) webinar will be given by Martin Avanzini. Abstract and practical informations are given below. You are welcome to attend it on Zoom. To obtain the connexion informations and/or be informed of future talks, please subscribe to the mailing list (for that send an email with subject "subscribe scot_webinar" and empty body to sy...@groupes.renater.fr). Tuesday November 9th 2021, 3pm-4pm (CET). Martin Avanzini (Inria Sophia-Antipolis). Title: On Continuation-Passing Transformations and Expected Cost Analysis - the room will open at 2:45pm (CET). You can come with your coffee for a chat! - the talk will start at 3:00 pm. Abstract: In this talk I will present recent joint work with Ugo Dal Lago and Gilles Barthe, which is concerned with a novel methodology for the cost analysis of randomized higher-order programs, i.e., programs which can sample values from chosen distributions during execution, and at the same time are capable of treating functions as first-class citizens. The evaluation of such a program results in a distribution of values, and has an expected cost, namely the average cost the program experiences along its execution. The way we tackle such an expected cost analysis is reminiscent of the seminal work of Rosendahl (1989), and lies in turning the program at hand into a second one, which is structurally quite similar but computes the cost of execution in addition. This turns an intensional property, namely the cost of execution, into an extensional one. A crucial aspect of this program transformation is that probabilistic effects are eliminated along the way, thereby enabling classical reasoning tools for non-probabilistic programs in our context. As one such tool we propose a slight variation of a standard higher-order logic, dubbed EHOL, which we also use to study some classical examples from probability theory. For the seminar: Isabel Oitavem, Patrick Baillot, Ugo Dal Lago Seminar web page: https://urldefense.com/v3/__http://www.cs.unibo.it/*dallago/SCOSEM/__;fg!!IBzWLUs!DvCcv9xBlTNQDMTDnBnfuQYSIT2PKXmhE8cOyFWYey0MSJu1z2FuTi1GHAna8Zdoe4JePztdSF0wyQ$ The list's homepage: https://urldefense.com/v3/__https://groupes.renater.fr/sympa/info/scot_webinar__;!!IBzWLUs!DvCcv9xBlTNQDMTDnBnfuQYSIT2PKXmhE8cOyFWYey0MSJu1z2FuTi1GHAna8Zdoe4JePzuEyIZDzQ$ General information about mailing lists: https://urldefense.com/v3/__https://groupes.renater.fr/sympa/help/introduction__;!!IBzWLUs!DvCcv9xBlTNQDMTDnBnfuQYSIT2PKXmhE8cOyFWYey0MSJu1z2FuTi1GHAna8Zdoe4JePzuhkLhmtA$ To unsubscribe from this list: send an email with subject "unsubscribe scot_webinar" and empty body to sy...@groupes.renater.fr If you wish to subscribe: same procedure with subject "subscribe scot_webinar"
[TYPES/announce] Post-doc position in Lyon
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Please find below a call for application for postdoc positions in Lyon (24months, possibly extendable to a third year). Applications of candidates from the Types community are welcome, concerning the Plume team of Laboratoire d'Informatique du Parallélisme (http://www.ens-lyon.fr/LIP/PLUME/), ENS Lyon. Potential candidates are invited to contact the member of the team who is closer to their research interest. == Post-doc positions Mathematics and Computer Science in Lyon (labex MILYON) == See: http://milyon.universite-lyon.fr/offres-de-post-docs/2-post-doctoral-positions-in-mathematics-and-or-computer-science--170911.kjsp?RH=MILYON-FR Offer: MILYON (the Laboratoire d'Excellence Mathématiques et Informatique à Lyon) offers two post-doctoral positions in mathematics and/or computer science for the academic year 2013-2014, to be held at the Unité de Mathématiques Pures et Appliquées or at the Laboratoire de l'Informatique du Parallélisme (École Normale Supérieure de Lyon), or at the Institut Camille Jordan (Université Claude Bernard Lyon 1). These are research-only appointments (without teaching). They are typically for two years, with possible renewal for a third year subject to review. The salary will be 2100 euros per month, with benefits including health insurance and social coverage. Funds will also be provided for traveling and inviting collaborators. Full description: More information can be found on the website of MILYON which contains links to the above three departments. It is requested to contact the colleagues in Lyon who are closest to your specialty. Eligibility: For holders of a Ph.D in mathematics or computer science obtained before October 1st, 2013. Deadline: Applications must be complete (including all reference letters) by : Tuesday, January 15th, 2013, at 17:00 (Lyon local time) How to apply? Applications must be submitted via the online form: http://math.univ-lyon1.fr/limesurvey/index.php?sid=27441lang=en Requested items: - a curriculum vitae; - a list of publications; - a scientific project (around two pages) specifying members of MILYON with whom you plan to interact primarily; - two detailed recommendation letters by scientists not members of MILYON; - a letter from your thesis adviser. Contact: Scientific contact : Francis FILBET fil...@math.univ-lyon1.fr Administrative contact : Carine SEVESTRE seves...@math.univ-lyon1.fr - Fin du message transféré - -- Patrick Baillot LIP (UMR 5668 CNRS) ENS de Lyon http://perso.ens-lyon.fr/patrick.baillot/ Tel (new!): (+33) 4 37 28 76 46Fax: (+33) 4 72 72 80 80
[TYPES/announce] Complexity School @LI2012 : call for participation
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] LOGIC AND INTERACTIONS 2012 CIRM, MARSEILLE COMPLEXITY WINTER SCHOOL (Week 1) 30 JANUARY- 3 FEBRUARY http://li2012.univ-mrs.fr/programme/week1/ The Logic and interactions 2012 session will gather researchers in various fields of logic in computer science. The meeting will run five consecutive weeks, from 30 January to 2 March 2012, each dedicated to a particular area of logic and its interactions. Each week will include lectures, invited talks and contributed talks, together with work sessions. Lectures are aimed primarily at PhD students and non-specialist researchers. CALL FOR CONTRIBUTIONS - COMPLEXITY WINTER SCHOOL **NEW [04/12/2011]**: a preliminary programme is available from the web page. -- SUBMISSION PROCEDURE -- This is a call for abstracts for contributed talks in the week. Abstract and title must be submitted electronically to the three organizers: patrick.bail...@ens-lyon.fr, nadia.creig...@lif.univ-mrs.fr, jean-yves.marion@loria.f Submissions of abstracts on published work are allowed. - IMPORTANT DATES - Abstract submission: December, 15th 2011 Registration: December 19th 2011 (After this date, we cannot guarantee accommodation) Notification for abstracts submitted: January, 3rd, 2012 --- SCOPE OF THE WEEK --- The theme of this week is the logical approach to logical complexity. The last decade has seen the development of logical formalisms derived from linear logic that characterize functions computable in various complexity classes (polynomial or elementary in time, logarithmic in space) in an implicit way, that is to say by contruction of the languages instead of using explicit measures. The theory that underlies these formalisms naturally meets the more established tradition of studying the complexity of algorithmic problems from logic (satisfiability, constraints solving, etc). The goal of this week is to survey the various aspects of the theory of algorithmic complexity where these communities meet, so as to trigger new interactions and enrich the various approaches. -- LECTURERS -- * Martin Hofmann (LMU, Munich, Germany): Pure pointer programs (implicit computational complexity with an abstract datatype of pointers) * Yiannis N. Moschovakis (UCLA, USA): Relative complexity in arithmetic and algebra * Stefan Szeider (TU Wien, Austria): Parameterized complexity * Heribert Vollmer (Leibniz Universität, Hannover, Germany): Circuit complexity -- INVITED SPEAKERS -- * Emmanuel Hainry (Nancy): Computable Analysis: Computability and complexity over the reals * Neil Jones (Copenhagen): Alan Turing and 75 years of Research in Models of Computation * Virgile Mogbil (Paris 13) : Parallel computation with Boolean proof nets The morning sessions will consist in tutorials given by invited speakers while the afternoons will be devoted to shorter presentations and contributed talks. Participants are welcome to submit a contribution (see the procedure above), but this is not mandatory. -- REGISTRATION -- There are no registration fees. Accomodation at the CIRM should be available for all participants: the only condition is to register on time. Pre-registration is now open on the web site. Once your pre-registration is validated, you will be contacted by the CIRM for the actual registration and booking. -- GRANTS -- Accommodation at the CIRM is funded for all participants requiring it: simply select the appropriate option in the pre-registration form. FYI: The standard rate for staying at the CIRM, including breakfast and two meals each day is 82 (double room) to 90 (single room) euros per day. We might also provide a limited amount of travel grants for students. To apply for such a grant, be sure to check the corresponding box of the pre-registration form: we will contact you directly for further information. ORGANIZERS * Patrick Baillot (LIP, ENS Lyon) * Nadia Creignou (LIF, Marseille) * Jean-Yves Marion (LORIA, Nancy) =
[TYPES/announce] DICE @ ETAPS 2010: call for participation
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] == 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)
[TYPES/announce] DICE 2010 workshop -- Call for short presentations
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.bail...@ens-lyon.fr
[TYPES/announce] CfP: Winter school on game semantics and linear logic, in Lyon
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] - Winter School on Game Semantics and Linear Logic Lyon (France), February 8-12, 2010 http://www.ens-lyon.fr/DI/?p=898lang=en - Overview: The Computer Science department of Ecole Normale Superieure Lyon organizes a winter school on Game Semantics and Linear Logic, from February 8 to 12, 2010. This 5 days (24 hours lecture) school is intended for Master and PhD students, as well as for researchers. It is part of a series of 6 winter schools taking place from January to February 2010 at ENS Lyon (see the link above for more informations about these 6 schools). Topics/Speakers: * Game Semantics with Applications, Dan R. Ghica, University of Birmingham *Linear Logic, Lorenzo Tortora de Falco (University of Roma 3), Olivier Laurent (ENS Lyon) More information on the contents can be found on: http://www.ens-lyon.fr/DI/?p=189lang=en Registration: There are no registration fees. For organization reasons it is however necessary to register online before *December 14th 2009*; see the following registration page : http://www.ens-lyon.fr/DI/?page_id=886 Location ENS Lyon is located in the south part of the town, easily accessible from the two railway stations. It is also near from the historical town center (15min by subway). Instructions for reaching ENS Lyon can be found from the web page. The city of Lyon offers many cultural and tourist interest sites: http://www.en.lyon-france.com/things-to-do/p-1070/discover-lyon.php Practical informations == Practical informations, in particular about accomodation, can be found from the web page ( http://www.ens-lyon.fr/DI/?p=898lang=en ). Contact: Patrick Baillot (patrick.baillot'at'ens-lyon.fr)
[TYPES/announce] CFP workshop DICE 2010 (Developments in Implicit Computational complExity)
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] (Apologies for multiple posting) == Call for papers 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: * Abstract submission: December 7th, 2009 * Paper submission: December 13th, 2009 * Notification date: January 27, 2010 * Final version 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 Thursday December 17th, 2009 ,a mail to patrick.bail...@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, 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
[TYPES/announce] post-doc position at ENS Lyon
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] = POST-DOC POSITION at ENS Lyon on implicit computational complexity and concurrency == A 12-month post-doc position is available at ENS Lyon (Ecole Normale Supérieure de Lyon) within the project: Implicit Computational Complexity, Concurrency and Extraction (COMPLICE) http://www-lipn.univ-paris13.fr/complice/spip.php?rubrique4 This four-year project is funded by the French national research agency (ANR) and the partner sites are ENS Lyon, Université Paris 13 and LORIA-Nancy. The suggested starting date for the post-doc position is september 2009 (but later dates can be considered). 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. * Research area. Applications related to the scope of quantitative properties and ICC for process calculi will be prefered, but those relevant to another direction of the project by candidates with background in one/some of the following fields are also welcome: - ICC / type systems for complexity - concurrency (esp. termination and quantitative properties) - proof-assistants and program extraction from proofs - linear logic, lambda-calculus, game semantics The applicant should hold a PhD or be about to defend his/her PhD by December 2009. * Location. The post-doc researcher will work within the Plume team of the LIP, the computer science laboratory of ENS Lyon, which is a leading research and education institution in sciences. http://www.ens-lyon.fr/LIP/ Strong interaction with the other sites of the COMPLICE project is also expected. * Salary. The net salary will be around 2030 euro/month. This is then subject to income tax. * Application procedure. We strongly recommend that potential candidates express their interest by sending an email to patrick.bail...@ens-lyon.fr before February 22nd 2009. Then send your application before May 15th 2009 including a resume, a short research project (1 page) and two names of possible references. This should be preferably done by email with subject line 'Postdoc position' to patrick.bail...@ens-lyon.fr, or at the postal address below. * Important dates: - intention of application (short email)February 22nd 2009 - deadline for application: May 15th 2009 - notification: June 15th 2009 - suggested starting date: September 1st 2009 Further information will possibly be made available from the web page of the project indicated above. * Postal address: Patrick Baillot LIP (UMR 5668) ENS Lyon 46 Allée d'Italie, 69364 Lyon Cedex 07, France. -- Patrick Baillot LIP (UMR 5668 CNRS) ENS de Lyon http://perso.ens-lyon.fr/patrick.baillot/ Tel: (+33) 4 72 72 81 49 Fax: (+33) 4 72 72 80 80
