加载中…
In this paper we give an algorithmic description of Freyd categories that subsumes and enhances the usual approach to finitely presented modules in computer algebra. The upshot is a constructive approach to finitely presented functors that only relies on a few basic algorithms.

生成讲解博客的中文版本

生成AI智能校验的中文版本