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

503

FULL-TEXT

930

 

Open Access

89 %

 

KEY WORDS

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

 

COLLABORATIONS