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

87 %



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