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 %



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