A theory of bunches

Acta Informatica

Volumn 37, Issue 8, 2001, Pages 541-561

  Morris, Joseph M ^a   Bunkenburg, Alexander ^b  

^a DUBLIN CITY UNIVERSITY   (Ireland)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035324730     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00013316     Document Type: Article

References (19)

1. [Bac80] R.-J. R. Back: Correctness preserving program refinements: Proof theory and applications. Tract 131, Mathematisch Centrum, Amsterdam, 1980
2. [DS90] E. W. Dijkstra, C. S. Scholten: Predicate Calculus and Program Semantics. New York: Springer 1990
3. [GS93] D. Gries, F. B. Schneider: A Logical Approach to Discrete Math. New York: Springer 1993
4. [Heh81] E. C. R. Hehner: Bunch theory: a simple set theory for computer science. Inf Process Lett 12: 26-31 (1981)
5. [Heh84] E. C. R. Hehner: The Logic of Programming. ISBN 0135399661. Englewood Cliffs, NJ: Prentice Hall 1984
6. [Heh93] E. Hehner: A Practical Theory of Programming. ISBN 0387941061. New York, London: Springer 1993
7. [HP72] P. Hitchcock, D. Park: Induction Rules and Termination Proofs. In: IRIA Conference on Automata, Languages, and Programming Theory, 1972
8. [Lee93] René Leermakers: The Functional Treatment of Parsing. ISBN 0-7923-9376-7. Dordrecht: Kluwer 1993
9. [MB98] J. M. Morris, A. Bunkenburg: Partiality and nondeterminacy in program proofs. Formal Asp Comput Sci 10: 76-96 (1998)
10. [MB99a] J. M. Morris, A. Bunkenburg: E3: A logic for reasoning equationally in the presence of partiality. Sci Comput Programm 34: 141-158 (1999)
11. [MB99b] J. M. Morris, A. Bunkenburg: Many-valued Logics for Programming: Theorems and Proofs. Report R-1999-49, University of Glasgow, Department of Computing Science, 1999. Available from http://www.compapp.dcu.ie/~jmorris/pubs/manyv.pdf
12. [MB99c] J. M. Morris, A. Bunkenburg: Specificational functions. ACM Trans Programm Lang Syst 21: 677-701 (1999)
13. [MB99d] J. M. Morris, A. Bunkenburg: Theorems of EB. http://www.compapp.dcu.ie/~jmorris/pubs/eblaws.pdf, University of Glasgow, Department of Computing Science, 1999
14. [MB00] J. M. Morris, A. Bunkenburg. A source of inconsistency in theories of nondeterministic functions. 2000. Submitted for publication
15. [Mee86] L. Meertens: Algorithmics - towards programming as a mathematical activity. Math Comput Sci 1: 1-46 (1986). CWI Monographs (J.W. de Bakker, M. Hazewinkel, J. K. Lenstra, eds.) North Holland, Publ. Co
16. [Mor87] J. M. Morris: A theoretical basis for stepwise refinement and the programming calculus. Sci Comput Program 9: 287-306 (1987)
17. [Mor88] C. Morgan: The specification statement. ACM Trans Program Lang Syst 10: 403-419 (1988)
18. [Ne189] G. Nelson: A generalization of Dijkstra's calculus. ACM Trans Program Lang Syst 11(4): 517-561 (1989)
19. [NH93] T. S. Norvell, E. C. R. Hehner: Logical specifications for functional programs. In: Proceedings of the 2nd International Conference on Mathematics of Program Construction, Oxford, 29 June-3 July 1992, Vol 669 of Lecture Notes in Computer Science, pp 269-290. Berlin Heidelberg New York: Springer 1993