| | |
Summary: A Kind System for Typed Machine Language
Andrew W. Appel Christopher D. Richards
Princeton University, October 2002
{appel,richards,kswadi}@cs.princeton.edu
Kedar N. Swadi
ABSTRACT
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 proper-
ties 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 sys-
tem with semantic proofs.
1. INTRODUCTION
Some of the early frameworks for Proof-Carrying Code (PCC)
[12] assumed the soundness of the typing rules for a particu-
lar type system. Foundational Proof-Carrying Code (FPCC)
[3] reduces the size of the Trusted Computing Base by giv-
ing semantics to types and instructions in terms of higher-
|
