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

493

FULL-TEXT

846

 

Open Access

88 %

 

KEY WORDS

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

 

COLLABORATIONS