{"title":"系统F的对策与可定义性","authors":"Dominic J. D. Hughes","doi":"10.1109/LICS.1997.614935","DOIUrl":null,"url":null,"abstract":"We develop a game-theoretic model of the polymorphic /spl lambda/-calculus, system F, as a fibred category F. Our main result is that every morphism /spl sigma/ of the model defines a normal form s/sub /spl sigma// of system F, whose interpretation is /spl sigma/. Thus the model gives a precise, non-syntactic account of the calculus.","PeriodicalId":272903,"journal":{"name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"Games and definability for system F\",\"authors\":\"Dominic J. D. Hughes\",\"doi\":\"10.1109/LICS.1997.614935\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We develop a game-theoretic model of the polymorphic /spl lambda/-calculus, system F, as a fibred category F. Our main result is that every morphism /spl sigma/ of the model defines a normal form s/sub /spl sigma// of system F, whose interpretation is /spl sigma/. Thus the model gives a precise, non-syntactic account of the calculus.\",\"PeriodicalId\":272903,\"journal\":{\"name\":\"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1997.614935\",\"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 Twelfth Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1997.614935","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We develop a game-theoretic model of the polymorphic /spl lambda/-calculus, system F, as a fibred category F. Our main result is that every morphism /spl sigma/ of the model defines a normal form s/sub /spl sigma// of system F, whose interpretation is /spl sigma/. Thus the model gives a precise, non-syntactic account of the calculus.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
