Computable queries for relational data bases
Ashok K. Chandra, David Harel
STOC 1979
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. © 1980, ACM. All rights reserved.
Ashok K. Chandra, David Harel
STOC 1979
David Harel
POPL 1979
David Harel
ACM SIGPLAN Notices
Ashok K. chandra, David Harel
Journal of Computer and System Sciences