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

502

FULL-TEXT

927

 

Open Access

89 %

 

KEY WORDS

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

 

COLLABORATIONS