Domain-theoretic Foundations Of Functional Programming
Regular price
€45.99
14 days return policy
Shipping & Delivery
A01=Thomas Streicher
Author_Thomas Streicher
Category Theory
Category=UMJ
Computability
Denotational Semantics
Domain Theory
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Full Abstraction
Functional Programming
Logical Relations
Logics of Programs
Product details
- ISBN 9789812701428
- Publication Date: 05 Dec 2006
- Publisher: World Scientific Publishing Co Pte Ltd
- Publication City/Country: SG
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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.
