CONCUR: A language for continuous, concurrent processes

Authors:
Richard M. Salter;Terence J. Brennan;Daniel P. Friedman
Affiliations:
Drexel University, Philadelphia, PA 19104, U.S.A.;Indiana University Bloomington, IN 47405, U.S.A.;Indiana University Bloomington, IN 47405, U.S.A.
Venue:
Computer Languages
Year:
1980

Citing 6
Cited 0

Communicating sequential processes

Communications of the ACM
Significant event simulation

Communications of the ACM
Programming semantics for multiprogrammed computations

Communications of the ACM
Synchronization in actor systems

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Procedural embedding of knowledge in planner

IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Correct and optimal implementations of recursion in a simple programming language

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hendrix's robot modeling system presented a simulation method in which time is represented as a continuous phenomenon. This paper introduces the language CONCUR, which realizes Hendrix's concept through an extension of the LISP environment. CONCUR uses generalized procedures (scenarios) operating in a data-driven mode to implement Hendrix's events. The heart of CONCUR is a generalized pattern-matcher which permits operators within the patterns to bind variables and modify the match process. We include several detailed examples in addition to an implementation of the pattern matcher.