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 %



Opetopic set Complexity Lambda-Calculus Lambda calculus Cluster complex Locally presentable category Non-wellfounded proofs Dependent type theory Local certification Monoid Réécriture Reachability Distributed Computing Polygraphs Verification Diameter Software Package Installation Coq Proof assistant Lattice Clustering Topology CONGEST Proof assistants Combinatorial maps Smart contracts Circular proofs Decision problems Proof theory Distributed graph algorithms Automata Categorical semantics Rewriting Décision distribuée Curry-Howard Approximation algorithms Polynomial functor Geometry of Interaction Approximation Algorithms Graph homomorphism Higher categories Classical logic Formal methods Temporal path Geometry of interaction Combinatorial topology Denotational semantics Opetope Infinite words Lower bounds Transducers Catégories supérieures Coloring Consensus Quantum algorithms Directed homotopy Fixed points Coinduction Automaton groups Graph theory BFS Game semantics Reduction operators Combinatorial model category Regular languages Distributed algorithms Sequent calculus Directed path Cut elimination Type theory Distance Labeling Graph algorithms Semantics Graph search Authentication Decidability Separation Formal verification Category theory Shared memory Linear logic Linear Logic Accessible model category Lambda Calculus Noncrossing partitions Theory of computation Conference Union types Distributed verification Communication complexity Distributed systems Reverse mathematics Dynamical analysis of Algorithms Eccentricity Proof nets Gradual typing Distributed decision Concurrency Subtyping Intersection types