Algorithm specification in a very high level language

Authors:
M. B. Gokhale
Affiliations:
Dept. of Computer and Information Science, University of Delaware, Newark De.
Venue:
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Year:
1987

Citing 5
Cited 1

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Parallel scheduling of recursively defined arrays

Journal of Symbolic Computation
Lucid, a nonprocedural language with iteration

Communications of the ACM
The global storage needs of a subcomputation

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Very-high level concurrent programming (distributed, configuration)

Very-high level concurrent programming (distributed, configuration)

The symbolic hyperplane transformation for recursively defined arrays

Proceedings of the 1988 ACM/IEEE conference on Supercomputing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The Problem Specification (PS) nonprocedural language is a very high level language for algorithm specification. PS is suitable for nonprogrammers, who can specify a problem using mathematically-oriented equations; for expert programmers, who can prototype different versions of a software system for evaluation; and for those who wish to use specifications for portions (if not all) of a program. PS has data types and modules similar to Modula-2. The compiler generates C code.In this paper, we first show PS by example, and then discuss efficiency issues in scheduling and code generation.