Refinement Calculus
@inproceedings{Back1998RefinementC, title={Refinement Calculus}, author={R. Back and J. V. Wright}, booktitle={Graduate Texts in Computer Science}, year={1998} }
Categories We can generalize the notion of a concrete category to an (abstract) category. A category C consists of a collection of objects Obj(C) and a collection of morphisms Mor(C). Each morphism has a source and a target, both of which are objects. We write A -!.... B to indicate that / is a morphism with source A and target B. Furthennore, there is a composition operator that takes a morphism A -!.... B and a morphism B ...!.. c to the morphism A ~ B. Composition / ; g is defined only if… CONTINUE READING
Topics from this paper
148 Citations
Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques
- Mathematics, Computer Science
- J. Symb. Comput.
- 2019
- 7
- PDF
References
SHOWING 1-8 OF 8 REFERENCES
Countable nondeterminism and random assignment
- Mathematics, Computer Science
- JACM
- 1986
- 190
- Highly Influential
- PDF
An introduction to mathematical logic and type theory - to truth through proof
- Mathematics, Computer Science
- Computer science and applied mathematics
- 1986
- 679
- Highly Influential
- PDF
On the correctness of refinement in program development
- Ph.D. thesis, Report A-1978-4,
- 1978