[TYPES/announce] PhD or postdoc position in logical modelling of notarial procedures at FAU Erlangen-Nürnberg
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] A fully funded three-year PhD or postdoc position (E-13 on the German TV-L scale, full time, no teaching obligation) is available at the Theoretical Computer Science lab of Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), Germany, with starting date between now and April 2024. The position is affiliated with a large interdisciplinary project involving FAU labs in computer science, linguistics, and law, funded by the German Federal Chamber of Notaries (Bundesnotarkammer). The project is aimed at providing automated support for notarial procedures using methods from formal logic, machine learning, and computational linguistics. The position at the Theoretical Computer Science lab, supervised by Lutz Schröder, is concerned with formal logical modelling and reasoning. We are thus looking for a candidate with an MSc or PhD in computer science or mathematics, ideally with a background in logic, in particular modal or description logics. The position is embedded into a large and active research group with a highly collaborative spirit, see https://www8.cs.fau.de/ for more details. Erlangen's technical campus is situated within pleasant Franconia, and close to the vibrant city of Nuremberg. Please send applications or further inquiries to lutz.schroe...@fau.de Best wishes, Lutz Schröder -- -- Prof. Dr. Lutz Schröder Friedrich-Alexander-Universität Erlangen-Nürnberg Department of Computer Science Chair 8 -- Theoretical Computer Science Martensstr. 3 91058 Erlangen +49-9131-85-64059 lutz.schroe...@fau.de http://www8.cs.fau.de/~schroeder/ - smime.p7s Description: S/MIME Cryptographic Signature
[TYPES/announce] ESSLLI 2023: Second Call for Course and Workshop Proposals
of current interest. Workshop organizers are responsible for soliciting papers and selecting the workshop program. They are also responsible for publishing proceedings if they decide to have proceedings. Proposal Guidelines Course and workshop proposals should closely follow these guidelines to ensure full consideration. Course and Workshop proposals can be submitted by no more than two lecturers/organizers and they are presented by no more than these two lecturers/organizers. All instructors and organizers must possess a PhD or equivalent degree by the submission deadline. Course proposals should mention explicitly the intended course category. Proposals for introductory courses should indicate the intended level, for example as it relates to standard textbooks and monographs in the area. Proposals for advanced courses should specify the prerequisites in detail. Proposals of Courses given at ESSLLI the previous year will have a lower priority of being accepted in the current year. Proposals must be in PDF format include all of the following: 1. Personal information for each proposer: Name, affiliation, contact address, email, homepage (optional) 2. General proposal information: Title, category 3. Contents information: a. Abstract of up to 150 words b. Motivation and description (up to two pages) c. Tentative outline d. Expected level and prerequisites e. Appropriate references (e.g. textbooks, monographs, proceedings, surveys) 4. Information on the proposer and course: a. Will your course appeal to students outside of the main discipline of the course? b. Include information on your experience in the intensive one-week interdisciplinary setting c. Include evidence that the course proposer is an excellent lecturer 5. Information from workshop organizers: a. Include information on relevant preceding meetings and events, if applicable b. Include information about potential external funding for participants Submission Information By January 13, 2023: You are asked to submit in EasyChair at least the name(s) of the instructor(s), the ESSLLI area+course level and a short abstract. By January 20: Your submission must be completed by uploading a PDF with the actual proposal as detailed above. Submission Portal Please submit your proposals to https://urldefense.com/v3/__https://easychair.org/conferences/?conf=esslli2023__;!!IBzWLUs!SxPKSwl6S4uXRnHXzbt_bzqB8wYnVmp9jTOIlF__BxxKEWuV5D0mCigmgOOAiYa4y1Uv-vVJa3alB6Kzd9mpfOwuia-Zl3n4PVcPD5Q$ Childcare If there is enough interest, ESSLLI will provide information on private child care services available during the summer school. EACSL Sponsorship The EACSL will support one Logic and Computation course or workshop addressing topics of interest to Computer Science Logic (CSL) conferences. The selected course or workshop will be designated an EACSL course/workshop in the programme. If you wish to be considered for this, please indicate so in your proposal. Organizing Committee Slavko Žitnik (University of Ljubljana) (chair) Špela Vintar (University of Ljubljana) Timotej Knez (University of Ljubljana) Mojca Brglez (University of Ljubljana) Matej Klemen (University of Ljubljana) Aleš Žagar (University of Ljubljana) Program Committee Juha Kontinen (University of Helsinki) (chair) Kaja Dobrovoljc (University of Ljubljana) (local co-chair) AREA CHAIRS LANGUAGE AND COMPUTATION (LACO) Kilian Evang (Heinrich Heine University Düsseldorf) Miryam de Lhoneux (KU Leuven) Shane Steinert-Threlkeld (University of Washington) AREA CHAIRS LANGUAGE AND LOGIC (LALO) Ivano Ciardelli (University of Padua) Agata Renans (Ruhr-Universität Bochum) Jacopo Romoli (Heinrich Heine University Düsseldorf) AREA CHAIRS LOGIC AND COMPUTATION (LOCO) Natasha Alechina (Utrecht University) Alessandra Palmigiano (Vrije Universiteit Amsterdam) Lutz Straßburger (Inria Saclay & École Polytechnique) ESSLLI Steering Committee Darja Fiser (University of Ljubljana) (chair) Phokion Kolaitis (University of California, Santa Cruz) (vice-chair) Roman Kuznets (TU Wien) Petya Osenova (Bulgarian Academy of Sciences and Sofia University) (secretary) Jakub Szymanik (University of Trento)
[TYPES/announce] ESSLLI 2023: Call for Course and Workshop Proposals
and they are presented by no more than these two lecturers/organizers. All instructors and organizers must possess a PhD or equivalent degree by the submission deadline. Course proposals should mention explicitly the intended course category. Proposals for introductory courses should indicate the intended level, for example as it relates to standard textbooks and monographs in the area. Proposals for advanced courses should specify the prerequisites in detail. Proposals of Courses given at ESSLLI the previous year will have a lower priority of being accepted in the current year. Proposals must be in PDF format include all of the following: 1. Personal information for each proposer: Name, affiliation, contact address, email, homepage (optional) 2. General proposal information: Title, category 3. Contents information: * Abstract of up to 150 words * Motivation and description (up to two pages) * Tentative outline * Expected level and prerequisites * Appropriate references (e.g. textbooks, monographs, proceedings, surveys) 1. Information on the proposer and course: * Will your course appeal to students outside of the main discipline of the course? * Include information on your experience in the intensive one-week interdisciplinary setting * Include evidence that the course proposer is an excellent lecturer 1. Information from workshop organizers: * Include information on relevant preceding meetings and events, if applicable * Include information about potential external funding for participants Submission Information By January 13, 2023: You are asked to submit in EasyChair at least the name(s) of the instructor(s), the ESSLLI area+course level and a short abstract. By January 20: Your submission must be completed by uploading a PDF with the actual proposal as detailed above. Submission Portal Please submit your proposals to https://urldefense.com/v3/__https://easychair.org/conferences/?conf=esslli2023__;!!IBzWLUs!VkcjEqQYvwKsMUYHwzbfRkweBHfiOpAr1ENbaVskWmxhTNAyXZZu82nhSUn4pr4r4U4sjyWX2mq_2N7jMrg3PTuqoXdp2wrNebjP6is$ <https://urldefense.com/v3/__https://easychair.org/conferences/?conf=esslli2023__;!!IBzWLUs!VkcjEqQYvwKsMUYHwzbfRkweBHfiOpAr1ENbaVskWmxhTNAyXZZu82nhSUn4pr4r4U4sjyWX2mq_2N7jMrg3PTuqoXdp2wrNebjP6is$ > Childcare If there is enough interest, ESSLLI will provide information on private child care services available during the summer school. EACSL Sponsorship The EACSL will support one Logic and Computation course or workshop addressing topics of interest to Computer Science Logic (CSL) conferences. The selected course or workshop will be designated an EACSL course/workshop in the programme. If you wish to be considered for this, please indicate so in your proposal. Organizing Committee Slavko Žitnik (University of Ljubljana) (chair) Špela Vintar (University of Ljubljana) Timotej Knez (University of Ljubljana) Mojca Brglez (University of Ljubljana) Matej Klemen (University of Ljubljana) Aleš Žagar (University of Ljubljana) Program Committee Juha Kontinen (University of Helsinki) (chair) Kaja Dobrovoljc (University of Ljubljana) (local co-chair) Area Chairs Language and Computation (LaCo) Kilian Evang (Heinrich Heine University Düsseldorf) Miryam de Lhoneux (KU Leuven) Shane Steinert-Threlkeld (University of Washington) Area Chairs Language and Logic (LaLo) Ivano Ciardelli (University of Padua) Agata Renans (Ruhr-Universität Bochum) Jacopo Romoli (Heinrich Heine University Düsseldorf) Area Chairs Logic and Computation (LoCo) Natasha Alechina (Utrecht University) Alessandra Palmigiano (Vrije Universiteit Amsterdam) Lutz Straßburger (Inria Saclay & École Polytechnique) ESSLLI Steering Committee Darja Fiser (University of Ljubljana) (chair) Phokion Kolaitis (University of California, Santa Cruz) (vice-chair) Roman Kuznets (TU Wien) Petya Osenova (Bulgarian Academy of Sciences and Sofia University) (secretary) Jakub Szymanik (University of Amsterdam)
[TYPES/announce] PhD funding on "Reasoning about Concurrent Game Structures with Numerical Resources"
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] PhD Fellowship - Labex Digicosme - Paris-Saclay (LIX, LMF) Urgent: deadline for application = June 10th 2021 We are looking for a candidate for the PhD proposal "REASONING ABOUT CONCURRENT GAME STRUCTURES WITH NUMERICAL RESOURCES" More details can be found at http://www.lsv.fr/~demri/PhDProposal2021.pdf Financement is secured, assuming that the candidate is known to Labex Digicosme by June 15th. The candidate must hold a Master degree in Computer Science, with a solid background in Theoretical Computer Science or Symbolic AI. Typically, candidates with a good knowledge on formal methods, logics for artificial intelligence and proof theory are much appreciated. Applications can be sent either in English or in French. To apply to the position, please send a CV to de...@lsv.fr and l...@lix.polytechnique.fr. --- Stéphane Demri (CNRS, LMF) https://cv.archives-ouvertes.fr/stephane-demri
[TYPES/announce] Open Topic Full Professorship in Computer Science, FAU Erlangen-Nürnberg
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Friedrich-Alexander-Universität Erlangen-Nürnberg is advertising an open-topic full professorship in computer science, see https://www.fau.de/people/karriere-personalentwicklung/ausgeschriebene-professuren/#collapse_3 or in English: https://www.fau.eu/university/careers-at-fau/professorships/#collapse_3 Best, Lutz smime.p7s Description: S/MIME Cryptographic Signature
[TYPES/announce] PhD position in Coalgebraic Model Checking at FAU Erlangen-Nürnberg
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] We are pleased to announce an opening for a fully funded three-year PhD position (E-13 on the German TV-L scale, full time, no teaching obligation) at Friedrich-Alexander-Universität Erlangen-Nürnberg, located at the Chair of Theoretical Computer Science. The position is within the new DFG project "Coalgebraic Model Checking", with Stefan Milius and Lutz Schröder as PIs and with Daniel Hausmann collaborating on a second project position. The aim of the project is to develop a generic framework for model checking a wide variety of logics beyond the standard relational setting, such as probabilistic, graded, or alternating-time logics, based on the successful paradigm of coalgebraic logic. The position is embedded into a large and active research group with a highly collaborative spirit, see https://www8.cs.fau.de/ for more details. Erlangen's technical campus is situated within pleasant Franconia, and close to the vibrant city of Nuremberg. Please send applications or further inquiries to the PIs at stefan.mil...@fau.de or lutz.schroe...@fau.de Best wishes, Lutz and Stefan smime.p7s Description: S/MIME Cryptographic Signature
[TYPES/announce] FLoC 2018 Workshop: Twenty years of deep inference
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Only two days left for submission ... TWENTY YEARS OF DEEP INFERENCE Oxford, July 7, 2018 Part of FLoC 2018 <https://www.lix.polytechnique.fr/~lutz/orgs/TYDI2018.html> Aim and Scope: -- Deep inference is a paradigm for designing deductive proof systems. The inference rules in such systems can perform arbitrary rewriting inside formulas. This is very different from what one would expect from more traditional formalisms, like sequent calculus or natural deduction, where formulas are always decomposed along their main connective. The purpose of this workshop is to - present this vast growing field in a coherent, easy accessible way to other communities in all areas of logic in computer science, and - bring together researchers in the area of deep inference to exchange ideas and to discuss their current work. Invited Speakers: - Alessio Guglielmi (University of Bath) Willem Heijltjes (University of Bath) Contributions: -- Since we will not publish any proceedings, we accept talks about work in progress as well as already published/submitted work and surveys. However, we do not allow work that is presented at another FLoC event. Submission Instructions: If you want to give a talk please submit an abstract of 1-3 pages in pdf format via the EasyChair submission page: <https://easychair.org/conferences/?conf=tydi0> Important Dates: 15 April 2018: abstract submission deadline 15 May 2018: Author notification 25 May 2018: Final version for USB flash drive 7 July 2018: Workshop Organization: - Andrea Aler Tubella (IRIF - CNRS & Univ. Paris Diderot) Lutz Straßburger (Inria Saclay & LIX, Ecole Polytechnique)
[TYPES/announce] PhD and Postdoc Position in Monad-Based Programming and Verification at FAU
[ The Types Forum (announcements only),
http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]
[We would be grateful for further distribution of the job advertisement
below]
In the Theoretical Computer Science group (Chair Computer Science 8) at
the Friedrich-Alexander-Universität Erlangen-Nürnberg, we have a PhD and
a postdoc position available in the DFG-Project "A High Level Language
for Programming and Specifying Multi-Effect Algorithms", which is
concerned with monad-based semantics and program logics for
side-effecting iteration and recursion. The technical part of the
project proposal can be made available on request.
The project is supervised by Sergey Goncharov and Lutz Schröder. The
positions are in the TV-L E13 or E14 pay scale depending on
qualification of the applicant; the project duration is three years.
Please enquire or apply by e-mail to
{lutz.schroeder,sergey.goncharov}@fau.de
Best,
Sergey and Lutz
--
--
Prof. Dr. Lutz Schröder
Friedrich-Alexander-Universität
Erlangen-Nürnberg
Department of Computer Science
Chair 8 -- Theoretical Computer Science
Martensstr. 3
91058 Erlangen
+49-9131-85-64059
lutz.schroe...@informatik.uni-erlangen.de
lutz.schroe...@cs.fau.de
http://www8.cs.fau.de/~schroeder/
--
smime.p7s
Description: S/MIME Cryptographic Signature
[TYPES/announce] Postdoc position in proof theory in Paris
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Postdoc position in proof theory in Paris There is an opening of a postdoc position on structural and computational proof theory. The position is financed by the ANR within the project FISP. <https://www.lix.polytechnique.fr/~lutz/orgs/FISP.html> The postdoc will be hosted by INRIA and the Laboratoire d'Informatique (LIX) at the Ecole Polytechnique, one of the "Grand Ecoles" in the French university system, located in the suburbs of Paris. The successful candidate will be working within the PARSIFAL team. <http://team.inria.fr/parsifal/> Starting date should be in Fall 2017. Applicants must have a Ph.D. or equivalent in computer science or mathematics, and should have a strong background in proof theory and related topics. The principal responsibility of the postdoc will be to carry out research in the area of proof theory within the FISP project. There are no teaching duties. For further information, see <http://www.lix.polytechnique.fr/~lutz/orgs/fisp-postdoc.html> or contact Lutz Strassburger <l...@lix.polytechnique.fr> Applications should be sent via email to Lutz Strassburger <l...@lix.polytechnique.fr> and should include a CV, a research statement (1-2 pages), and one or two recommendation letters. The application deadline is *** April 16, 2017 ***
[TYPES/announce] Workshop on Efficient and Natural Proof Systems: 14-16 December, Bath.
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] 2nd AND FINAL CALL FOR PARTICIPATION Workshop on EFFICIENT AND NATURAL PROOF SYSTEMS University of Bath 14-16 December, 2015 The Mathematical Foundations group at the Department of Computer Science, University of Bath, will host a 2.5-day workshop on structural proof theory, starting in the afternoon of 14 December. The workshop will focus on the various aspects of structural proof theory, including but not limited to the following topics: - deep inference proof theory - algebraic, combinatorial and geometric representations of proofs - proof compression - normalisation of proofs - proof checking - proof search - complexity of proofs - computational interpretations of proofs PROGRAMME Both the programme and the current list of participants can be found here: <http://www.cs.bath.ac.uk/ag/ENPS/wenps2015.html> PARTICIPATION There is no fee or formal registration for the workshop and anyone is welcome to attend. However, at this stage, we ask that anyone who intends to attend (and hasn't contacted us already) informs us as soon as possible (deadline was 20 November), so that we may accordingly plan the local organisation. Enquiries can be sent to <wenps2...@easychair.org> or to the Bath's organisers. COURSE ON DEEP INFERENCE *Change of time*: 14 December 11:00 to 13:00. (Due to the high quality and number of contributions received by the committee, we have decided to replace the previously advertised course on deep inference by an abridged version preceding the workshop.) Deep inference is a modern proof theory offering a better understanding of proofs and extending the range of applications of traditional Gentzen proof theory. This course will offer a brief introduction to deep inference. CHILDCARE The Department of Computer Science and the University of Bath are committed to a supportive and inclusive working environment. Childcare will be provided to workshop participants and their children if required. If you need this service, please contact us as soon as possible at <wenps2...@easychair.org>. ORGANISING AND PROGRAMME COMMITTEE Paola Bruscoli (Bath) Anupam Das (ENS Lyon) Willem Heijltjes (Bath) Lutz Strassburger (Inria) FUNDING EPSRC Project EP/K018868/1 "Efficient and Natural Proof Systems" <http://www.cs.bath.ac.uk/ag/ENPS/>.
[TYPES/announce] Deadline Extension: SD14, July 12-13, 2014, Vienna
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] DEADLINE EXTENSION: April 20, 2014 The Third International Workshop on STRUCTURES AND DEDUCTION (SD14) http://vsl2014.at/sd/ July 12-13, 2014 Affiliated with CSL-LICS 2014 Part of the Vienna Summer of Logic Overview This is the third in a series of meetings that bring together researchers in different areas of proof theory. The main interest is in new algebraic and geometric results in proof theory that expand our abilities to manipulate proofs, that help to reduce bureaucracy in deductive systems, and that ultimately lead to new methods for proof search and new kinds of proof certificates. Topics of the workshop include - syntactic presentations of proofs, like sequent calculi and deep inference systems, in their focused and non-focused variants; - combinatorial presentations of proofs, such as proof nets; - algebraic presentations of proofs, for example via game semantics or category theory; - methods for proof manipulation and normal forms for proofs; - methods for incorporating computation and rewriting in proof search, such as deduction modulo or fixpoint definitions. Since the past two meetings, held in 2005 in Lisbon and in 2009 in Bordeaux, there has been a tremendous amount of progress in the theoretical foundations of the topics mentioned above. The time is ripe for moving towards implementations of these ideas in terms of new interactive and automated reasoning tools and modifications to existing tools. Thus, we encourage contributions not only of regular papers, but also of system descriptions, work in progress, and programmatic/position papers. Invited Speakers Gilles Dowek (Inria Paris-Rocquencourt) Rosalie Iemhoff (Utrecht University) Kazushige Terui (Kyoto University) Deadlines and Author Instructions = Submission deadline: April 20, 2014 Notification:May 9, 2014 Final version: May 20, 2014 Authors are requested to submit a 10 page (for finished work) or 5 page (for work in progress) paper in the Easychair Proceedings format. LaTeX style files and documentation are available at: http://www.easychair.org/publications/easychair.zip Submissions are through the following URL: http://easychair.org/conferences/?conf=sd14 Program Committee = David Baelde (ENS Cachan) Paola Bruscoli (University of Bath) Kaustuv Chaudhuri (Inria) - chair Nicolas Guenot (IT University of Copenhagen) Willem Heijltjes (University of Bath) - chair James Laird (University of Bath) Chuck Liang (Hofstra Unviersity) Michel Parigot (CNRS - Université Paris 7) Elaine Pimentel (UFMG) Revantha Ramanayake (Vienna University of Technology) Luca Roversi (University Torino) Lutz Strassburger (Inria) - chair Christine Tasson (Laboratoire PPS) Alwen Tiu (Nanyang Technological University)
[TYPES/announce] Third and Last Call for Papers for SD14, July 12-13, 2014, Vienna
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] THIRD AND LAST CALL FOR PAPERS FOR The Third International Workshop on STRUCTURES AND DEDUCTION (SD14) http://vsl2014.at/sd/ July 12-13, 2014 Affiliated with CSL-LICS 2014 Part of the Vienna Summer of Logic Overview This is the third in a series of meetings that bring together researchers in different areas of proof theory. The main interest is in new algebraic and geometric results in proof theory that expand our abilities to manipulate proofs, that help to reduce bureaucracy in deductive systems, and that ultimately lead to new methods for proof search and new kinds of proof certificates. Topics of the workshop include - syntactic presentations of proofs, like sequent calculi and deep inference systems, in their focused and non-focused variants; - combinatorial presentations of proofs, such as proof nets; - algebraic presentations of proofs, for example via game semantics or category theory; - methods for proof manipulation and normal forms for proofs; - methods for incorporating computation and rewriting in proof search, such as deduction modulo or fixpoint definitions. Since the past two meetings, held in 2005 in Lisbon and in 2009 in Bordeaux, there has been a tremendous amount of progress in the the theoretical foundations of the topics mentioned above. The time is ripe for moving towards implementations of these ideas in terms of new interactive and automated reasoning tools and modifications to existing tools. Thus, we encourage contributions not only of regular papers, but also of system descriptions, work in progress, and programmatic/position papers. Invited Speakers Gilles Dowek (Inria Paris-Rocquencourt) Rosalie Iemhoff (Utrecht University) Kazushige Terui (Kyoto University) Deadlines and Author Instructions = Submission deadline: April 13, 2014 Notification:May 9, 2014 Final version: May 20, 2014 Authors are requested to submit a 10 page (for finished work) or 5 page (for work in progress) paper in the Easychair Proceedings format. LaTeX style files and documentation are available at: http://www.easychair.org/publications/easychair.zip Submissions are through the following URL: http://easychair.org/conferences/?conf=sd14 Program Committee = David Baelde (ENS Cachan) Paola Bruscoli (University of Bath) Kaustuv Chaudhuri (Inria) - chair Nicolas Guenot (IT University of Copenhagen) Willem Heijltjes (University of Bath) - chair James Laird (University of Bath) Chuck Liang (Hofstra Unviersity) Michel Parigot (CNRS - Université Paris 7) Elaine Pimentel (UFMG) Revantha Ramanayake (Vienna University of Technology) Luca Roversi (University Torino) Lutz Strassburger (Inria) - chair Christine Tasson (Laboratoire PPS) Alwen Tiu (Nanyang Technological University)
[TYPES/announce] Second Call for Papers for SD14, July 12-13, 2014, Vienna
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] SECOND CALL FOR PAPERS FOR The Third International Workshop on STRUCTURES AND DEDUCTION (SD14) http://vsl2014.at/sd/ July 12-13, 2014 Affiliated with CSL-LICS 2014 Part of the Vienna Summer of Logic Overview This is the third in a series of meetings that bring together researchers in different areas of proof theory. The main interest is in new algebraic and geometric results in proof theory that expand our abilities to manipulate proofs, that help to reduce bureaucracy in deductive systems, and that ultimately lead to new methods for proof search and new kinds of proof certificates. Topics of the workshop include - syntactic presentations of proofs, like sequent calculi and deep inference systems, in their focused and non-focused variants; - combinatorial presentations of proofs, such as proof nets; - algebraic presentations of proofs, for example via game semantics or category theory; - methods for proof manipulation and normal forms for proofs; - methods for incorporating computation and rewriting in proof search, such as deduction modulo or fixpoint definitions. Since the past two meetings, held in 2005 in Lisbon and in 2009 in Bordeaux, there has been a tremendous amount of progress in the the theoretical foundations of the topics mentioned above. The time is ripe for moving towards implementations of these ideas in terms of new interactive and automated reasoning tools and modifications to existing tools. Thus, we encourage contributions not only of regular papers, but also of system descriptions, work in progress, and programmatic/position papers. Invited Speakers Gilles Dowek (Inria Paris-Rocquencourt) Rosalie Iemhoff (Utrecht University) Kazushige Terui (Kyoto University) Deadlines and Author Instructions = Submission deadline: April 13, 2014 Notification:May 9, 2014 Final version: May 20, 2014 Authors are requested to submit a 10 page (for finished work) or 5 page (for work in progress) paper in the Easychair Proceedings format. LaTeX style files and documentation are available at: http://www.easychair.org/publications/easychair.zip Submissions are through the following URL: http://easychair.org/conferences/?conf=sd14 Program Committee = David Baelde (ENS Cachan) Paola Bruscoli (University of Bath) Kaustuv Chaudhuri (Inria) - chair Nicolas Guenot (IT University of Copenhagen) Willem Heijltjes (University of Bath) - chair James Laird (University of Bath) Chuck Liang (Hofstra Unviersity) Michel Parigot (CNRS - Université Paris 7) Elaine Pimentel (UFMG) Revantha Ramanayake (Vienna University of Technology) Luca Roversi (University Torino) Lutz Strassburger (Inria) - chair Christine Tasson (Laboratoire PPS) Alwen Tiu (Nanyang Technological University)
[TYPES/announce] First Call for Papers for SD14, July 12-13, 2014, Vienna
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] CALL FOR PAPERS FOR The Third International Workshop on STRUCTURES AND DEDUCTION (SD14) http://vsl2014.at/sd/ July 12-13, 2014 Affiliated with CSL-LICS 2014 Part of the Vienna Summer of Logic Overview This is the third in a series of meetings that bring together researchers in different areas of proof theory. The main interest is in new algebraic and geometric results in proof theory that expand our abilities to manipulate proofs, that help to reduce bureaucracy in deductive systems, and that ultimately lead to new methods for proof search and new kinds of proof certificates. Topics of the workshop include - syntactic presentations of proofs, like sequent calculi and deep inference systems, in their focused and non-focused variants; - combinatorial presentations of proofs, such as proof nets; - algebraic presentations of proofs, for example via game semantics or category theory; - methods for proof manipulation and normal forms for proofs; - methods for incorporating computation and rewriting in proof search, such as deduction modulo or fixpoint definitions. Since the past two meetings, held in 2005 in Lisbon and in 2009 in Bordeaux, there has been a tremendous amount of progress in the the theoretical foundations of the topics mentioned above. The time is ripe for moving towards implementations of these ideas in terms of new interactive and automated reasoning tools and modifications to existing tools. Thus, we encourage contributions not only of regular papers, but also of system descriptions, work in progress, and programmatic/position papers. Invited Speakers Gilles Dowek (Inria Paris-Rocquencourt) Rosalie Iemhoff (Utrecht University) Kazushige Terui (Kyoto University) Deadlines and Author Instructions = Submission deadline: April 13, 2014 Notification: May 9, 2014 Final version: May 20, 2014 Authors are requested to submit a 10 page (for finished work) or 5 page (for work in progress) paper in the Easychair Proceedings format. LaTeX style files and documentation are available at: http://www.easychair.org/publications/easychair.zip Submissions are through the following URL: http://easychair.org/conferences/?conf=sd14 Program Committee = David Baelde (ENS Cachan) Paola Bruscoli (University of Bath) Kaustuv Chaudhuri (INRIA) - chair Nicolas Guenot (IT University of Copenhagen) Willem Heijltjes (University of Bath) - chair James Laird (University of Bath) Chuck Liang (Hofstra Unviersity) Michel Parigot (CNRS - Université Paris 7) Elaine Pimentel (UFMG) Revantha Ramanayake (Vienna University of Technology) Luca Roversi (University Torino) Lutz Strassburger (Inria) - chair Christine Tasson (Laboratoire PPS) Alwen Tiu (Nanyang Technological University)
[TYPES/announce] Postdoc position in proof theory in Paris
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Postdoc position in proof theory in Paris There is an opening of a postdoc position on structural and computational proof theory. The position is financed by the ANR within the project STRUCTURAL. http://www.lix.polytechnique.fr/~lutz/orgs/structural.html The postdoc will be hosted by INRIA and the Laboratoire d'Informatique (LIX) at the Ecole Polytechnique, one of the Grand Ecoles in the French university system, located in the suburbs of Paris. The successful candidate will be working within the PARSIFAL team. http://team.inria.fr/parsifal/ Starting date should be between February and April 2013. Applicants must have a Ph.D. or equivalent in computer science or mathematics, and should have a strong background in proof theory and related topics. The principal responsibility of the postdoc will be to carry out research in the area of proof theory within the project STRUCTURAL. There are no teaching duties. For further information, see http://www.lix.polytechnique.fr/~lutz/orgs/structural-postdoc.html or contact Lutz Strassburger l...@lix.polytechnique.fr Applications should be sent via email to Lutz Strassburger l...@lix.polytechnique.fr and should include a CV, a research statement (1-2 pages), and one or two recommendation letters. The application deadline is *** January 31, 2013 ***
[TYPES/announce] Postdoc Position at LIX/Ecole Polytechnique
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] There is a 12 month postdoc position available at LIX, Ecole Polytechnique, within the PARSIFAL team. http://team.inria.fr/parsifal/ The selected candidate will have to conduct research on one of the topics currently studied in the Parsifal team, in particular within the projects - STRUCTURAL (http://www.lix.polytechnique.fr/~lutz/orgs/structural.html), - ProofCert (http://team.inria.fr/parsifal/proofcert/), and - RAPT (http://www.lix.polytechnique.fr/~kaustuv/rapt/) Starting date should be between September and December 2012. Profile: Candidates must have a PhD in Computer Science with strong background in proof theory, declarative programming, and related fields. Application: Applicants should send their application, consisting of a CV, a research statement of 1-2 pages, explaining how they would integrate in the Parsifal team, and two recommendation letters (or names of at least two references) to: Lutz Strassburger l...@lix.polytechnique.fr Deadline: August 24, 2012
[TYPES/announce] PhD/Postdoc Positions in Theoretical Computer Science at FAU Erlangen-Nürnberg
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] [I would be grateful for further distribution of the job advertisement below] In the newly founded Theoretical Computer Science group (Chair 8) at the University of Erlangen-Nürnberg, several research positions are available that can be filled at the doctoral or post-doctoral level. These include project positions of up to two years, in the TV-L E13 or E14 pay scale depending on qualification of the applicant; project topics include - coalgebraic logic - probabilistic description logic - formal methods in mechanical engineering. Additionally, at least one position is available that is not tied to a specific research project but does carry a teaching obligation of 5h per week; in this case, research work can be positioned in any of the core fields of the group including - modal logic - knowledge representation - coalgebra - formal methods - program semantics - applications of semantic technologies Such positions can be filled at TV-L E13 for an initial appointment of three years, with a possibility of extension for another three years subject to provisions by German laws on temporal employment in academia; postdoctoral applicants from EU countries can be appointed at the A13 payscale (akademischer Rat) (which pays better and has better benefits) for two periods of three years, with a possible extension of two periods of two years at the A14 payscale (akademischer Oberrat) for candidates who successfully complete a habilitation during the first six years. Please send applications consisting of a cover letter, resume, and contact details of three references by email to lutz.schroe...@cs.fau.de. There is no particular application deadline; positions will be filled when suitable candidates are found. Best regards, Lutz -- -- Prof. Dr. Lutz Schröder Chair of Theoretical Computer Science Department of Computer Science Friedrich-Alexander-Universität Erlangen-Nürnberg lutz.schroe...@informatik.uni-erlangen.de lutz.schroe...@cs.fau.de --
[TYPES/announce] FHIES 2011 Second Call for Papers
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] [Thanks for circulating the call for papers below, which may be of interest to readers of the types list through the relationship of types to formal methods. -- Lutz] FHIES 2011 International Symposium on Foundations of Health Information Engineering and Systems (http://www.iist.unu.edu/ICTAC/FHIES2011/) 27-29 August 2011 Mabalingwe Nature Reserve, South Africa (Colocated with ICTAC 2011) Information and communication technology plays an increasingly enabling role in addressing the global challenges of healthcare, in both the developed and the developing world, that are the concern of the United Nations, its Peoples and Members States. The use of software in medical devices is already raising issues in relation to safety and efficacy for manufacturers and regulators. Health information systems raise issues of both privacy and confidentiality, on the one hand, and, increasingly, patient safety on the other. Hospital and other information systems raise important issues of efficacy and interoperability. However, to capitalize on the potential of this technology in reshaping healthcare demands focused research on sound and safe development techniques from software engineering, electronic engineering, computing science, information science, mathematics, and industrial engineering. Aims = The purpose of the new symposium series on Foundations of Software Engineering Health Informatics (FHIES) is to promote a nascent research area that aims to develop and apply theories and techniques in computing science and software engineering to modelling, building and certifying software based systems in the application domain of healthcare. Many of these systems are already regulated in many jurisdictions and many more of them will become regulated in the future. Research on theories, techniques and tools of software modelling, verification and validation has been an important area of computer science and software engineering, known as Formal Methods. This research addresses the challenging problem of design and certification of safety or mission critical software systems through abstraction and decomposition techniques based on the use of mathematical modelling theories and sound engineering methods. Formal methods have primarily addressed the correctness of systems used in the industrial, financial, and defense applications. However, they have recently found application in modelling and analysis of complex systems that involve interacting behaviour of many kinds of objects and agents, including software systems, physical objects and humans. The models of these systems have both discrete and continuous behaviour, and both qualitative and quantitative (e.g., spatial timing and probabilistic) properties. It is believed that these methods can be used for modelling problems of health informatics, which presents the challenge of scalability. Software plays a critical role in sustainable health care, both as part of the solution and as part of the problem. Software intensive information systems are needed to support the collection and processing of vast amounts of data via different devices, and allow policy makers to access and share these data, and to support their decision making and validation. Software systems can be developed for managing, controlling and monitoring policies, processes and workflows in medical systems. Software systems can be developed to help create the sophisticated medical devices that are simply impossible to build without the software. On the other hand, the application of software raises challenging issues in safety, security and privacy, and increases the complexity of healthcare workflows and the need for new business policies. Paper Submissions == We solicit high quality submissions reporting on 1. original research contributions (18 pages maximum in LNCS format) 2. application experience, case studies and software prototypes (18 pages maximum in LNCS format) 3. surveys, comparisons, and state-of-the-art reports (18 pages maximum in LNCS format) 4. position papers that define research projects with identified challenges and milestones (10 pages maximum in LNCS format) 5. proposals for panel discussions, with at least three named panellists, about a topical question (5 pages maximum in LNCS format). All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Submissions should be in English, prepared in the LNCS format (see here for details). Submission constitutes a commitment to attend and present a paper, if accepted. All
[TYPES/announce] Postdoc position in proof theory in Paris
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Postdoc position in proof theory in Paris There is an opening of a postdoc position on structural and computational proof theory. The position is financed by the ANR within the project STRUCTURAL http://www.lix.polytechnique.fr/~lutz/orgs/structural.html The postdoc will be hosted by the Laboratoire d'Informatique (LIX) at the Ecole Polytechnique, one of the Grand Ecoles in the French university system, located in the suburbs of Paris. Applicants must have a Ph.D. or equivalent in computer science or mathematics, and should have a strong background in proof theory and related topics. The principal responsibility of the postdoc will be to carry out research in the area of proof theory within the project STRUCTURAL. There are no teaching duties. For further information, see http://www.lix.polytechnique.fr/~lutz/orgs/structural-postdoc.html or contact Lutz Strassburger l...@lix.polytechnique.fr or Kaustuv Chaudhuri kaustuv.chaudh...@inria.fr Applications should be sent via email to Lutz Strassburger l...@lix.polytechnique.fr and Kaustuv Chaudhuri kaustuv.chaudh...@inria.fr, and should include a CV, a research statement (1-2 pages), and two recommendation letters. The application deadline is *** May 20, 2011 ***
[TYPES/announce] FHIES 2011: First Call for Papers
or Springer in the LNCS series, and it will include all the accepted submissions, EXCEPT FOR the proposals for panel discussions. The post proceedings will include a brief summary of panel discussions. Important Dates === Abstract Submission 29May 2011 Paper Submission5 June 2011 Notification of acceptance 18July 2011 Final copy for proceedings 7 August 2011 FHIES 2011 29-30 August 2011 Organization = General Chairs * Peter Haddawy, UNU-IIST, Macao * Tom Maibaum, McMaster University, Canada Programme Chairs * Zhiming Liu, UNU-IIST, Macao * Alan Wassyng, McMaster University, Canada Organising Chair * Hao Wang, UNU-IIST, Macao Program Committee * Syed Mohamed Aljunid, UNU-IIGH * Sebastian Fischmeister, University of Waterloo, Canada * Peter Haddawy, UNU-IIST, Macao * Jozef Hooman, Embedded Systems Institute and Radboud University, Nijmegen, The Netherlands * Michaela Huhn, TU Clausthal, Germany * Mark Lawford, McMaster University, Canada * Insup Lee, University of Pennsylvania, USA * Martin Leucker, TU Munich, Germany * Wendy MacCaull, St. Francis Xavier University, Canada * Tom Maibaum, McMaster University, Canada * Dominique Mery, LORIA and Universite Henri Poincare Nancy 1, France * Jun Pang, University of Luxembourg, Luxembourg * David Robertson, University of Edinburgh, UK * Lutz Schröder, DFKI Bremen and University of Bremen, Germany * Jens H. Weber, University of Victoria, Canada * Liang Xiao, Hubei University of Technology, P.R.China -- -- PD Dr. Lutz Schröder Senior Researcher DFKI Bremen Safe and Secure Cognitive Systems Cartesium, Enrique-Schmidt-Str. 5 D-28359 Bremen phone: (+49) 421-218-64216 Fax: (+49) 421-218-9864216 mail: lutz.schroe...@dfki.de www.dfki.de/sks/staff/lschrode -- - Deutsches Forschungszentrum für Künstliche Intelligenz GmbH Firmensitz: Trippstadter Strasse 122, D-67663 Kaiserslautern Geschäftsführung: Prof. Dr. Dr. h.c. mult. Wolfgang Wahlster (Vorsitzender) Dr. Walter Olthoff Vorsitzender des Aufsichtsrats: Prof. Dr. h.c. Hans A. Aukes Amtsgericht Kaiserslautern, HRB 2313 -
[TYPES/announce] OSEMA 2011 Call for Papers
, Ontoprise, Germany. 8. Kristina Shea, Technische Universität München, Germany. 9. Oliver Eck, Department of Computer Science, HTWG Konstanz, Germany. 10. Parisa Ghoudous, University Claude Bernard Lyon I, France. 11. Richard Gil Herrera, University Simón Bolivar. Venezuela. 12. Sylvere Krima, National Institute of Standards and Technology (NIST), USA. 13. Yuh-Jen Chen, National Kaohsiung First University of Science and Technology, Taiwan. ORGANIZING COMMITTEE * Alexander García Castro, University of Bremen, Germany/University of Arkansas, USA. Email: alexgarc...@gmail.com * Lutz Schröder, German Research Center for Artificial Intelligence (DFKI). Email: lutz.schroe...@dfki.de * Carlos Toro, Vicomtech Research Centre / Donostia-San Sebastían, Spain. Email: ct...@vicomtech.org * Luis Enrique Ramos García, University of Bremen, Germany. Email: s_7dn...@uni-bremen.de -- -- PD Dr. Lutz Schröder Senior Researcher DFKI Bremen Safe and Secure Cognitive Systems Cartesium, Enrique-Schmidt-Str. 5 D-28359 Bremen phone: (+49) 421-218-64216 Fax: (+49) 421-218-9864216 mail: lutz.schroe...@dfki.de www.dfki.de/sks/staff/lschrode -- - Deutsches Forschungszentrum für Künstliche Intelligenz GmbH Firmensitz: Trippstadter Strasse 122, D-67663 Kaiserslautern Geschäftsführung: Prof. Dr. Dr. h.c. mult. Wolfgang Wahlster (Vorsitzender) Dr. Walter Olthoff Vorsitzender des Aufsichtsrats: Prof. Dr. h.c. Hans A. Aukes Amtsgericht Kaiserslautern, HRB 2313 -
[TYPES/announce] Post-doctoral position in coalgebraic logic at DFKI Bremen
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] [Thanks for distributing the job advertisement below.] The German Research Center for Artificial Intelligence (DFKI GmbH) is seeking a Postdoctoral Researcher for its Safe and Secure Cognitive Systems Lab in Bremen working in the area of security policies within the DFG-project GenMod2, which will start in February 2011. The project GenMod2 (Generic Algorithms in Modal and Hybrid Logics) is concerned with the further development of a coalgebraic generic framework for automatic deduction in various extensions of modal logic, including probabilistic, strategy-oriented, and non-monotonic logics. Applications of such logics are found on the one hand in various areas of knowledge representation, that is, in extensions of description logic, and on the other hand in the specification and verification of reactive systems. One of the goals of the project is to increase the scope and efficiency of the generic modal reasoner CoLoSS. We expect applicants to have experience in at least one of the following topics: Modal logic / description logic Automatic reasoning Coalgebra In the field of innovative software technologies, the German Research Center for Artificial Intelligence (DFKI) is the leading research institution in Germany, and in the international science community the DFKI ranks among the most important “Centers of Excellence” worldwide. The position is at the postdoctoral level; however, candidates without a PhD can be considered in case of exceptional qualification. In this case, the position offers the opportunity to work towards a PhD from the University of Bremen. The initial employment contract will run for two years. More information about the lab is available at http://www.dfki.de/web/research/sks The DFKI is an equal opportunities employer. Women are especially encouraged to apply. Handicapped applicants with equal qualification will be given preferential treatment. Applications should be sent to PD Dr. Lutz Schröder, DFKI, Enrique-Schmidt-Str. 5, 28359 Bremen, or via e-mail to lutz.schroe...@dfki.de. -- -- PD Dr. Lutz Schröder Senior Researcher DFKI Bremen Safe and Secure Cognitive Systems Cartesium, Enrique-Schmidt-Str. 5 D-28359 Bremen phone: (+49) 421-218-64216 Fax: (+49) 421-218-9864216 mail: lutz.schroe...@dfki.de www.dfki.de/sks/staff/lschrode -- - Deutsches Forschungszentrum für Künstliche Intelligenz GmbH Firmensitz: Trippstadter Strasse 122, D-67663 Kaiserslautern Geschäftsführung: Prof. Dr. Dr. h.c. mult. Wolfgang Wahlster (Vorsitzender) Dr. Walter Olthoff Vorsitzender des Aufsichtsrats: Prof. Dr. h.c. Hans A. Aukes Amtsgericht Kaiserslautern, HRB 2313 -
[TYPES/announce] Deadline Extension for SD'09 in Bordeaux
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Due to popular demand there will a deadline extension for the workshop Structures and Deduction 2009 in Bordeaux, July 20-24, 2009. New deadline for submission: Sunday, March 8, 2009 Further details can be found on the webpage http://www.lix.polytechnique.fr/~lutz/orgs/SD09.html Kind regards, Lutz Strassburger
[TYPES/announce] Last CfP (and Deadline Extension): Workshop SD09, Bordeaux, July 20-24, 2009
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] *** LAST CALL FOR PAPERS International Workshop Structures and Deduction (SD09) http://www.lix.polytechnique.fr/~lutz/orgs/SD09.html July 20 - 24, 2009 organized as part of the European Summer School on Logic, Language and Information ESSLLI 2009 http://esslli2009.labri.fr/ July 20 - 31, 2009 in Bordeaux *** DESCRIPTION OF THE WORKSHOP: The topic of this workshop is the application of algebraic, geometric, and combinatorial methods in proof theory. In traditional proof theory, research is focussed on syntax, but in recent years many researchers have proposed approaches to avoid syntactic bureaucracy in the presentation of proofs. Examples are proof nets, atomic flows, new deductive systems based on deep inference, and new algebraic semantics for proofs. These efforts have also led to new methods of proof normalisation and new results in proof complexity. Thus the workshop is relevant to a wide range of people. The list of topics includes among others: algebraic semantics of proofs, game semantics, proof nets, deep inference, tableaux systems, category theory, deduction modulo, cut elimination, complexity theory, etc. The goal of the workshop is twofold: first, to bring together researchers from various fields who share the interest in reducing the dependency of logic from low-level syntax, and second, to provide an opportunity for PhD students and researchers to present and discuss their work with colleagues who work in the broad subject areas that are represented at ESSLLI. The workshop is intended to be a sequel of the ICALP-workshop SD05 in Lisbon 2005 http://www.cs.bath.ac.uk/ag/w/sd05. SUBMISSION DETAILS: Contributions can be regular papers, but also work in progress, programmatic/position papers or tutorials. Submissions should be formatted with the LNCS LaTeX style, and should take between two and fifteen pages, to allow the committee to assess their merits with reasonable effort. This limit can be relaxed for the versions that will be presented at the workshop, depending on the total bulk of the accepted contributions. Please use the SD'09 submission page http://www.easychair.org/conferences/?conf=sd09, handled by the EasyChair conference system, to submit papers. The accepted papers will appear in the workshop proceedings published by ESSLLI. One author for each accepted paper must attend the workshop in order to present the paper. IMPORTANT DATES: Deadline for submissions: February 28, 2009 (extended) Notification of acceptance: April 15, 2009 Deadline for final versions: May 11, 2009 Workshop dates: July 20 - 24, 2009 WORKSHOP FORMAT: The workshop is part of ESSLLI and is open to all ESSLLI participants. It will consist of five 90-minute sessions held over five consecutive days in the first week of ESSLLI. There will be 2 or 3 slots for paper presentation and discussion per session. On the first day the workshop organizers will give an introduction to the topic. INVITED SPEAKER: Francois Lamarche (LORIA, Nancy) PROGRAM COMMITTEE: Lev Beklemishev (Moscow) Stefano Berardi (Torino) Agata Ciabattoni (Vienna) Alessio Guglielmi (Bath/Nancy) Martin Hyland (Cambridge) Grigori Mints (Stanford) Michel Parigot (Paris) Lutz Strassburger (Palaiseau) Kazushige Terui (Kyoto) ORGANIZERS: Michel Parigot (CNRS, Univ. Paris 7, France) Lutz Strassburger (INRIA Saclay-IdF, France) LOCAL ARRANGEMENTS: All workshop participants including the presenters will be required to register for ESSLLI. The registration fee for authors presenting a paper will correspond to the early student/workshop speaker registration fee. Moreover, a number of additional fee waiver grants will be made available by the ESSLLI local organizing committee on a competitive basis and workshop participants are eligible to apply for those. There will be no reimbursement for travel costs and accommodation. Workshop speakers who have difficulty in finding funding should contact the local organizing committee to ask for the possibilities for a grant. FURTHER INFORMATION: About the workshop: http://www.lix.polytechnique.fr/~lutz/orgs/SD09.html About ESSLLI: http://esslli2009.labri.fr/
[TYPES/announce] Second CfP: Structures and Deduction, Bordeaux, July 20-24, 2009
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] *** SECOND CALL FOR PAPERS International Workshop Structures and Deduction (SD09) http://www.lix.polytechnique.fr/~lutz/orgs/SD09.html July 20 - 24, 2009 organized as part of the European Summer School on Logic, Language and Information ESSLLI 2009 http://esslli2009.labri.fr/ July 20 - 31, 2009 in Bordeaux *** ORGANIZERS: Michel Parigot (CNRS, Univ. Paris 7, France) Lutz Strassburger (INRIA Saclay-IdF, France) DESCRIPTION OF THE WORKSHOP: The topic of this workshop is the application of algebraic, geometric, and combinatorial methods in proof theory. In recent years many researchers have proposed approaches to understand and reduce syntactic bureaucracy in the presentation of proofs. Examples are proof nets, atomic flows, new deductive systems based on deep inference, and new algebraic semantics for proofs. These efforts have also led to new methods of proof normalisation and new results in proof complexity. The workshop is relevant to a wide range of people. The list of topics includes among others: algebraic semantics of proofs, game semantics, proof nets, deep inference, tableaux systems, category theory, deduction modulo, cut elimination, complexity theory, etc. The goal of the workshop is twofold: first, to bring together researchers from various fields who share the interest of understanding and dealing with structural properties of proofs and second, to provide an opportunity for PhD students and researchers to present and discuss their work with colleagues who work in the broad subject areas that are represented at ESSLLI. The workshop is intended to be a sequel of the ICALP-workshop SD05 in Lisbon 2005 http://www.cs.bath.ac.uk/ag/w/sd05. SUBMISSION DETAILS: Contributions can be regular papers, but also work in progress, programmatic/position papers or tutorials. Submissions should be formatted with the LNCS LaTeX style, take between two and fifteen pages and allow the committee to assess their merits with reasonable effort. The length limit can be relaxed for the versions that will be presented at the workshop, depending on the total bulk of the accepted contributions. Please use the SD'09 submission page http://www.easychair.org/conferences/?conf=sd09 handled by the EasyChair conference system, to submit papers. The accepted papers will appear in the workshop proceedings published by ESSLLI. One author of each accepted paper must attend the workshop in order to present the paper. WORKSHOP FORMAT: The workshop is part of ESSLLI and is open to all ESSLLI participants. It will consist of five 90-minute sessions held over five consecutive days in the first week of ESSLLI. There will be 2 or 3 slots for paper presentation and discussion per session. On the first day the workshop organizers will give an introduction to the topic. INVITED SPEAKER: François Lamarche (LORIA, Nancy) PROGRAM COMMITTEE: Lev Beklemishev (Moscow) Stefano Berardi (Torino) Agata Ciabattoni (Vienna) Alessio Guglielmi (Bath/Nancy) Martin Hyland (Cambridge) Grigori Mints (Stanford) Michel Parigot (Paris) Lutz Strassburger (Palaiseau) Kazushige Terui (Kyoto) IMPORTANT DATES: Deadline for submissions: February 15, 2009 Notification of acceptance: April 15, 2009 Deadline for final versions: May 11, 2009 Workshop dates: July 20 - 24, 2009 LOCAL ARRANGEMENTS: All workshop participants including the presenters will be required to register for ESSLLI. The registration fee for authors presenting a paper will correspond to the early student/workshop speaker registration fee. Moreover, a number of additional fee waiver grants will be made available by the ESSLLI local organizing committee on a competitive basis and workshop participants are eligible to apply for those. There will be no reimbursement for travel costs and accommodation. Workshop speakers who have difficulty in finding funding should contact the local organizing committee to ask for the possibilities for a grant. FURTHER INFORMATION: About the workshop: http://www.lix.polytechnique.fr/~lutz/orgs/SD09.html About ESSLLI: http://esslli2009.labri.fr/
[TYPES/announce] CfP Workshop Structures and Deduction, Bordeaux, July 20-24, 2009
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] *** FIRST CALL FOR PAPERS International Workshop Structures and Deduction (SD09) http://www.lix.polytechnique.fr/~lutz/orgs/SD09.html July 20 - 24, 2009 organized as part of the European Summer School on Logic, Language and Information ESSLLI 2009 http://esslli2009.labri.fr/ July 20 - 31, 2009 in Bordeaux *** ORGANIZERS: Michel Parigot (CNRS, Univ. Paris 7, France) Lutz Strassburger (INRIA Saclay-IdF, France) DESCRIPTION OF THE WORKSHOP: The topic of this workshop is the application of algebraic, geometric, and combinatorial methods in proof theory. In recent years many researchers have proposed approaches to understand and reduce syntactic bureaucracy in the presentation of proofs. Examples are proof nets, atomic flows, new deductive systems based on deep inference, and new algebraic semantics for proofs. These efforts have also led to new methods of proof normalisation and new results in proof complexity. The workshop is relevant to a wide range of people. The list of topics includes among others: algebraic semantics of proofs, game semantics, proof nets, deep inference, tableaux systems, category theory, deduction modulo, cut elimination, complexity theory, etc. The goal of the workshop is twofold: first, to bring together researchers from various fields who share the interest of understanding and dealing with structural properties of proofs and second, to provide an opportunity for PhD students and researchers to present and discuss their work with colleagues who work in the broad subject areas that are represented at ESSLLI. The workshop is intended to be a sequel of the ICALP-workshop SD05 in Lisbon 2005 http://www.cs.bath.ac.uk/ag/w/sd05. SUBMISSION DETAILS: Contributions can be regular papers, but also work in progress, programmatic/position papers or tutorials. Submissions should be formatted with the LNCS LaTeX style, take between two and fifteen pages and allow the committee to assess their merits with reasonable effort. The length limit can be relaxed for the versions that will be presented at the workshop, depending on the total bulk of the accepted contributions. The accepted papers will appear in the workshop proceedings published by ESSLLI. One author of each accepted paper must attend the workshop in order to present the paper. WORKSHOP FORMAT: The workshop is part of ESSLLI and is open to all ESSLLI participants. It will consist of five 90-minute sessions held over five consecutive days in the first week of ESSLLI. There will be 2 or 3 slots for paper presentation and discussion per session. On the first day the workshop organizers will give an introduction to the topic. INVITED SPEAKERS: tba PROGRAM COMMITTEE: Lev Beklemishev (Moscow) Stefano Berardi (Torino) Agata Ciabattoni (Vienna) Alessio Guglielmi (Bath/Nancy) Martin Hyland (Cambridge) Grigori Mints (Stanford) Michel Parigot (Paris) Lutz Strassburger (Palaiseau) Kazushige Terui (Kyoto) IMPORTANT DATES: Deadline for submissions: February 15, 2009 Notification of acceptance: April 15, 2009 Deadline for final versions: May 11, 2009 Workshop dates: July 20 - 24, 2009 LOCAL ARRANGEMENTS: All workshop participants including the presenters will be required to register for ESSLLI. The registration fee for authors presenting a paper will correspond to the early student/workshop speaker registration fee. Moreover, a number of additional fee waiver grants will be made available by the ESSLLI local organizing committee on a competitive basis and workshop participants are eligible to apply for those. There will be no reimbursement for travel costs and accommodation. Workshop speakers who have difficulty in finding funding should contact the local organizing committee to ask for the possibilities for a grant. FURTHER INFORMATION: About the workshop: http://www.lix.polytechnique.fr/~lutz/orgs/SD09.html About ESSLLI: http://esslli2009.labri.fr/
