论文信息 - Order Semantics of Data Types

Order Semantics of Data Types

Work initiated by D. S. Scott and C. Strachey in the 1960s, and contributed to by many up to the present writing, yields a framework for program semantics in which every data type is a domain and every computed function is continuous. We provide a critique of these basic assumptions in Section 1, but then proceed to develop an introduction to this theory of ordered semantics in the remaining sections.

Michael A. Arbib | Ernest G. Manes | M. Arbib | E. Manes

[1] Gordon D. Plotkin,et al. A Powerdomain Construction , 1976, SIAM J. Comput..

[2] Joseph E. Stoy,et al. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .

[3] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[4] Michael A. Arbib,et al. Port Automata and the Algebra of Concurrent Processes , 1983, J. Comput. Syst. Sci..

[5] Michael J. C. Gordon,et al. The denotational description of programming languages - an introduction , 1979 .

[6] A. J. Kfoury,et al. A Programming Approach to Computability , 1982, Texts and Monographs in Computer Science.

[7] D. Scott. Models for Various Type-Free Calculi , 1973 .

[8] Dana S. Scott,et al. Data Types as Lattices , 1976, SIAM J. Comput..

[9] Michael J. C. Gordon,et al. The Denotational Description of Programming Languages , 1979, Springer New York.