相关论文: Definable functions in the simply typed lambda-cal…
This paper presents the Functional Machine Calculus (FMC) as a simple model of higher-order computation with "reader/writer" effects: higher-order mutable store, input/output, and probabilistic and non-deterministic computation. The FMC…
The Eremenko-Lyubich class consists of transcendental entire functions with bounded singular set and the Speiser class is made up of functions with a finite singular set. In an earlier paper "Models for the Eremenko-Lyubich class" I gave a…
The formal system lambda-delta is a typed lambda calculus that pursues the unification of terms, types, environments and contexts as the main goal. lambda-delta takes some features from the Automath-related lambda calculi and some from the…
We give a formula for $f(\eta)$, where $f :\mathbb C \to \mathbb C$ is a continuously differentiable function satisfying $f(\bar z) = \overline{f(z)}$, and $\eta$ is a dual quaternion. Note this formula is straightforward or well known if…
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…
Probabilistic circuits compute multilinear polynomials that represent multivariate probability distributions. They are tractable models that support efficient marginal inference. However, various polynomial semantics have been considered in…
We say that a function is rare-case hard against a given class of algorithms (the adversary) if all algorithms in the class can compute the function only on an $o(1)$-fraction of instances of size $n$ for large enough $n$. Starting from any…
In this paper, we present a general realizability semantics for the simply typed $\lambda\mu$-calculus. Then, based on this semantics, we derive both weak and strong normalization results for two versions of the $\lambda\mu$-calculus…
In this note, we are interested in the *-version of various special functions. Noting that many special functions are defined by integrals involving the exponential functions, we define *-special functions by similar integral formula…
For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…
We introduce the notion of $(\mathcal F,p)$-valent functions. We concentrate in our investigation on the case, where $\mathcal F$ is the class of polynomials of degree at most $s$. These functions, which we call $(s,p)$-valent functions,…
The paper defines polynomials in a bicategory $\mathscr{M}$. Polynomials in bicategories $\mathrm{Spn}\mathscr{C} \ $ of spans in a finitely complete category $\mathscr{C} \ $ agree with polynomials in $\mathscr{C} \ $ as defined by Nicola…
We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. We interpret the recursive types as information systems in a…
The lambda-cube is a famous pure type system (PTS) cube of eight powerful explicit type systems that include the simple, polymorphic and dependent type theories. The lambda-cube only types Strongly Normalising (SN) terms but not all of…
We study symmetries enjoyed by the polynomials enumerating non-degenerate flags in finite vector spaces, equipped with a non-degenerate alternating bilinear, hermitian or quadratic form. To this end we introduce Igusa-type rational…
A formula for calculating Extensions of (mainly integral) Polynomial Functors is established, based upon projective resolutions. Sample computations are performed, which, in particular, exhibit a surprising non-trivial extension of Divided…
We define a switch function to be a function from an interval to $\{1,-1\}$ with a finite number of sign changes. (Special cases are the Walsh functions.) By a topological argument, we prove that, given $n$ real-valued functions, $f_1,…
We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions, i.e., multivariate functions over the ring of integers modulo $d$, and investigate some of their structural properties. We also point out…
In this paper, we introduce new classes of functions that extend the known classes of functions of complex variable, such as entire functions, meromorphic functions, rational functions and polynomial functions and take values in the set of…