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.•

 

 

LATEST PUBLICATIONS

Chargement de la page

 

REFERENCES

Chargement de la page

FULL-TEXT

Chargement de la page

 

Open Access

Chargement de la page

 

KEY WORDS

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

 

COLLABORATIONS