Placeholder text

Go to cart

Domain-Theoretic Foundations of Functional Programming

By Thomas Streicher

Domain-Theoretic Foundations of Functional Programming Computer Science

Domain-Theoretic Foundations of Functional Programming

0 - Default Title
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.
Product details
Edition:
illustrated
Number of Pages:
132
Release Date:
2006-12-04
Publication Date:
2006-12-01
Publisher:
World Scientific Publishing Company
Languages:
Original: English
ISBN10:
9812701427
ISBN13:
9789812701428
Weight:
372 g
Height:
164 cm
Width:
234 cm
Thickness:
14 cm
Buy on Amazon
Currently sold out