Program Specification and Data Refinement in Type Theory

@article{Luo1993ProgramSA,
  title={Program Specification and Data Refinement in Type Theory},
  author={Zhaohui Luo},
  journal={Mathematical Structures in Computer Science},
  year={1993},
  volume={3},
  pages={333-363}
}
or: for an equivalence relation R over some structure type S, Abs[R] : Spec(S) -> Spec(S) is defined as follows: Str[Abs[K](Si>)] =df S, Ax[Abs[R]{SP)](s) =df 3s':S.Ax[SP](s')&R{s,s'); and the notion of abstractor implementation would be given as: Abstractor implementation: SP is implemented by SP' via R (an equivalence relation over Str[SP]) through refinement map p : Str[SP'] -> Str[SP], written SP =^>p SP', if and only if,or implementation: SP is implemented by SP' via R (an equivalence… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS