|
Program Systems: Theory and Applications, 2014, Volume 5, Issue 3, Pages 27–50
(Mi ps122)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Mathematical Foundations of Programming
On dependent types and intuitionism in programming mathematics
S. D. Meshveliani Program Systems Institute of RAS, Yaroslavskaya obl., Pereslavskii raion, s. Ves'kovo
Abstract:
It is discussed a practical possibility of a provable programming of mathematics basing of the approach of intuitionism, a language with dependent types, proof carrying code. This approach is illustrated with examples. The discourse bases on the experience of implementing in the Agda language of a certain small algebraic library including the arithmetic of a residue domain $R/(b)$ for an arbitrary Euclidean ring $R$. (in Russian)
Key words and phrases:
intuitionistic mathematics, algebra, dependent types, Coq, Agda, Haskell.
Citation:
S. D. Meshveliani, “On dependent types and intuitionism in programming mathematics”, Program Systems: Theory and Applications, 5:3 (2014), 27–50
Linking options:
https://www.mathnet.ru/eng/ps122 https://www.mathnet.ru/eng/ps/v5/i3/p27
|
Statistics & downloads: |
Abstract page: | 249 | Full-text PDF : | 177 | References: | 36 |
|