Unifying Recursion in Partial, Total and General Correctness-Reference-Cited by-同舟云学术

Unifying Recursion in Partial, Total and General Correctness

Published:2010 Issue: Volume: Page:207-225
ISSN:0302-9743
Container-title:Unifying Theories of Programming
language:
Short-container-title:

Author:

Guttmann Walter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-16690-7_10

Reference31 articles.

1. Aarts, C.J.: Galois connections presented calculationally. Master’s thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology (1992)

2. de Bakker, J.W.: Semantics and termination of nondeterministic recursive programs. In: Michaelson, S., Milner, R. (eds.) Automata, Languages and Programming: Third International Colloquium, pp. 435–477. Edinburgh University Press, Edinburgh (1976)

3. Berghammer, R., Zierer, H.: Relational algebraic semantics of deterministic and nondeterministic programs. Theoretical Computer Science 43, 123–147 (1986)

4. Colloquium Publications;G. Birkhoff,1967

5. Lecture Notes in Computer Science;M. Broy,1979

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hoare and He’s Unifying Theories of Programming;Theories of Programming;2021-10-02

2. UTP by Example: Designs;Engineering Trustworthy Software Systems;2017

3. An algebraic approach to computations with progress;Journal of Logical and Algebraic Methods in Programming;2016-06

4. Infinite executions of lazy and strict computations;Journal of Logical and Algebraic Methods in Programming;2015-05

5. Extended designs algebraically;Science of Computer Programming;2013-11