[isabelle] FSCD 2017 - Last Call for Papers (ABSTRACT DEADLINE THIS WEEK)
- To: cl-isabelle-users at lists.cam.ac.uk, types-announce at lists.seas.upenn.edu, rewriting at ens-lyon.fr, ProofTheory at Lists.Bath.Ac.UK, appsem at lists.tcs.ifi.lmu.de, coq-club at inria.fr, caml-list at inria.fr, termtools at lists.lri.fr, cade at itu.dk, concurrency at listserver.tue.nl, categories at mta.ca, finite-model-theory at lists.rwth-aachen.de, lfcs-interest at inf.ed.ac.uk, linear at cs.stanford.edu, GAMES at lists.rwth-aachen.de, prog-lang at diku.dk, theorem-provers at ai.mit.edu, theory-logic at CS.CMU.EDU, agda at lists.chalmers.se, asl at vassar.edu, las-lics at lists.tu-berlin.de, types at lists.chalmers.se, logic at math.uni-bonn.de
- Subject: [isabelle] FSCD 2017 - Last Call for Papers (ABSTRACT DEADLINE THIS WEEK)
- From: Sandra Alves <sandra at dcc.fc.up.pt>
- Date: Wed, 5 Apr 2017 08:48:50 +0100
*** Apologies for multiple copies, please redistribute ***
CALL FOR PAPERS
Second International Conference on
Formal Structures for Computation and Deduction (FSCD'17)
4 -- 7 September 2017, Oxford, UK
(in-cooperation with the ACM SIGLOG and SIGPLAN and co-located with ICFP 2017)
FSCD (http://fscdconference.org/ <http://fscdconference.org/>) covers all aspects of formal
structures for computation and deduction from theoretical foundations
to applications. Building on two communities, RTA (Rewriting
Techniques and Applications) and TLCA (Typed Lambda Calculi and
Applications), FSCD embraces their core topics and broadens their
scope to closely related areas in logics, proof theory and new
emerging models of computation such as quantum computing or homotopy
IMPORTANT DATES All deadlines are midnight anywhere-on-earth (AoE) and
are firm; late submissions will not be considered.
Abstract Deadline: 7 April 2017
Submission Deadline: 14 April 2017
Rebuttal: 29--31 May 2017
Notification: 14 June 2017
Camera-Ready: 7 July 2017
Suggested, but not exclusive, list of topics for submission are:
1. Calculi: Lambda calculus * Concurrent calculi * Logics * Rewriting
systems * Proof theory * Type theory and logical frameworks
2. Methods in Computation and Deduction: Type systems * Induction and
coinduction * Matching, unification, completion, and orderings *
Strategies * Tree automata * Model checking * Proof search and
theorem proving * Constraint solving and decision procedures
3. Semantics: Operational semantics * Abstract machines * Game
Semantics * Domain theory and categorical models * Quantitative
4. Algorithmic Analysis and Transformations of Formal Systems: Type
Inference and type checking * Abstract Interpretation * Complexity
analysis and implicit computational complexity * Checking
termination, confluence, derivational complexity and related
properties * Symbolic computation
5. Tools and Applications: Programming and proof environments *
Verification tools * Libraries for proof assistants and interactive
theorem provers * Case studies in proof assistants and interactive
theorem provers * Certification
PUBLICATION The proceedings will be published as an electronic volume
in the Leibniz International Proceedings in Informatics (LIPIcs) of
Schloss Dagstuhl. All LIPIcs proceedings are open access.
SUBMISSION GUIDELINES Submissions can be made in two categories.
Regular research papers are limited to 15 pages and must present
original research which is unpublished and not submitted
elsewhere. System descriptions are limited to 10 pages and must
describe a working system which has not been published or submitted
elsewhere. Submissions must be formatted using the LIPIcs style files
and submitted via EasyChair. Complete instructions on submitting a
paper can be found on the conference web site.
SPECIAL ISSUES Full versions of several accepted papers, to be
selected by the program committee, will be invited for submission to a
special issue of Logical Methods in Computer Science.
BEST PAPER AWARD BY JUNIOR RESEARCHERS The program committee will
consider declaring this award to a paper in which all authors are
junior researchers: a junior researcher is a person who is either a
student or whose PhD award date is less than three years from the
first day of the meeting.
PROGRAM COMMITTEE CHAIR
Dale Miller, Inria Saclay & LIX <fscd17 at easychair.org <mailto:fscd17 at easychair.org>>
Andreas Abel, Gothenburg Univ.
Elvira Albert, Complutense Madrid
Maria Alpuente, TU Valencia
Takahito Aoto, Niigata Univ.
Zena Ariola, Univ. Oregon
Federico Aschieri, TU Wien
Stefano Berardi, Univ. Turin
Lars Birkedal, Aarhus Univ.
Filippo Bonchi, CNRS, ENS Lyon
Pierre Clairambault, CNRS, ENS Lyon
Ugo Dal Lago, Univ. Bologna
Herman Geuvers, Radboud Univ.
Silvia Ghilezan, Univ. Novi Sad
Juergen Giesl, RWTH Aachen
Hugo Herbelin, Inria Paris
Jan Hoffmann, Carnegie Mellon
Deepak Kapur, Univ. New Mexico
Paul Blain Levy, Univ. Birmingham
Paulo Oliva, QMUL, London
Vincent van Oostrom, Univ. Innsbruck
Daniela Petrisan, LIAFA, Paris
Femke van Raamsdonk, VU Univ. Amsterdam
Grigore Rosu, Univ. Illinois
Albert Rubio, UPC-BarcelonaTech
Paula Severi, Univ. Leicester
Bas Spitters, Aarhus Univ.
Aaron Stump, Univ. Iowa
Kazushige Terui, Kyoto Univ.
Rene Thiemann, Univ. Innsbruck
Sophie Tison, Lille Univ.
Sam Staton, Univ. of Oxford
Jamie Vicary, Univ. of Oxford
Sandra Alves, Univ. of Porto
FSCD STEERING COMMITTEE T. Altenkirch (Univ. Nottingham), S. Alves
(Univ. Porto), G. Dowek, (Inria), S. Escobar (Univ. Politecnica de
Valencia), M. Fernandez (King's College London), H. Herbelin (Inria),
D. Kesner (Univ. Paris), N. Kobayashi (Univ. Tokyo), L. Ong (Chair,
Univ. Oxford), B. Pientka (McGill Univ.), R. Thiemann (Univ. Innsbruck).
This archive was generated by a fusion of
Pipermail (Mailman edition) and