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

504

FULL-TEXT

941

 

Open Access

89 %

 

KEY WORDS

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

 

COLLABORATIONS