[TYPES/announce] Preliminary CFP - FICS Workshop (submission deadline: 1st December 2023)

Alexis Saurin alexis.saurin at irif.fr
Wed Oct 11 08:05:23 EDT 2023


(Apologies for multiple postings)

=== Preliminary Call for contributions ===


Workshop on Fixed Points in Computer Science
19 & 20 February 2024
https://urldefense.com/v3/__https://www.irif.fr/users/saurin/fics2024/index.html__;!!IBzWLUs!SYJZSV3_tpLmU2CVuOo4bwY_wgVAg0YnSiOqefs4AQSKRhnyslHHQLZ9kr9Ihpmwz_E4u-c0RFCaltHzOLLD9kXiEgnz_w_ap1E_DVc$ 


This year, FICS workshop (Workshop on Fixed Points in Computer Science) 
will take place in Naples on the 19th and 20th of February, 2024, 
affiliated with CSL 2024 (https://urldefense.com/v3/__https://csl2024.github.io/Home/__;!!IBzWLUs!SYJZSV3_tpLmU2CVuOo4bwY_wgVAg0YnSiOqefs4AQSKRhnyslHHQLZ9kr9Ihpmwz_E4u-c0RFCaltHzOLLD9kXiEgnz_w_aywX6PNE$ ).


== About FICS workshop series ==

The goal is to bring together people from different subfields such as 
algebra/coalgebra, verification, logic, around the thematic of fixed 
points. Fixed points play a fundamental role in several areas of 
computer science. They are used to justify (co)recursive definitions and 
associated reasoning techniques. The construction and properties of 
fixed points have been investigated in many different settings such as: 
design and implementation of programming languages, logics, 
verification, databases.


== Scope ==

Topics include, but are not restricted to:

- fixed points in algebra and coalgebra
- fixed points in formal languages and automata
- fixed points in game theory
- fixed points in programming language semantics
- fixed points in proofs
- fixed points in the mu-calculus and modal logics
- fixed points in process algebras and process calculi
- fixed points in functional programming and type theory
- fixed points in relation to dataflow and circuits
- fixed points in automated theorem proving, interactive theorem proving 
and logic programming
- fixed points in finite model theory, descriptive complexity theory, 
and databases
- fixed points in category theory for logic in computer science


== Important dates ==

- Submission deadline for short and extended abstracts: 1 December 2023;
- Notification: 21 December 2023;
- Workshop: 19 and 20 February 2024.


== Types of submissions ==

This year, we welcome two categories of submissions, short abstracts as 
well as extended abstracts:

* short abstracts are abstracts of 3 to 5 pages, references included, 
describing the topic of the proposed contributed talk. They may contain 
(i) new completed results, (ii) work in progress or (iii) already 
(recently) published or submitted works. The submission can refer to a 
published paper or a preprint but the description given in the short 
abstract should be sufficiently detailed for the PC to judge the 
relevance of the proposed talk to the workshop program.

* extended abstracts are papers of 6 to 10 pages, references excluded, 
describing original results which have not been published nor are 
currently submitted elsewhere. The results must be presented in 
sufficient details to constitute a scientific publication. An appendix 
can provide additional details for the reviewer but will be read at the 
discretion of the reviewers. We plan to have formal proceedings for 
extended abstract, more details will be posted on FICS website and in 
forthcoming calls for contributions.


Both types of submissions will be handled via Easychair and will be 
peer-reviewed by the PC.


== Journal publication ==

Depending on the number and quality of submissions, we will plan a 
subsequent special issue of a journal, as often done for previous 
editions of the workshop.


== Program Committee ==

     Alexis Saurin, PC chair

     Program committee: to be announced soon


== Contact ==

Alexis Saurin
alexis.saurin at irif.fr
https://urldefense.com/v3/__https://www.irif.fr/users/saurin/index__;!!IBzWLUs!SYJZSV3_tpLmU2CVuOo4bwY_wgVAg0YnSiOqefs4AQSKRhnyslHHQLZ9kr9Ihpmwz_E4u-c0RFCaltHzOLLD9kXiEgnz_w_aTsBvV_Y$ 


More information about the Types-announce mailing list