[ The Types Forum (announcements only),
     http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

Continuity, Computability, Constructivity:
From Logic to Algorithms 2017

Call for Submissions

After the successful start of the new EU-MSCA-RISE project "Computing with 
Infinite Data" (CID) and the excellent Workshop CCC 2017 in Nancy (France) in 
June this year, we are planning to publish a collection of papers dedicated to 
the meeting and to the project as a Special Issue in the open-access journal

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 

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.  


Ulrich Berger (Swansea, UK)
Pieter Collins (Maastricht, NL)
Mathieu Hoyrup (Nancy, FR)
Victor Selivanov (Novosibirsk, RUS)
Dieter Spreen (Siegen, DE)
Martin Ziegler (KAIST, KR)

 1 February 2018

If you intend to submit a paper for the special issue, please inform us by 
sending email to:  

spr...@math.uni-siegen.de <mailto:spr...@math.uni-siegen.de>


1 Januar 2018

You will then receive concrete submission instructions and a Special-Issue-Code 
allowing you to submit your paper.

Please prepare your manuscript using the LMCS class file lmcs.cls which can be 
downloaded from 


Submissions will be reviewed according to the usual high standards of LMCS.

Best regards,

Ulrich Berger
Pieter Collins
Mathieu Hoyrup
Victor Selivanov
Dieter Spreen
Martin Ziegler

Reply via email to