"Langages de programmation Sémantique." . . "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."@en . . . . . . . . . . . . . . . "Domain-theoretic foundations of function programming" . "Domain-theoretic foundations of functional programming"@en . . . "Langages de programmation." . . "Functionele programmering." . . "Functionele programmering" . "Informatique Mathématiques." . . "Domein (wiskunde)" . . "programmation par fonctions." . .