The K combinator as a semantically transparent tagging mechanism

Abstract

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

Download PDF:
_{Sorry, we are unable to provide the full text but you may find it at the following location(s):}

http://citeseerx.ist.psu.edu/v... (external link)

http://www.cl.cam.ac.uk/users/... (external link)