index - Institut de Recherche en Informatique Fondamentale Access content directly

Welcome to the collection of IRIF laboratory - UMR 8243

Institut de Recherche en Informatique Fondamentale (IRIF) is a research unit co-founded by CNRS and Université Paris Cité, as UMR 8243. It results from the merging of the two research units LIAFA and PPS on January 1st, 2016. IRIF hosts one Inria project-team. IRIF is also member of Fondation Sciences Mathématiques de Paris (FSMP), and of three regional programs: Math Innov, Computer Sciences, Quantum Technologies.

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. In particular, IRIF is renown for its contributions to the design and analysis of algorithms, the study of computational and data representation models, the foundations of programming languages, software development, verification, and certification. IRIF also conducts interdisciplinary research taking advantage of its scientific approach.

•This collection contains only publications submitted on the initiative of their authors and is therefore not representative of all IRIF publications. Any statistical study of this collection could only be wrong. However, IRIF encourages its members to regularly deposit their publications in this collection.•









Open Access

88 %



Graph homomorphism Coq Categorical semantics Réécriture Formal methods Polygraphs Concurrency Denotational semantics Eccentricity Gravitational radiation detector Complexity Distributed graph algorithms Proof assistants Category theory Opetope Signed graphs Dependent type theory Sequent calculus Algorithm Cluster complex Smart contracts Lambda calculus Verification Separation CONGEST Classical logic Proof theory Type theory Graphs Quantum algorithms Proof nets Non-wellfounded proofs Cryptography Symbolic dynamics Theory of computation Combinatorial model category Fixed points Directed homotopy Coloring Union types Regular languages Transducers Gradual typing Topology Catégories supérieures Accessible model category Reachability Geometry of Interaction Graph theory Approximation Algorithms Reverse mathematics Automata Distributed algorithms Linear Logic Formal verification Curry-Howard Distributed decision Dynamical analysis of Algorithms Polynomial functor Communication complexity Combinatorial topology Rewriting Distributed systems BFS Monoid Graph search Circular proofs Semantics Automaton groups Diameter Temporal path Authentication Conference Combinatorial maps Noncrossing partitions Approximation algorithms Graph algorithms Décision distribuée Opetopic set Distributed Computing Software Package Installation Decidability Geometry of interaction Lower bounds Distance Labeling Intersection types Directed path Decision problems Distributed verification Broadcasting Coinduction Reduction operators Proof assistant Game semantics Subtyping Shared memory Linear logic Cut elimination Consensus Clustering