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 %



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