This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
P. Aczel , An introduction to inductive definitions, Handbook of Mathematical Logic (J. Barwise , editor), Studies in Logic and the Foundations of Mathematics, vol. 90, chapter C.7, North-Holland Publishing Company, 1977, pp. 739–782.
K. Aehlig and J. Johannsen , An elementary fragment of second-order lambda-calculus, ACM Transactions on Computational Logic, vol. 6 (2005), no. 2, pp. 468–480.
T. Altenkirch and T. Coquand , A finitary subsystem of the polymorphic lambda-calculus, Proceedings of the 5th international conference on typed lambda caculi and applications (TLCA '01) (S. Abramsky , editor), Lecture Notes in Computer Science, vol. 2044, Springer Verlag, Berlin, 2001, pp. 22–28.
T. Arai , A slow growing analogue to Buchholz' proof, Annals of Pure and Applied Logic, vol. 54 (1991), pp. 101–120.
S. Feferman , Formal theories for transfinite iterations of generalized inductive definitions, Intuitionism and proof theory (proceedings of the summer conference at Buffalo N. Y. 1968) (A. Kino , J. Myhill , and R. E. Vesley , editors), Studies in Logic and the Foundation of Mathematics, North-Holland Publishing Company, Amsterdam, 1970, pp. 303–326.
D. Leivant , Finitely stratified polymorphism, Information and Computation, vol. 93 (1991), pp. 93–113.
G. Takeuti , Consistency proofs of subsystems of classical analysis, Annals of Mathematics, vol. 86 (1967), pp. 299–348.