精益计算多项式的第一步

arXiv - CS - Symbolic Computation Pub Date : 2024-08-08 DOI:arxiv-2408.04564

James Harold Davenport

{"title":"精益计算多项式的第一步","authors":"James Harold Davenport","doi":"arxiv-2408.04564","DOIUrl":null,"url":null,"abstract":"The proof assistant Lean has support for abstract polynomials, but this is\nnot necessarily the same as support for computations with polynomials. Lean is\nalso a functional programming language, so it should be possible to implement\ncomputational polynomials in Lean. It turns out not to be as easy as the naive\nauthor thought.","PeriodicalId":501033,"journal":{"name":"arXiv - CS - Symbolic Computation","volume":"58 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"First steps towards Computational Polynomials in Lean\",\"authors\":\"James Harold Davenport\",\"doi\":\"arxiv-2408.04564\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The proof assistant Lean has support for abstract polynomials, but this is\\nnot necessarily the same as support for computations with polynomials. Lean is\\nalso a functional programming language, so it should be possible to implement\\ncomputational polynomials in Lean. It turns out not to be as easy as the naive\\nauthor thought.\",\"PeriodicalId\":501033,\"journal\":{\"name\":\"arXiv - CS - Symbolic Computation\",\"volume\":\"58 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Symbolic Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.04564\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Symbolic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.04564","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

精益证明助手支持抽象多项式，但这并不一定等同于支持多项式计算。精益也是一种函数式编程语言，因此在精益中实现多项式计算应该是可能的。事实证明，这并不像天真的作者想象的那么容易。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

First steps towards Computational Polynomials in Lean

The proof assistant Lean has support for abstract polynomials, but this is not necessarily the same as support for computations with polynomials. Lean is also a functional programming language, so it should be possible to implement computational polynomials in Lean. It turns out not to be as easy as the naive author thought.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - CS - Symbolic Computation

自引率

0.00%

发文量

期刊最新文献

Synthesizing Evolving Symbolic Representations for Autonomous Systems Introducing Quantification into a Hierarchical Graph Rewriting Language Towards Verified Polynomial Factorisation Symbolic Regression with a Learned Concept Library Active Symbolic Discovery of Ordinary Differential Equations via Phase Portrait Sketching