By Thomas Streicher
This textbook presents a foundation for a PhD direction on domain-theoretic semantics of practical programming languages and their meta-mathematical houses. It introduces uncomplicated area concept and the means of logical family members as constructed through Scott and Plotkin. the answer of recursive area equations is defined intimately. an entire dialogue of the well-known complete abstraction challenge for Pcf (a practical Kernel language as a result of Scott and Plotkin) is given together with a building of the absolutely summary Milner version utilizing Kripke logical kinfolk. a last bankruptcy introduces computability in Scott domain names and indicates that this version is totally summary and common for applicable extensions of Pcf by means of parallel language constructs.
Read or Download Domain-Theoretic Foundations Of Functional Programming PDF
Similar Programming books
Computability and complexity concept might be of relevant challenge to practitioners in addition to theorists. regrettably, even though, the sphere is understood for its impenetrability. Neil Jones's aim as an educator and writer is to construct a bridge among computability and complexity concept and different parts of desktop technology, specifically programming.
October 28-31, 1991, San Diego, California formerly known as The North American convention, the 1991 overseas Symposium enhances the overseas convention on good judgment Programming held every year in June. either are subsidized by way of the organization for common sense Programming. themes lined: Foundations.
Additional resources for Domain-Theoretic Foundations Of Functional Programming