Related papers: Multi types and reasonable space
In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite…
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…
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…
Cylindrical Algebraic Decomposition (CAD) was the first practical means for doing real quantifier elimination (QE), and is still a major method, with many improvements since Collins' original method. Nevertheless, its complexity is…
We propose a decision-theoretic framework for computational complexity, complementary to classical theory: moving from syntactic exactness (Turing / Shannon) to semantic simulability (Le Cam). While classical theory classifies problems by…
In principle, the local classification of spacetimes is always possible using the Cartan-Karlhede algorithm. However, in practice, the process of determining equivalence of two spacetimes is potentially computationally difficult or not at…
In this paper, we propose a feasible algorithm to give an explicit basis of the space of regular differential forms on the nonsingular projective model of any given plane algebraic curve. The algorithm is demonstrated for concrete examples,…
$\lambda$-Scale is an enrichment of lambda calculus which is adapted to emergent algebras. It can be used therefore in metric spaces with dilations.
Invariance under translation is exploited to efficiently simulate one-dimensional quantum lattice systems in the limit of an infinite lattice. Both the computation of the ground state and the simulation of time evolution are considered.
We study the homotopy types of certain spaces closely related to the spaces of algebraic (rational) maps from the $m$ dimensional real projective space into the $n$ dimensional complex projective space for $2\leq m\leq 2n$ (we conjecture…
Starting categorically, we give simple and precise models of equivariant classifying spaces. We need these models for work in progress in equivariant infinite loop space theory and equivariant algebraic K-theory, but the models are of…
We consider expanding vacuum spacetimes with a CMC foliation by compact spacelike hypersurfaces. Under scale invariant a priori geometric bounds (type-III), we show that there are arbitrarily large future time intervals that are modelled by…
In this paper we address important issues surrounding the choice of variables when performing a dynamical systems analysis of alternative theories of gravity. We discuss the advantages and disadvantages of compactifying the state space, and…
Tensor contraction operations in computational chemistry consume significant fractions of computing time on large-scale computing platforms. The widespread use of tensor contractions between large multi-dimensional tensors in describing…
We consider quantum computational models defined via a Lie-algebraic theory. In these models, specified initial states are acted on by Lie-algebraic quantum gates and the expectation values of Lie algebra elements are measured at the end.…
There are numerous examples of problems in symbolic algebra in which the required storage grows far beyond the limitations even of the distributed RAM of a cluster. Often this limitation determines how large a problem one can solve in…
The introduction of first-class type classes in the Coq system calls for re-examination of the basic interfaces used for mathematical formalization in type theory. We present a new set of type classes for mathematics and take full advantage…
This paper presents a logical approach to the translation of functional calculi into concurrent process calculi. The starting point is a type system for the {\pi}-calculus closely related to linear logic. Decompositions of intuitionistic…
Ground robots which are able to navigate a variety of terrains are needed in many domains. One of the key aspects is the capability to adapt to the ground structure, which can be realized through movable body parts coming along with…
This paper presents the extension from flat spacetime into curved spacetime of the area of theoretical investigation that has been known as topological gauge field theory. The extension here presented is based upon a new derivation of the…