Related papers: Alpha-conversion for lambda terms with explicit we…
I give a proof of the confluence of combinatory strong reduction that does not use the one of lambda-calculus. I also give simple and direct proofs of a standardization theorem for this reduction and the strong normalization of simply typed…
The application of automatic transformation processes during the formal development and optimization of programs can introduce encumbrances in the generated code that programmers usually (or presumably) do not write. An example is the…
We study models of quintessence consisting of a number of scalar fields coupled to several dark matter components. In the case of exponential potentials the scaling solutions can be described in terms of a single field. The corresponding…
We study Milner's lambda-calculus with partial substitutions. Particularly, we show confluence on terms and metaterms, preservation of \b{eta}-strong normalisation and characterisation of strongly normalisable terms via an intersection…
In the present paper, we establish three special $q$-Abel transformation formulae of $q$-series via the use of Abel's lemma on summation by parts. As direct applications, we set up the corresponding $q$-contiguous relations for three kinds…
Recent theoretical work on automatic differentiation (autodiff) has focused on characteristics such as correctness and efficiency while assuming that all derivatives are automatically generated by autodiff using program transformation, with…
In this paper we empirically evaluate biased methods for alpha-divergence minimization. In particular, we focus on how the bias affects the final solutions found, and how this depends on the dimensionality of the problem. We find that (i)…
In this paper we show that reversible analysis of logic languages by abstract interpretation can be performed without loss of precision by systematically refining abstract domains. The idea is to include semantic structures into abstract…
In this work we look at the original fractional calculus of variations problem in a somewhat different way. As a simple consequence, we show that a fractional generalization of a classical problem has a solution without any restrictions on…
The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching a la ML into a case analysis on constants and a commutation rule between case and application…
Let $(\mu_{\alpha})$ be a net of Radon sub-probability measures on the real line, and $(t_{\alpha})$ be a net in $]0,+\infty[$ converging to 0. Assuming that the generalized log-moment generating function $L(\lambda)$ exists for all…
Solving of regular equations via Arden's Lemma is folklore knowledge. We first give a concise algorithmic specification of all elementary solving steps. We then discuss a computational interpretation of solving in terms of coercions that…
We investigate a class of nominal algebraic Henkin-style models for the simply typed lambda-calculus in which variables map to names in the denotation and lambda-abstraction maps to a (non-functional) name-abstraction operation. The…
For a real number $0<\lambda<2$, we introduce a transformation $T_\lambda$ naturally associated to expansion in $\lambda$-continued fraction, for which we also give a geometrical interpretation. The symbolic coding of the orbits of…
We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.
The set of pure terms which are typable in the $\lambda$$\Pi$-calculus in a given context is not recursive. So there is no general type inference algorithm for the programming language Elf and, in some cases, some type information has to be…
A method is given for obtaining equivalence subgroups of a family of differential equations from the equivalence group of simpler equations of a similar form, but in which the arbitrary functions specifying the family element depend on…
The construction of generalized Backlund transformation for the $A_n$ Affine Toda hierarchy is proposed in terms of gauge transformation acting on the zero curvature representation. Such construction is based upon the graded structure of…
The Lorentz Transformations are derived without any linearity assumptions and without assuming that y and z coordinates transform in a Galilean manner. Status of the invariance of the speed of light is reduced from a foundation of the…
Prompted by an observation about the integral of exponential functions of the form $f(x)=\lambda e^{\alpha x}$, we investigate the possibility to exactly integrate families of functions generated from a given function by scaling or by…