定义HOL中的递归函数

1991., International Workshop on the HOL Theorem Proving System and Its Applications Pub Date : 1991-08-28 DOI:10.1109/HOL.1991.596300

W. Ploegaerts, L. Claesen, H. Man

{"title":"定义HOL中的递归函数","authors":"W. Ploegaerts, L. Claesen, H. Man","doi":"10.1109/HOL.1991.596300","DOIUrl":null,"url":null,"abstract":"The limited support for defining recursive functions and generating induction schemes is a major shortcoming of the HOL system. In this paper, a theory of primitive recursive functions and a tool that minimizes the proof effort required for the definition of a wide class of primitive recursive functions are presented. Due to its jlezibility and degree of automation, this work offers a useful eztension of the HOL system.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Defining Recursive Functions In HOL\",\"authors\":\"W. Ploegaerts, L. Claesen, H. Man\",\"doi\":\"10.1109/HOL.1991.596300\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The limited support for defining recursive functions and generating induction schemes is a major shortcoming of the HOL system. In this paper, a theory of primitive recursive functions and a tool that minimizes the proof effort required for the definition of a wide class of primitive recursive functions are presented. Due to its jlezibility and degree of automation, this work offers a useful eztension of the HOL system.\",\"PeriodicalId\":213603,\"journal\":{\"name\":\"1991., International Workshop on the HOL Theorem Proving System and Its Applications\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1991., International Workshop on the HOL Theorem Proving System and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HOL.1991.596300\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HOL.1991.596300","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

对定义递归函数和生成归纳方案的有限支持是HOL系统的一个主要缺点。在这篇文章中，我们提出了一个原始递归函数的理论和一个工具，这个工具可以最大限度地减少定义一大类原始递归函数所需的证明工作量。由于其灵活性和自动化程度，这项工作为HOL系统提供了一个有用的扩展。

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

查看原文本刊更多论文

Defining Recursive Functions In HOL

The limited support for defining recursive functions and generating induction schemes is a major shortcoming of the HOL system. In this paper, a theory of primitive recursive functions and a tool that minimizes the proof effort required for the definition of a wide class of primitive recursive functions are presented. Due to its jlezibility and degree of automation, this work offers a useful eztension of the HOL system.

求助全文

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

来源期刊

1991., International Workshop on the HOL Theorem Proving System and Its Applications

自引率

0.00%

发文量