CALCO Early Ideas presentations will be selected according to originality, significance, and general interest, on the basis of submitted 2-page short contributions. It can be work in progress, a summary of work submitted to a conference or workshop elsewhere, or work that in some other way might be interesting to the CALCO audience. A booklet with the accepted short contributions will be available at the workshop.
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.
* Abstract models and logics
- Automata and languages
- Categorical semantics
- Modal logics
- Relational systems
- Graph transformation
- Term rewriting
* Specialised models and calculi
- 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.)
* Algebraic and coalgebraic semantics
- Abstract data types
- Inductive and coinductive methods
- Re-engineering techniques (program transformation)
- Semantics of conceptual modelling methods and techniques
- Semantics of programming languages
* System specification and verification
- 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
* Corecursion in Programming Languages
- Corecursion in logic / constraint / functional / answer set
programming
- Corecursive type inference
- Coinductive methods for proving program properties
- Implementing corecursion
- Applications
* Algebra and Coalgebra in quantum computing
- Categorical semantics for quantum computing
- Quantum calculi and programming languages
- Foundational structures for quantum computing
- Applications of quantum algebra
* String Diagrams and Network Theory
- Combinatorial approaches
- Theory of PROPs and operads
- Rewriting problems and higher-dimensional approaches
- Automated reasoning with string diagrams
- Applications of string diagrams
- Connections with Control Theory, Engineering and Concurrency