DSS structure and algorithmic transparency in APL

Authors:
W. E. Cundiff
Affiliations:
Griffith University, Nathan, Brisbane, Queensland 4111, Australia
Venue:
APL '91 Proceedings of the international conference on APL '91
Year:
1991

Citing 10
Cited 0

Reusing and Interconnecting Software Components

Computer
An introduction to structured modeling

Management Science
A dictionary of APL

ACM SIGAPL APL Quote Quad
The contrasting roles of Monte Carlo simulation and gaming in decision support Systems

Simulation
Modern structured analysis

Modern structured analysis
A prototyping language for decision support systems design

Information and Management
Database organisation: an algorithmic framework for decision support systems in APL

Decision Support Systems
Inference planning using digraphs and Boolean arrays

APL '89 Conference proceedings on APL as a tool of thought
A structured approach to analysis and design of complex systems

APL '90 Conference proceedings on APL 90: for the future
Building Effective Decision Support Systems

Building Effective Decision Support Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Earlier discussion focused on APL as an executable notation for understanding the inner-workings of dialogue generation and data/model base management in Decision Support Systems (DSS). The present work applies the notion of algorithmic transparency to the broader properties of system structure that connect the technology components of DSS. Using a concise set of idioms, embodying only the control construct of sequence, APL's direct definition form is employed in revealing patterns in the specification of a functional prototype Group DSS (GDSS).