C.A.R. Hoare. Correctness of data representations. Acta Informatica 1:271--281 (1972). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Constructive Data Refinement in Typed Lambda Calculus - Honsell, Longley.. (2000) (4 citations) (Correct)
....in both cases. The standard treatment of data refinement in the context of typed lambda calculus, originating with Reynolds in [Rey81,Rey83] but described most clearly in [Ten94] cf. Sect. 8.5 of [Mit96] uses logical relations to prove the correctness of refinements. This work has its roots in [Hoa72], which proposes that the correctness of the concrete program be verified using an invariant on the domain of concrete values together with a function mapping concrete values (that satisfy the invariant) to abstract values. In algebraic terms, what is required is a homomorphism from a subalgebra ....
C.A.R. Hoare. Correctness of data representations. Acta Informatica 1:271--281 (1972).
Constructive Data Refinement in Typed Lambda Calculus - Honsell, Longley.. (2000) (4 citations) (Correct)
....and a substantial example of refinement is presented. 1 Introduction Various treatments of data refinement in the context of typed lambda calculus, beginning with Tennent s in [Ten94] have used logical relations to formalize the intuitive notion of refinement. This work has its roots in [Hoa72], which proposes that the correctness of a concrete version of an abstract program be verified using an invariant on the domain of concrete values together with a function mapping concrete values (that satisfy the invariant) to abstract values. In algebraic terms, what is required is a ....
C.A.R. Hoare. Correctness of data representations. Acta Informatica 1:271--281 (1972).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC