[TYPES/announce] Logic and Computational Complexity (LCC 2016) - 1st CFP

Clément Aubert (CNRS) Clement.Aubert at math.cnrs.fr
Sun Apr 3 15:30:25 EDT 2016

(Apologies for multiple copies due to cross-posting.
  Please forward to colleagues who might be interested.
  PDF version of the CFP at http://lcc2016.cs.unibo.it/CFP.pdf )

                         First Call for Papers
                               LCC 2016

                   17th International Workshop on
                 Logic and Computational Complexity
                September 2-3, 2016, Marseille, France
                     collocated with CSL 2016

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 
programme will consist of invited lectures as well as contributed talks 
selected by the Programme Committee.


  * submission     June 17th, 2016
  * notification   July 4th, 2016
  * workshop       September 2nd-3rd, 2016


  Ugo dal Lago (Università degli Studi di Bologna)
  Ian Pratt-Hartmann (University of Manchester)


  Anupam Das (Ecole Normale Supérieure de Lyon)
  Hugo Férée (Technische Universität Darmstadt)
  Yevgeny Kazakov (Ulm University )
  Emanuel Kieroński (Wrocław University)


We 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 
Programme Committee will check relevance and may provide additional 

Submissions must be in English and in the form of an abstract of about 
3-4 pages.  All submissions should be made through Easychair at:



  Clément Aubert (Appalachian State University)
  Marc Bagnol (University of Ottawa)
  Stéphane Demri (CNRS and ENS de Cachan)
  Agi Kurucz (King's College, London)
  Olivier Laurent (CNRS and ENS de Lyon)
  Yavor Nenov (University of Oxford)
  Aleksy Schubert (University of Warsaw)
  Jakob Grue Simonsen (University of Copenhagen)
  Lidia Tendera (University of Opole)

Belk Hall 312F, Computer Science Department — Appalachian State 
University — Boone, NC, USA
AubertC at appstate.edu <mailto:aubertc at appstate.edu>
https://cs.appstate.edu/~aubertc/ <https://cs.appstate.edu/%7Eaubertc/> 
(en) // https://lacl.fr/~caubert/ <https://lacl.fr/%7Ecaubert/> (fr)
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20160403/f1e57ed1/attachment.html>

More information about the Types-announce mailing list