Related papers: The Agda Universal Algebra Library, Part 2: Struct…
LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as proofs of correctness of decision procedures for LF's…
The present survey results from the will to reconcile two approaches to quantum probabilities: one rather physical and coming directly from quantum mechanics, the other more algebraic. The second leading idea is to provide a unified picture…
Dialgebras are generalizations of associative algebras which give rise to Leibniz algebras instead of Lie algebras. In this paper we study super dialgebras and Leibniz superalgebras, which are $\z_2$-graded dialgebras and Leibniz algebras.…
Module is effective representation of ring in Abelian group. Linear map of module over commutative ring is morphism of corresponding representation. This definition is the main subject of the book. To consider this definition from more…
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…
Proof assistant software has recently been used to verify proofs of major theorems, yet even the libraries of some of the most prominent proof assistants lack much of undergraduate mathematics. In particular, the Agda proof assistant has no…
AuDaLa is a recently introduced programming language that follows the new data autonomous paradigm. In this paradigm, small pieces of data execute functions autonomously. Considering the paradigm and the design choices of AuDaLa, it is…
This paper describes a formal theory of smooth vector fields, Lie groups and the Lie algebra of a Lie group in the theorem prover Isabelle. Lie groups are abstract structures that are composable, invertible and differentiable. They are…
For the associative algebra $A(\mathfrak g)$ of an infinite-dimensional Lie algebra $\mathfrak g$, we introduce twisted fiber bundles over arbitrary compact topological spaces. Fibers of such bundles are given by elements of algebraic…
Linear algebra is a major field of numerical computation and is widely applied. Most linear algebra libraries (in most programming languages) do not statically guarantee consistency of the dimensions of vectors and matrices, causing runtime…
In this note we study associative dialgebras proving that the most interesting such structures arise precisely when the algebra is not semiprime. In fact the presence of some "perfection" property (simpleness, primitiveness, primeness or…
Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic…
We establish a direct connection between the representation theories of Lie algebras and Lie superalgebras (of type A) via Fock space reformulations of their Kazhdan-Lusztig theories. As a consequence, the characters of finite-dimensional…
We say that there is a representation of the universal algebra B in the universal algebra A if the set of endomorphisms of the universal algebra A has the structure of universal algebra B. Therefore, the role of representation of the…
The primary goal of this paper is to present a unified way to transform the syntax of a logic system into certain initial algebraic structure so that it can be studied algebraically. The algebraic structures which one may choose for this…
This paper presents aplib, a Java library for programming intelligent agents, featuring BDI and multi agency, but adding on top of it a novel layer of tactical programming inspired by the domain of theorem proving. Aplib is also implemented…
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and their proofs. Such calculi can also be given a logic…
We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is inspired from proof…
Let $\mathfrak{g}$ and $\mathfrak{h}$ be two Lie algebras with $\mathfrak{h}$ finite dimensional and consider ${\mathcal A} = {\mathcal A} (\mathfrak{h}, \, \mathfrak{g})$ to be the corresponding universal algebra as introduced in…
We present a formalization of constructive affine schemes in the Cubical Agda proof assistant. This development is not only fully constructive and predicative, it also makes crucial use of univalence. By now schemes have been formalized in…