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

858

 

Open Access

88 %

 

KEY WORDS

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

 

COLLABORATIONS