{"title":"游戏和完整的FPC抽象","authors":"G. McCusker","doi":"10.1109/LICS.1996.561316","DOIUrl":null,"url":null,"abstract":"We present a new category of games, /spl Gscr/, and build from it a cartesian closed category I and its extensional quotient /spl epsi/. /spl epsi/ represents an improvement over existing categories of games in that it has sums as well as products, function spaces and recursive types. A model of the language FPC, a sequential functional language with just this type structure, in /spl epsi/ is described and shown to be fully abstract.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"83","resultStr":"{\"title\":\"Games and full abstraction for FPC\",\"authors\":\"G. McCusker\",\"doi\":\"10.1109/LICS.1996.561316\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a new category of games, /spl Gscr/, and build from it a cartesian closed category I and its extensional quotient /spl epsi/. /spl epsi/ represents an improvement over existing categories of games in that it has sums as well as products, function spaces and recursive types. A model of the language FPC, a sequential functional language with just this type structure, in /spl epsi/ is described and shown to be fully abstract.\",\"PeriodicalId\":382663,\"journal\":{\"name\":\"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"83\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1996.561316\",\"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 11th Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1996.561316","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We present a new category of games, /spl Gscr/, and build from it a cartesian closed category I and its extensional quotient /spl epsi/. /spl epsi/ represents an improvement over existing categories of games in that it has sums as well as products, function spaces and recursive types. A model of the language FPC, a sequential functional language with just this type structure, in /spl epsi/ is described and shown to be fully abstract.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
