[ The Types Forum (announcements only),
http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]
CALL FOR CONTRIBUTIONS:
CCC 2025:
Continuity, Computability, Constructivity – From Logic to Algorithms
Swansea, Wales, UK, September 1-3, 2025
Dedicated to Norbert Muller on the occasion of his retirement.
https://urldefense.com/v3/__https://swansea-theory.github.io/conferences/CCC2025/index.html__;!!IBzWLUs!RNrvVA3dzLbbt4_MYvB1p6qcRdcGTeyJg2jkhXSP-pIstPeRA3br5mN9hmF_oz8-JWU1g6oq8hqHtCAWTvndNFtoXWVAV0_t7VNAVSswdD8z$
Submissions: Please submit an extended abstract (2 pages) by 21 July 2025.
===========================================
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 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. Previous workshops have been held in
Cologne 2009, Trier 2012, Gregynog 2013, Ljubljana 2014, Kochel near Munich
2015, Nancy 2017, Faro 2018, Ljubljana 2019, Faro 2020, Birmingham 2021, Padova
2022, Kyoto 2023, Nice 2024.
==========================================
Invited Speakers:
Anuj Dawar (Cambridge)
Milly Maietti (Padova)
Cecilia Pradic (Swansea)
Nobuko Yoshida (Oxford)
With further speakers to be announced.
==========================================
Contributions:
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
Deadline for Submissions: 21 July 2025 (AoE)
==========================================
Steering Committee:
* Ulrich Berger (Swansea University, UK)
* Akitoshi Kawamura (Kyoto University, Japan)
* Norbert Müller (University of Trier, Germany)
* Svetlana Selivanova (Novosibirsk, Russia)
* Dieter Spreen (University of Siegen, Germany)
* Holger Thies (Kyoto University, Japan)
* Linda Westrick (Penn State University, USA)
* Martin Ziegler (KAIST University, South Korea)
Programme Committee:
* Olivier Bournez (Nice)
* Peter Collins (Maastricht)
* Daniel Graça (Algarve)
* Takayuki Kihara (Nagoya)
* Olga Petrovska (Swansea)
* Anton Setzer (Swansea)
* Dieter Spreen (Siegen)
* Mukesh Tiwari (Swansea)
* Martin Ziegler (KAIST)
Organizing Committee:
* Ulrich Berger (Swansea)
* Olga Petrovska (Swansea)
* Monika Seisenberger (Swansea)
* Anton Setzer (Swansea)
* Mukesh Tiwari (Swansea)
In case of questions please email [email protected] or
[email protected]
All welcome!
Ulrich, Olga, Anton, Mukesh, and Monika
--
Department of Computer Science
School of Mathematics and Computer Science
Swansea University
