And/Or Programs: A New Approach to Structured Programming

Authors:
David Harel
Affiliations:
IBM Thomas J. Watson Research Center, Yorktown Heights, NY
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1980

Citing 7
Cited 11

Equivalence between AND/OR graphs and context-free grammars

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
Revised report on the algorithm language ALGOL 60

Communications of the ACM
Systematic Programming: An Introduction

Systematic Programming: An Introduction
Introduction to Mathematical Theory of Computation

Introduction to Mathematical Theory of Computation
A Discipline of Programming

A Discipline of Programming
Structured programming

Structured programming

Concurrent dynamic logic

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Concurrent dynamic logic

Journal of the ACM (JACM)
Knowledge engineering for software design

ACM SIGSOFT Software Engineering Notes
Processor networks and alternating machines

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Educator's view of structured concepts

ACM '80 Proceedings of the ACM 1980 annual conference
Gödel numbers: a new approach to structured programming

ACM SIGPLAN Notices
Statecharts in the making: a personal account

Proceedings of the third ACM SIGPLAN conference on History of programming languages
Statecharts in the making: a personal account

Communications of the ACM - Being Human in the Digital Age
Alternation as a programming paradigm

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Towards combinatorial evolution of composite systems

Expert Systems with Applications: An International Journal
Extending procedural task models by systematic explicit integration of objects, knowledge and information

Proceedings of the 31st European Conference on Cognitive Ergonomics

Quantified Score

Hi-index	0.01

Visualization

Abstract

A simple tree-like programming/specification language is presented. The central idea is the dividing of conventional programming constructs into the two classes of and and or subgoaling, the subgoal tree itself constituting the program. Programs written in the language can, in general, be both nondeterministic and parallel. The syntax and semantics of the language are defined, a method for verifying programs written in it is described, and the practical significance of programming in the language assessed. Finally, some directions for further research are indicated.