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 %



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