Related papers: Girard's $!()$ as a reversible fixed-point operato…
In this paper, we construct an infinitary variant of the relational model of linear logic, where the exponential modality is interpreted as the set of finite or countable multisets. We explain how to interpret in this model the fixpoint…
We consider the endomorphism operad of a functor, which is roughly the object of natural transformations from (monoidal) powers of that functor to itself. There are many examples from geometry, topology, and algebra where this object has…
Firmly nonexpansive operators arise naturally as resolvents of monotone operators and as generalizations of projections and proximal mappings in convex optimization and fixed point theory. While their iterates are known to converge weakly…
A fertile field of research in theoretical computer science investigates the representation of general recursive functions in intensional type theories. Among the most successful approaches are: the use of wellfounded relations,…
In a reversible language, any forward computation can be undone by a finite sequence of backward steps. Reversible computing has been studied in the context of different programming languages and formalisms, where it has been used for…
Let G be a subgroup of GL(V), where V is a finite dimensional vector space over a finite field of characteristic p >0. If det(g-1) = 0 for all g \in G then we call G a fixed-point subgroup of GL(V). Motivated in parallel by questions in…
We propose a "modal linear logic" to reformulate intuitionistic modal logic S4 (IS4) in terms of linear logic, establishing an S4-version of Girard translation from IS4 to it. While the Girard translation from intuitionistic logic to linear…
We construct a localization for operads with respect to one-ary operations based on the Dwyer-Kan hammock localization. For an operad O and a sub-monoid of one-ary operations W we associate an operad LO and a canonical map O to LO which…
We prove a recursive identity involving formal iterated logarithms and formal iterated exponentials. These iterated logarithms and exponentials appear in a natural extension of the logarithmic formal calculus used in the study of…
The paper provides a coherent presentation of an operator scheme, which is used in an approach to inverse problems of mathematical physics (the boundary control method). The scheme is based on the triangular factorization of operators. It…
We characterize bijections on matrix spaces (operator algebras) preserving full rank (invertibility) of differences of matrix (operator) pairs in both directions.
In a recent work, Girard proposed a new and innovative approach to computational complexity based on the proofs-as-programs correspondence. In a previous paper, the authors showed how Girard proposal succeeds in obtaining a new…
In this paper, we show how to extend the notion of reducibility introduced by Girard for proving the termination of $\beta$-reduction in the polymorphic $\lambda$-calculus, to prove the termination of various kinds of rewrite relations on…
A new mathematical notation is proposed for the iteration of functions. It facilitates the application of the iteration of functions in mathematical and logical expressions, definitions of sets, and formulations of algorithms. Illustrations…
We give a new proof of the result that if f and g are transcendental entire functions, then the composite function f(g) has infinitely many fixed points. The method yields a number of generalization of this result. In particular, it extends…
Signal inference problems with non-Gaussian posteriors can be hard to tackle. Through using the concept of Gibbs free energy these posteriors are rephrased as Gaussian posteriors for the price of computing various expectation values with…
We formulate and prove the existence and uniqueness of the generalized Fourier transform associated with the absolutely continuous part of an arbitrary selfadjoint operator on a separable Hilbert space. To this end we develop a novel method…
We establish a fixed-point theorem for the face maps that consist in deleting the $i$th entry of an ordered set. Furthermore, we show that there exists random finite sets of integers that are almost invariant under such deletions.…
Quasidiagonal operators on a Hilbert space are a large and important class (containing all self-adjoint operators for instance). They are also perfectly suited for study via the finite section method (a particular Galerkin method). Indeed,…
Reversible computing models settings in which all processes can be reversed. Applications include low-power computing, quantum computing, and robotics. It is unclear how to represent side-effects in this setting, because conventional…