[TYPES/announce] Post-Doc position at INRIA on semantics and verification of probabilistic programs
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] The ANR Research Project PPS (Probabilistic Programming Semantics, ANR-19-CE48-0014) offers one 12 month postdoc position starting at the beginning of the 2022 solar year, at INRIA Sophia Antipolis: https://urldefense.com/v3/__https://www.inria.fr/en/centre-inria-sophia-antipolis-mediterranee__;!!IBzWLUs!CFfoJxiQN-mBYD9r0KyrFuURJ--mYnmJdzr_b98660WGXGWtA56juZ1qQAuGk-Sw_lqbPYM80syyDA$ <https://urldefense.com/v3/__https://www.inria.fr/en/centre-inria-sophia-antipolis-mediterranee__;!!IBzWLUs!CFfoJxiQN-mBYD9r0KyrFuURJ--mYnmJdzr_b98660WGXGWtA56juZ1qQAuGk-Sw_lqbPYM80syyDA$ > Our goal is to develop the semantics (e.g. coherent semantics, rewriting) and verification tools (e.g. type systems, logical frameworks) for probabilistic higher-order languages, building on the many connections between proof theory, linear algebra, rewriting, and programming language theory. Acquaintance with probabilistic programming languages, their mathematical semantics and/or their implementation, is welcome but not mandatory, although we expect the applicant to be excited to work on these topics. Anyone interested should contact as soon as possible Martin Avanzini (martin.avanzini@i <mailto:ehrh...@irif.fr>nria.fr <https://urldefense.com/v3/__http://nria.fr__;!!IBzWLUs!CFfoJxiQN-mBYD9r0KyrFuURJ--mYnmJdzr_b98660WGXGWtA56juZ1qQAuGk-Sw_lqbPYPCmQ9QRA$ >) and Ugo Dal Lago (ugo.dall...@unibo.it) briefly outlining their academic background and research interests. More details about the project are available here: https://urldefense.com/v3/__https://www.irif.fr/anrpps__;!!IBzWLUs!CFfoJxiQN-mBYD9r0KyrFuURJ--mYnmJdzr_b98660WGXGWtA56juZ1qQAuGk-Sw_lqbPYNXvtmbug$ <https://urldefense.com/v3/__https://www.irif.fr/anrpps__;!!IBzWLUs!CFfoJxiQN-mBYD9r0KyrFuURJ--mYnmJdzr_b98660WGXGWtA56juZ1qQAuGk-Sw_lqbPYNXvtmbug$ > As a second step, a complete application consisting 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; is expected to be sent by email to Martin Avanzini and Ugo Dal Lago The review of applications will begin on October 15th and continue until the position is filled.
[TYPES/announce] Virtual LCC'20: Second Call for Contributions
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] (Apologies for cross posting.) === Second Call for Contributions LCC 2020 21th International Workshop on Logic and Computational Complexity July 6, 2020, VIRTUAL (Saarbruecken, Germany) Collocated with LICS/ICALP 2020 http://www.cs.swansea.ac.uk/lcc/ 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. VIRTUAL EDITION: The LCC workshop is co-allocated with LICS/ICALP and as such will take place as a virtual event, due to the Covid-19 pandemic. The workshop has been moved to July 6th for this reason. Further details will be posted on the webpage as soon as the handling of the virtual LICS/ICALP conferences become clear. IMPORTANT DATES: All dates are AoE, extended because of COVID-19. * submission May 6, 2020 * notification May 27, 2020 * workshop July 6, 2020 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://easychair.org/conferences/?conf=lcc20 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: Martin Avanzini (INRIA Sophia Antipolis Méditerranée, France, co-chair) Diego Figueira (CNRS Bordeaux, France) Joanna Ochremiak (CNRS Bordeaux, France) Magdalena Ortiz (TU Wien, Austria) Thomas Seiller (CNRS Paris, France) Jakob Grue Simonsen (University of Copenhagen, Denmark) Thomas Zeume (Ruhr-Universität Bochum, Germany, co-chair) CONTACT: To contact the workshop organizers, please send an e-mail to lc...@easychair.org
[TYPES/announce] LCC'20 First Call for Contributions
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] (Apologies for cross posting.) === First Call for Contributions LCC 2020 21th International Workshop on Logic and Computational Complexity July 7, 2020, Saarbruecken, Germany Collocated with LICS/ICALP 2020 http://www.cs.swansea.ac.uk/lcc/ === 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 April 22, 2020 * notification May 13, 2020 * workshop July 7, 2020 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://easychair.org/conferences/?conf=lcc20 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: Martin Avanzini (INRIA Sophia Antipolis Méditerranée, France, co-chair) Diego Figueira (CNRS Bordeaux, France) Joanna Ochremiak (CNRS Bordeaux, France) Magdalena Ortiz (TU Wien, Austria) Thomas Seiller (CNRS Paris, France) Jakob Grue Simonsen (University of Copenhagen, Denmark) Thomas Zeume (TU Dortmund, Germany, co-chair) CONTACT: To contact the workshop organizers, please send an e-mail to lc...@easychair.org
[TYPES/announce] DICE Special Issue in TCS -- 2nd Call for Papers
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] == Call for Papers THEORETICAL COMPUTER SCIENCE Special Issue on Implicit Computational Complexity (open post-conference publication of the workshops DICE 2016, 2017 and 2018) Deadline: October 12th 2018 Guest Editors: Martin Avanzini Romain Péchoux == The area of Implicit Computational Complexity has grown from several proposals for using logic and formal methods to provide languages for complexity-bounded computation (such as polynomial time, polynomial space or logarithmic space computation). Its aim is to study computational complexity without reference to external measuring conditions or particular machine models, but only in terms of language restrictions or logical/computational principles implying complexity properties. We welcome contributions on various aspects of Implicit Computational Complexity, including (but not exclusively) the following topics: - types for controlling / inferring / checking complexity - logical systems for implicit computational complexity - programming languages for complexity bounded computation - logics closely related to complexity classes - static resource analysis and practical applications - semantics of complexity-bounded computation - application of implicit complexity to security - rewriting and termination orderings - termination and resource analysis for probabilistic programs - semantic methods to analyse resources This special issue of Theoretical Computer Science follows the informal workshops on Developments in Implicit Computational Complexity (DICE), DICE 2016 in Eindhoven (http://lipn.univ-paris13.fr/DICE2016/), DICE 2017 in Uppsala (http://cbr.uibk.ac.at/events/dice-fopara/) and DICE 2018 in Thessaloniki (http://cl-informatik.uibk.ac.at/users/zini/events/dice18). Submission to this special issue is open to everyone, including those who did not participate in the above editions of DICE. DICE workshops have been held annually as satellite events of ETAPS: DICE 2010 in Paphos, DICE 2011 in Saarbrücken, DICE 2012 in Tallinn, DICE 2013 in Rome, DICE 2014 in Grenoble, DICE 2015 in London, DICE 2016 in Eindhoven, DICE 2017 in Uppsala and DICE 2018 in Thessaloniki. Previous post-conference publications have appeared in - Information & Computation for DICE 2011, - Theoretical Computer Science for DICE 2012, - Information & Computation for DICE 2013, - Information & Computation for DICE 2014 & 2015. More information on the DICE workshop series is available at: http://perso.ens-lyon.fr/patrick.baillot/DICE Theoretical Computer Science solicits high quality papers reporting research results related to the topics mentioned above. All papers must be original, unpublished, and not submitted for publication elsewhere. All manuscripts and any supplementary material should be submitted through Elsevier Editorial System (EES). The authors must select as “SI:DICE” when they reach the “Article Type” step in the submission process. The EES submission website is located at: http://ees.elsevier.com/tcs/default.asp All papers will be peer-reviewed by three independent reviewers. Requests for additional information should be addressed to the guest editors. A detailed submission guideline is available as “Guide to Authors” at: http://www.journals.elsevier.com/theoretical-computer-science Submissions must be submitted no later than October 12th 2018. We are aiming for a turnaround of no more than eight months.
[TYPES/announce] DICE Special Issue in TCS -- Call for Papers
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] == Call for Papers THEORETICAL COMPUTER SCIENCE Special Issue on Implicit Computational Complexity (open post-conference publication of the workshops DICE 2016, 2017 and 2018) Deadline: October 12th 2018 Guest Editors: Martin Avanzini Romain Péchoux == The area of Implicit Computational Complexity has grown from several proposals for using logic and formal methods to provide languages for complexity-bounded computation (such as polynomial time, polynomial space or logarithmic space computation). Its aim is to study computational complexity without reference to external measuring conditions or particular machine models, but only in terms of language restrictions or logical/computational principles implying complexity properties. We welcome contributions on various aspects of Implicit Computational Complexity, including (but not exclusively) the following topics: - types for controlling / inferring / checking complexity - logical systems for implicit computational complexity - programming languages for complexity bounded computation - logics closely related to complexity classes - static resource analysis and practical applications - semantics of complexity-bounded computation - application of implicit complexity to security - rewriting and termination orderings - termination and resource analysis for probabilistic programs - semantic methods to analyse resources This special issue of Theoretical Computer Science follows the informal workshops on Developments in Implicit Computational Complexity (DICE), DICE 2016 in Eindhoven (http://lipn.univ-paris13.fr/DICE2016/), DICE 2017 in Uppsala (http://cbr.uibk.ac.at/events/dice-fopara/) and DICE 2018 in Thessaloniki (http://cl-informatik.uibk.ac.at/users/zini/events/dice18). Submission to this special issue is open to everyone, including those who did not participate in the above editions of DICE. DICE workshops have been held annually as satellite events of ETAPS: DICE 2010 in Paphos, DICE 2011 in Saarbrücken, DICE 2012 in Tallinn, DICE 2013 in Rome, DICE 2014 in Grenoble, DICE 2015 in London, DICE 2016 in Eindhoven, DICE 2017 in Uppsala and DICE 2018 in Thessaloniki. Previous post-conference publications have appeared in - Information & Computation for DICE 2011, - Theoretical Computer Science for DICE 2012, - Information & Computation for DICE 2013, - Information & Computation for DICE 2014 & 2015. More information on the DICE workshop series is available at: http://perso.ens-lyon.fr/patrick.baillot/DICE Theoretical Computer Science solicits high quality papers reporting research results related to the topics mentioned above. All papers must be original, unpublished, and not submitted for publication elsewhere. All manuscripts and any supplementary material should be submitted through Elsevier Editorial System (EES). The authors must select as “SI:DICE” when they reach the “Article Type” step in the submission process. The EES submission website is located at: http://ees.elsevier.com/tcs/default.asp All papers will be peer-reviewed by three independent reviewers. Requests for additional information should be addressed to the guest editors. A detailed submission guideline is available as “Guide to Authors” at: http://www.journals.elsevier.com/theoretical-computer-science Submissions must be submitted no later than October 12th 2018. We are aiming for a turnaround of no more than eight months.
[TYPES/announce] DICE 18: Final Call -- Extended Deadline
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] -- DICE 2018 9th Workshop on Developments in Implicit Computational complExity http://cl-informatik.uibk.ac.at/users/zini/events/dice18 Thessaloniki, Greece April 14 - 15, 2018 (a satellite event of ETAPS 2018) -- SCOPE The area of Implicit Computational Complexity (ICC) has grown from several proposals for using logic and formal methods to provide languages for complexity-bounded computation (e.g. PTIME, LOGSPACE computation). Its aim is to study computational complexity without reference to external measuring conditions or particular machine models, but only in terms of 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 connects both to the study of complexity classes and to static program analysis, in particular, resource analysis. With the aim to more closely bring together researches from these fields, this year contributions related to program's resource analysis are strongly encouraged. The workshop is open to contributions on various aspects of ICC and resource analysis, including (but not exclusively): * type systems for controlling/inferring/checking complexity; * logical and machine-independent characterisations of complexity classes; * programming languages for complexity-bounded computation; * logics closely related to complexity classes; * theoretical foundations of program complexity analysis; * static resource analysis and practical applications; * semantics of complexity-bounded computation; * applications of implicit complexity to security; * termination and resource analysis for probabilistic programs; * semantic methods to analyse resources. INVITED TALKS Jan Hoffmann (Carnegie Mellon University) Anupam Das (University of Copenhagen) SUBMISSIONS Authors are invited to submit an extended abstract of up to 5 pages by 7 February, 2018. Abstracts must be written in English and must be prepared using the LaTeX LIPIcs style template of 2016 (see http://www.dagstuhl.de/en/publications/lipics). Submissions are handled via the DICE 2018 EasyChair page: https://easychair.org/conferences/?conf=dice2018 . Submissions will be judged on originality, relevance, interest and clarity. Accepted abstracts will be presented at the workshop, and will be made available through the workshop's webpage. It is not intended to preclude later publication at another venue. Abstracts can contain material already published elsewhere. Preference will be given to abstracts containing novel work (including work in progress). IMPORTANT DATES Paper submission: 7 February, 2018 (extended) Notification: 25 February, 2018 Final versions due: 11 March, 2018 Workshop date: April 14-15, 2018 CONFERENCE VENUE The workshop will be held as a satellite workshop of the European Joint Conferences on Theory and Practice of Software 2018 (ETAPS 2018) which takes place in Thessaloniki, Greece. PROGRAM COMMITTEE Martin Avanzini (France, chair) Flavien Breuvart (France) Florian Frohn (Germany) Cynthia Kop (Netherlands) Olivier Laurent (France) Van Chan Ngo (USA) Romain Péchoux (France) Luca Roversi (Italy)
[TYPES/announce] DICE 18: 2nd Call for Papers
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] -- DICE 2018 9th Workshop on Developments in Implicit Computational complExity http://cl-informatik.uibk.ac.at/users/zini/events/dice18 Thessaloniki, Greece April 14 - 15, 2018 (a satellite event of ETAPS 2018) -- SCOPE The area of Implicit Computational Complexity (ICC) has grown from several proposals for using logic and formal methods to provide languages for complexity-bounded computation (e.g. PTIME, LOGSPACE computation). Its aim is to study computational complexity without reference to external measuring conditions or particular machine models, but only in terms of 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 connects both to the study of complexity classes and to static program analysis, in particular, resource analysis. With the aim to more closely bring together researches from these fields, this year contributions related to program's resource analysis are strongly encouraged. The workshop is open to contributions on various aspects of ICC and resource analysis, including (but not exclusively): * type systems for controlling/inferring/checking complexity; * logical and machine-independent characterisations of complexity classes; * programming languages for complexity-bounded computation; * logics closely related to complexity classes; * theoretical foundations of program complexity analysis; * static resource analysis and practical applications; * semantics of complexity-bounded computation; * applications of implicit complexity to security; * termination and resource analysis for probabilistic programs; * semantic methods to analyse resources. INVITED TALKS Jan Hoffmann (Carnegie Mellon University) Anupam Das (University of Copenhagen) SUBMISSIONS Authors are invited to submit an extended abstract of up to 5 pages by 31 January, 2018. Abstracts must be written in English and must be prepared using the LaTeX LIPIcs style template of 2016 (see http://www.dagstuhl.de/en/publications/lipics). Submissions are handled via the DICE 2018 EasyChair page: https://easychair.org/conferences/?conf=dice2018 . Submissions will be judged on originality, relevance, interest and clarity. Accepted abstracts will be presented at the workshop, and will be made available through the workshop's webpage. It is not intended to preclude later publication at another venue. Abstracts can contain material already published elsewhere. Preference will be given to abstracts containing novel work (including work in progress). IMPORTANT DATES Paper submission: 31 January, 2018 Notification: 25 February, 2018 Final versions due: 11 March, 2018 Workshop date: April 14-15, 2018 CONFERENCE VENUE The workshop will be held as a satellite workshop of the European Joint Conferences on Theory and Practice of Software 2018 (ETAPS 2018) which takes place in Thessaloniki, Greece. PROGRAM COMMITTEE Martin Avanzini (France, chair) Flavien Breuvart (France) Florian Frohn (Germany) Cynthia Kop (Netherlands) Olivier Laurent (France) Van Chan Ngo (USA) Romain Péchoux (France) Luca Roversi (Italy)
[TYPES/announce] DICE 18: Call for Papers
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] -- DICE 2018 9th Workshop on Developments in Implicit Computational complExity http://cl-informatik.uibk.ac.at/users/zini/events/dice18 Thessaloniki, Greece April 14 - 15, 2018 (a satellite event of ETAPS 2018) -- SCOPE The area of Implicit Computational Complexity (ICC) has grown from several proposals for using logic and formal methods to provide languages for complexity-bounded computation (e.g. PTIME, LOGSPACE computation). Its aim is to study computational complexity without reference to external measuring conditions or particular machine models, but only interms of 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 connects both to the study of complexity classes and to static program analysis. The workshop is open to contributions on various aspects of ICC and resource analysis, including (but not exclusively): * type systems for controlling/inferring/checking complexity; * logical and machine-independent characterisations of complexity classes; * programming languages for complexity-bounded computation; * logics closely related to complexity classes; * theoretical foundations of program complexity analysis; * static resource analysis and practical applications; * semantics of complexity-bounded computation; * applications of implicit complexity to security; * termination and resource analysis for probabilistic programs; * semantic methods to analyse resources. SUBMISSIONS Authors are invited to submit an extended abstract of up to 5 pages by 31 January, 2018. Abstracts must be written in English and must be prepared using the LaTeX LIPIcs style template of 2016 (see http://www.dagstuhl.de/en/publications/lipics). Submissionsare handled via the DICE 2018 EasyChair page: https://easychair.org/conferences/?conf=dice2018 . Submissions will be judged on originality, relevance, interest and clarity. Accepted abstracts will be presented at the workshop, and will be made available through the workshop's webpage. It is not intended to preclude later publication at another venue. Abstracts can contain material already published elsewhere. Preference will be given to abstracts containing novel work (including work in progress). IMPORTANT DATES Paper submission 31 January, 2018 Notification 25 February, 2018 Final versions due11 March, 2018 Workshop date April 14-15, 2018 CONFERENCE VENUE The workshop will be held as a satellite workshop of the European Joint Conferences on Theory and Practice of Software 2018 (ETAPS 2018) which takes place in Thessaloniki, Greece. PROGRAM COMMITTEE Martin Avanzini (France, chair) Flavien Breuvart (France) Florian Frohn (Germany) Cynthia Kop (Netherlands) Olivier Laurent (France) Van Chan Ngo (USA) Romain Péchoux (France) Luca Roversi (Italy)
