EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link: https://ebookbell.com/faq

We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.

For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Domaintheoretic Foundations Of Functional Programming Thomas Streicher

Name: Domaintheoretic Foundations Of Functional Programming Thomas Streicher
SKU: BELL-2540972
Price: 31.00 USD
Availability: InStock
Rating: 4.8 (94 reviews)

SKU: BELL-2540972

$ 31.00 ~~$ 45.00~~ (-31%)

4.8

94 reviews

Domaintheoretic Foundations Of Functional Programming Thomas Streicher instant download after payment.

Publisher: World Scientific Publishing Company

File Extension: PDF

File size: 1.66 MB

Pages: 120

Author: Thomas Streicher

ISBN: 9789812701428, 9789812772596, 9812701427, 9812772596

Language: English

Year: 2006

Product desciption

Domaintheoretic Foundations Of Functional Programming Thomas Streicher by Thomas Streicher 9789812701428, 9789812772596, 9812701427, 9812772596 instant download after payment.

This textbook provides a basis for a PhD course on domain-theoretic semantics of functional programming languages and their meta-mathematical properties. It introduces basic domain theory and the technique of logical relations as developed by Scott and Plotkin. The solution of recursive domain equations is explained in detail. A complete discussion of the famous full abstraction problem for PCF (a functional Kernel language due to Scott and Plotkin) is given including a construction of the fully abstract Milner model using Kripke logical relations. A final chapter introduces computability in Scott domains and shows that this model is fully abstract and universal for appropriate extensions of PCF by parallel language constructs.