[TYPES/announce] Workshop on Logic and Computational Complexity (LCC '10)

[Ronchi Della Rocca Simona]

[ The Types Forum (announcements only), 
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]


=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=
=



call
 for papers

 11th  
International Workshop on Logic and Computational Complexity


LCC 
'10



http://web.comlab.ox.ac.uk/people/stephan.kreutzer/lcc10/index.html

Edinburgh 
, July 10, 2010


  affiliated 
 to LICS 201


 ATTENTION 
: DEADLINE CHANGED!


= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 
= 



The Eleventh International Workshop on Logic and Computational  
Complexity (LCC'10) will be held in Edinburgh on 10th July 2010, as an  
affiliated meeting of Logic in Computer Science (LiCS) 2010 as part of  
the 2010 Federated Logic Conference (FLoC).


LCC meetings are aimed at the foundational interconnections between  
logic and computational complexity, as present, for example, in  
implicit computational complexity (descriptive and type-theoretic  
methods); deductive formalisms as they relate to complexity (e.g.  
ramification, weak comprehension, bounded arithmetic, linear logic and  
resource logics); complexity aspects of finite model theory and  
databases; complexity-mindful program derivation and verification;  
computational complexity at higher type; and proof complexity.


The LCC'10 program consists of invited lectures as well as contributed  
papers selected by the program committee.


Invited Speakers

There will be two invited 1-hour lectures.
Ugo Dal Lago, Bologna
Albert Atserias, Barcelona


Submissions

Submissions must be in English and in the form of abstracts of about  
3-4 pages. Submissions published elsewhere or which are simultaneously  
being submitted to another conference or workshop are welcome, as well  
as work in progress or not yet completely developed ideas. There will  
be no proceedings for this edition of LCC.


LCC 10 uses the EasyChair system for managing the submission process.  
Submissions must be made electronically using the easychair system at http://www.easychair.org/conferences/?conf=lcc10 
.


Important dates

Submission deadline:
Revised earlier deadline: 18 April 2010, 1am CET (GMT +1). The  
submission server will remain open till approximately 7am CET.

Author notification:
Beginning of May 2010







Program Committee

Andrei Bulatov (Vancouver)
Phokion Kolaitis (Santa Cruz)
Jan Krajicek (Prague)
Stephan Kreutzer (Oxford, co-chair)
Olivier Laurent (Lyon)
Jean Yves Moyen (Paris 13)
Damian Niwinski (Warsaw)
Simona Ronchi Della Rocca (Torino, co-chair)

Steering Committee

Michael Benedikt (Oxford) (Co-chair)
Robert Constable (Cornell)
Anuj Dawar (Cambridge)
Fernando Ferreira (Lisbon)
Martin Hofmann (U Munich)
Neil Immerman (U Mass. Amherst)
Neil Jones (Copenhagen)
Bruce Kapron (U Victoria)
Daniel Leivant (Indiana U)  (Co-chair)
Jean-Yves Marion (LORIA Nancy)
Luke Ong (Oxford)
Martin Otto (Darmstadt)
James Royer (Syracuse)
Helmut Schwichtenberg (U Munich)
Pawel Urzyczyn (Warsaw)

_
Simona Ronchi Della Rocca
full professor of
Foundations of Computer Science
Dipartimento di Informatica
Università di Torino
c. Svizzera 185, 10149 Torino

e-mail: ron...@di.unito.it
phone:+39-011-6706734
fax: +39-011-751603
mobile: +39-320-4205121

[TYPES/announce] DICE 2013 call for papers

[Ronchi Della Rocca Simona]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

   DICE 2013
§§

  (DEVELOPMENTS IN IMPLICIT COMPUTATIONAL 
COMPLEXITY)
  
http://dice2013.di.unito.it/index.html

 Roma, March 16,17 
2013
  satellite event of 
ETAPS 2013
 
   call for 
papers


IMPORTANT DATES:
submission:January 10, 2013
notification: January 25, 2013
final version due:February 14, 2013

INVITED:

‣ Jean-Yves Marion (Loria - INPL Nancy)
‣ Marko van Eekelen (Open University - Radboud University Nijmegen)
‣ Paul-André Melliès (PPS, Paris)


SCOPE:

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,
- programming languages for complexity-bounded computation,
- application of implicit complexity to other programming paradigms  
  (e.g. imperative or object-oriented languages).


SUBMISSIONS:

Authors are invited to submit an extended abstract, up to 5 pages.
Abstracts should be written in English, in the form of a PDF file uploaded to 
DICE 13 page at Easychair
https://www.easychair.org/account/signin.cgi?conf=dice2013.
Submissions of abstracts by PC members are allowed and encouraged.
 
We plan on not having pre-proceedings; an open call for post-proceedings, 
hopefully as special issue of a journal, will follow.

PROGRAM COMMITTEE:

‣ Roberto Amadio (Paris-Diderot)
‣ Harry Mairson (Brandeis)
‣ Virgile Mogbil (Paris 13)
‣ Simona Ronchi Della Rocca (Torino) (Chair)
‣ Luca Roversi (Torino)
‣ Olha Shkaravska (Nijmegen)
‣ Ulrich Schöpp (LMU)
‣ Aleksy Shubert (Warsaw)
‣ Jakob G. Simonsen (DIKU)


STEERING COMMITTEE:

‣ Patrick Baillot (ENS Lyon, CNRS)
‣ Ugo Dal Lago (Università degli Studi di Bologna)
‣ Martin Hofmann (Ludwig-Maximilians-Universität München)
‣ Jean-Yves Marion (Loria - INPL Nancy)
‣ Simona Ronchi Della Rocca (Università degli Studi di Torino))

[TYPES/announce] CSL'13 call for participation

[Ronchi Della Rocca Simona]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

__
 
 CSL 2013
 COMPUTER SCIENCE LOGIC 2013
  Torino, September 2-5 2013

  http://csl13.di.unito.it/

call-for-participation

REGISTRATION IS NOW OPEN
___

AIM AND SCOPE
Computer Science Logic (CSL) is the annual conference of the European 
Association for Computer Science Logic (EACSL).
The conference is intended for computer scientists whose research activities 
involve logic, as well as for logicians working on
issues significant for computer science.

LOCATION
The 22nd EACSL Annual Conference on Computer Science Logic will be held at 
Museo di Scienze Naturali in Torino from
Monday 2nd through Thursday 5th of September 2013.

LIST OF TOPICS OF INTEREST (NON EXHAUSTIVE)
automated deduction and interactive theorem proving, constructive mathematics 
and type theory, equational logic and term rewriting,
automata and games, game semantics, modal and temporal logic, model checking, 
decision procedures, logical aspects of computational
complexity, computational proof theory, bounded arithmetic and propositional 
proof complexity, logic programming and constraints, lambda
calculus and combinatory logic, domain theory, categorical logic and 
topological semantics, database theory, specification, extraction and
transformation of programs, logical aspects of quantum computing, logical 
foundations of programming paradigms, verification and program
analysis, linear logic, higher-order logic, non-monotonic reasoning.

IMPORTANT DEADLINES FOR REGISTRATION
Standard registration: July, 18th 2013 (extended)
Late registration: August 25th 2013
On-site registration: --


SATELLITE EVENTS
The 9th  International Workshop on Fixed Points in Computer Science (FICS'13) 
will be held on 1st of September 2013 as a satellite event of CSL'13.
The 14th International Workshop on Logic and Computational Complexity (LCC'13) 
will be held on 6th of September 2013 as a satellite event of CSL'13.
An international summer school on “Linear logic and related topics” will be 
held from 28th through 31st of August 2013 as a satellite event of CSL'13.
Details are in the web site of CSL'13.

PROGRAM COMMITTEE
Zena Ariola (University of Oregon)
Arnon Avron (Tel-Aviv University)
Roberto Bagnara (University of Parma, and BUGSENG srl)
Christel Baier (Technical University of Dresden)
Marc Bezem (University of Bergen)
Paola Bruscoli (University of Bath, Computer Science Department)
Agata Ciabattoni (TU Wien)
Thierry Coquand (Chalmers University)
Ugo Dal Lago (Università di Bologna)
Valeria De Paiva (Nuance Communications)
Reinhard Kahle (CENTRIA and DM, UNL, Portugal)
Stephan Kreutzer (Technical University Berlin)
Olivier Laurent (CNRS - ENS Lyon)
Carsten Lutz (Universität Bremen)
Jean-Yves Marion (Université de Lorraine, LORIA)
Damian Niwinski (Warsaw University)
Frank Pfenning (Carnegie Mellon University)
Elaine Pimentel (UFMG)
Ruzica Piskac (Max Planck Institute for Software Systems (MPI-SWS))
Simona Ronchi Della Rocca CHAIR (Università di Torino)
Jan Rutten (CWI)
Helmut Schwichtenberg (LMU Munich)
Phil Scott (Dept. of Math  Stats, U. Ottawa)
Peter Selinger (Dalhousie University)
Makoto Tatsuta (National Institute of Informatics)
Tachio Terauchi (Nagoya University)

ORGANIZING COMMITTEE
Erika De Benedetti (Dipartimento di Informatica, Torino)
Paola Giannini (Dipartimento di Scienze e Innovazione Tecnologica (DISIT), 
Alessandria)
Mauro Piccolo (Dipartimento di Informatica, Torino)
Luca Padovani (Dipartimento di Informatica, Torino)
Luca Paolini (Dipartimento di Informatica, Torino)
Simona Ronchi Della Rocca (Dipartimento di Informatica, Torino)
Luca Roversi (Dipartimento di Informatica, Torino)
Angelo Troina (Dipartimento di Informatica, Torino)
_
Simona Ronchi Della Rocca
full professor of
Foundations of Computer Science
Dipartimento di Informatica
Università di Torino
c. Svizzera 185, 10149 Torino

e-mail: ron...@di.unito.it
phone:+39-011-6706734
fax: +39-011-751603
mobile: +39-320-4205121

[TYPES/announce] Conference in honour of Corrado Böhm

[Ronchi Della Rocca Simona]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

The Accademia delle Scienze di Torino organizes a 

Conference in honour of Corrado Böhm

in occasion of the centenary of his birth.

Date: May 24, 2023.

For further information:

https://urldefense.com/v3/__https://www.accademiadellescienze.it/iniziative/2023/ricordando-corrado-bohm__;!!IBzWLUs!QnOVWluTadzMVtJz0xG3Brg4IHqOI7m8OYyFwjhRjOCRa_8OUwMUFcTpdllSGCsB1BVbcwDescXmQZK_DATCf_zTfAVL51pN$
  


_
Simona Ronchi Della Rocca
Professor Emerita 
of Theoretical Computer Science
Università di Torino
Accademia delle Scienze di Torino