2000 character limit reached
A revised completeness result for the simply typed $λμ$-calculus using realizability semantics
Published 29 Dec 2016 in math.LO and cs.LO | (1612.09223v4)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.