Journal ArticleDOI
Associons: A Program Notation with Tuples Instead of Variables
Reads0
Chats0
TLDR
The notation proposed is the result of a search for a basic statement the execution of which may employ more concurrency than is the case for the traditional assignment statement.Abstract:
A program notation without variables is proposed. The state of a computation is recorded as a set of "associons." Each associon is a tuple of names representing a relation between the entities with those names. The state of the computation can be changed by the creation of new associons representing new relations deducible from those already recorded. The building block prescribing such deductions is called the "closure statement." The notation proposed is the result of our search for a basic statement the execution of which may employ more concurrency than is the case for the traditional assignment statement. Some possible extensions to the notation are discussed.read more
Citations
More filters
Book ChapterDOI
Coordination models and languages
TL;DR: This chapter defines and presents in sufficient detail the fundamental concepts of what constitutes a coordination model or language and describes the main existing coordination models and languages as either ``data-driven'' or ``control-driven'''' (also called ``process-'''' or ``task-oriented'').
Journal ArticleDOI
Programming by multiset transformation
TL;DR: A new formalism called Gamma is presented in which programs are described in terms of multiset transformations, with the possibility of expressing algorithms in a very abstract way, without any artificial sequentiality.
Journal ArticleDOI
The gamma model and its discipline of programming
TL;DR: A new formalism called GAMMA is presented in which programs are described as multiset transformers and the relevance of this formalism with respect to program development is shown by proposing a systematic program derivation method and illustrating it with several nontrivial problems.
Book ChapterDOI
Gamma and the Chemical Reaction Model: Fifteen Years After
TL;DR: Most of the work around Gamma considered as a programming or as a specification language is reviewed, showing that this paradigm has been a source of inspiration in various research areas.
Book
Interaction abstract machines
TL;DR: This paper introduces the metaphor of Interaction Abstract Machines, a metaphor in the same vein of such metaphors as the Chemical Abstract Machine, in allowing interactions among independent, locally deened subsystems | a crucial requirement for capturing the global behavior of open systems.
References
More filters
Book
Computation: Finite and Infinite Machines
TL;DR: In this article, the authors present an abstract theory that categorically and systematically describes what all these machines can do and what they cannot do, giving sound theoretical or practical grounds for each judgment, and the abstract theory tells us in no uncertain terms that the machines' potential range is enormous and that its theoretical limitations are of the subtlest and most elusive sort.
Journal ArticleDOI
Guarded commands, nondeterminacy and formal derivation of programs
TL;DR: So-called “guarded commands” are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniquely determined by the initial state.
Book
A Programming Language
TL;DR: The paper describes a succinct problem-oriented programming language that relies heavily on a systematic extension of a small set of basic operations to vectors, matrices, and trees, and on a family of flexible selection operations controlled by logical vectors.
ReportDOI
An overview of production systems
Randall Davis,Jonathan J. King +1 more
TL;DR: This paper is an attempt to provide an analysis and overview of recurrent themes in production systems, as well as a conceptual framework by which many of the seemingly disparate efforts can be viewed, both in relation to each other, and to other methodologies.
Description and Theoretical Analysis (Using Schemata) of Planner: A Language for Proving Theorems and Manipulating Models in a Robot
TL;DR: PANNER is a formalism for proving theorems and manipulating models in a robot built out of a number of problem-solving primitives together with a hierarchical multiprocess backtrack control structure.