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

492

FULL-TEXT

852

 

Open Access

88 %

 

KEY WORDS

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

 

COLLABORATIONS