Andere Kunden interessierten sich auch für
![Functional and Logic Programming - Proceedings of the Second Fuji International Workshop]( "Functional and Logic Programming - Proceedings of the Second Fuji International Workshop")
Functional and Logic Programming - Proceedings of the Second Fuji International Workshop124,99 €![Functional and Logic Programming - Proceedings of the Fuji International Workshop]( "Functional and Logic Programming - Proceedings of the Fuji International Workshop")
Functional and Logic Programming - Proceedings of the Fuji International Workshop129,99 €![Non-Deterministic Concurrent Logic Programming in Pandora]( "Non-Deterministic Concurrent Logic Programming in Pandora")
Non-Deterministic Concurrent Logic Programming in Pandora103,99 €![Learning Functional Programming in Go]( "Learning Functional Programming in Go")
Learning Functional Programming in Go52,99 €![Functional Python Programming - Second Edition]( "Functional Python Programming - Second Edition")
Functional Python Programming - Second Edition55,99 €![A skeptic's guide to functional programming with JavaScript]( "A skeptic's guide to functional programming with JavaScript")
A skeptic's guide to functional programming with JavaScript56,99 €![Hands-On Functional Programming in RUST]( "Hands-On Functional Programming in RUST")
Hands-On Functional Programming in RUST49,99 €
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.