## Nour, Karim and Ziadeh, Mohamad - 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
A revised completeness result for the simply typed $\lambda\mu$-calculus using realizability semantics

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.

Source : oai:arXiv.org:1612.09223
DOI : 10.23638/LMCS-13(3:13)2017
Volume: Volume 13, Issue 3
Published on: August 22, 2017
Submitted on: August 22, 2017
Keywords: Mathematics - Logic,Computer Science - Logic in Computer Science