Related papers: A finiteness structure on resource terms
We begin the study of the consequences of the existence of certain infinite matrices. Our present application is to compactness of products of topological spaces.
We formulate and analyze several finiteness conjectures for linear algebraic groups over higher-dimensional fields. In fact, we prove all of these conjectures for algebraic tori as well as in some other situations. This work relies in an…
Quantum coherence is one of the most important resources in quantum information. Indeed, preventing the loss of coherence is one of the most important technical challenges obstructing the development of large-scale quantum computers.…
In a previous paper, we provided some update in the treatment of the finiteness theorem for rational maps of finite degree from a fixed variety to varieties of general type. In the present paper we present another improvement, introducing…
We present a system to translate natural language sentences to formulas in a formal or a knowledge representation language. Our system uses two inverse lambda-calculus operators and using them can take as input the semantic representation…
In compositional model-theoretic semantics, researchers assemble truth-conditions or other kinds of denotations using the lambda calculus. It was previously observed that the lambda terms and/or the denotations studied tend to follow the…
We characterize ultrafilter convergence and ultrafilter compactness in linearly ordered and generalized ordered topological spaces. In such spaces, and for every ultrafilter $D$, the notions of $D$-compactness and of $D$-pseudocompactness…
Terms in the lambda-calculus can be represented as planar trees decorated with symbols for abstraction and application, and having variables as leaves. In this paper, we concentrate on the branches of such trees, rather than on the trees…
The organization of latent knowledge within large-scale models poses unique challenges when addressing overlapping representations and optimizing contextual accuracy. Conceptual redundancies embedded across layers often result in…
We prove the Stability Property for the call-by-value $\lambda$-calculus (CbV in the following). This result states necessary conditions under which the contexts of the CbV $\lambda$-calculus commute with intersections of approximants. This…
We show how (well-established) type systems based on non-idempotent intersection types can be extended to characterize termination properties of functional programming languages with pattern matching features. To model such programming…
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings,…
We relate a balancing property of letters for bi-infinite sequences to the invariance of the resulting 1-dimensional tiling dynamics under changes in the lengths of the tiles. If the language of the sequence space is finitely balanced, then…
Fluctuation theorems provide universal constraints on nonequilibrium energy and entropy fluctuations, making them a natural framework to assess how and to what extent quantum resources become thermodynamically relevant. We develop a unified…
The $\lambda$-calculus is a handy formalism to specify the evaluation of higher-order programs. It is not very handy, however, when one interprets the specification as an execution mechanism, because terms can grow exponentially with the…
We study the complexity of deciding the equality of infinite objects specified by systems of equations, and of infinite objects specified by lambda-terms. For equational specifications there are several natural notions of equality: equality…
A predicate linear temporal logic LTL_{\lambda,=} without quantifiers but with predicate abstraction mechanism and equality is considered. The models of LTL_{\lambda,=} can be naturally seen as the systems of pebbles (flexible constants)…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
Finding a denotational semantics for higher order quantum computation is a long-standing problem in the semantics of quantum programming languages. Most past approaches to this problem fell short in one way or another, either limiting the…
We present some contributions to the theory of infinitary rewriting for weakly orthogonal term rewrite systems, in which critical pairs may occur provided they are trivial. We show that the infinitary unique normal form property fails by an…