A completeness result for the simply typed $\lambda\mu$-calculus

Karim Nour (1) , Khelifa Saber (1)

1 LAMA - Laboratoire de Mathématiques

In this paper, we define a 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. This result serves to give characterizations of the computational behavior of some closed typed terms. We also prove a completeness result of our realizability semantics using a particular term model.

Domaines: Logique [math.LO]

Karim Nour, Khelifa Saber. A completeness result for the simply typed $\lambda\mu$-calculus. Annals of Pure and Applied Logic, 2009, 161, pp.109-118. ⟨hal-00380646⟩