The denotational semantics of dynamic networks of processes

Authors:
Arie de Bruin;Wim Böhm
Affiliations:
Erasmus Univ., Rotterdam, The Netherlands;Univ. of Utrecht, Utrecht, The Netherlands
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1985

Citing 6
Cited 0

The Denotational Description of Programming Languages: An Introduction

The Denotational Description of Programming Languages: An Introduction
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
A Theory of Programming Language Semantics

A Theory of Programming Language Semantics
An Operational Semantics for Pure Dataflow

Proceedings of the 9th Colloquium on Automata, Languages and Programming
A Proof System for Partial Correctness of Dynamic Networks of Processes (Extended Abstract)

Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Recursive definitions of partial functions and their computations

Recursive definitions of partial functions and their computations

Quantified Score

Hi-index	0.00

Visualization

Abstract

DNP (dynamic networks of processes) is a variant of the language introduced by Kahn and MacQueen [11, 12]. In the language it is possible to create new processes dynamically. We present a complete, formal denotational semantics for the language, along the lines sketched by Kahn and MacQueen. An informal explanation of the formal semantics is also given.