Domain-Theoretic Foundations of Functional Programming
| AUTHOR | Streicher, Thomas |
| PUBLISHER | World Scientific Publishing Company (12/01/2006) |
| PRODUCT TYPE | Hardcover (Hardcover) |
Description
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.
Show More
Product Format
Product Details
ISBN-13:
9789812701428
ISBN-10:
9812701427
Binding:
Hardback or Cased Book (Sewn)
Content Language:
English
More Product Details
Page Count:
132
Carton Quantity:
40
Product Dimensions:
6.46 x 0.56 x 9.22 inches
Weight:
0.82 pound(s)
Feature Codes:
Bibliography,
Index,
Table of Contents,
Illustrated
Country of Origin:
SG
Subject Information
BISAC Categories
Computers | Computer Science
Dewey Decimal:
005.131
Library of Congress Control Number:
2007298163
Descriptions, Reviews, Etc.
publisher marketing
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.
Show More
List Price $45.00
Your Price
$44.55