15-399 Constructive Logic
Lecture 16: Reasoning about Data Representations
Using natural numbers in binary notation as an example, we discuss
how to reason about different representations of data types. In
particular, we consider what is required for one function to implement
another on a different representation.
As a second topic, we consider the notion of an admissible rule of
inference. For a rule to be admissible, every instance must be valid.
This is a weaker requirement than for derived rules, where we must have
a hypothetical derivation of the conclusion from the premises.