A completeness result for the simply typed $λμ$-calculus

Details A completeness result for the simply typed $λμ$-calculus A completeness result for the simply typed $λμ$-calculus

2009-05-04

arxiv.org/abs/0905.0357v1

Annals of Pure and Applied Logic (2009) 1-16

Mathematics

Logic

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A completeness result for the simply typed $λμ$-calculus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A completeness result for the simply typed $λμ$-calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A completeness result for the simply typed $λμ$-calculus will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-199407