The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Journal of the ACM (JACM)
Program development by stepwise refinement
Communications of the ACM
BLISS: a language for systems programming
Communications of the ACM
Letters to the editor: go to statement considered harmful
Communications of the ACM
A correspondence between ALGOL 60 and Church's Lambda-notations: Part II
Communications of the ACM
EULER: a generalization of ALGOL and it formal definition: Part 1
Communications of the ACM
Design of a separable transition-diagram compiler
Communications of the ACM
LISP 1.5 Programmer's Manual
An overview of nonprocedural languages
Proceedings of the ACM SIGPLAN symposium on Very high level languages
Programming by semantic refinement
Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems
The design of usable programming languages
ACM '75 Proceedings of the 1975 annual conference
LINUS: an experiment in language preprocessing
ACM SIGPLAN Notices
Implementation and application of a function data type
AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
| Hi-index | 0.00 |
The control structures of the Madcap language have evolved to a point where today those of Madcap 6 have obviated programmer defined labels and go-to statements. The benefits of the removal of these concepts are discussed in detail. Madcap has a powerful class of data structures, including sets, sequences, and expressions, along with a full array of operators for manipulating these structures. These operators include important facilities for forming sets and for forming and concatenating sequences, based on very general iterative expressions. Procedures in Madcap are expressions whose evaluation is deferred; characteristics of this approach are discussed. Also described is a notation which facilitates backtrack programming.