Related papers: Alpha-conversion for lambda terms with explicit we…
We develop a linear-algebraic framework for dimensional analysis in systems with constraints, particularly when variables are numerous or related by implicit relations so that direct elimination is impractical. By expressing both…
In this paper, we present an explicit substitution calculus which distinguishes between ordinary bound variables and meta-variables. Its typing discipline is derived from contextual modal type theory. We first present a dependently typed…
We introduce a transformation of linear Pfaffian systems, which we call the middle Laplace transform, as a formulation of the Laplace transform from the perspective of Katz theory. While the definition of the middle Laplace transform is…
The lambda-calculus is a peculiar computational model whose definition does not come with a notion of machine. Unsurprisingly, implementations of the lambda-calculus have been studied for decades. Abstract machines are implementations…
We introduce a method to evaluate untyped lambda terms by combining the theory of traversals, a term-tree traversing technique inspired from Game Semantics, with judicious use of the eta-conversion rule of the lambda calculus. The traversal…
Implicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of com-putation, and by internalizing the bounds rather than using external measure. We survey how automata theory…
Implicit variables of a mathematical program are variables which do not need to be optimized but are used to model feasibility conditions. They frequently appear in several different problem classes of optimization theory comprising bilevel…
We show that by adding suitable lower-order terms to the Z4 formulation of the Einstein equations, all constraint violations except constant modes are damped. This makes the Z4 formulation a particularly simple example of a lambda-system as…
In functional programming, point-free relation calculi have been fruitful for general theories of program construction, but for specific applications pointwise expressions can be more convenient and comprehensible. In imperative…
An infinite permutation $\alpha$ is a linear ordering of $\mathbb N$. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this…
We study the lambda-mu-calculus, extended with explicit substitution, and define a compositional output-based interpretation into a variant of the pi-calculus with pairing that preserves single-step explicit head reduction with respect to…
We perform an asymptotic evaluation of the Hankel transform, $\int_0^{\infty}J_{\nu}(\lambda x) f(x)\mathrm{d}x$, for arbitrarily large $\lambda$ of an entire exponential type function, $f(x)$, of type $\tau$ by shifting the contour of…
Functional ANOVA offers a principled framework for interpretability by decomposing a model's prediction into main effects and higher-order interactions. For independent features, this decomposition is well-defined, strongly linked with SHAP…
A copula of continuous random variables $X$ and $Y$ is called an \emph{implicit dependence copula} if there exist functions $\alpha$ and $\beta$ such that $\alpha(X) = \beta(Y)$ almost surely, which is equivalent to $C$ being factorizable…
We give closed-form expressions for the Dirichlet beta function at even positive integers and for the Dirichlet lambda function at odd positive integers, based on the function J(s) defined via convergent integral. We also show fundamental…
We describe an exact sampler for a simply-typed, first-order functional programming language. Given an acyclic finite automaton, $\alpha_{\varnothing}$, it samples a random function uniformly without replacement from well-typed functions in…
Dependently typed lambda calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types" notion, such calculi can also encode the correspondence between…
This paper establishes an explicit $L^2$-estimate for weak solutions $u$ to linear elliptic equations in divergence form with general coefficients and external source term $f$, stating that the $L^2$-norm of $u$ over $U$ is bounded by a…
Lambda-calculi come with no fixed evaluation strategy. Different strategies may then be considered, and it is important that they satisfy some abstract rewriting property, such as factorization or normalization theorems. In this paper we…
Let $A$ be a commutative Banach algebra with non-empty character space $\Delta(A)$. In this paper, we change the concepts of convergence and boundedness in the classical notion of bounded approximate identity. This work give us a new kind…