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

490

FULL-TEXT

830

 

Open Access

88 %

 

KEY WORDS

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

 

COLLABORATIONS