FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

  • Safe delivery by Christmas SANTA SAFE
    Domain-theoretic Foundations Of Functional Programming

Domain-theoretic Foundations Of Functional Programming

Thomas Streicher
    Product form
      FORMAT: Hardback

      R 1,649.00 Price and availability exclusive to website

      YOU COULD EARN 1,649 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 20 - 30 Business Days
      BUY NOW PAY LATER
      From R 274.83 per month!
      3x monthly payments of R 549.66 with
      4x fortnightly payments of R 412.25 with
      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.
      Format: Hardback CONTRIBUTORS: Thomas Streicher EAN: 9789812701428 COUNTRY: Singapore PAGES: WEIGHT: 0 g HEIGHT: 0 cm
      PUBLISHED BY: World Scientific Publishing Co Pte Ltd DATE PUBLISHED: 2006-12-05 CITY: GENRE: COMPUTERS / Computer Science WIDTH: 0 cm SPINE:

      Book Themes:

      Functional programming

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      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.
      Format: Hardback CONTRIBUTORS: Thomas Streicher EAN: 9789812701428 COUNTRY: Singapore PAGES: WEIGHT: 0 g HEIGHT: 0 cm
      PUBLISHED BY: World Scientific Publishing Co Pte Ltd DATE PUBLISHED: 2006-12-05 CITY: GENRE: COMPUTERS / Computer Science WIDTH: 0 cm SPINE:

      Book Themes:

      Functional programming

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account