{"title":"Confirmable Workflows in OSCAR","authors":"Michael Joswig, Lars Kastner, Benjamin Lorenz","doi":"arxiv-2404.06241","DOIUrl":null,"url":null,"abstract":"We discuss what is special about the reproducibility of workflows in computer\nalgebra. It is emphasized how the programming language Julia and the new\ncomputer algebra system OSCAR support such a reproducibility, and how users can\nbenefit for their own work.","PeriodicalId":501256,"journal":{"name":"arXiv - CS - Mathematical Software","volume":"25 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Mathematical Software","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2404.06241","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We discuss what is special about the reproducibility of workflows in computer
algebra. It is emphasized how the programming language Julia and the new
computer algebra system OSCAR support such a reproducibility, and how users can
benefit for their own work.