Relative Completeness for Logics of Functional Programs

Authors Bernhard Reus, Thomas Streicher

Thumbnail PDF


  • Filesize: 0.49 MB
  • 11 pages

Document Identifiers

Author Details

Bernhard Reus
Thomas Streicher

Cite AsGet BibTex

Bernhard Reus and Thomas Streicher. Relative Completeness for Logics of Functional Programs. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 470-480, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)


We prove a relative completeness result for a logic of functional programs extending D. Scott's LCF. For such a logic, contrary to results for Hoare logic, it does not make sense to ask whether it is complete relative to the full theory of its first-order part, since the first order part does not determine uniquely the model at higher-order types. Therefore, one has to fix a model and choose an appropriate data theory w.r.t. which the logic is relatively complete. We establish relative completeness for two models: for the Scott model we use the theory of Baire Space as data theory, and for the effective Scott model we take first-order arithmetic. In both cases we need to extend traditional LCF in order to capture a sufficient amount of domain theory.
  • completeness
  • program logics
  • LCF


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail