Descriptive and Relative Completeness of Logics for Higher-Order Functions

  title={Descriptive and Relative Completeness of Logics for Higher-Order Functions},
  author={Kohei Honda and Martin Berger and Nobuko Yoshida},
This paper establishes a strong completeness property of compositional program logics for pure and imperative higher-order functions introduced in [2, 15–18]. This property, called descriptive completeness, says that for each program there is an assertion fully describing the former’s behaviour up to the standard observational semantics. This formula is inductively calculable from the program text alone. As a consequence we obtain the first relative completeness result for compositional logics… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS
18 Citations
30 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 30 references

Assigning meaning to programs

  • R. W. Floyd
  • In Symp. in Applied Mathematics, volume 19,
  • 1967
Highly Influential
6 Excerpts

and M

  • N. Yoshida, K. Honda
  • Berger. Local state in hoare logic for imperative…
  • 2006
1 Excerpt

Similar Papers

Loading similar papers…