1. A predicative strong normalisation proof for a λ-calculus with interleaving inductive types;Abel,2000
2. J. Avigad and S. Feferman. Gödel’s functional (“Dialectica”) interpretation. In Buss [63], chapter V, pages 337–405.
3. The computability of primitive recursive terms of finite type, and primitive recursive realization;Dragalin,1970
4. J.-Y. Girard. Une extension du système de fonctionelles recursives de Gödel et son application aux fondements de l’analyse. In Fenstad [148], pages 63–92.
5. Proofs and Types, volume 7 of Cambridge Tracts in Theoretical Computer Science;Girard,1989