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

486

FULL-TEXT

819

 

Open Access

88 %

 

KEY WORDS

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

 

COLLABORATIONS