{"title":"并行对象的一个小演算","authors":"Kohei Honda, M. Tokoro","doi":"10.1145/127056.127079","DOIUrl":null,"url":null,"abstract":"This brief paper introduces a small anonymous formal system representing the core theory of concurrent object-based computing. Milner's π-calculus is its underlying formalism, but the original calculus is reinterpreted and reformulated to become a simple and powerful expression of concurrent object-based computing. We briefly describe its underlying computational framework, its syntax, transition rules, semantic equivalence, and its special properties concerning \"naming\", which makes this calculus unique among various concurrency formalisms.","PeriodicalId":135062,"journal":{"name":"OOPSLA/ECOOP '90","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":"{\"title\":\"A small calculus for concurrent objects\",\"authors\":\"Kohei Honda, M. Tokoro\",\"doi\":\"10.1145/127056.127079\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This brief paper introduces a small anonymous formal system representing the core theory of concurrent object-based computing. Milner's π-calculus is its underlying formalism, but the original calculus is reinterpreted and reformulated to become a simple and powerful expression of concurrent object-based computing. We briefly describe its underlying computational framework, its syntax, transition rules, semantic equivalence, and its special properties concerning \\\"naming\\\", which makes this calculus unique among various concurrency formalisms.\",\"PeriodicalId\":135062,\"journal\":{\"name\":\"OOPSLA/ECOOP '90\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"26\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"OOPSLA/ECOOP '90\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/127056.127079\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"OOPSLA/ECOOP '90","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/127056.127079","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This brief paper introduces a small anonymous formal system representing the core theory of concurrent object-based computing. Milner's π-calculus is its underlying formalism, but the original calculus is reinterpreted and reformulated to become a simple and powerful expression of concurrent object-based computing. We briefly describe its underlying computational framework, its syntax, transition rules, semantic equivalence, and its special properties concerning "naming", which makes this calculus unique among various concurrency formalisms.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
