This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G.Asser, Rekursive Wortfunktionen, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 6, pp.258–278.
H.Bekic, K.Walk, Formalization of storage properties, in: Symposium on Semantics of Algorithmic Languages (E.Engeler ed.), Springer Lecture Notes 188, 1971.
M.Blum, A machine-independent theory of the complexity of recursive functions, J.ACM 14/2, 1967.
B.Buchberger, Associating functions and the operator of conditioned iteration (Russian), Communications of the JINR Dubna, P5-5788, (English translation: Bericht Nr.71–1, Inst.f.num. Math., Univ.Innsbruck, 1971).
B.Buchberger, A basic problem in the theory of programming languages, Bericht Nr.72–1, Inst.f.num.Math., Univ.Innsbruck, 1972.
B.Buchberger, B.Roider, A study on universal functions, Bericht Nr.72–5, Inst.f.num.Math., Univ.Innsbruck, to appear.
E.F.Codd, Cellular automata, Academic Press, 1968.
J.E.Fenstad, On axioms for computation theories, Lecture given at the conference on mathematical logic, Oberwolfach, Germany, April 1972.
P.C.Gilmore, An abstract computer with a LISP-like machine language, in: Computer Programming and Formal Systems (P.Braffort/D.Hirschberg ed.), North-Holland, 1967.
P.Lucas, P.Lauer, H.Stigleitner, Method and notation for the formal definition of programming languages, TR 25.087, IBM Laboratory Vienna, 1968.
J.McCarthy, LISP 1.5 programmer's manual, MIT Press, 1962.
J.McCarthy, J.Painter, Correctness of a compiler for arithmetic expressions, Proc.of Symp.in Applied Math. 19 (J.T. Schwartz ed.), Amer.Math.Soc., pp.33–41.
A.A.Markov, On the representation of recursive functions (Russian), Doklady Ak.Nauk SSSR, n.s.58, pp.1891–1892.
Axioms for computation theories — first draft, in: Logic Colloquium '69 (R.O.Gandy, C.M.E.Yates ed.), North-Holland, 1971.
H. Rogers, Jr., Gödel numberings of partial recursive functions, J.Symbolic Logic 23/3, pp.331–341, 1958.
H.Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill 1967.
F. Schwenkel, Semantische Theorie der Programmiersprachen, Dissertation, Univ.Tübingen, Germany, 1966.
D. Scott, Some definitional suggestions for automata theory, J.Comp.System Sci. 1, pp.187–212, 1967.
D.Scott, The lattice of flow diagrams, in: Symposium on Semantics of Algorithmic Languages (E.Engeler ed.), Springer Lecture Notes 188, 1971.
J.R.Shoenfield, Degrees of unsolvability, North-Holland/American Elsevier, 1971.
V.A.Uspenskii, Computable operators and the notion of program (Russian), Uspehi Mat.Nauk 11/4, pp.172–176.
V.A. Uspenskii, Lectures on computable functions (Russian), Gos.Izd.Fiz.Mat.Lit., Moscow, 1960.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buchberger, B. (1974). Certain decompositions of Gödel numbering and the semantics of programming languages. In: Ershov, A., Nepomniaschy, V. (eds) International Symposium on Theoretical Programming. Lecture Notes in Computer Science, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06720-5_13
Download citation
DOI: https://doi.org/10.1007/3-540-06720-5_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06720-7
Online ISBN: 978-3-540-38012-2
eBook Packages: Springer Book Archive