Linked Data Explorerhttp://worldcat.org/entity/work/id/66848571
Domain-theoretic foundations of functional programming
"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.
Open All Close All
http://schema.org/about
- http://id.worldcat.org/fast/1078716
- http://experiment.worldcat.org/entity/work/data/66848571#Topic/langages_de_programmation_semantique
- http://id.loc.gov/authorities/subjects/sh85042295
- http://experiment.worldcat.org/entity/work/data/66848571#Topic/functionele_programmering
- http://id.loc.gov/authorities/subjects/sh85107316
- http://experiment.worldcat.org/entity/work/data/66848571#Topic/domein_wiskunde
- http://experiment.worldcat.org/entity/work/data/66848571#Topic/informatique_mathematiques
- http://experiment.worldcat.org/entity/work/data/66848571#Topic/langages_de_programmation
- http://id.worldcat.org/fast/872460
- http://experiment.worldcat.org/entity/work/data/66848571#Topic/programmation_par_fonctions
http://schema.org/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."--Publisher's website."@en
http://schema.org/name
- "Domain-theoretic foundations of functional programming"
- "Domain-theoretic foundations of function programming"
- "Domain-theoretic foundations of functional programming"@en