Logical Foundations of Functional Progra
β Gerard Huet
π Library
π
1990
π Addison-Wesley Pub (Sd)
π English
β¦ LIBER β¦
π
Foundations of functional programming
β Scribed by Paulson L.C.
- Year
- 1995
- Tongue
- English
- Leaves
- 54
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Logical foundations of functional progra
β GeΜrard Huet
π Library
π
1990
π Addison-Wesley, Addison-Wesley Pub (Sd)
π English
Domain-theoretic foundations of function
β Thomas Streicher
π Library
π
2006
π WS
π English
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 equat
Domain-theoretic Foundations of Function
β Thomas Streicher
π Library
π
2006
π World Scientific Publishing Company
π English
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 equat
Domain-theoretic Foundations of Function
β Thomas Streicher
π Library
π
2006
π World Scientific Publishing Company
π English
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 equat
Domain-theoretic Foundations of Function
β Thomas Streicher
π Library
π
2006
π World Scientific Pub Co Inc
π English
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 equat