Karim Nour ; Mohamad Ziadeh - A revised completeness result for the simply typed $\lambda\mu$-calculus using realizability semantics

lmcs:2625 - Logical Methods in Computer Science, August 22, 2017, Volume 13, Issue 3 - https://doi.org/10.23638/LMCS-13(3:13)2017
A revised completeness result for the simply typed $\lambda\mu$-calculus using realizability semanticsArticle

Authors: Karim Nour ; Mohamad Ziadeh

    In this paper, we define a new realizability semantics for the simply typed lambda-mu-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability semantics using a particular term model. This paper corrects some errors in [21] by the first author and Saber.

    Comment: arXiv admin note: text overlap with arXiv:0905.0357

    https://doi.org/10.23638/LMCS-13(3:13)2017
    Source: arXiv.org:1612.09223
    Volume: Volume 13, Issue 3
    Published on: August 22, 2017
    Imported on: August 22, 2017
    Keywords: Mathematics - Logic, Computer Science - Logic in Computer Science
    Licence: arXiv.org - Non-exclusive license to distribute

    Classifications

    Mathematics Subject Classification 20201
    Sources:
    • [1] zbMATH Open.

    Share and export

    Consultation statistics

    This page has been seen 1935 times.
    This article's PDF has been downloaded 495 times.