Related papers: An Introduction to the Clocked Lambda Calculus
System I is a simply-typed lambda calculus with pairs, extended with an equational theory obtained from considering the type isomorphisms as equalities. In this work we propose an extension of System I to polymorphic types, adding the…
These lectures review the classical Moebius-Lie geometry and recent work on its extension. The latter considers ensembles of cycles (quadrics), which are interconnected through conformal-invariant geometric relations (e.g. "to be…
Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…
We provide a characterisation of strongly normalising terms of the lambda-mu-calculus by means of a type system that uses intersection and product types. The presence of the latter and a restricted use of the type omega enable us to…
Classical oscillators of sextic and octic anharmonicities are solved analytically up to the linear power of \lambda (Anharmonic Constant) by using Taylor series method. These solutions exhibit the presence of secular terms which are summed…
We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations'…
We study the weak call-by-value $\lambda$-calculus as a model for computational complexity theory and establish the natural measures for time and space -- the number of beta-reductions and the size of the largest term in a computation -- as…
We investigate the relationship between finite terms in {\lambda}-letrec, the {\lambda}-calculus with letrec, and the infinite {\lambda}-terms they express. We say that a lambda-letrec term expresses a lambda-term if the latter can be…
In this note, analysis of time delay systems using Lambert W function approach is reassessed. A common canonical form of time delay systems is defined. We extended the recent results of [6] for second order into nth order system. The…
The classical quadratic Gauss sum can be thought of as an exponential sum attached to a quadratic form on a cyclic group. We introduce an equivariant version of Gauss sum for arbitrary finite quadratic forms, which is an exponential sum…
Many different types of fractional calculus have been defined, which may be categorised into broad classes according to their properties and behaviours. Two types that have been much studied in the literature are the Hadamard-type…
Manifold calculus is a form of functor calculus concerned with functors from some category of manifolds to spaces. A weakness in the original formulation is that it is not continuous in the sense that it does not handle well the natural…
Let $LA_{n}(\tau)$ be the length of the longest alternating subsequence of a uniform random permutation $\tau\in[n]$. Classical probabilistic arguments are used to rederive the asymptotic mean, variance and limiting law of $LA_{n}(\tau)$.…
We give an introduction to the Mathematica package Lambda, designed for calculating $\lambda$-brackets in both vertex algebras, and in SUSY vertex algebras. This is equivalent to calculating operator product expansions in two-dimensional…
Feynman's model of a quantum computer provides an example of a continuous-time quantum walk. Its clocking mechanism is an excitation of a basically linear chain of spins with occasional controlled jumps which allow for motion on a planar…
An extension of standard quantum mechanics is proposed in which the Newtonian time appearing as a parameter in the unitary evolution operator is replaced with the time shown by a `quantum clock'. Such a clock is defined by the following…
Using random variables as motivation, this paper presents an exposition of the formalisms developed by Rota and Taylor for the classical umbral calculus. A variety of examples are presented, culminating in several descriptions of sequences…
We study the interpretation of the lambda-calculus in a framework based on tropical mathematics, and we show that it provides a unifying framework for two well-developed quantitative approaches to program semantics: on the one hand program…
Formal transformations somehow resembling the usual derivative are surprisingly common in computer science, with two notable examples being derivatives of regular expressions and derivatives of types. A newcomer to this list is the…
Many calculi exist for modelling various features of object-oriented languages. Many of them are based on $\lambda$-calculus and focus either on statically typed class-based languages or dynamic prototype-based languages. We formalize…