Provides a basis for a PhD course on domain-theoretic semantics of functional programming languages and their meta-mathematical properties. This book introduces basic domain theory and technique of logical relations as developed by Scott and Plotkin. It also introduces computability in Scott domains.
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.
Get Domain-theoretic Foundations Of Functional Programming by Thomas Streicher at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by World Scientific Publishing Co Pte Ltd and it has 132 pages.
Our digital collection is currently being curated to ensure the best possible reading experience on Werezi. We'll be launching our Ebooks platform shortly.
Your privacy, your choice
Make Werezi work for you
We use essential cookies for your cart and sign-in. With your permission, optional cookies help us understand how Werezi is used and improve your book recommendations.
Essential cookies are always active. Optional analytics stay off unless you choose Allow all.