This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Hitchcock, P. and D.M.R. Park, Induction rules and proofs of termination, Proc. 1 st ICALP (M. Nivat, ed.), pp. 225–251, 1973, North-Holland, Amsterdam.
Mazurkiewicz, A., Proving properties of processes, CC PAS reports 134, Warsaw, 1973.
De Roever, W.P., Maximal fixed points solve some of the problems with Scott induction, Proc. 4 th ICALP, to appear.
Scott, D. and C. Strachey, Towards a mathematical semantics for computer languages, Proc. Symp. Computers and Automata (J. Fox, ed.), pp. 19–46, 1971, Polytechnic Institute of Brooklyn.
Milne, R. and C. Strachey, A Theory of Programming Language Semantics, Chapman & Hall, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Bakker, J.W. (1977). Semantics of infinite processes using generalized trees. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_141
Download citation
DOI: https://doi.org/10.1007/3-540-08353-7_141
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08353-5
Online ISBN: 978-3-540-37285-1
eBook Packages: Springer Book Archive