[ The Types Forum (announcements only),
http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]
Continuity, Computability, Constructivity:
From Logic to Algorithms 2019 & 2020
Postproceedings
Call for Submissions
After two years of successful work in the EU-MSCA-RISE project "Computing with
Infinite Data" (CID) and two excellent Workshops CCC 2019 in Ljubljana
(Slovenia) and CCC 2020 (online), we are planning to publish a collection of
papers dedicated to the meetings, to the project and to the subject in general
as a Special Issue in the open-access journal
LOGICAL METHODS IN COMPUTER SCIENCE.
The issue should reflect progress made in Computable Analysis 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,
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:
Daniel Graça (Faro, Portugal)
Alex Simpson (Ljubljana, Slovenia)
DEADLINE FOR SUBMISSION:
31 March 2021
If you intend to submit a paper for the special issue, please inform us by
sending an email to:
[email protected] <mailto:[email protected]> (Daniel Graça)
or
[email protected] <mailto:%[email protected]> (Alex
Simpson)
by
31 January 2021
You will then receive concrete submission instructions about how to submit your
paper to this special issue. Please prepare your manuscript using the LMCS
LaTeX style which can be downloaded from
https://lmcs.episciences.org/page/authors-latex-style
<https://lmcs.episciences.org/page/authors-latex-style>.
Submissions will be reviewed according to the usual high standards of LMCS.
