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

Chargement de la page



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