CALCO aims to bring together researchers and practitioners with interests in foundational aspects, and both traditional and emerging uses of algebras and coalgebras in computer science. The study of algebra and coalgebra relates to the data, process and structural aspects of software systems.
This is a high-level, bi-annual conference formed by joining the forces and reputations of
- CMCS (the International Workshop on Coalgebraic Methods in Computer Science), and
- WADT (the Workshop on Algebraic Development Techniques).
Previous CALCO editions took place in:
The fifth edition will be held in Warsaw, the capital of Poland.
Topics of interest:
We invite submissions of technical papers that report results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. We encourage submissions in topics included or related to those listed below.
- ABSTRACT MODELS AND LOGICS
- SPECIALISED MODELS AND CALCULI
- ALGEBRAIC AND COALGEBRAIC SEMANTICS
- SYSTEM SPECIFICATION AND VERIFICATION
Automata and languages; Categorical semantics; Modal logics; Relational systems; Graph transformation; Term rewriting; Adhesive categories
Hybrid, probabilistic, and timed systems; Calculi and models of concurrent, distributed, mobile, and context-aware computing; General systems theory and computational models (chemical, biological, etc.)
Abstract data types; Inductive and coinductive methods; Re-engineering techniques (program transformation); Semantics of conceptual modelling methods and techniques; Semantics of programming languages
Algebraic and coalgebraic specification; Formal testing and quality assurance; Validation and verification; Generative programming and model-driven development; Models, correctness and (re)configuration of hardware/middleware/architectures; Process algebra
This edition of CALCO will feature two new topics, and submission of papers on these topics is especially encouraged.
- CORECURSION IN PROGRAMMING LANGUAGES
- ALGEBRA AND COALGEBRA IN QUANTUM COMPUTING
Corecursion in logic / constraint / functional / answer set programming; Corecursive type inference; Coinductive methods for proving program properties; Implementing corecursion; Applications
Categorical semantics for quantum computing; Quantum calculi and programming languages; Foundational structures for quantum computing; Applications of quantum algebra
CALCO 2013 proceedings will be published in Springer Lecture Notes in Computer Science.
A special issue of the open access journal Logical Methods in Computer Science, containing extended versions of selected papers, is also being planned.
Best paper and best presentation awards:
For the first time, this edition of CALCO will feature two kinds of awards: a best paper award whose recipients will be selected by the PC before the conference and a best presentation award, elected by the participants.
- Abstract submission: March 1, 2013 (extended!)
- Full paper submission: March 8, 2013 (extended!)
- Author notification: May 6, 2013
- Final version due: June 3, 2013