• I currently left the scope unchanged, even though I would suggest:
  • DONE adding an item “fixed points in proof theory” and
  • DONE to complement the item “fixed points in logic programming and theorem proving” as “fixed points in automated theorem proving, interactive theorem proving and logic programming”
• DONE length of short abstracts
• DONE length of extended abstracts
• DONE PC submissions short/extended abstract. Below is a proposal, I am fine discussion any other options.

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. 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

This year, we welcome two kinds of submissions, short abstracts as well as formal papers, which must be submitted with easychair, following EPTCS latex style, by following this link: https://easychair.org/conferences/?conf=fics2024

• In the “short abstract” category, people can submit an abstract of 3 to 5 pages, references included included, describing the topic of the proposed contributed talk. Short abstracts may contain (i) new completed results, (ii) work in progress or (iii) already (recently) published or submitted works to be presented at the workshop. 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.

• In the “extended abstract” category, people can submit extended abstracts of 6 to 10 pages, references excluded in EPTCS format (11pt, see https://style.eptcs.org/), describing original results which have not been published nor are currently submitted elsewhere. The results must be presented in sufficient details to constitute a publication. An appendix can provide additional details for the reviewer but will be read at the discretion of the reviewers. Appendices may be included in the proceedings only if reviewers assert that they have been reviewed. Accepted extended abstracts will be published through the open-access venue EPTCS. Notice that according to EPTCS policy, “full versions of extended abstracts published in EPTCS, or substantial revisions, may later be published elsewhere.”

For more details on the difference between short and extended abstracts, see EPTCS webpage.

• …

• Short abstracts (co-)authored by any PC members are allowed;
• Extended abstract (co-)authored by program committee members other than the PC chair are allowed.

• Alexis Saurin, chair
• …

• Bahareh Afshari (University of Gothenburg)
• Denis Kuperberg (CNRS & ENS Lyon)
• Ralph Matthes (IRIT, CNRS & Université de Toulouse)
• Damian Niwinski (University of Warsaw)
• Luigi Santocanale (LIS, Université Aix-Marseille)
• Alexis Saurin (IRIF, CNRS & Université Paris Cité & INRIA)
• Tarmo Uustalu (Reykjavik University, Tallinn Institute of Cybernetics)
• Igor Walukiewicz (LaBRI, Bordeaux)