The 13th International Workshop on Fixed Points in Computer Science will take place in Paris as a satellite of the International Conference CSL 2026 (Computer Science Logic) on the 23rd and the morning of the 24th of February 2026 in Paris, France.
News
(Feb. 22nd) We have uploaded a Book of Abstracts with the program and abstracts of all the contributed talks.
(Feb. 21st) The submissions are available (see program). Please note that FICS is scheduled to take place in room 3.03 (third floor) of the Campus Condorcet Conference Center. See the CSL page for directions.
(Feb. 7th) The list of accepted submissions and the program are now available (see the program page).
You may be interested in the soapbox session (see session 3 on Monday in program).
(Feb. 2nd) Registration is now possible again (click here). Please note that FICS will start at 9 am on Monday and run until roughly 12:30 pm on Tuesday.
(Jan. 30th) Please note that registration via CSL appears to be broken right now. The deadline for early registration is now February 9th.
(Jan. 22nd) Confirmed invited speakers
(Jan. 22nd) The planned EPTCS volume is not going to happen. We are exploring options.
(Jan. 9th) Added information on venue and registration
(Jan. 4th) Deadlines extended!
(Dec. 14th) Added Program Committee
(Nov. 27th) Call for Submissions online
(Nov. 23rd) Website online
Description
The goal of the workshop 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
FICS 2026 is organized by Gianluca Curzi (University of Gothenburg) and Florian Bruse (TU Munich)
Léonard Brice, Jean-Francois Raskin and Marie Van Den Bogaard. The Negotiation Function: Subgame-perfect Equilibria in Graph Games as Fixed Points
Rémy Cerda and Alexis Saurin. Compression for Coinductive Infinitary Rewriting: A Generic Approach, with Applications to Cut-Elimination for Non-Wellfounded Proofs
Lide Grotenhuis and Daniël Otten. Unravelling cyclic proofs into proofs by well-founded induction
Luka Janjić and Michael D. Adams. Semantics for Datalog with Subsumption
Paul Blain Levy. Global flattening of nested inductive definitions
Lê Thành Dũng Nguyễn. On the power of additive branching in affine higher-order recursion schemes
Damian Niwinski, Paweł Parys and Michał Skrzypczak. A Dichotomy Theorem for Ordinal Ranks in MSO
Daniel Osorio-Valencia and Alexis Saurin. Towards Proof-relevant interpolation for circular proofs
András Z. Salamon and Michael Wehar. A Different Proof of the Time Hierarchy Theorem
Important Dates
Paper registration: Friday, December 21st January 9th 2026, AoE (extended)
Paper submission: Sunday, January 4th 11th, 2026 (AoE) (extended)
Notification: Tuesday, January 20th 27th, 2026
Workshop: February 23rd, 24th, 2026
Venue & Registration
FICS 2026 takes place at the Campus Condorcet Conference Center. See the corresponding page on the CSL website.
Registration will be handled by CSL (see this page). The registration fee is 150 €. Note that registration for FICS only does not require EACSL membership.
The deadline for early registration is February 9th.
Call for Submissions
Submissions will be handled via Easychair. Please visit https://easychair.org/conferences?conf=fics2026 to submit your contribution.
At least an author of each submission will be expected to present the contribution in person at FICS 2026.
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) newly 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 reviewers but will be read at their discretion.
Papers should be submitted in EPCTS format (see https://info.eptcs.org/). Papers diverging substantially from this standard my be rejected.
Submissions from the program committee (except the chairs) are permitted and encouraged.
We hope to be able to offer post-proceedings for the extended abstracts in an EPTCS volume. Due to the low number of submissions for extended abstracts, this will likely not be possible.
Depending on the number and quality of submissions, extended versions of selected contributions may be invited to a (planned) special issue of Fundamenta Informaticae.