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

491

FULL-TEXT

852

 

Open Access

88 %

 

KEY WORDS

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

 

COLLABORATIONS