Free Delivery Over $100
|
|
|||
|
||||
OverviewThis 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. Full Product DetailsAuthor: Thomas Streicher (Technische Univ Darmstadt, Germany)Publisher: World Scientific Publishing Co Pte Ltd Imprint: World Scientific Publishing Co Pte Ltd Dimensions: Width: 16.40cm , Height: 1.40cm , Length: 23.40cm Weight: 0.372kg ISBN: 9789812701428ISBN 10: 9812701427 Pages: 132 Publication Date: 05 December 2006 Audience: Professional and scholarly , Professional & Vocational Format: Hardback Publisher's Status: Active Availability: Out of stock  The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
