Should your specification language be typed
ACM Transactions on Programming Languages and Systems (TOPLAS)
Unifying Sets and Programs via Dependent Types
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Hi-index | 0.00 |
IZF is a well investigated impredicative constructive version of Zermelo-Fraenkel set theory. Using set terms, we axiomatize IZF with Replacement, which we call IZFR, along with its intensional counterpart IZF$_{R}^{\rm --}$ . We define a typed lambda calculus λZ corresponding to proofs in IZF$_{R}^{\rm --}$ according to the Curry-Howard isomorphism principle. Using realizability for IZF$_{R}^{\rm --}$ , we show weak normalization of λZ by employing a reduction-preserving erasure map from lambda terms to realizers. We use normalization to prove disjunction, numerical existence, set existence and term existence properties. An inner extensional model is used to show the properties for full, extensional IZFR.