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 %



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