Preview
Unable to display preview. Download preview PDF.
References
Goguen, J., J. W. Thatcher, E. G. Wagner and J. B. Wright. “An initial algebra semantics and continuous algebras”. Journal of the ACM, Vol. 24(1), January 1977, pp. 68–95.
Aho, A. V., J. E. Hopcroft, and J. D. Ullman The Design and Analysis of Computer Algorithms. Addison Wesley, 1974.
Bednarczyk, M. A. and A. M. Borzyszkowski. “Graphs make initial uniform topological algebras”, in preparation.
Bednarczyk, M. A., A. M. Borzyszkowski and W. Pawłowski. “Towards the Semantics of the Definitional Language of MetaSoft”. This volume.
Cohn, P. M. Universal Algebra. Harper and Row, 1965.
Courcelle, B. “Fundamental properties of infinite trees”. Theoretical Computer Science 25, 1983, pp. 95–169.
Courcelle, B. “Equivalences and Transformations of Regular Systems—Applications to Recursive Program Schemes and Grammars”. Theoretical Computer Science 42, 1986, pp. 1–122.
Grätzer, G. Universal Algebra. 2-nd edition, Springer-Verlag, 1979.
Milner, R. “Calculi for Synchrony and Asynchrony”. Theoretical Computer Science 25, 1983, pp. 267–310.
Park, D. “Concurrency and Automata on Infinite Sequences”. Proceedings 5th GI Conf. on Theoret. Comp. Science, Lecture Notes in Computer Science 104, Springer-Verlag, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bednarczyk, M.A., Borzyszkowski, A.M., Pawłowski, W. (1990). Recursive definitions revisited. In: Bjørner, D., Hoare, C.A.R., Langmaack, H. (eds) VDM '90 VDM and Z — Formal Methods in Software Development. VDM 1990. Lecture Notes in Computer Science, vol 428. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52513-0_23
Download citation
DOI: https://doi.org/10.1007/3-540-52513-0_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52513-4
Online ISBN: 978-3-540-47006-9
eBook Packages: Springer Book Archive