The K combinator provides a semantically transparent tagging mechanism which is useful in various aspects of mechanizing higher order logic. Our examples include: numerals, normalization procedures, named hypotheses in goal-directed proof, and rewriting directives
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.