Data Types as Lattices

作     者：Dana Scott 

出 版 物：《SIAM Journal on Computing》 

年 卷 期：1976年第5卷第3期

页      面：522-587页

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主　　题：programming language semantics lattice continuous lattice algebraic lattice computability retract combinatory logic lambda calculus recursion theorem enumeration degrees continuous function fixed-point theorem 

摘      要：The meaning of many kinds of expressions in programming languages can be taken as elements of certain spaces of “partial objects. In this report these spaces are modeled in one universal domain PωPω, the set of all subsets of the integers. This domain renders the connection of this semantic theory with the ordinary theory of number theoretic (especially general recursive) functions clear and straightforward.