English
Related papers

Related papers: Two Decreasing Measures for Simply Typed Lambda-Te…

200 papers

We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value lambda-calculus can simulate each other within a polynomial…

Logic in Computer Science · Computer Science 2007-05-23 Ugo Dal Lago , Simone Martini

This is the first in a series of two papers studying mu-cscK metrics and muK-stability, from a new perspective evoked from observations in arXiv:2004.06393 and in this first article. The first paper is about a characterization of mu-cscK…

Differential Geometry · Mathematics 2022-02-25 Eiji Inoue

This paper considers metrics whose curvature tensor makes sense as a distribution. A class of such metrics, the regular metrics, was defined and studied by Geroch and Traschen. Here, we generalize their definition to form a wider class:…

General Relativity and Quantum Cosmology · Physics 2009-10-31 David Garfinkle

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…

Logic in Computer Science · Computer Science 2026-03-05 Rob Nederpelt , Ferruccio Guidi

Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is lambda-calculus a reasonable machine? Is there a way to measure the computational complexity…

Programming Languages · Computer Science 2017-01-11 Beniamino Accattoli , Ugo Dal Lago

This work introduces an asymptotic study of Hotelling-type tensor deflation in the presence of noise, in the regime of large tensor dimensions. Specifically, we consider a low-rank asymmetric tensor model of the form $\sum_{i=1}^r…

This work uncovers the tropical analogue for measured laminations of the convex hull construction of decorated Teichmueller theory, namely, it is a study in coordinates of geometric degeneration to a point of Thurston's boundary for…

Geometric Topology · Mathematics 2011-06-15 R. C. Penner

Higher-order representations of objects such as programs, proofs, formulas and types have become important to many symbolic computation tasks. Systems that support such representations usually depend on the implementation of an intensional…

Programming Languages · Computer Science 2007-05-23 Xiaochu Qi

This paper focuses on various decompositions of topological measures, deficient topological measures, signed topological measures, and signed deficient topological measures. These set functions generalize measures and correspond to certain…

Classical Analysis and ODEs · Mathematics 2019-02-22 Svetlana V. Butler

The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of…

Information Theory · Computer Science 2026-01-21 Sebastian Bitzer , Alberto Ravagnani , Violetta Weger

We study the interpretation of the lambda-calculus in a framework based on tropical mathematics, and we show that it provides a unifying framework for two well-developed quantitative approaches to program semantics: on the one hand program…

Logic in Computer Science · Computer Science 2023-11-28 Davide Barbarossa , Paolo Pistone

We develop an asymptotic expansion of the spectral measures on a degenerating family of hyperbolic Riemann surfaces of finite volume. As an application of our results, we study the asymptotic behavior of weighted counting functions, which,…

Differential Geometry · Mathematics 2016-09-06 Jonathan Huntley , Jay Jorgenson , Rolf Lundelius

Measuring attenuation coefficients is a fundamental problem that can be solved with diverse techniques such as X-ray or optical tomography and lidar. We propose a novel approach based on the observation of a sample from a few different…

Optimization and Control · Mathematics 2017-01-11 Valentin Debarnot , Jonas Kahn , Pierre Weiss

We consider the following decision problem: given two simply typed $\lambda$-terms, are they $\beta$-convertible? Equivalently, do they have the same normal form? It is famously non-elementary, but the precise complexity - namely…

Logic in Computer Science · Computer Science 2024-09-11 Lê Thành Dũng Nguyên

Tensors play a central role in many modern machine learning and signal processing applications. In such applications, the target tensor is usually of low rank, i.e., can be expressed as a sum of a small number of rank one tensors. This…

Machine Learning · Statistics 2015-05-18 Parikshit Shah , Nikhil Rao , Gongguo Tang

A maxitive measure is the analogue of a finitely additive measure or charge, in which the usual addition is replaced by the supremum operation. Contrarily to charges, maxitive measures often have a density. We show that maxitive measures…

General Topology · Mathematics 2013-01-08 Paul Poncet

Let $(X,d)$ be a compact metric space and $(X,\mathcal{A},\mu,T)$ a measure preserving dynamical system. Furthermore, given a real, positive function $\psi$, let $W(T, \psi)$ and $ R(T,\psi) $ respectively denote the shrinking target set…

Dynamical Systems · Mathematics 2025-11-05 Yubin He , Bing Li , Sanju Velani

Damping is defined through various terms such as energy loss per cycle (for cyclic tests), logarithmic decrement (for vibration tests), complex modulus, rise-time or spectrum ratio (for wave propagation analysis), etc. For numerical…

Classical Physics · Physics 2009-01-26 Jean-François Semblat

Let $(X,d)$ be a compact metric space. We consider the behavior of probability measures $\mu$ with the property that $$ \int_{X} d(x, y) d\mu(y) \qquad \mbox{is independent of}~x \in X.$$ It appears that such measures, when they exist,…

Metric Geometry · Mathematics 2026-02-24 Stefan Steinerberger

We present a spatially efficient decomposition of matrices and arbitrary-order tensors as linear combinations of tensor products of $\{-1, 1\}$-valued vectors. For any matrix $A \in \mathbb{R}^{m \times n}$, $$A - R_w = S_w C_w T_w^\top =…

Combinatorics · Mathematics 2024-10-03 Alex W. Neal Riasanovsky , Sarah El Kazdadi