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 %



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