| 书目名称 | Games and Full Abstraction for a Functional Metalanguage with Recursive Types | | 编辑 | Guy McCusker | | 视频video | | | 概述 | 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 | | 图书封面 |  | | 描述 | 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 | | 关键词 | computer science; model; programming; programming language; semantics | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4471-0615-9 | | isbn_softcover | 978-1-4471-1165-8 | | isbn_ebook | 978-1-4471-0615-9 | | copyright | Springer-Verlag London Limited 1998 |
The information of publication is updating
|
|
发表于 2025-3-21 19:12:27
