PowerEpsilon中的程序派生

[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference Pub Date : 1992-09-21 DOI:10.1109/CMPSAC.1992.217567

M.-Y. Zhu, C.-W. Wang

{"title":"PowerEpsilon中的程序派生","authors":"M.-Y. Zhu, C.-W. Wang","doi":"10.1109/CMPSAC.1992.217567","DOIUrl":null,"url":null,"abstract":"The authors present a proof development system called PowerEpsilon, based on a constructive type theory which can be used as a formal program development system for deriving a program from a specification. PowerEpsilon is a polymorphic language based on Martin-Lof's type theory and the calculus of constructions. In PowerEpsilon, the concept of limit of type universe hierarchies and a scheme for inductive define types are introduced. The system can be used as both a programming language with a very rich set of data structures and a metalanguage for formalizing constructive mathematics. The system has been implemented. A programming exercise is given to show how the system works.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Program derivation in PowerEpsilon\",\"authors\":\"M.-Y. Zhu, C.-W. Wang\",\"doi\":\"10.1109/CMPSAC.1992.217567\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present a proof development system called PowerEpsilon, based on a constructive type theory which can be used as a formal program development system for deriving a program from a specification. PowerEpsilon is a polymorphic language based on Martin-Lof's type theory and the calculus of constructions. In PowerEpsilon, the concept of limit of type universe hierarchies and a scheme for inductive define types are introduced. The system can be used as both a programming language with a very rich set of data structures and a metalanguage for formalizing constructive mathematics. The system has been implemented. A programming exercise is given to show how the system works.<<ETX>>\",\"PeriodicalId\":286518,\"journal\":{\"name\":\"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPSAC.1992.217567\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1992.217567","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

作者提出了一个基于构造型理论的证明开发系统PowerEpsilon，它可以作为一个从规范导出程序的形式化程序开发系统。PowerEpsilon是一种基于Martin-Lof类型理论和构造演算的多态语言。在PowerEpsilon中，引入了类型域层次的极限概念和一种归纳定义类型的方案。该系统既可以作为具有非常丰富的数据结构集的编程语言，也可以作为形式化构造数学的元语言。系统已实现。给出了一个编程练习来展示系统是如何工作的。

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

查看原文本刊更多论文

Program derivation in PowerEpsilon

The authors present a proof development system called PowerEpsilon, based on a constructive type theory which can be used as a formal program development system for deriving a program from a specification. PowerEpsilon is a polymorphic language based on Martin-Lof's type theory and the calculus of constructions. In PowerEpsilon, the concept of limit of type universe hierarchies and a scheme for inductive define types are introduced. The system can be used as both a programming language with a very rich set of data structures and a metalanguage for formalizing constructive mathematics. The system has been implemented. A programming exercise is given to show how the system works.<>

求助全文

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

来源期刊

[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference

自引率

0.00%

发文量