Due to obvious limitations of size, only some representative publications are listed here. More comprehensive bibliographies may be found in Curry, Hindley and Seldin (1972), Hindley (1997), Anderson, Belnap and Dunn (1992), Terese (2003) as well as Hindley and Seldin (2008).

• Anderson, A., N. Belnap, and J.M. Dunn, 1992. Entailment: The Logic of Relevance and Necessity (Volume II), Princeton: Princeton University Press. (Scholar)
• Barendregt, H. P., 1981. The Lambda Calculus. Its Syntax and Semantics, (Studies in Logic and the Foundations of Mathematics: Volume 103), Amsterdam: North-Holland. (Scholar)
• Barendregt, H., J. Endrullis, J. W. Klop and J. Waldmann, 2017. “Dance of the starlings,” in M. Fitting and B. Rayman (eds.), Raymond Smullyan on Self Reference, (Outstanding Contributions to Logic: Volume 14), Cham: Springer Nature, 67–111. (Scholar)
• Bimbó, K., 2003. “The Church-Rosser property in dual combinatory logic,” Journal of Symbolic Logic, 68: 132–152. (Scholar)
• –––, 2004. “Semantics for dual and symmetric combinatory calculi,” Journal of Philosophical Logic, 33: 125–153. (Scholar)
• –––, 2005. “Types of \(\textsf{I}\)-free hereditary right maximal terms,” Journal of Philosophical Logic, 34: 607–620. (Scholar)
• –––, 2007. “Relevance logics,” in D. Jacquette (ed.), Philosophy of Logic (Handbook of the Philosophy of Science: Volume 5), D. Gabbay, P. Thagard and J. Woods (eds.), Amsterdam: Elsevier/North-Holland, 2007, pp. 723–789. (Scholar)
• –––, 2010. “Schönfinkel-type operators for classical logic,” Studia Logica, 95: 355–378. (Scholar)
• –––, 2012. Combinatory Logic: Pure, Applied and Typed, Boca Raton, FL: CRC Press. (Scholar)
• –––, 2014. Proof Theory: Sequent Calculi and Related Formalisms, Boca Raton, FL: CRC Press. (Scholar)
• Bimbó, K., and J. M. Dunn, 2008. Generalized Galois Logics. Relational Semantics of Nonclassical Logical Calculi (CSLI Lecture Notes: Volume 188), Stanford, CA: CSLI Publications. (Scholar)
• –––, 2012. “New consecution calculi for \(R^\textbf{t}_\rightarrow\),” Notre Dame Journal of Formal Logic, 53: 491–509. (Scholar)
• –––, 2013. “On the decidability of implicational ticket entailment,” Journal of Symbolic Logic, 78: 214–236 (Scholar)
• –––, 2014. “Extracting \(\textsf{BB'IW}\) inhabitants of simple types from proofs in the sequent calculus \(LT^{\mathbf{t}}_{\rightarrow}\) for implicational ticket entailment,” Logica Universalis, 8(2): 141–164. (Scholar)
• Broda, S., Damas, L., Finger, M. and P. S. Silve e Silva, 2004. “The decidability of a fragment of \(\textsf{BB'IW}\)-logic,” Theoretical Computer Science, 318: 373–408. (Scholar)
• Bunder, M. W., 1992. “Combinatory logic and lambda calculus with classical types,” Logique et Analyse, 137–128: 69–79. (Scholar)
• –––, 2000. “Expedited Broda–Damas bracket abstraction,” Journal of Symbolic Logic, 65: 1850–1857. (Scholar)
• Cardone, F., and J. R. Hindley, 2006. “History of lambda-calculus and combinatory logic,” in D. M. Gabbay and J. Woods (eds.), Logic from Russell to Church (Handbook of the History of Logic: Volume 5), Amsterdam: Elsevier, 2006, 732–817. (Scholar)
• Church, A., 1941. The Calculi of Lambda-conversion, 1st edition, Princeton, NJ: Princeton University Press. (Scholar)
• Coppo, M., and M. Dezani-Ciancaglini, 1980. “An extension of the basic functionality theory for the \(\lambda\)-calculus,” Notre Dame Journal of Formal Logic, 21: 685–693. (Scholar)
• Curry, H. B., 1963. Foundations of Mathematical Logic, 1st edition, New York: McGraw–Hill Book Company, Inc. (2nd edition, 1977, New York: Dover Publications, Inc.) (Scholar)
• Curry, H. B., and R. Feys, 1958. Combinatory Logic (Studies in Logic and the Foundations of Mathematics: Volume I), 1st edition, Amsterdam: North-Holland. (Scholar)
• Curry, H. B., J. R. Hindley, and J. P. Seldin, 1972. Combinatory Logic (Studies in Logic and the Foundations of Mathematics: Volume II), Amsterdam: North-Holland. (Scholar)
• Dunn, J. M., 1991. “Gaggle theory: An abstraction of Galois connections and residuation with applications to negation, implication, and various logical operators,” in J. van Eijck (ed.), Logics in AI: European Workshop JELIA ’90 (Lecture Notes in Computer Science: Volume 478), Springer, Berlin, 1991, pp. 31–51. (Scholar)
• Dunn, J. M., and R. K. Meyer, 1997. “Combinators and structurally free logic,” Logic Journal of IGPL, 5: 505–537. (Scholar)
• Endrullis, J., J. W. Klop and A. Polonsky, 2016. “Reduction cycles in lambda calculus and combinatory logic,” in J. van Eijck, R. Iemhoff and J. J. Joosten (eds.), Liber Amicorum Alberti. A Tribute to Albert Visser (Tributes, Volume 30), London: College Publications, 111–124. (Scholar)
• Fitch, F., 1942. “A basic logic,” Journal of Symbolic Logic, 7: 105–114.
• –––, 1942. “An extension of basic logic,” Journal of Symbolic Logic, 13: 95–106. (Scholar)
• Gierz, G., K. H. Hofmann, K. Keimel, J. D. Lawson, M. W. Mislove, and D. S. Scott, 2003. Continuous Lattices and Domains (Encyclopedia of Mathematics and its Applications: Volume 93), Cambridge: Cambridge University Press. (Scholar)
• Gödel, K., 1931. “Über formal unentscheidbare Sätze der Principia mathematica und verwandter Systeme I,” in S. Feferman (ed.), Kurt Gödel: Collected Works (Volume I), New York and Oxford: Oxford University Press and Clarendon Press, 1986, pp. 144–195. (Scholar)
• Hindley, J. R., 1997. Basic Simple Type Theory (Cambridge Tracts in Theoretical Computer Science: Volume 42), Cambridge: Cambridge University Press. (Scholar)
• Hindley, J. R., and J. P. Seldin, 2008. \(\lambda\)-calculus and Combinators, an Introduction, Cambridge: Cambridge University Press. (Scholar)
• Kleene, S. C., 1967. Mathematical Logic, New York: John Wiley & Sons, Inc; reprinted Mineola, NY: Dover, 2002. (Scholar)
• Mackie, I., 2019. “Linear numeral systems,” Journal of Automated Reasoning, 63: 887–909. (Scholar)
• Padovani, V., 2013. “Ticket Entailment is decidable,” Mathematical Structures in Computer Science, 23(3): 568–607. (Scholar)
• Quine, W. V. O., 1960. “Variables explained away,” Proceedings of the American Philosophical Association, 104 (3): 343–347; reprinted in W.V.O. Quine, Selected Logical Papers, New York: Random House, 1966, 227–235. (Scholar)
• –––, 1981. “Predicate functors revisited,” Journal of Symbolic Logic, 46: 649–652. (Scholar)
• Révész, G. E., 1988. Lambda-calculus, Combinators and Functional Programming, Cambridge: Cambridge University Press. (Scholar)
• Rezus, A., 1982. A Bibliography of Lambda-Calculi, Combinatory Logics and Related Topics, Amsterdam: Mathematisch Centrum. (Scholar)
• Rosser, J. B., 1936. “A mathematical logic without variables,” Annals of Mathematics, 2: 127–150.
• Schönfinkel, M., 1924. “On the building blocks of mathematical logic,” in J. van Heijenoort, (ed.), From Frege to Gödel. A Source Book in Mathematical Logic, Cambridge, MA: Harvard University Press, 1967, pp. 355–366. (Scholar)
• Scott, D., 1970. Outline of a Mathematical Theory of Computation (Technical report), Oxford: Oxford University Computing Laboratory Programming Research Group. (Scholar)
• –––, 1974. “The language Lambda, (abstract),” Journal of Symbolic Logic, 39: 425–426. (Scholar)
• –––, 1976. “Data types as lattices,” SIAM Journal on Computing, 5: 522–587. (Scholar)
• Seldin J. P., 2006. “The logic of Curry and Church,” in D. M. Gabbay and J. Woods (eds.), Logic from Russell to Church (Handbook of the History of Logic: Volume 5), Amsterdam: Elsevier, 2006, 819–873. (Scholar)
• Smullyan, R. M., 1985. To Mock a Mockingbird. And other Logic Puzzles Including an Amazing Adventure in Combinatory Logic, New York: Alfred A. Knopf. (Scholar)
• –––, 1994. Diagonalization and Self-reference, Oxford: Clarendon. (Scholar)
• Updike, E. T., 2010. Paradise Regained: Fitch’s Program of Basic Logic, Ph.D. Thesis, University of California Irvine, Ann Arbor, MI: ProQuest (UMI). (Scholar)
• –––, 2012. “Abstraction in Fitch’s basic logic,” History and Philosophy of Logic, 33: 215–243. (Scholar)
• Tait, W., 1967. “Intensional interpretations of functionals of finite type I,” Journal of Symbolic Logic, 32: 198–212. (Scholar)
• Terese (by Marc Bezem, Jan Willem Klop, Roel de Vrijer, Erik Barendsen, Inge Bethke, Jan Heering, Richard Kennaway, Paul Klint, Vincent van Oostrom, Femke van Raamsdonk, Fer-Jan de Vries and Hans Zantema), 2003. Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science: Volume 55), Cambridge: Cambridge University Press. (Scholar)