相关论文: A General Type for Storage Operators
We present an abstract machine that implements a full-reducing (a.k.a. strong) call-by-value strategy for pure $\lambda$-calculus. It is derived using Danvy et al.'s functional correspondence from Cr\'egut's KN by: (1) deconstructing KN to…
The main result of this paper is the construction of a new class of weight shifting operators, similar to the theta operators of arXiv:1902.10911, arXiv:1712.06969 and others, which are defined on the lower Ekedahl-Oort strata of the…
Historically the fractional calculus concept works an extended idea based on the question asked by Guillaume de L'H\^opital to Gottfried Wilhelm Leibniz in 1695 about the notation ${d^nf}/{dx^n}$ for the derivative operator "What if…
In this paper, approximation by means of algebraic polynomials of classes of functions defined by a generalised modulus of smoothness of operators of differentiation of these functions is considered. We give structural characteristics of…
Java's type system mostly relies on type checking augmented with local type inference to improve programmer convenience. We study global type inference for Featherweight Generic Java (FGJ), a functional Java core language. Given generic…
In this paper, we present a new class of operators, which we name to be $n$-Ritt operators. This produces a discrete analogue of $n$-sectorial operators and generalizes the notion of Ritt operators. We develop a $H^\infty$-functional…
Linear type systems need to keep track of how programs use their resources. The standard approach is to use context splits specifying how resources are (disjointly) split across subterms. In this approach, context splits redundantly echo…
In this article, for modelling numeral systems, the operator approach, which is introduced in [25], is generalized for a certain case. An example of such numeral systems is introduced and considered.
Pattern-matching programming is an example of a rule-based programming style developed in functional languages. This programming style is intensively used in dialects of ML but is restricted to algebraic data-types. This restriction limits…
We study the $q$-bracket operator of Bloch and Okounkov when applied to $f(\lambda)=\sum_{\lambda_i \in \lambda}g(\lambda_i)$ and $f(\lambda)=\sum_{\substack{\lambda_i \in \lambda \lambda_i \text{distinct} }}g(\lambda_i)$. We use these…
Strong call-by-need combines full normalization with the sharing discipline of lazy evaluation, yet no prior implementation achieved both simplicity and efficiency. We introduce RKNL, an abstract machine that realizes strong call-by-need…
A fertile field of research in theoretical computer science investigates the representation of general recursive functions in intensional type theories. Among the most successful approaches are: the use of wellfounded relations,…
Tilting theory has been a very important tool in the classification of finite dimensional algebras of finite and tame representation type, as well as, in many other branches of mathematics. Happel [Ha] proved that generalized tilting…
We present an extension of the second-order logic AF2 with iso-style inductive and coinductive definitions specifically designed to extract programs from proofs a la Krivine-Parigot by means of primitive (co)recursion principles. Our logic…
Let $\mathcal{A}$ denote the operator class in which every nonzero intertwiner between two operators in $\mathcal{A}$ has dense range. Utilizing the operators in $\mathcal{A}$ as atoms and the flag structure as connection, we introduce an…
In this paper, we present the definitions and some properties of the general fractional integrals (GFIs) and general fractional derivatives (GFDs) of a function f(x) with respect to another function g(x). Examples of special cases of…
In this work we define operator-valued Fourier transforms for suitable integrable elements with respect to the Plancherel weight of a (not necessarily Abelian) locally compact group. Our main result is a generalized version of the Fourier…
We extend the theory of distributional kernel operators to a framework of generalized functions, in which they are replaced by integral kernel operators. Moreover, in contrast to the distributional case, we show that these generalized…
We introduce generalized filtration with which we can represent situations such as some agents forget information at some specific time. The filtration is defined as a functor to a category Prob whose objects are all probability spaces and…
The contribution of this article is a data concept that is essentially based on the two concepts of information and computable functionality. In short, data is viewed as typed information. A data type is defined as a pair of a set of…