Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTheory Presentation Combinators
113
0
0.0
(
0
)
Added by
Jacques Carette
Publication date
2012
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We motivate and give semantics to theory presentation combinators as the foundational building blocks for a scalable library of theories. The key observation is that the category of contexts and fibered categories are the ideal theoretical tools for this purpose.
rate research
Read More
To build a large library of mathematics, it seems more efficient to take advantage of the inherent structure of mathematical theories. Various theory presentation combinators have been proposed, and some have been implemented, in both legacy and current systems. Surprisingly, the ``standard library of most systems do not make pervasive use of these combinators. We present a set of combinators optimized for reuse, via the tiny theories approach. Our combinators draw their power from the inherent structure already present in the emph{category of contexts} associated to a dependently typed language. The current work builds on ideas originating in CLEAR and Specware and their descendents (both direct and intellectual). Driven by some design criteria for user-centric library design, our library-building experience via the systematic use of combinators has fed back into the semantics of these combinators, and later into an updated syntax for them.
We introduce two new packages, Nemo and Hecke, written in the Julia programming language for computer algebra and number theory. We demonstrate that high performance generic algorithms can be implemented in Julia, without the need to resort to a low-level C implementation. For specialised algorithms, we use Julias efficient native C interface to wrap existing C/C++ libraries such as Flint, Arb, Antic and Singular. We give examples of how to use Hecke and Nemo and discuss some algorithms that we have implemented to provide high performance basic arithmetic.
We present some of the experiments we have performed to best test our design for a library for MathScheme, the mechanized mathematics software system we are building. We wish for our library design to use and reflect, as much as possible, the mathematical structure present in the objects which populate the library.
The computation of Feynman integrals often involves square roots. One way to obtain a solution in terms of multiple polylogarithms is to rationalize these square roots by a suitable variable change. We present a program that can be used to find such transformations. After an introduction to the theoretical background, we explain in detail how to use the program in practice.
In this paper, we report on an implementation in the free software Mathemagix of lacunary factorization algorithms, distributed as a library called Lacunaryx. These algorithms take as input a polynomial in sparse representation, that is as a list of nonzero monomials, and an integer $d$, and compute its irreducible degree-$le d$ factors. The complexity of these algorithms is polynomial in the sparse size of the input polynomial and $d$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
