|
|
|
|
|
Domain-theoretic Foundations of Functional Programming
| Our Price |
$ 44.52
|
|
|
|
|
|
|
|
| Item Number |
165123 |
|
|
|
|
|
|
Item Description...
Product 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.
|
Item Specifications...
Pages 120
Dimensions: Length: 9" Width: 5.6" Height: 0.6"
Weight: 0.8 lbs.
Binding Hardcover
Release Date Dec 4, 2006
Publisher World Scientific Publishing Company
ISBN 9812701427
EAN 9789812701428
|
Availability 1 units.
Availability accurate as of May 30, 2012 06:24.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.
|
Product Categories
Similar Products
Reviews - What do our customers think? Be the first to write a review about Domain-theoretic Foundations of Functional Programming
|
Shopping Cart (0 Items)
