[TYPES/announce] Cfp: Continuity, Computability, Constructivity: From Logic to Algorithms Postproceedings

[Monika Seisenberger]

Continuity, Computability, Constructivity:
>From Logic to Algorithms 2021, Postproceedings
In honour of Ulrich Berger

Call for Submissions

After another year of successful work in the EU-MSCA-RISE project "Computing with Infinite Data" (CID) and an excellent CCC Workshop in Birmingham, we are planning to publish a collection of papers relevant to the CCC meeting, to the project, and to the subject in general, as a Special Issue in THEORETICAL COMPUTER SCIENCE. The volume will be dedicated to Ulrich Berger's 65th Birthday.

The issue will reflect progress made on CCC topics and related areas, and is not restricted to work in the CID project or presented at the Workshop. Submissions are welcome from all scientists on topics in the entire spectrum from logic to algorithms including, but not limited to:

  *   Exact real number computation,
  *   Correctness of algorithms on infinite data types,
  *   Computable analysis,
  *   Complexity of real numbers, real-valued functions, etc.
  *   Effective descriptive set theory,
  *   Constructive topological foundations,
  *   Scott's domain theory,
  *   Constructive analysis,
  *   Category-theoretic approaches to computation on infinite data,
  *   Weihrauch degrees,
  *   Randomness and computable measure theory,
  *   Other related areas.

EDITORS:

Achim Jung (Birmingham)
Monika Seisenberger (Swansea)


DEADLINE FOR SUBMISSIONS: 1 May 2022.
If you are interested to contribute, please send a tentative title and abstract to the editors by the end of 31 January 2022.
Submissions will be reviewed according to the usual high standards of TCS.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://LISTS.SEAS.UPENN.EDU/pipermail/types-announce/attachments/20220114/3564076b/attachment-0001.htm>