Towards a theory of parallel algorithms on concrete data structures

DOI10.1016/0304-3975(92)90049-LzbMath0761.68042MaRDI QIDQ1194326

Stephen Brookes, Shai Geva

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

input-output functionintensional semantics of parallelismintensional strictness ordering

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Distributed algorithms (68W15)

Related Items

Continuous functions and parallel algorithms on concrete data structures, Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin

Cites Work

• Sequential algorithms on concrete data structures
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• Power domains
• Continuous functions and parallel algorithms on concrete data structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item