.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Games and Full Abstraction for a Functional Metalanguage with Recursive Types
Guy McCusker
€ 66.10
FREE Delivery in Ireland
Description for Games and Full Abstraction for a Functional Metalanguage with Recursive Types
Paperback. Series: Distinguished Dissertations. Num Pages: 189 pages, biography. BIC Classification: PBCD; UMX; WM. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 11. Weight in Grams: 326.
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 ... Read more
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 ... Read more
Product Details
Format
Paperback
Publication date
2012
Publisher
Springer London Ltd United Kingdom
Number of pages
189
Condition
New
Series
Distinguished Dissertations
Number of Pages
189
Place of Publication
England, United Kingdom
ISBN
9781447111658
SKU
V9781447111658
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Games and Full Abstraction for a Functional Metalanguage with Recursive Types