Pass through InductiveTypes, through end of recursive types

latex/cpdt.bib

@@ -130,9 +130,29 @@
   year = {1988}
 }
 
-@article{GADT,
+@inproceedings{GADT,
   author = {Hongwei Xi and Chiyan Chen and Gang Chen},
   title = {Guarded Recursive Datatype Constructors},
   booktitle = {Proceedings of the 30th ACM SIGPLAN Symposium on Principles of Programming Languages},
   year = {2003}
 }
+
+@article{Curry,
+  title={Functionality in Combinatory Logic},
+  author = {H. B. Curry},
+  journal = {Proceedings of the National Academy of Sciences of the United States of America},
+  volume = {20(11)},
+  year = {1934},
+  pages = {584--590}
+}
+
+@incollection{Howard,
+  author = {Howard, William A.},
+  title = {The formulae-as-types notion of construction},
+  editor = {Seldin, Jonathan P. and Hindley, J. Roger},
+  booktitle = {To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism},
+  publisher = {Academic Press},
+  pages = {479--490},
+  year = {1980},
+  note = {Original paper manuscript from 1969}
+}