[TYPES/announce] CCC2022 -September 19-23, 2022- 2nd call for contributions

[Maria Emilia Maietti]

2nd CALL FOR  CONTRIBUTIONS:



CCC 2022: Continuity, Computability, Constructivity – From Logic to 
Algorithms

                  Dedicated to Dieter Spreen on the Occasion of his 75th 
Birthday


Department of Mathematics and   ONLINE
Padova, Italy, September 19-23, 2022


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

Submission link https://urldefense.com/v3/__https://easychair.org/conferences/?conf=ccc20220__;!!IBzWLUs!RkpnVTKqFPJOyY9V4AGofmcWJ9LPYv0t1YoPd0_yTJvMwtq6JgUMSVZS6V2se-ER8EcwWZ5Ldknt-nE5R9VkJjGIMHJ25AVJIAo$ 

Submission deadline:    August 16, 2022

Nofication of acceptance:   August 26, 2022

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


CCC is a workshop series that brings together researchers applying 
logical methods to the development of algorithms, with a particular 
focus on computation with infinite data, where issues of continuity, 
computability and constructivity play major roles. Specific topics 
include exact real number computation, computable analysis, effective 
descriptive set theory, constructive analysis and topology, and related 
areas. The overall aim is to apply logical methods in these disciplines 
to provide a sound foundation for obtaining exact and provably correct 
algorithms for computations with real numbers and other continuous data, 
which are of increasing importance in safety-critical applications and 
scientific computation.

Participation is welcome in person or online.

Previous workshops have been held in Cologne 2009, Trier 2012, Gregynog 
2013, Ljubljana 2014, Kochel 2015, Nancy 2017, Faro 2018, Ljubljana 
2019, Faro 2020 (online), Birmingham 2021 (online).

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

Submission Guidelines

The workshop invites all contributions relating to computation where 
issues of continuity, computability and constructivity play major roles. 
Specific areas of interest include:

     Exact real number computation
     Correctness of algorithms on infinite data
     Computable analysis
     Complexity of real numbers, real-valued functions, etc.
     Effective descriptive set theory
     Domain theory
     Constructive analysis and topology
     Constructive foundations
     Category-theoretic approaches to computation on infinite data
     Weihrauch degrees
     Other related areas.

Extended abstracts (1-2 pages) should be submitted in pdf format.

A post-proceedings volume will be published in the open-access journal 
Logical Methods in Computer Science.


===============================================
Tutorial speakers:

     Alexander Miquel (Universidad de La Republica, Uruguay)
     Linda Westrick (Penn State University, USA)

Invited speakers:

     Mikołaj Bojańczyk (Warsaw, Poland)
     Tatsuji Kawai (JAIST, Japan)
     Michael Rathjen (Leeds, UK)
     Andreas Rauh (Oldenburg, Germany)

========================================================
Program Committee

     Pieter Collins (Maastricht, Netherlands)
     Achim Jung (Birmingham, UK)
     Maria Emilia Maietti (Padova, Italy)  (chair)
     Arno Pauly (Swansea, UK)
     Alex Simpson (Ljubljana, Slovenia)
     Holger Thies (Kyoto, Japan)
     Chuangjie Xu (Munich, Germany)
     Ning Zhong (Cincinnati, USA)
     Martin Ziegler (KAIST, Republic of Korea)


Organizing committee

     Francesco Ciraulo (Padova, Italy)
     Maria Emilia Maietti (Padova, Italy)
     Samuele Maschio (Padova, Italy)
     Pietro Sabelli (Padova, Italy)

Contact

All questions about submissions should be emailed to ccc22 at math.unipd.it