Implementation of a non-deterministic loop

Authors:
Hartmut Höft
Affiliations:
Eastern Michigan University, Ypsilanti, MI
Venue:
ACM SIGCSE Bulletin
Year:
1991

Citing 4
Cited 1

A generalization of Dijkstra's calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
Curriculum '78: recommendations for the undergraduate program in computer science— a report of the ACM curriculum committee on computer science

Communications of the ACM
The Science of Programming

The Science of Programming
A Discipline of Programming

A Discipline of Programming

Paradigms and laboratories in the core computer science curriculum: an overview

ACM SIGCSE Bulletin

Quantified Score

Hi-index	0.05

Visualization

Abstract

Dijkstra's calculus of guarded commands incorporates nondeterminism into the branch and the loop statements. I argue in this paper that the course CS8, Organization of Programming Languages, is an appropriate place to introduce this semantics for a language control structure into the undergraduate curriculum. In section IV I present a short implementation for the Dijkstra do... od command as a function in Mathematica. The paper concludes with the application of this function to random walks.