{"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}
引用次数: 12
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.<>
![[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference](/Content/css/sci/img/zetp.jpg)
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
