Domain-theoretic Foundations of Functional Programming
Book information
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.
Similar books
Fibred categories à la Jean Bénabou
2019 · PDF
Introduction to Category Theory and Categorical Logic
2018 · PDF
Realizability [Lecture notes]
2013 · PDF
Introduction to Constructive Logic and Mathematics [Lecture notes]
2009 · PDF
Fibred categories à la Jean Bénabou [Lecture notes]
2017 · PDF
Categorical Models of Constructive Logic [Lecture notes]
2013 · PDF
Logik für Informatiker [Lecture notes]
2002 · PDF
Allgemeine Algebra für Informatiker und Wirtschaftsinformatiker [Lecture notes]
2002 · PDF