Streicher, Thomas, 1958-
Domain-theoretic foundations of functional programming [electronic resource] / Thomas Streicher. - Singapore : World Scientific Publishing Co. Pte Ltd., ©2006. - 1 online resource (132 p.) : ill.
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."--
System requirements: Adobe Acrobat Reader.
Mode of access: World Wide Web.
9789812772596
Programming languages (Electronic computers)--Semantics.
Computer science--Mathematics.
Electronic books.
QA76.7 / .S818 2006
005.13/1
Domain-theoretic foundations of functional programming [electronic resource] / Thomas Streicher. - Singapore : World Scientific Publishing Co. Pte Ltd., ©2006. - 1 online resource (132 p.) : ill.
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."--
System requirements: Adobe Acrobat Reader.
Mode of access: World Wide Web.
9789812772596
Programming languages (Electronic computers)--Semantics.
Computer science--Mathematics.
Electronic books.
QA76.7 / .S818 2006
005.13/1