Related papers: $\lambda$-Scale, a lambda calculus for spaces with…
We examine the relationship between the algebraic lambda-calculus, a fragment of the differential lambda-calculus and the linear-algebraic lambda-calculus, a candidate lambda-calculus for quantum computation. Both calculi are algebraic:…
With the help of link diagrams with decorated crossings, I explain computations in emergent algebras, introduced in arXiv:0907.1520, as the kind of computations done in the front end visual system.
Time scales are a model of time, where the continuous and the discrete time cases are considered and merged into the same framework. In this paper some basic definitions of the time scale calculus are presented. Simultaneously, a package in…
Differential lambda-calculus was first introduced by Thomas Ehrhard and Laurent Regnier in 2003. Despite more than 15 years of history, little work has been done on a differential calculus with integration. In this paper, we shall propose a…
Basic elements of integral calculus over algebras of iterated differential forms, are presented. In particular, defining complexes for modules of integral forms are described and the corresponding berezinians and complexes of integral forms…
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…
It is investigated how two (standard or generalized) $\lambda-$symmetries of a given second-order ordinary differential equation can be used to solve the equation by quadratures. The method is based on the construction of two commuting…
We describe a type system for the linear-algebraic $\lambda$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $\lambda$-calculus: it is able to statically describe the linear combinations of terms…
In a recent paper, a realizability technique has been used to give a semantics of a quantum lambda calculus. Such a technique gives rise to an infinite number of valid typing rules, without giving preference to any subset of those. In this…
We exhibit an isomorphism of associative algebras between the $\operatorname{Ext}$-algebra $\operatorname{Ext}_\Lambda^\ast(\Delta,\Delta)$ of standard modules over the dual extension algebra $\Lambda$ of two directed algebras $B$ and $A$…
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affine variant of this logic. We prove that the (untyped) terms…
A comparison of Landin's form of lambda calculus with Church's shows that, independently of the lambda calculus, there exists a mechanism for converting functions with arguments indexed by variables to the usual kind of function where the…
Let $\Lambda$ be a lattice of rank $n$. A Lie algebra on the lattice $\Lambda$ is a Lie algebra ${\cal L}=\oplus_{\lambda\in\Lambda}\,{\cal L}_{\lambda}$ such that $\dim\,{\cal L}_\lambda=1$ for all $\lambda$. In this article, we classify…
We introduce a Curry-Howard correspondence for a large class of intermediate logics characterized by intuitionistic proofs with non-nested applications of rules for classical disjunctive tautologies (1-depth intermediate proofs). The…
We give a semantics for the lambda-calculus based on a topological duality theorem in nominal sets. A novel interpretation of lambda is given in terms of adjoints, and lambda-terms are interpreted absolutely as sets (no valuation is…
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 propose an implementation of lambda+, a recently introduced simply typed lambda-calculus with pairs where isomorphic types are made equal. The rewrite system of lambda+ is a rewrite system modulo an equivalence relation, which makes its…
Let $\Lambda$ be a basic finite dimensional algebra over an algebraically closed field, presented as a path algebra modulo relations; further, assume that $\Lambda$ is graded by lengths of paths. The paper addresses the classifiability, via…
We prove a version of the Euler-Lagrange equations for certain problems of the calculus of variations on time scales with higher-order delta derivatives.
We apply tilting theory over preprojective algebras $Lambda$ to a study of moduli space of $Lambda$-modules. We define the categories of semistable modules and give an equivalence, so-called reflection functors, between them by using…