Related papers: Preservation of Strong Normalisation modulo permut…
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…
A useful sampling-reconstruction model should be stable with respect to different kind of small perturbations, regardless whether they result from jitter, measurement errors, or simply from a small change in the model assumptions. In this…
We study the regularization and renormalization of the Yang-Mills theory in the framework of the manifestly invariant formalism, which consists of a higher covariant derivative with an infinitely many Pauli-Villars fields. Unphysical…
We study solvable deformations of two-dimensional quantum field theories driven by a bilinear operator constructed from a pair of conserved $U(1)$ currents $J^a$. We propose a quantum formulation of these deformations, based on the gauging…
We continue studying regularization scheme dependence of the $\mathcal{N}=2$ supersymmetric sigma models. In the present work the previous result for the four loop $\beta$-function is extended to the five loop order. Namely, we find the…
The Functional Machine Calculus (FMC), recently introduced by the authors, is a generalization of the lambda-calculus which may faithfully encode the effects of higher-order mutable store, I/O and probabilistic/non-deterministic input.…
The Functional Machine Calculus (FMC, Heijltjes 2022) extends the lambda-calculus with the computational effects of global mutable store, input/output, and probabilistic choice while maintaining confluent reduction and simply-typed strong…
We present the system $\mathtt{d}$, an extended type system with lambda-typed lambda-expressions. It is related to type systems originating from the Automath project. $\mathtt{d}$ extends existing lambda-typed systems by an existential…
Formalising the pi-calculus is an illuminating test of the expressiveness of logical frameworks and mechanised metatheory systems, because of the presence of name binding, labelled transitions with name extrusion, bisimulation, and…
We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive…
In this paper we briefly summarize the contents of Manzonetto's PhD thesis which concerns denotational semantics and equational/order theories of the pure untyped lambda-calculus. The main research achievements include: (i) a general…
Modern programming frequently requires generalised notions of program equivalence based on a metric or a similar structure. Previous work addressed this challenge by introducing the notion of a V-equation, i.e. an equation labelled by an…
We present a powerful method to generate various equations which possess the Lax representations on noncommutative (1+1) and (1+2)-dimensional spaces. The generated equations contain noncommutative integrable equations obtained by using the…
We study the space of Lie algebras equipped with left-invariant complex structures, $\mathcal{L}_{ J_{\tiny{\mbox{cn}}} }(\mathbb{R}^{2n}) $, with particular attention to their degenerations and deformations. To this end, we identify…
This paper introduces a new term rewriting system that is similar to the embedded read-back mechanism for interaction nets presented in our previous work, but is easier to follow than in the original setting and thus to analyze its…
In this paper we consider perturbation theory in generic two-dimensional sigma models in the so-called first-order formalism, using the coordinate regularization approach. Our goal is to analyze the first-order formalism in application to…
We define a notion of model for the $\lambda$$\Pi$-calculus modulo theory and prove a soundness theorem. We then define a notion of super-consistency and prove that proof reduction terminates in the $\lambda$$\Pi$-calculus modulo any…
The resource calculus is an extension of the lambda-calculus allowing to model resource consumption. It is intrinsically non-deterministic and has two general notions of reduction - one parallel, preserving all the possible results as a…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
We propose a decomposition framework for the parallel optimization of the sum of a differentiable function and a (block) separable nonsmooth, convex one. The latter term is typically used to enforce structure in the solution as, for…