EUVIMEDEUVIMED entdecken
Crossref

PROOF-CARRYING PROGRAMMING: GCD OF POLYNOMIALS

S. D. MESHVELIANI

Программирование / Programming and Computer Software · 2025 · (6) · 72

DOI: 10.7868/s3034584725060051 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Программирование / Programming and Computer Software, 2025. Verfasst von S. D. MESHVELIANI.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This document briefly discusses the current development status of the computational algebra library DoCon-A using the Agda language. Strictly speaking, Agda is an extension of the Haskell language with dependent types. In such a system, computing programs are accompanied by formal proofs of their most important properties (chosen by the programmer), and these proofs are automatically verified by the system. The next challenge is to construct a constructive proof program for the most general method of computing the GCD of multivariate polynomials. By default (in Agda), preference is given to constructive logic. However, in certain cases, it becomes necessary to use a suitable special case of the Law of Excluded Middle. The general method for GCD of polynomials turned out to be the first instance of violating the purity of constructivism in this project.

Zitieren

APA

MESHVELIANI, S. D. (2025). PROOF-CARRYING PROGRAMMING: GCD OF POLYNOMIALS. Программирование / Programming and Computer Software, 72. https://doi.org/10.7868/s3034584725060051

Vancouver

MESHVELIANI SD. PROOF-CARRYING PROGRAMMING: GCD OF POLYNOMIALS. Программирование / Programming and Computer Software. 2025:72. doi:10.7868/s3034584725060051

BibTeX
@article{MESHVELIANI2025,
  author = {MESHVELIANI, S. D.},
  title = {PROOF-CARRYING PROGRAMMING: GCD OF POLYNOMIALS},
  journal = {Программирование / Programming and Computer Software},
  year = {2025},
  number = {6},
  pages = {72},
  doi = {10.7868/s3034584725060051}
}
Kostenlos starten →