Barendregt, H. P., The lambda-calculus: its syntax and semantics, Studies in Logic and the Foundations of Mathematics, vol. 103, North-Holland, 1984.
Beeson, M.J., Foundations of constructive mathematics, Springer, 1985.
Bishop, E., Foundations of constructive analysis, McGraw-Hill Book Company, New York, 1967.
Bove, A. and Dybjer, P., Dependent types at work, Language engineering and rigorous software development (Bove, A.
et al., editors), Lecture Notes in Computer Science, vol. 5520, Springer, 2009, pp. 57–99.
Bridges, D. and Richman, F., Varieties of constructive mathematics, London Mathematical Society Lecture Note Series, vol. 97, Cambridge University Press, Cambridge, 1987.
Bridges, D., Dalen, D. Van, and Ishihara, H., Ishihara's proof technique in constructive analysis, Indagationes Mathematicae, vol. 14 (2003), no. 2, pp. 163–168.
Bridges, D. and ViŢĂ, L., A general constructive proof technique, Electronic Notes in Theoretical Computer Science, vol. 120 (2005), pp. 31–43.
Coquand, T., Hancock, P., and Setzer, A., Ordinals in type theory, invited talk at Computer Science Logic, CSL 97, http://www.cse.Chalmers.se/~coquand/ordinal.ps, 1997.
Escardó, M. H., Infinite sets that admit fast exhaustive search, Logic in computer science, IEEE Computer Society, 2007, pp. 443–452.
Escardó, M. H., Exhaustible sets in higher-type computation, Logical Methods in Computer Science, vol. 4 (2008), no. 3, pp. 3:3, 37.
Escardó, M. H. and Oliva, P., Bar recursion and products of selection functions, available from the authors' web page, November, 2010.
Escardó, M. H., Searchable sets, Dubuc-Penon compactness, omniscience principles, and the Drinker Paradox, Computability in Europe 2010 (Ferreira, F., Guerra, H., Mayordomo, E., and Rasga, J., editors), Centre for Applied Mathematics and Information Technology, Department of Mathematics, University of Azores, abstract and handout booklet, 2010, pp. 168–177.
Escardo, M. H., Selection functions, bar recursion and backward induction, Mathematical Structures in Computer Science, vol. 20 (2010).
Grilliot, T. J., On effectively discontinuous type-2 objects, this Journal, vol. 36 (1971), pp. 245–248.
Hartley, J. P., Effective discontinuity and a characterisation of the superjump, this Journal, vol. 50 (1985), no. 2, pp. 349–358.
Ishihara, H., Continuity and nondiscontinuity in constructive mathematics, this Journal, vol. 56 (1991), no. 4, pp. 1349–1354.
Escardo, M. H., Constructive reverse mathematics: compactness properties, From sets and types to topology and analysis (Crosilla, Laura and Schuster, Peter, editors), Oxford Logic Guides, vol. 48, Oxford University Press, Oxford, 2005, pp. 245–267.
Kreisel, G., Lacombe, D., and Shoenfield, J. R., Partial recursive functionals and effective operations, Constructivity in mathematics (Heyting, A., editor), Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1959, pp. 290–297.
Palmgren, E., Constructivist and structuralist foundations: Bishop's and Lawvere's theories of, sets, Annals of Pure and Applied Logic, vol. 163 (2012), no. 10, pp. 1384–1399.
Troelstra, A. S. and Dalen, D. Van, Constructivism in mathematics, Studies in Logic and the Foundations of Mathematics, vol. 121 and 123, North Holland, Amsterdam, 1988.
Heijenoort, J. Van, From Frege to Godel: A source book in mathematical logic, 1879-1931, Harvard University Press, 1967.