Related papers: Homogeneous Linear Calculus of Order 1 and a $\lam…
In this paper, we derive an optimal first-order Taylor-like formula. In a seminal paper [14], we introduced a new first-order Taylor-like formula that yields a reduced remainder compared to the classical Taylor's formula. Here, we relax the…
We define analogues of higher derivatives for $F_q$-linear functions over the field of formal Laurent series with coefficients in $F_q$. This results in a formula for Taylor coefficients of a $F_q$-linear holomorphic function, a definition…
This paper derives a way to express differentiable complex-valued functions as the sum of powers of $(1-e^{\lambda x})$, where $\lambda\in\mathbb{R}$, with an explicit formula for the remainder. This formulation is then used to associate an…
We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…
We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…
We propose a novel foundation for calculus that focuses on the notion of approximations while avoiding the use of limits altogether. Continuity is defined as approximation at a point, while differentiability is defined as approximation with…
The Fundamental Theorem of Integral Calculus links the integrand and its antiderivative via a simple first order differential equation. A numerical solution of this ode yields the antiderivative and hence the required integral. This…
We derive Taylor's Formula for conformable fractional derivatives. This is then employed to extend some recent and classical integral inequalities to the conformable fractional calculus, including the inequalities of Steffensen, Chebychev,…
With a view towards models of quantum computation and/or the interpretation of linear logic, we define a functional language where all functions are linear operators by construction. A small step operational semantic (and hence an…
Consider a sequence of real-valued functions of a real variable given by a homogeneous linear recursion with differentiable coefficients. We show that if the functions in the sequence are differentiable, then the sequence of derivatives…
Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the…
Perturbation or error bounds of functions have been of great interest for a long time. If the functions are differentiable, then the mean value theorem and Taylor's theorem come handy for this purpose. While the former is useful in…
We propose a way to unify two approaches of non-cloning in quantum lambda-calculi: logical and algebraic linearities. The first approach is to forbid duplicating variables, while the second is to consider all lambda-terms as…
A new method is presented for obtaining indefinite integrals of common special functions. The approach is based on a Lagrangian formulation of the general homogeneous linear ordinary differential equation of second order. A general integral…
Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…
In this article we show that hybrid type-logical grammars are a fragment of first-order linear logic. This embedding result has several important consequences: it not only provides a simple new proof theory for the calculus, thereby…
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…
We give an adequate, concrete, categorical-based model for Lambda-S, which is a typed version of a linear-algebraic lambda calculus, extended with measurements. Lambda-S is an extension to first-order lambda calculus unifying two approaches…
In this paper, we present an extension of $\lambda\mu$-calculus called $\lambda\mu^{++}$-calculus which has the following properties: subject reduction, strong normalization, unicity of the representation of data and thus confluence only on…
Many first-order equational theories, such as the theory of groups or boolean algebras, can be presented by a smaller set of axioms than the original one. Recent studies showed that a homological approach to equational theories gives us…