{"title":"Game semantics and subtyping","authors":"J. Chroboczek","doi":"10.1109/LICS.2000.855769","DOIUrl":null,"url":null,"abstract":"While game semantics has been remarkably successful at modelling, often in a fully abstract manner a wide range of features of programming languages, there has to date been no attempt at applying it to subtyping. We show how the simple device of explicitly introducing error values in the syntax of the calculus leads to a notion of subtyping for game semantics. We construct an interpretation of a simple /spl lambda/-calculus with subtyping and show how the range of the interpretation of types is a complete lattice, thus yielding an interpretation of bounded quantification.","PeriodicalId":300113,"journal":{"name":"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.2000.855769","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

While game semantics has been remarkably successful at modelling, often in a fully abstract manner a wide range of features of programming languages, there has to date been no attempt at applying it to subtyping. We show how the simple device of explicitly introducing error values in the syntax of the calculus leads to a notion of subtyping for game semantics. We construct an interpretation of a simple /spl lambda/-calculus with subtyping and show how the range of the interpretation of types is a complete lattice, thus yielding an interpretation of bounded quantification.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
游戏语义和子类型
虽然游戏语义在建模方面非常成功,通常是以一种完全抽象的方式来模拟编程语言的各种功能,但迄今为止还没有人尝试将其应用于子类型。我们展示了在微积分语法中显式引入错误值的简单方法如何导致游戏语义的子类型概念。我们构造了一个具有子类型的简单/spl λ /-微积分的解释,并证明了类型解释的范围是一个完全格,从而得到了有界量化的解释。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A general notion of realizability A theory of bisimulation for a fragment of Concurrent ML with local names A modality for recursion Approximating labeled Markov processes Back and forth between guarded and modal logics
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1