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

488

FULL-TEXT

843

 

Open Access

88 %

 

KEY WORDS

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

 

COLLABORATIONS