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 %



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