|
Mathematical Foundations of Programming
Programming computer algebra with basing on constructive mathematics. Domains with factorization
S. D. Meshveliani Ailamazyan Program Systems Institute of Russian Academy of Sciences
Abstract:
The paper continues prevoius author publications on a constructive mathematics approach in computational algebra using a language with dependent types.
A constructive expression for the notion of a domain with factorization
to primes for a monoid and for a ring
possessing certain additionnal properties is obtained.
A way to achieve constructed machine-checked proofs
for theorems that relate the factorization notion
for domains of different kinds is discussed.
All the described methods and proofs are completely implemented as a working program written in the Agda functional language.
(In Russian).
Key words and phrases:
constructive mathematics, computer algebra, dependent types, functional programming, Agda.
Received: 26.11.2016 Accepted: 23.01.2017
Citation:
S. D. Meshveliani, “Programming computer algebra with basing on constructive mathematics. Domains with factorization”, Program Systems: Theory and Applications, 8:1 (2017), 3–46
Linking options:
https://www.mathnet.ru/eng/ps247 https://www.mathnet.ru/eng/ps/v8/i1/p3
|
|