English
Related papers

Related papers: On the Taylor expansion of $\lambda$-terms and the…

200 papers

The algebraic $\lambda$-calculus is an extension of the ordinary $\lambda$-calculus with linear combinations of terms. We establish that two ordinary $\lambda$-terms are equivalent in the algebraic $\lambda$-calculus iff they are…

Logic in Computer Science · Computer Science 2023-06-16 Axel Kerinec , Lionel Vaux Auclair

Herbrand's theorem is one of the most fundamental insights in logic. From the syntactic point of view, it suggests a compact representation of proofs in classical first- and higher-order logic by recording the information of which instances…

Logic · Mathematics 2019-10-09 Federico Aschieri , Stefan Hetzl , Daniel Weller

The differential $\lambda$-calculus studies how the quantitative aspects of programs correspond to differentiation and to Taylor expansion inside models of linear logic. Recent work has generalized the axioms of Taylor expansion so they…

Logic in Computer Science · Computer Science 2026-03-27 Christine Tasson , Aymeric Walch

The notion of trees plays an important role in Butcher's B-series. More recently, a refined understanding of algebraic and combinatorial structures underlying the Magnus expansion has emerged thanks to the use of rooted trees. We follow…

Combinatorics · Mathematics 2017-09-14 Kurusch Ebrahimi-Fard , Dominique Manchon

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…

Logic in Computer Science · Computer Science 2024-09-19 Davide Barbarossa

The culmination of the papers (arXiv:0905.0518, arXiv:0910.0909) was a proof of the norm convergence in $L^2(\mu)$ of the quadratic nonconventional ergodic averages \frac{1}{N}\sum_{n=1}^N(f_1\circ T_1^{n^2})(f_2\circ…

Dynamical Systems · Mathematics 2010-05-25 Tim Austin

A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be expanded into a set of resource proof-structures: its Taylor expansion. We introduce a new criterion characterizing those sets of resource proof-structures that are…

Logic in Computer Science · Computer Science 2019-10-18 Giulio Guerrieri , Luc Pellissier , Lorenzo Tortora de Falco

In \cite{Kramer11} Kramer proves for a large class of semisimple Lie groups that they admit just one locally compact $\sigma$-compact Hausdorff topology compatible with the group operations. We present two different methods of generalising…

Group Theory · Mathematics 2014-11-06 Rupert McCallum

The computational complexity of time-dependent perturbation theory is well-known to be largely combinatorial whatever the chosen expansion method and family of parameters (combinatorial sequences, Goldstone and other Feynman-type…

Strongly Correlated Electrons · Physics 2010-07-26 Christian Brouder , Ângela Mestre , Frédéric Patras

Let $\mathcal{R}$ be an expansion of the ordered real additive group. When $\mathcal{R}$ is o-minimal, it is known that either $\mathcal{R}$ defines an ordered field isomorphic to $(\mathbb{R},<,+,\cdot)$ on some open subinterval…

Logic · Mathematics 2021-03-09 Philipp Hieronymi , Erik Walsberg

Germs of tubular neighborhood embeddings for submanifolds N of manifolds M are in one-one correspondence with germs of Euler-like vector fields near N. In many contexts, this reduces the proof of `normal forms results' for geometric…

Differential Geometry · Mathematics 2024-11-28 Eckhard Meinrenken

Motivated by some alternatives to the classical logical model of boolean algebra, this paper deals with algebraic structures which extend skew lattices by locally invertible elements. Following the meme of the Ehresmann-Schein-Nambooripad…

Group Theory · Mathematics 2021-01-07 D. G. FitzGerald

In this paper we establish a Taylor-like expansion in the context of the rough path theory for a family of It ^{o} maps indexed by a small parameter. We treat not only the case that the roughness $p$ satisfies $[p]=2$, but also the case…

Probability · Mathematics 2010-04-12 Yuzuru Inahama

Based on the Taylor expansion, we propose a renormalization method for asymptotic analysis. The standard renormalization group (RG) method for asymptotic analysis can be derived out from this new method, and hence the mathematical essence…

Mathematical Physics · Physics 2016-05-11 Cheng-shi Liu

The Taylor expansion is a widely used and powerful tool in all branches of Mathematics, both pure and applied. In Probability and Mathematical Statistics, however, a stronger version of Taylor's classical theorem is often needed, but only…

Other Statistics · Statistics 2023-05-09 Gianluca Viggiano

We introduce the notion of \emph{topo-symmetric extensions} of topological groups, a new generalization of classical group extensions that incorporates both topological and symmetry constraints. We define morphisms between such extensions,…

General Mathematics · Mathematics 2025-10-02 Es-said En-naoui

We discuss a generalization of Clifford algebras known as generalized Clifford algebras (in particular, ternary Clifford algebras). In these objects, we have a fixed higher-degree form (in particular, a ternary form) instead of a quadratic…

Mathematical Physics · Physics 2025-06-10 D. S. Shirokov

Using an algebraic point of view we present an introduction to the groupoid theory, that is, we give fundamental properties of groupoids as, uniqueness of inverses and properties of the identities, and study subgroupoids, wide subgroupoids…

Group Theory · Mathematics 2020-01-29 Jesús Ávila , Víctor Marín , Héctor Pinedo

We present a framework for the formal meta-theory of lambda calculi in first-order syntax, with two sorts of names, one to represent both free and bound variables, and the other for constants, and by using Stoughton's multiple…

Logic in Computer Science · Computer Science 2023-03-24 Sebastián Urciuoli

Herbrand's theorem is one of the most fundamental insights in logic. From the syntactic point of view it suggests a compact representation of proofs in classical first- and higher-order logic by recording the information which instances…

Logic in Computer Science · Computer Science 2013-08-05 Stefan Hetzl , Daniel Weller