A language design for concurrent processes

Authors:
L. G. Tesler;H. J. Enea
Affiliations:
Computer Consultant, Palo Alto, California;Stanford University, Stanford, California
Venue:
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Year:
1968

Citing 7
Cited 11

POSE: a language for posing problems to a computer

Communications of the ACM
A note on “Program structures for parallel processing”

Communications of the ACM
Program structures for parallel processing

Communications of the ACM
An algorithm for selecting and sequencing statements as a basis for a problem-oriented programming system

ACM '66 Proceedings of the 1966 21st national conference
LISP 1.5 Programmer's Manual

LISP 1.5 Programmer's Manual
A multiprocessor system design

AFIPS '63 (Fall) Proceedings of the November 12-14, 1963, fall joint computer conference
Explicit parallel processing description and control in programs for multi- and uni-processor computers

AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference

Parallelism, control and synchronization expression in a single assignment language

ACM SIGPLAN Notices
Aspects of Applicative Programming for Parallel Processing

IEEE Transactions on Computers
A Flow Analysis Procedure for the Translation of High-Level Languages to a Data Flow Language

IEEE Transactions on Computers
The "single-assignment" approach to parallel processing

AFIPS '71 (Fall) Proceedings of the November 16-18, 1971, fall joint computer conference
Challenge to artificial intelligence: programming problems to be solved

IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Some techniques for compile-time analysis of user-computer interactions

IBM Journal of Research and Development
Language facilities for programming user-computer dialogues

IBM Journal of Research and Development
Agent-oriented programming: from prolog to guarded definite clauses

Agent-oriented programming: from prolog to guarded definite clauses
LVars: lattice-based data structures for deterministic parallelism

Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing
KScript and KSWorld: a time-aware and mostly declarative language and interactive GUI framework

Proceedings of the 2013 ACM international symposium on New ideas, new paradigms, and reflections on programming & software
Freeze after writing: quasi-deterministic parallel programming with LVars

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.01

Visualization

Abstract

In conventional programming languages, the sequence of execution is specified by rules such as: (1) The statement "GO TO L" is followed by the statement labelled "L" (Branching rule). (2) The last statement in the range of an iteration is followed, under certain conditions, by the first statement in the range (Looping rule). (3) The last statement of a subroutine is followed by the statement immediately after its CALL (Out-of-line code rule). ... (Other rules) (n) In other cases, each statement is followed by the statement immediately after it (Order rule).