相关论文: Polymorphic type inference for the relational alge…

Theory of representations of universal algebra is a natural development of the theory of universal algebra. Morphism of the representation is the map that conserve the structure of the representation. Exploring of morphisms of the…

In this note, we investigate how different fundamental groups of presentations of a fixed algebra $A$ can be. For finitely many finitely presented groups $G_i$, we construct an algebra $A$ such that all $G_i$ appear as fundamental groups of…

Some notions of algebraic geometry can be defined for arbitrary varieties of algebras. This leads to universal algebraic geometry. The main idea of the presented theory is to consider interactions between algebra, logic and geometry in…

Given an ideal of forms in an algebra (polynomial ring, tensor algebra, exterior algebra, Lie algebra, bigraded polynomial ring), we consider the Hilbert series of the factor ring. We concentrate on the minimal Hilbert series, which is…

According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relational parametricity, introduced by Reynolds, is one possible…

This article deals with OLAP systems based on multidimensional model. The conceptual model we provide, represents data through a constellation (multi-facts) composed of several multi-hierarchy dimensions. In this model, data are displayed…

A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…

Lexical semantic typology has identified important cross-linguistic generalizations about the variation and commonalities in polysemy patterns---how languages package up meanings into words. Recent computational research has enabled…

The expression problem describes a fundamental tradeoff between two types of extensibility: extending a type with new operations, such as by pattern matching on an algebraic data type in functional programming, and extending a type with new…

We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…

Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…

This article discuss a class of tractable model in the form of polynomial type.

Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…

We consider algebras over a field K, generated by two variables x and y subject to the single relation yx = qxy + ax + by + c for q in K^* and a, b, c in K. We prove, that among such algebras there are precisely five isomorphism classes.…

The Algebraic lambda-calculus and the Linear-Algebraic lambda-calculus extend the lambda-calculus with the possibility of making arbitrary linear combinations of terms. In this paper we provide a fine-grained, System F-like type system for…

The notion of associativity (which differs from the straightforward generalization of the usual associativity given by the move of parentheses in the relevant expression) for operations of high arity is introduced. It is proved that the…

Type theories can be formalized using the intrinsically (hard) or the extrinsically (soft) typed style. In large libraries of type theoretical features, often both styles are present, which can lead to code duplication and integration…

Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…

We study extensions of standard description logics to the framework of polyadic modal logic. We promote a natural approach to such logics via general relation algebras that can be used to define operations on relations of all arities. As a…

In our previous paper an effective algorithm for inverting polynomial automorphisms was proposed. We extend its application to the case of formal power series over a field of arbitrary characteristic and illustrate the proposed approach…