Related papers: Higher-Order Recursion Abstraction: How to Make Ac…

We introduce a class of convolutions on arithmetical functions that are regular in the sense of of Narkiewicz, homogeneous in the sense of Burnett et al, and bounded, in the sense that there exists a common finite bound for the rank of…

In David Schmidt's PhD work he explored the use of denotational semantics as a programming language. It was part of an effort to not only treat formal semantics as specifications but also as interpreters and input to compiler generators.…

The free energy of a field theory can be considered as a functional of the free correlation function. As such it obeys a nonlinear functional differential equation which can be turned into a recursion relation. This is solved order by order…

A central method for analyzing the asymptotic complexity of a functional program is to extract and then solve a recurrence that expresses evaluation cost in terms of input size. The relevant notion of input size is often specific to a…

We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…

Abstraction is a core tenet of human cognition and communication. When composing natural language instructions, humans naturally evoke abstraction to convey complex procedures in an efficient and concise way. Yet, interpreting and grounding…

Abstraction logic is a new logic, serving as a foundation of mathematics. It combines features of both predicate logic and higher-order logic: abstraction logic can be viewed both as higher-order logic minus static types as well as…

A new recursive procedure to compute the Zassenhaus formula up to high order is presented, providing each exponent in the factorization directly as a linear combination of independent commutators and thus containing the minimum number of…

In this paper we give a new foundational, categorical formulation for operations and relations and objects parameterizing them. This generalizes and unifies the theory of operads and all their cousins including but not limited to PROPs,…

Many possible definitions have been proposed for fractional derivatives and integrals, starting from the classical Riemann-Liouville formula and its generalisations and modifying it by replacing the power function kernel with other kernel…

This paper continues the study of combinatorial properties of binary functions --- that is, functions $f:2^E\rightarrow\mathbb{C}$ such that $f(\emptyset)=1$, where $E$ is a finite set. Binary functions have previously been shown to admit…

In this paper we introduce reproducing kernel Hilbert spaces of polyanalytic functions of infinite order. First we study in details the counterpart of the Fock space and related results in this framework. In this case the kernel function is…

Canonical coordinates for both the Schroedinger and the nonlinear Schroedinger equations are introduced, making more transparent their Hamiltonian structures. It is shown that the Schroedinger equation, considered as a classical field…

The strong recurrence is equivalent to the Riemann hypothesis. On the other hand, the generalized strong recurrence holds for any irrational number. In this paper, we show the generalized strong recurrence for all non-zero rational numbers.…

Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers. In this context the…

Humans have a remarkable ability to rapidly generalize to new tasks that is difficult to reproduce in artificial learning systems. Compositionality has been proposed as a key mechanism supporting generalization in humans, but evidence of…

This paper sets the groundwork for the consideration of families of recursively defined polynomials and rational functions capable of describing the Bernoulli numbers. These families of functions arise from various recursive definitions of…

It is well known that general recursion cannot be expressed within Martin-Loef's type theory and various approaches have been proposed to overcome this problem still maintaining the termination of the computation of the typable terms. In…

Backpropagation is a classic automatic differentiation algorithm computing the gradient of functions specified by a certain class of simple, first-order programs, called computational graphs. It is a fundamental tool in several fields, most…

A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse…