A Kind System for Typed Machine Language


One of the aims of Foundational Proof-Carrying Code (FPCC) is to incorporate a completely semantic description of types into the Proof-Carrying Code framework. FPCC describes types as complex predicates, some of which require properties like contractiveness, representability, and extensionality to hold. We keep track of these properties by encoding them within kinds. In this paper, we give a syntactic kinding system with semantic proofs.

Extracted Key Phrases

4 Figures and Tables

Cite this paper

@inproceedings{Appel2002AKS, title={A Kind System for Typed Machine Language}, author={Andrew W. Appel and Christopher D. Richards and Kedar N. Swadi}, year={2002} }