{"title":"递归程序之间的操作和语义等价。","authors":"J. Raoult, J. Vuillemin","doi":"10.1145/800133.804334","DOIUrl":null,"url":null,"abstract":"In this paper, we show that two widely different notions of program equivalence coincide for the language of recursive definitions with simplification rules. The first one is the now classical equivalence for fixed-point semantics. The other one is purely operational in nature and is much closer to a programmer's intuition of program equivalence.","PeriodicalId":313820,"journal":{"name":"Proceedings of the tenth annual ACM symposium on Theory of computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1978-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Operational and semantic equivalence between recursive programs.\",\"authors\":\"J. Raoult, J. Vuillemin\",\"doi\":\"10.1145/800133.804334\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we show that two widely different notions of program equivalence coincide for the language of recursive definitions with simplification rules. The first one is the now classical equivalence for fixed-point semantics. The other one is purely operational in nature and is much closer to a programmer's intuition of program equivalence.\",\"PeriodicalId\":313820,\"journal\":{\"name\":\"Proceedings of the tenth annual ACM symposium on Theory of computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1978-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the tenth annual ACM symposium on Theory of computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800133.804334\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the tenth annual ACM symposium on Theory of computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800133.804334","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Operational and semantic equivalence between recursive programs.
In this paper, we show that two widely different notions of program equivalence coincide for the language of recursive definitions with simplification rules. The first one is the now classical equivalence for fixed-point semantics. The other one is purely operational in nature and is much closer to a programmer's intuition of program equivalence.