index - Archive ouverte HAL 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.











Full-Text Documents



Open Access

87 %


Key Words

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