index - Institut de Recherche en Informatique Fondamentale

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

492

FULL-TEXT

853

 

Open Access

88 %

 

KEY WORDS

Type theory Theory of computation → Graph algorithms analysis Distributed algorithms Directed path Shared memory Fixed points Geometry of interaction Linear Logic Clustering Denotational semantics Polynomial functor Polygraphs Circular proofs Complexity Observational equivalence Quantum algorithms Signed graphs Topology Distributed graph algorithms Decidability Sequent calculus Directed homotopy Authentication Cut elimination Verification Accessible model category CCS Concepts Approximation algorithms Dynamical analysis of Algorithms Conference Catégories supérieures Proof theory Concurrency Consensus Regular languages BFS Distributed verification Temporal path Formal verification Category theory Proof assistants Software Package Installation Theory of computation Graph algorithms Call-by-value Distance Labeling Cluster complex Symbolic dynamics Linear logic Broadcasting Smart contracts Lambda-Calculus Diameter Automaton groups Coq Transducers Distributed systems Reachability Subtyping Lower bounds Categorical semantics Dependent type theory Union types Formal methods Opetopic set Algorithm Denotational Semantics Automata Cryptography Classical logic Coinduction Intersection types Communication complexity Graph search Opetope Proof assistant Combinatorial model category Separation Non-wellfounded proofs Réécriture Curry-Howard Monoid Blockchain Distributed decision Rewriting Lambda calculus Approximation Algorithms Coloring Noncrossing partitions CONGEST Combinatorial topology Combinatorial maps Graph theory Reverse mathematics Reduction operators Distributed Computing Semantics Proof nets Eccentricity Decision problems

 

COLLABORATIONS