foetus - 简单功能程序的终止检查程序

arXiv - CS - Programming Languages Pub Date : 2024-07-09 DOI:arxiv-2407.06924

Andreas Abel

{"title":"foetus - 简单功能程序的终止检查程序","authors":"Andreas Abel","doi":"arxiv-2407.06924","DOIUrl":null,"url":null,"abstract":"We introduce a simple functional language foetus (lambda calculus with\ntuples, constructors and pattern matching) supplied with a termination checker.\nThis checker tries to find a well-founded structural order on the parameters on\nthe given function to prove termination. The components of the check algorithm\nare: function call extraction out of the program text, call graph completion\nand finding a lexical order for the function parameters.","PeriodicalId":501197,"journal":{"name":"arXiv - CS - Programming Languages","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"foetus - Termination Checker for Simple Functional Programs\",\"authors\":\"Andreas Abel\",\"doi\":\"arxiv-2407.06924\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce a simple functional language foetus (lambda calculus with\\ntuples, constructors and pattern matching) supplied with a termination checker.\\nThis checker tries to find a well-founded structural order on the parameters on\\nthe given function to prove termination. The components of the check algorithm\\nare: function call extraction out of the program text, call graph completion\\nand finding a lexical order for the function parameters.\",\"PeriodicalId\":501197,\"journal\":{\"name\":\"arXiv - CS - Programming Languages\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Programming Languages\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2407.06924\",\"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 - Programming Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.06924","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们介绍了一种带有终止检查程序的简单函数式语言胎儿（带有元组、构造函数和模式匹配的 lambda 微积分），该检查程序试图为给定函数的参数找到有理有据的结构顺序，以证明终止。检查算法的组成部分包括：从程序文本中提取函数调用、完成调用图和查找函数参数的词法顺序。

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

查看原文

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

本刊更多论文

foetus - Termination Checker for Simple Functional Programs

We introduce a simple functional language foetus (lambda calculus with tuples, constructors and pattern matching) supplied with a termination checker. This checker tries to find a well-founded structural order on the parameters on the given function to prove termination. The components of the check algorithm are: function call extraction out of the program text, call graph completion and finding a lexical order for the function parameters.

求助全文

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

来源期刊

arXiv - CS - Programming Languages

自引率

0.00%

发文量

期刊最新文献

Repr Types: One Abstraction to Rule Them All $μλεδ$-Calculus: A Self Optimizing Language that Seems to Exhibit Paradoxical Transfinite Cognitive Capabilities Expressing and Analyzing Quantum Algorithms with Qualtran Conversational Concurrency The MLIR Transform Dialect. Your compiler is more powerful than you think