HOL中的递归布尔函数

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

Flemming Andersen, K. D. Petersen

{"title":"HOL中的递归布尔函数","authors":"Flemming Andersen, K. D. Petersen","doi":"10.1109/HOL.1991.596301","DOIUrl":null,"url":null,"abstract":"The HOL system supports mechanized verification of specifications in polymorphic Higher Order Logic. Ht3L has facilities for defining primitive recursive fuiactions, but no support for defining functions that are not primitive recursive. This paper presents a package for defining recursive boolean functions in HOL as the minimal or maximal fixed point of a boolean function transformer. The implt?mentation of the package is based on the results on fixed points in complete lattices by Tarski. Two examples on how to use the package are given. Both examples describe the definition of recursive botolean functions for specifying properties of parallel pnograms.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"193 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Recursive Boolean Functions In HOL\",\"authors\":\"Flemming Andersen, K. D. Petersen\",\"doi\":\"10.1109/HOL.1991.596301\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The HOL system supports mechanized verification of specifications in polymorphic Higher Order Logic. Ht3L has facilities for defining primitive recursive fuiactions, but no support for defining functions that are not primitive recursive. This paper presents a package for defining recursive boolean functions in HOL as the minimal or maximal fixed point of a boolean function transformer. The implt?mentation of the package is based on the results on fixed points in complete lattices by Tarski. Two examples on how to use the package are given. Both examples describe the definition of recursive botolean functions for specifying properties of parallel pnograms.\",\"PeriodicalId\":213603,\"journal\":{\"name\":\"1991., International Workshop on the HOL Theorem Proving System and Its Applications\",\"volume\":\"193 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"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.596301\",\"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.596301","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

HOL系统支持多态高阶逻辑规范的机械化验证。html具有定义基本递归函数的功能，但不支持定义非基本递归函数。本文给出了一个定义HOL中递归布尔函数为布尔函数变换器的最小不动点或最大不动点的包。implt吗?包的构造是基于Tarski关于完全格中不动点的结果。给出了如何使用该包的两个示例。两个例子都描述了用于指定并行图的性质的递归肉塔尔函数的定义。

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

查看原文本刊更多论文

Recursive Boolean Functions In HOL

The HOL system supports mechanized verification of specifications in polymorphic Higher Order Logic. Ht3L has facilities for defining primitive recursive fuiactions, but no support for defining functions that are not primitive recursive. This paper presents a package for defining recursive boolean functions in HOL as the minimal or maximal fixed point of a boolean function transformer. The implt?mentation of the package is based on the results on fixed points in complete lattices by Tarski. Two examples on how to use the package are given. Both examples describe the definition of recursive botolean functions for specifying properties of parallel pnograms.

求助全文

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

来源期刊

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

自引率

0.00%

发文量