index - Institut de Recherche en Informatique Fondamentale Access content directly

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

846

 

Open Access

88 %

 

KEY WORDS

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

 

COLLABORATIONS