----------------------------------------------------------------------
----------------------------------------------------------------------
                 Final Call for Papers - Deadline Extended
----------------------------------------------------------------------
----------------------------------------------------------------------

                       International Workshop on
                Classical Logic and Computation (CL&C'14)
                http://vsl2014.at/meetings/CLC-index.html   
                            July, 13 2014
                           Vienna, Austria


CL&C'14 is a satellite workshop of CSL-LICS'14

IMPORTANT DATES
Deadline for abstract (extended):     April 12, 2014
Deadline for submission (extended):   April 16, 2014
Notification of acceptance:           June   6, 2014
Final version due:                    June  25, 2014
Workshop date:                        July  13, 2014

INTRODUCTION

CL&C'14 is the fifth of a conference series on Classical Logic and
Computation. It intends to cover all work aiming to explore
computational aspects of classical logic and classical proofs in
mathematics.

This year CL&C will be held as satellite workshop of the joint
meeting of CSL and LICS at the

            Vienna Summer of Logic (http://www.vsl2014.at)

CL&C is focused on the interplay between, on one side, the
exploration of the computational content of classical mathematical
proofs, and on the other side, the languages and the semantical
models proposed in computer science for this task: continuations,
game models, denotational models, learning models and so forth.
The scientific aim of this workshop is to bring together researchers
from both proof theory and computer science and to exchange ideas.

SCOPE OF CL&C

This workshop aims to support a fruitful exchange of ideas between
the various lines of research on Classical Logic and Computation.
Topics of interest include, but are not limited to:

- versions of lambda calculi adapted to represent classical logic;
- design of programming languages inspired by classical logic;
- cut-elimination for classical systems;
- proof representation for classical logic;
- translations of classical to intuitionistic proofs;
- constructive interpretation of non-constructive principles;
- witness extraction from classical proofs;
- constructive semantics for classical logic (e.g. game semantics);
- case studies (for any of the previous points).

INVITED SPEAKER

  * Alexandre Miquel (Paris 7 University / Universidad de la Republica Uruguay)

SUBMISSION AND PUBLICATION

We have room for informal talks, too. Therefore participants are
encouraged to present both: work in progress, overviews of more
extensive work, and programmatic / position papers, and completed
projects.

All submitted papers will be reviewed to normal standards. The PC
recognises two kinds of papers: it will distinguish between accepted
(full) papers that contain unpublished results not submitted
elsewhere, to be published on EPTCS, and presentations of (short)
papers about work in progress.

The accepted papers will be published in the open access electronic
journal EPTCS.

In order to make a submission:
- Format your file using the EPTCS (http://style.eptcs.org/)
   guidelines; there is a 15 page limit.
- Use the submission instructions at

   https://www.easychair.org/conferences/?conf=clc14

PROGRAMME COMMITTEE

* Jeremy Avigad (Carnegie Mellon)
* José Carlos Espírito Santo (Minho)
* Martin Escardo (Birmingham)
* Monika Seisenberger (Swansea)
* Paulo Oliva (Queen Mary University of London) - chair
* Stefano Berardi (University of Turin)
* Steffen van Bakel (Imperial College London)
* Thomas Streicher (Darmstadt University)

CONTACT PERSON

Paulo Oliva<p.ol...@qmul.ac.uk>
--
Paulo Oliva
Royal Society University Research Fellow
Queen Mary University of London
London E1 4FZ
+44 (0) 207 882 5255
http://www.dcs.qmul.ac.uk/~pbo





------------------------------------------------------------------------------
_______________________________________________
hol-info mailing list
hol-info@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/hol-info

Reply via email to