The Completeness of BCD for an Operational Semantics

Author Richard Statman



PDF
Thumbnail PDF

File

LIPIcs.TYPES.2016.15.pdf
  • Filesize: 248 kB
  • 5 pages

Document Identifiers

Author Details

Richard Statman

Cite AsGet BibTex

Richard Statman. The Completeness of BCD for an Operational Semantics. In 22nd International Conference on Types for Proofs and Programs (TYPES 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 97, pp. 15:1-15:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.TYPES.2016.15

Abstract

We give a completeness theorem for the BCD theory of intersection types in an operational semantics based on logical relations.
Keywords
  • intersection types
  • operational semantics
  • Beth model
  • logical relations
  • forcing

Metrics

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

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail