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

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