Abramsky, Samson On semantic foundations for applicative multiprogramming. (English) Zbl 0538.68064 Automata, languages and programming, 10th Colloq., Barcelona/Spain 1983, Lect. Notes Comput. Sci. 154, 1-14 (1983). [For the entire collection see Zbl 0511.00030.] The paper describes a categorial approach to unbounded nondeterminism in non-discrete data domains. The author follows some ideas of D. Lehman and M. Smyth giving them more mathematical justification and showing the applications to the semantics of programming languages. Despite a clear practical interpretation of the problem the paper is written in a rather abstract style. Reviewer: A.Blikle Cited in 12 Documents MSC: 68Q55 Semantics in the theory of computing 68N01 General topics in the theory of software Keywords:category theory; unbounded nondeterminism in non-discrete data domains; semantics of programming languages Citations:Zbl 0511.00030 PDF BibTeX XML OpenURL