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 %



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