相关论文: A General Type for Storage Operators
Step-indexed semantic models of types were proposed as an alternative to purely syntactic safety proofs using subject-reduction. Building upon the work by Appel and others, we introduce a generalized step-indexed model for the call-by-name…
Several approaches to the formulation of a fractional theory of calculus of "variable order" have appeared in the literature over the years. Unfortunately, most of these proposals lack a rigorous mathematical framework. We consider an…
This paper studies emulation of induction by coinduction in a call-by-name language with control operators. Since it is known that call-by-name programming languages with control operators cannot have general initial algebras, interaction…
We consider a general notion of timed automata with input-determined guards and show that they admit a robust logical framework along the lines of [D 'Souza03], in terms of a monadic second order logic characterisation and an expressively…
Let $E$ be the open unit disk $\{z\in \mathbb{C}: |z|<1\}$. Let $A$ be the class of analytic functions in $E$, which have the form $f(z)=z+a_2z^2+...$. We define operators $L_n^\sigma\colon A\to A$ using the convolution *. Using these…
An extension of the Super KdV integrable system in terms of operator valued functions is obtained. Following the ideas of Gardner, a general algebraic approach for finding the infinitely many conserved quantities of integrable systems is…
The calculus of Dependent Object Types (DOT) has enabled a more principled and robust implementation of Scala, but its support for type-level computation has proven insufficient. As a remedy, we propose $F^\omega_{..}$, a rigorous…
Linear dependent types allow to precisely capture both the extensional behaviour and the time complexity of lambda terms, when the latter are evaluated by Krivine's abstract machine. In this work, we show that the same paradigm can be…
In [1], an operator was introduced which acts parallel to the Riemann-Liouville differintegral on a transformation of the space of real analytic functions and commutes with itself. This paper aims to extend the technique - and its defining…
The operators of fractional calculus come in many different types, which can be categorised into general classes according to their nature and properties. We conduct a formal study of the class known as weighted fractional calculus and its…
We develop the fine structure theory of operator-premice. These are a generalization of standard premice, in which an abstract operator $F$ is used to form the successor steps in the internal hierarchy of the premouse, instead of Jensen's…
Solving analytic systems using inversion can be implemented in a variety of ways. One method is to use Lagrange inversion and variations. Here we present a different approach, based on dual vector fields. For a function analytic in a…
We introduce a class of operators on abstract measure spaces, which unifies the Calder\'on-Zygmund operators on spaces of homogeneous type, the maximal functions and the martingale transforms. We prove that such operators can be dominated…
We formally specified the type system and operational semantics of LOOPw with Ott and Isabelle/HOL proof assistant. Moreover, both the type system and the semantics of LOOPw have been tested using Isabelle/HOL program extraction facility…
We introduce an interleaving operational semantics for describing the client-observable behaviour of atomic transactions on distributed key-value stores. Our semantics builds on abstract states comprising centralised, global key-value…
In this paper, we present a categorical approach to learning automata over words, in the sense of the $L^*$-algorithm of Angluin. This yields a new generic $L^*$-like algorithm which can be instantiated for learning deterministic automata,…
We present alternative definitions of the first-order stable model semantics and its extension to incorporate generalized quantifiers by referring to the familiar notion of a reduct instead of referring to the SM operator in the original…
This article investigates a class of discrete nabla fractional operators by using the discrete nabla convolution theorem. Inspired by this, we define the discrete generalized nabla fractional sum and differences of Riemann-Liouville and…
In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the last two authors presented a combined language made of a (strongly normalizing) algebraic rewrite system and a typed lambda-calculus enriched by pattern-matching…
We define a variant of realizability where realizers are pairs of a term and a substitution. This variant allows us to prove the normalization of a simply-typed call-by-need $$\lambda$-$calculus with control due to Ariola et al. Indeed, in…