Abstract
Computations are carried out in recursive languages by the iterative application of two kinds of transformation rules (substitution and simplification rules) to an initial term.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cadiou J.M. “Recursive definitions of partial functions and their computations”. Ph.D. Thesis. Computer Science Depat. Stanford U., 1972.
Manna Z., S.Ness and J.Vuillemin. “Inductive methods for proving properties of pregrams”. CACM, pp. 491–502, August 1973.
Pacini G. “An optimal fixpoint computation algorithm for a simple recursive language”. Internal Report I.F.I. 873–10, October 73.
Rosen K.B.K. “Tree manipulating systems and Church Rosser theorems”. JACM, pp. 160–187, January 1973.
Scott D. “Outline of a mathematical theory of computation”. Oxford U. PRO technical mono., 1970.
Vuillemin J. “Correct and optimal implementations of recursion in a simple programming language”. Proc. of 5-th annual ACM Symposium or Theory of Computing. Austin,Texas. pp. 224–239, April 1973.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pacini, G., Montangero, C., Turini, F. (1974). Graph Representation and Computation Rules for Typeless Recursive Languages. In: Loeckx, J. (eds) Automata, Languages and Programming. ICALP 1974. Lecture Notes in Computer Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21545-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-21545-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06841-9
Online ISBN: 978-3-662-21545-6
eBook Packages: Springer Book Archive