Abstract
The technique of expressing the semantics of a mechanical language in terms of the language itself is considered; an attempt is made to give a description that is independent of the specific language to which the technique is applied. The main investigation is restricted to expression languages, i.e. languages whose meaningful terms are expressions denoting constants. Lisp is used as an example, and some remarks how to extend the technique to programming languages are added.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
McCARTHY, John: Lisp 1.5 Programmers Manual — Massachusetts Institute of Technology (1962).
McCARTHY, John: Towards a Mathematical Science of Computation — In: C. M. Popplewell (editor), Proceedings of IFIP Congress 1962 — North Holland Publishing Company, Amsterdam (1963).
MARKOV, A.A.: The Theory of Algorithms — Am. Math. Soc. Transl. Ser. 2, vol. 15 (1960).
TURING, A.M.: On computable numbers with an application to the Entscheidungs problem — Proc. London Math. Soc., vol.42 (1936); vol.43 (1937).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bekić, H. (1984). Defining a language in its own terms. In: Jones, C.B. (eds) Programming Languages and Their Definition. Lecture Notes in Computer Science, vol 177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0048937
Download citation
DOI: https://doi.org/10.1007/BFb0048937
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13378-0
Online ISBN: 978-3-540-38933-0
eBook Packages: Springer Book Archive