具有重复的滑稽(指数、交互类型和完备性)

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI:10.2168/LMCS-7(2:13)2011

Michele Basaldella, C. Faggian

{"title":"具有重复的滑稽(指数、交互类型和完备性)","authors":"Michele Basaldella, C. Faggian","doi":"10.2168/LMCS-7(2:13)2011","DOIUrl":null,"url":null,"abstract":"We prove that is possible to extend Girard's Ludics so as to have repetitions (hence exponentials), and still have the results on semantical types which characterize Ludics in the panorama of Game Semantics. The results are obtained by using less structure than in the original paper; this has an interest on its own, and we hope that it will open the way to applying the approach of Ludics to a larger domain.","PeriodicalId":415902,"journal":{"name":"2009 24th Annual IEEE Symposium on Logic In Computer Science","volume":"52 17","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":"{\"title\":\"Ludics with Repetitions (Exponentials, Interactive Types and Completeness)\",\"authors\":\"Michele Basaldella, C. Faggian\",\"doi\":\"10.2168/LMCS-7(2:13)2011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We prove that is possible to extend Girard's Ludics so as to have repetitions (hence exponentials), and still have the results on semantical types which characterize Ludics in the panorama of Game Semantics. The results are obtained by using less structure than in the original paper; this has an interest on its own, and we hope that it will open the way to applying the approach of Ludics to a larger domain.\",\"PeriodicalId\":415902,\"journal\":{\"name\":\"2009 24th Annual IEEE Symposium on Logic In Computer Science\",\"volume\":\"52 17\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"34\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 24th Annual IEEE Symposium on Logic In Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2168/LMCS-7(2:13)2011\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 24th Annual IEEE Symposium on Logic In Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2168/LMCS-7(2:13)2011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 34

摘要

我们证明了可以扩展Girard的Ludics以具有重复(因此是指数)，并且仍然有关于在游戏语义全景中表征Ludics的语义类型的结果。采用比原论文更少的结构得到了结果;这本身就很有趣，我们希望它将为将Ludics的方法应用到更大的领域开辟道路。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Ludics with Repetitions (Exponentials, Interactive Types and Completeness)

We prove that is possible to extend Girard's Ludics so as to have repetitions (hence exponentials), and still have the results on semantical types which characterize Ludics in the panorama of Game Semantics. The results are obtained by using less structure than in the original paper; this has an interest on its own, and we hope that it will open the way to applying the approach of Ludics to a larger domain.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 24th Annual IEEE Symposium on Logic In Computer Science

自引率

0.00%

发文量

期刊最新文献

Applications of Game Semantics: From Program Analysis to Hardware Synthesis Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus The Inverse Taylor Expansion Problem in Linear Logic Logical Step-Indexed Logical Relations Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications