PERHAPS A GIFT VOUCHER FOR MUM?: MOTHER'S DAY

Close Notification

Your cart does not contain any items

Domain-theoretic Foundations Of Functional Programming

Thomas Streicher (Technische Univ Darmstadt, Germany)

$81.99

Hardback

Not in-store but you can order this
How long will it take?

QTY:

English
World Scientific Publishing Co Pte Ltd
05 December 2006
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.

By:  
Imprint:   World Scientific Publishing Co Pte Ltd
Country of Publication:   Singapore
Dimensions:   Height: 234mm,  Width: 164mm,  Spine: 14mm
Weight:   372g
ISBN:   9789812701428
ISBN 10:   9812701427
Pages:   132
Publication Date:  
Audience:   Professional and scholarly ,  Undergraduate
Format:   Hardback
Publisher's Status:   Active
PCF and Its Operational Semantics; The Scott Model of PCF; Computational Adequacy; Milner's Context Lemma; The Full Abstraction Problem; Logical Relations; Some Structural Properties of the D ; Solutions of Recursive Domain Equations; Characterisation of Fully Abstract Models; Sequential Domains as a Model of PCF; The Model of PCF in S is Fully Abstract; Computability in Domains.

See Also