License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TYPES.2016.15
URN: urn:nbn:de:0030-drops-98478
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9847/
Go to the corresponding LIPIcs Volume Portal

Statman, Richard

The Completeness of BCD for an Operational Semantics

pdf-format:
LIPIcs-TYPES-2016-15.pdf (0.2 MB)

Abstract

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

BibTeX - Entry

@InProceedings{statman:LIPIcs:2018:9847,
  author =	{Richard Statman},
  title =	{{The Completeness of BCD for an Operational Semantics}},
  booktitle =	{22nd International Conference on Types for Proofs and  Programs (TYPES 2016)},
  pages =	{15:1--15:5},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-065-1},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{97},
  editor =	{Silvia Ghilezan and Herman Geuvers and Jelena Ivetić},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9847},
  URN =		{urn:nbn:de:0030-drops-98478},
  doi =		{10.4230/LIPIcs.TYPES.2016.15},
  annote =	{Keywords: intersection types, operational semantics, Beth model, logical relations, forcing}
}

Keywords: intersection types, operational semantics, Beth model, logical relations, forcing
Collection: 22nd International Conference on Types for Proofs and Programs (TYPES 2016)
Issue Date: 2018
Date of publication: 05.11.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI