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

937

 

Open Access

89 %

 

KEY WORDS

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

 

COLLABORATIONS