Domain-theoretic Foundations of Functional Programming

Domain-theoretic Foundations of Functional Programming
World Scientific Publishing Company | 2006-12-04 | ISBN: 9812701427 | 120 pages | File type: PDF | 1 mb
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.

Download Links:

[Fast Download] Domain-theoretic Foundations of Functional Programming

Related eBooks:
Focus on Bio-Image Informatics
Practical PostScript. A Guide to Digital Typesetting
How to Get Instagram Likes and Follows for $1!!
The Ugly Fight: Unleashing Artificial Intelligence Against Global Warming
SPSS for Applied Sciences: Basic Statistical Testing
Instant Kendo UI Grid
Traversals: The Use of Preservation for Early Electronic Writing
Advancements in Applied Metaheuristic Computing
Petri Nets: Fundamental Models, Verification and Applications
Social Informatics
Beginning Visual Basic 2005 Databases
Internet - Technical Development and Applications
Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.