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.•

 

 

 

REFERENCES

471

FULL-TEXT

790

 

Open Access

88 %

 

KEY WORDS

Language theory Decidability Communication complexity Authentication Sequent calculus Circular proofs Proof assistant Réécriture Smart contracts Lower bounds Graph homomorphism Proof nets Reverse mathematics Separation Approximation Algorithms Distributed decision Reduction operators Categorical semantics Shared memory Union types Approximation algorithms Lambda calculus Conference Reachability CONGEST Complexity Dependent type theory Coinduction Proof assistants Cut elimination Clustering Formal verification Décision distribuée Fixed points Decision problems Temporal path Verification Denotational semantics Coloring Directed path Distributed Computing Logique linéaire Dynamical analysis of Algorithms Geometry of Interaction Lambda Calculus Type theory Theory of computation Lattice Combinatorial model category Opetope Polygraphs Distributed algorithms Distributed systems Coq Linear logic Polynomial functor Quantum algorithms Distance Labeling Rewriting Lambda-calculus Automaton groups Non-wellfounded proofs Combinatorial maps Catégories supérieures Formal methods Proof theory Eccentricity Noncrossing partitions Consensus Opetopic set Lambda-Calculus Monoid Transducers Gradual typing Intersection types Geometry of interaction Linear Logic Software Package Installation Higher categories Concurrency Category theory BFS Graph theory Directed homotopy Classical logic Semantics Curry-Howard Regular languages Game semantics Combinatorial topology Automata Subtyping Infinite words Distributed verification Graph algorithms Graph search Topology Distributed graph algorithms Accessible model category Diameter

 

COLLABORATIONS