60 citations
- Université Paris-SaclayFR43 papers
- Centre National de la Recherche ScientifiqueFR36 papers
- CentraleSupélecFR17 papers
- Institut national de recherche en sciences et technologies du numériqueFR14 papers
- École Normale Supérieure - PSLFR11 papers
- École Normale Supérieure Paris-SaclayFR8 papers
- Laboratoire de Biologie et Pharmacologie AppliquéeFR8 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR8 papers
- Centre Inria de SaclayFR6 papers
- Institut Universitaire de FranceFR6 papers
- Université de LorraineFR6 papers
- Aix-Marseille UniversitéFR5 papers
5 papers · 2 filters
Semantics for a Turing-complete Reversible Programming Language with Inductive Types
Kostia Chardonnet, Louis Lemonnier, Benoît Valiron
This paper is concerned with the expressivity and denotational semantics of a functional higher-order reversible programming language based on Theseus. In this language, pattern-ma…
Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
Renaud Vilmart
The "Sum-Over-Paths" formalism is a way to symbolically manipulate linear maps that describe quantum systems, and is a tool that is used in formal verification of such systems. We…
On the Satisfiability of Local First-Order Logics with Data
Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality. As the…
The principle of a finite density of information
Pablo Arrighi, Gilles Dowek
The possibility to describe the laws of the Universe in a computational way seems to be correlated to a principle that the density of information is bounded. This principle, that i…
Ordinal measures of the set of finite multisets
Isa Vialard
Well-partial orders, and the ordinal invariants used to measure them, are relevant in set theory, program verification, proof theory and many other areas of computer science and ma…