Logic List Mailing Archive

CfP: CCC 2026 – Continuity/ Computability/ Constructivity: From Logic to Algorithms, 27–30 May 2026, Kyoto (Japan)

Call For Contributions

CCC 2026: Continuity, Computability, Constructivity  From Logic to Algorithms

Dedicated to Ulrich Berger on the Occasion of his 70th Birthday and to the Memory of Willem Fouch

Kyoto, Japan, May 27-30, 2026

Participation is open both in presence and online.

Conference Website: https://www.i.h.kyoto-u.ac.jp/ccc2026/
==============================================

Submission link: https://easychair.org/conferences/?conf=ccc2026

Submission deadline: March 31, 2026

Notification of acceptance: April 15, 2026

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

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

Topics: constructive mathematics, constructive analysis, computable analysis, exact real number computation

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.


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), Padua 2022, Kyoto 2023, Nice 2024, Swansea 2025.

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

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.

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

Tba

Invited speakers:

Tba

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

   Matthew de Brecht (Kyoto, Japan) (Co-chair)
   Daniel Graa (Faro, Portugal)
   Takayuki Kihara (Nagoya, Japan)
   Maria Emilia Maietti (Padua, Italy) (Chair)
   Alexander Melnikov (Wellington, New Zealand)
   Elvira Mayordomo (Zaragoza, Spain)
   Norbert Mller (Trier, Germany)
   Sewon Park (Ljubljana, Slovenia)
   Arno Pauly (Swansea, UK)
   Monika Seisenberger (Swansea, UK)
   Dieter Spreen (Siegen, Germany)

Organizing committee

   Matthew de Brecht (Kyoto, Japan)
   Akitoshi Kawamura (Kyoto, Japan)
   Holger Thies (Kyoto, Japan)
   Hideki Tsuiki (Kyoto, Japan)
--
[LOGIC] mailing list, provided by DLMPST
More information (including information about subscription management) can
be found here: http://dlmpst.org/pages/logic-list.php