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 %



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