找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Games and Full Abstraction for a Functional Metalanguage with Recursive Types; Guy McCusker Book 1998 Springer-Verlag London Limited 1998

[復(fù)制鏈接]
查看: 49635|回復(fù): 36
樓主
發(fā)表于 2025-3-21 19:12:27 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Games and Full Abstraction for a Functional Metalanguage with Recursive Types
編輯Guy McCusker
視頻videohttp://file.papertrans.cn/381/380543/380543.mp4
概述Contains the first treatment of recursive types using game semantics, and the first fully abstract model of a recursively typed language *.The first exposition of game semantics for programming langua
叢書名稱Distinguished Dissertations
圖書封面Titlebook: Games and Full Abstraction for a Functional Metalanguage with Recursive Types;  Guy McCusker Book 1998 Springer-Verlag London Limited 1998
描述This book is a minor revision of the thesis submitted in August 1996; no major changes have been made. However, I would like to take this opportunity to mention that since the thesis was written, discoveries have been made which would allow a substantial simplification and strengthening of the results in Chapters 3 and 6. In particular, it is now possible to model sums correctly in the category I as well as in £, which means that the definability results of Chapter 6 can be stated and proved at the intensional level, making them simpler and much closer in spirit to the original proofs of Abramsky, Jagadeesan, Malacaria, Hyland, Ong and Nickau [10,61,79]. This also leads quite straightforwardly to an understanding of call-by-value languages. Details of these improvements can be found in [14,73]. It is also worth mentioning that progress has been made on some of the topics suggested for future research in Chapter 7. In particular, fully abstract models have been found for various kinds of languages with local variables [8,13-16], and a fully complete games model of the polymorphic language System F has been constructed by Hughes [59]. Guy McCusker February 1998 Acknowledgements First
出版日期Book 1998
關(guān)鍵詞computer science; model; programming; programming language; semantics
版次1
doihttps://doi.org/10.1007/978-1-4471-0615-9
isbn_softcover978-1-4471-1165-8
isbn_ebook978-1-4471-0615-9
copyrightSpringer-Verlag London Limited 1998
The information of publication is updating

書目名稱Games and Full Abstraction for a Functional Metalanguage with Recursive Types影響因子(影響力)




書目名稱Games and Full Abstraction for a Functional Metalanguage with Recursive Types影響因子(影響力)學(xué)科排名




書目名稱Games and Full Abstraction for a Functional Metalanguage with Recursive Types網(wǎng)絡(luò)公開度




書目名稱Games and Full Abstraction for a Functional Metalanguage with Recursive Types網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Games and Full Abstraction for a Functional Metalanguage with Recursive Types被引頻次




書目名稱Games and Full Abstraction for a Functional Metalanguage with Recursive Types被引頻次學(xué)科排名




書目名稱Games and Full Abstraction for a Functional Metalanguage with Recursive Types年度引用




書目名稱Games and Full Abstraction for a Functional Metalanguage with Recursive Types年度引用學(xué)科排名




書目名稱Games and Full Abstraction for a Functional Metalanguage with Recursive Types讀者反饋




書目名稱Games and Full Abstraction for a Functional Metalanguage with Recursive Types讀者反饋學(xué)科排名




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 22:54:03 | 只看該作者
板凳
發(fā)表于 2025-3-22 02:45:04 | 只看該作者
Book 1998ture research in Chapter 7. In particular, fully abstract models have been found for various kinds of languages with local variables [8,13-16], and a fully complete games model of the polymorphic language System F has been constructed by Hughes [59]. Guy McCusker February 1998 Acknowledgements First
地板
發(fā)表于 2025-3-22 05:20:52 | 只看該作者
The Ecological Basis for Biological Control,e weaker ordertheoretic requirement of rationality, which can itself be described by simple algebraic, non-order-theoretic, axioms. In Chapter 5 the language . was introduced and the theory of Chapter 4 used to define a notion of model of . and establish a computational adequacy result for such mode
5#
發(fā)表于 2025-3-22 12:30:40 | 只看該作者
6#
發(fā)表于 2025-3-22 13:04:16 | 只看該作者
Games and Full Abstraction for a Functional Metalanguage with Recursive Types978-1-4471-0615-9
7#
發(fā)表于 2025-3-22 19:08:26 | 只看該作者
8#
發(fā)表于 2025-3-22 22:38:05 | 只看該作者
Prior and Likelihood Representation,question of completeness to one of .: are all the finite strategies of certain games in fact the denotation of some . program? Our analysis then answers this question in the affirmative, yielding the full abstraction theorem.
9#
發(fā)表于 2025-3-23 02:49:08 | 只看該作者
Full Abstraction,question of completeness to one of .: are all the finite strategies of certain games in fact the denotation of some . program? Our analysis then answers this question in the affirmative, yielding the full abstraction theorem.
10#
發(fā)表于 2025-3-23 07:02:44 | 只看該作者
, and its Models,ble of type . is interpreted as a morphism ?.? : ?.? →?.?. (More free variables are handled using products in the category.) Supposing that a notion of program equivalence ? is given, we would like the following . condition to hold.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 21:43
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
北碚区| 武隆县| 德清县| 江口县| 湛江市| 莱西市| 德阳市| 黄冈市| 昔阳县| 库车县| 新昌县| 黄骅市| 西城区| 盖州市| 奉贤区| 车险| 屯昌县| 乐山市| 双峰县| 叙永县| 芜湖市| 新疆| 广平县| 双辽市| 麻城市| 阳泉市| 锦屏县| 丹凤县| 合山市| 葫芦岛市| 白银市| 阳谷县| 兴城市| 永定县| 平果县| 同心县| 轮台县| 平山县| 呼伦贝尔市| 固安县| 曲沃县|