ACM Home Page
Please provide us with feedback. Feedback
Ten Mini-Languages: A Study of Topical Issues in Programming Languages
Full text PdfPdf (2.26 MB)
Source ACM Computing Surveys (CSUR) archive
Volume 3 ,  Issue 3  (September 1971) table of contents
Pages: 115 - 146  
Year of Publication: 1971
ISSN:0360-0300
Author
Henry F. Ledgard  Computer Science, The Johns Hopkins University, Baltimore, Maryland
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 54,   Citation Count: 14
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/356589.356592
What is a DOI?

ABSTRACT

The proliferation of programming languages has raised many issues of language design, definition, and implementation. This paper presents a series of ten mini-languages, each of which exposes salient features found in existing programming languages. The value of the mini-languages lies in their brevity of description and the isolation of important linguistic features: in particular, the notions of assignment, transfer of control, functions, parameter passing, type checking, data structures, string manipulation, and input/output. The mini-languages may serve a variety of uses: notably, as a pedagogical tool for teaching programming languages, as a subject of study for the design of programming languages, and as a set of test cases for methods of language implementation or formal definition.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
CURRY, HASKELL B.; AND ROBERT FEYS. Combinatory logic, Vol. 1. North-Holland Publ. Co., Amsterdam, The Netherlands, 1958.
 
4
CARACCIOLO DI FORINO, A. "String processing languages and generalized Markov algorithms." In Symbol manipulation languages and techniques, D. G. Bobrow (Ed.), North-Holland Publ. Co., Amsterdam, The Netherlands, 1968, pp. 191-206.
 
5
HOARE, C. A. R. "Record handling." In Programming languages, F. Genuys (Ed.), Academic Press, New York, 1968.
 
6
JOHNSTON, JOHN B. "The contour model of block structured processes." In Proc. of a Symposium on Data Structures in Programming Languages, J. T. Tou and P. Wegner (Eds.), Univ. Florida, Gainesville, Fla., 1971, 55--82.
7
8
9
 
10
MARKOV, ANDREI A. Theory of algorithms. (Russian) Academy of Sciences of the USSR, Moscow, 1954. English translation by Israel Program for Scientific Translations.
 
11
MORRIS, JAMES H. "X-calculus models of programming languages." (PhD Dissertation) Project MAC Technical Report 57, MIT, Cambridge, Mass., 1968.
12
 
13
QUINE, WILLARD V. Word and object. MIT Press, Cambridge, Mass., 1960.
 
14
SCOTT, DANA. "Outline for a mathematical theorv of computation." Technical Monograph PRG-2, Programming Research Group, Oxford Univ. Computing Lab., Oxford, England, 1970.
 
15
STANDISH, THOMAS A. "A data definition facility for programming languages." (PhD Dissertation) Carnegie Institute of Technology, Pittsburgh, Pa., 1967.
 
16
STRACHEY, CHRISTOPHER. "Fundamental concepts in programming languages." In Proc. of 1967 NATO Summer School, Copenhagen, Denmark, 1967.

CITED BY  14