Institut de Recherche en Informatique Fondamentale(IRIF)


IRIF, the Research Institute on the Foundations of Computer Science, is a research laboratory of CNRS and Université de Paris, also hosting two Inria project-teams.

The research conducted at IRIF is based on the study and understanding of the foundations of all computer science, in order to provide innovative solutions to the current and future challenges of digital sciences.

IRIF hosts about 200 people. Six of its members have been distinguished by the European Research Council (ERC), five are members of the Institut Universitaire de France IUF), two are members of the Academia Europæa, and one is member of Académie des sciences.

The members of the CS department and the laboratory IRIF of Université de Paris voted in favor of a motion requesting the withdrawal of the LPPR project.

Sylvain Schmitz

Sylvain Schmitz (IRIF) co-organizes the “14th International Conference on Reachability Problems” (RP'20), that is planned to take place either online or at IRIF on October 19-20.


Members of IRIF organize the fifth International Conference on Formal Structures for Computation and Deduction (FSCD) and its affiliated workshops. The event was planned in Paris, due to the pandemic, it is now an online conference held from 06-29 to 07-06.

Tommaso Petrucciani

Tommaso Petrucciani is awarded the GPL PhD Thesis Prize (Software Engineering and Programming) for his thesis“ “Polymorphic set-theoretic types for functional languages” prepared at IRIF co-supervised by Giuseppe Castagna (IRIF) and Elena Zucca (Università di Genova).
Polymorphism and set-theoretic types

A function is polymorphic when it can be applied to arguments of different types. For instance, the identity function fun x = x is polymorphic since it can be applied, say, to integers and Boolean arguments, while the successor function fun x = x+1 is not, since it can be applied only to integers. The latter function has type Int→Int, while the former has type ∀α.α→α, that is, it has type α→α for all possibles types α. The last type is a polymorphic type. Set theoretic types are types with union, intersection, and negation connectives: again fun x = x has both type Int→Int and Bool→Bool and, thus, it has the intersection type (Int→Int)∩(Bool→Bool).
Amos Korman

Amos Korman (IRIF) will give a talk for receiving the 2020 prize of innovations in distributed computing. It will be broadcast live on Tuesday, June 30, at 7-8 pm (CET). Watching the talk is free of charge, but registration is required.

(These news are displayed using a randomized-priority ranking.)

Limited number of events during the Summer break

Monday July 13, 2020, 11AM, (online, using BigBlueButton)
Jan Kretinsky (Technical University of Munich) Approximating Values of Generalized-Reachability Stochastic Games

Simple stochastic games are turn-based 2.5-player games with a reachability objective. The basic question asks whether one player can ensure reaching a given target with at least a given probability. A natural extension is games with a conjunction of such conditions as objective. Despite a plethora of recent results on the analysis of systems with multiple objectives, the decidability of this basic problem remains open. In this paper, we present an algorithm approximating the Pareto frontier of the achievable values to a given precision. Moreover, it is an anytime algorithm, meaning it can be stopped at any time returning the current approximation and its error bound.