Refinement Calculus

@inproceedings{Back1998RefinementC,
  title={Refinement Calculus},
  author={R. Back and J. V. Wright},
  booktitle={Graduate Texts in Computer Science},
  year={1998}
}
  • R. Back, J. V. Wright
  • Published in
    Graduate Texts in Computer…
    1998
  • Computer Science
  • 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
    148 Citations

    Topics from this paper

    ZRC – A Refinement Calculus for Z
    • 54
    A Theory of Synchronous Relational Interfaces
    • 75
    • PDF
    "JACK: A process algebra implementation in Java"
    • 8
    • PDF
    The Timed Predicative Calculus as a Framework for Comparative Semantics
    • 1
    • PDF
    On Role Logic
    • 15
    • PDF
    Formal Semantics for Program Paths
    • 6
    Software Evolution with Refinement and Retrenchment
    • 6
    Modular semantics for object-oriented models
    • 12
    • PDF
    Algebraic reasoning for object-oriented programming
    • 89
    • PDF

    References

    SHOWING 1-8 OF 8 REFERENCES
    Countable nondeterminism and random assignment
    • 190
    • Highly Influential
    • PDF
    An introduction to mathematical logic and type theory - to truth through proof
    • P. Andrews
    • Mathematics, Computer Science
    • Computer science and applied mathematics
    • 1986
    • 679
    • Highly Influential
    • PDF
    Realizable and Unrealizable Specifications of Reactive Systems
    • 273
    • PDF
    Quantifiers; Games and Inductive Definitions
    • 23
    Ten Years of Hoare's Logic: A Survey—Part I
    • K. Apt
    • Computer Science
    • TOPL
    • 1981
    • 590
    • PDF
    On the correctness of refinement in program development
    • Ph.D. thesis, Report A-1978-4,
    • 1978
    Correctness preserving program refinements: Proof theory and applications
    • 255
    Semantics of unbounded nondeterminism : (preprint)
    • 1