[CTTCS 27] Programs, Recursion and Unbounded Choice - W.H.Hesselink [Cambridge Tracts in puter Science] (CUP 1992).pdf

PROGRAMS, RECURSION AND UNBOUNDED CHOICE
Cambridge Tracts in Theoretical
Computer Science
Managing Editor Professor CJ. van Rijsbergen,
Department puting Science, University of Glasgow
Editorial Board
S. Abramsky, Department puting Science, Imperial College of Science
and Technology
. Aczel, Department puter Science, University of Manchester
. de Bakker, Centrum voor Wiskunde en Informatica, Amsterdam
LA. Goguen, Programming Research Group, University of Oxford
. Tucker, Department of Mathematics puter Science,
University College of Swansea
Titles in the series
1. G. Chaitin Algorithmic Information Theory
2. . Paulson Logic putation
3. M. Spivey Understanding Z
4. G. Revesz Lambda Calculus, Combinators and Functional Programming
5. A. Ramsay Formal Methods in Artificial Intelligence
6. S. Vickers Topology via Logic
7. J-Y. Girard, Y. Lafont & P. Taylor Proofs and Types
8. J. Clifford Formal Semantics & Pragmatics for Natural Language Processing
9. M. Winslett Updating Logical Databases
10. K. McEvoy & . Tucker (eds) Theoretical Foundations of VLSI Design
11. . Tse A Unifying Framework for Stuctured Analysis and Design Models
12. G. Brewka Nonmonotonic Reasoning
13. G. Smolka Logic Programming over Polymorphically Order-Sorted Types
15. S. Dasgupta Design Theory puter Science
17. . Baeten (ed) Applications of Process Algebra
18. . Baeten & W. P. Weijland Process Algebra
23. E.-R. s, Terms and Formulas
27. . Hesselink Programs, Recursion and Unbounded Choice
29. P. Gardenfors (ed) Belief Revision
30. M. Anthony & N. putational Learning Theory
PROGRAMS, RECURSION AND
UNBOUNDED CHOICE
Predicate-Transformation Semantics and Transformation Rules

Department puter Science
University ofGroningen
CAMBRIDGE
UNIVERSITY PRESS
CAMBRIDGE UNIVERSITY PRESS
Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore, Sao Paulo
Cambridge University Press
The Edinburgh Building, Cambridge CB2