research-article

Free access

On the basis for ELF: an extensible language facility

Authors:

T. E. Cheatham, Jr.,

P. JorrandAuthors Info & Claims

AFIPS '68 (Fall, part II): Proceedings of the December 9-11, 1968, fall joint computer conference, part II

Pages 937 - 948

https://doi.org/10.1145/1476706.1476710

Published: 09 December 1968 Publication History

Abstract

There are two basic premises which underlie the development of ELF. The first of these is that there exists a need for a wide variety of programming languages; indeed, our progress in the understanding and application of computers will demand an ever widening variety of languages. There are, in fact, "scientific" problems, "data processing" problems, "information retrieval" problems, "symbol manipulation" problems, "text handling" problems, and so on. From the point of view of a computer user who is working in one or more of these areas there are certain units of data with which he would like to transact and there are certain unit operations which he would like to perform on these data. The user will be able to make effective use of a computer only when the language facilities provided allow him to work toward a desired result in terms of data and operations which he chooses as being a natural representation of his conception of the problem solution. That is, it is not enough to have a language facility which is formally sufficient to allow the user to solve his problem; indeed, most available programming languages are, to within certain size limitations, universal languages. Rather, the facility must be natural for him to use in the solution of his particular problem.

References

[1]

T E Cheatham Jr The introduction of definitional facilities into higher level programming languages Second Edition Proceedings of the AFIPS Fall Joint Computer Conference San Francisco November 1966 Vol 29 Washington DC Spartan 1966 pp 623--637

Digital Library

[2]

E W Dijkstra Letter to the editor Communications of the ACM Vol 11 March 1968 pp 147--148

Digital Library

[3]

A E Fischer P Jorrand BASEL The base language for an extensible language facility Mass Computer Associates Inc CA-6806-1311 June 1968

[4]

R W Floyd Syntactic analysis and operator precedence Journal of the ACM 10 July 1963 pp 316--333

Digital Library

[5]

J V Garwick J R Bell L D Krider The GPL language Control Data Corporation Palo Alto California Programming Technical Report TER-05, 1967

[6]

J V Garwick A general purpose language (GPL) Forsvarets Forskningsinstitut Norwegian Defence Research Establishment Intern Report S-32

[7]

B A Galler A J Perlis A proposal for definitions in ALGOL Communications of the ACM Vol 10 April 1967 pp 204--219

Digital Library

[8]

G F Leonard J R Goodroe An environment for an operating system Proceedings of the ACM 19th National Conference Philadelphia Pennsylvania 1964 New York ACM 1964 pp E2 3--1--E2 3--11

Digital Library

[9]

P J Landin The next 700 programming languages Communications of the ACM Vol 9 March 1966 pp 157--166

Digital Library

[10]

A J Perlis The synthesis of algorithmic systems First ACM Turing Lecture Journal of the ACM Vol 14 January 1967 pp 1--9

Digital Library

[11]

A J Perlis Private Communication

[12]

R M Shapiro S Warshall A general purpose table driven compiler Proceedings of the AFIPS Spring Joint Computer Conference Washington DC April 1964 Balitmore Spartan 1964 pp 59--65

Digital Library

[13]

R M Shapiro L J Zand A description of the compiler generator system Massachusetts Computer Associates Inc Wakefield Mass CA-6306-0112 June 1963

[14]

A van Wijngaarden B J Mailloux J E L Peck A draft proposal for the algorithmic language ALGOL 68 IFIP Working Group 2 1 MR 92 January 1968

[15]

N Wirth H Weber EULER: A generalization of ALGOL and its formal definition Part I Communications of the ACM Vol 9 January 1966 pp 3--9 Part II Communications of the ACM Vol 9 February 1966 pp 89--99

Digital Library

Cited By

Daquin CGirault C(2005)The construction of types of abstract machines in SIMACGI — 5. Jahrestagung10.1007/3-540-07410-4_631(205-218)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-07410-4_631
Solntseff NYezerski A(1974)A survey of extensible programming languagesAnnual Review in Automatic Programming10.1016/0066-4138(74)90001-97(267-307)Online publication date: Jan-1974
https://doi.org/10.1016/0066-4138(74)90001-9
Wegbreit B(1972)Multiple evaluators in an extensible programming systemProceedings of the December 5-7, 1972, fall joint computer conference, part II10.1145/1480083.1480118(905-915)Online publication date: 5-Dec-1972
https://dl.acm.org/doi/10.1145/1480083.1480118
Show More Cited By

On the basis for ELF: an extensible language facility
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages

Recommendations

O.LISP theoretical basis and description

We describe, in this article, O. LISP: a functional language based on the manipulation of expressions issued from the syntax of lambda-calculus on occurrence (λ()-caculus [8]). In this theoretical framework, the functions are constructed without ...
Layout-sensitive language extensibility with SugarHaskell
Haskell '12: Proceedings of the 2012 Haskell Symposium

Programmers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...
Layout-sensitive language extensibility with SugarHaskell
Haskell '12

Programmers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

AFIPS '68 (Fall, part II): Proceedings of the December 9-11, 1968, fall joint computer conference, part II

December 1968

607 pages

ISBN:9781450379007

DOI:10.1145/1476706

Copyright © 1968 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

AFIPS: American Federation of Information Processing Societies

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 December 1968

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
141
Total Downloads

Downloads (Last 12 months)27
Downloads (Last 6 weeks)5

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Daquin CGirault C(2005)The construction of types of abstract machines in SIMACGI — 5. Jahrestagung10.1007/3-540-07410-4_631(205-218)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-07410-4_631
Solntseff NYezerski A(1974)A survey of extensible programming languagesAnnual Review in Automatic Programming10.1016/0066-4138(74)90001-97(267-307)Online publication date: Jan-1974
https://doi.org/10.1016/0066-4138(74)90001-9
Wegbreit B(1972)Multiple evaluators in an extensible programming systemProceedings of the December 5-7, 1972, fall joint computer conference, part II10.1145/1480083.1480118(905-915)Online publication date: 5-Dec-1972
https://dl.acm.org/doi/10.1145/1480083.1480118
Milgrom EKatzenelson J(1972)Data structures in the extensible programming language AEPLProceedings of the December 5-7, 1972, fall joint computer conference, part I10.1145/1479992.1480064(515-523)Online publication date: 5-Dec-1972
https://dl.acm.org/doi/10.1145/1479992.1480064
Solntseff N(1972)A classification of extensible programming languagesInformation Processing Letters10.1016/0020-0190(72)90005-11:3(91-96)Online publication date: Feb-1972
https://doi.org/10.1016/0020-0190(72)90005-1
McFarland C(1970)A language-oriented computer designProceedings of the November 17-19, 1970, fall joint computer conference10.1145/1478462.1478554(629-640)Online publication date: 17-Nov-1970
https://dl.acm.org/doi/10.1145/1478462.1478554
Schuman SJorrand P(1970)Definition mechanisms in extensible programming languagesProceedings of the November 17-19, 1970, fall joint computer conference10.1145/1478462.1478465(9-20)Online publication date: 17-Nov-1970
https://dl.acm.org/doi/10.1145/1478462.1478465

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents