Domain-theoretic foundations of functional programming [electronic resource] / Thomas Streicher.
By: Streicher, Thomas
.
Material type: 
Computer filePublisher: Singapore : World Scientific Publishing Co. Pte Ltd., ©2006Description: 1 online resource (132 p.) : ill.ISBN: 9789812772596.Subject(s): Programming languages (Electronic computers) -- Semantics | Computer science -- Mathematics | Electronic booksDDC classification: 005.13/1 Online resources: Access to full text is restricted to subscribers. Summary: "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."-- Publisher's website.
System requirements: Adobe Acrobat Reader.
Mode of access: World Wide Web.
Title from web page (viewed December 14, 2018).
Includes bibliographical references (p. 117-118) and index.
"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."-- Publisher's website.
There are no comments for this item.