Location of Repository

The K combinator as a semantically transparent tagging mechanism

By Konrad Slind and Michael Norrish

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

Year: 2002
OAI identifier: oai:CiteSeerX.psu:10.1.1.19.6098
Provided by: CiteSeerX
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)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.