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 %



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