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 %



Algorithm Cut elimination Complexity Transducers Theory of computation Software Package Installation Lambda calculus Coloring Distributed graph algorithms Approximation Algorithms Subtyping Proof theory Monoid Higher categories Automaton groups Fixed points Denotational semantics Sémantique Lambda-calculus Distance Labeling 2012 ACM Subject Classification Theory of computation → Tree languages Separation Formal verification Accessible model category Proof nets Parity games Noncrossing partitions Reduction operators Program verification Distributed algorithms Opetope Curry-Howard Vérification Systèmes distribués Categorical semantics Combinatorial model category Conference Lattice Monadic second-order logic Abstraction Linear Logic Semantic subtyping Topology Graph search Graph homomorphism Coq Access Décision distribuée Temporal path Verification Graph theory Type theory Proof assistants Decidability Formal methods Game semantics Distributed systems Polygraphs Logique linéaire Gradual typing Catégories supérieures Eccentricity Consensus BFS Clustering Distributed decision Intersection types Non-determinism Reverse mathematics Classical logic Distributed verification Communication complexity Circular proofs Directed homotopy Directed path Dynamical analysis of Algorithms Concurrency Algebraic theories Sequent calculus Lower bounds Authentication Graph algorithms Reachability Distributed Computing Semantics Locally presentable category Lambda Calculus Decision problems Polynomial functor Linear logic Coinduction Rewriting Geometry of Interaction Topologically enriched category Accès Proof assistant Non-wellfounded proofs Interval graphs Combinatorial maps Local certification