[1]

Archimedes. The Works of Archimedes. Cambridge University Press, Cambridge, 1897.

[2]

Richard Bird and Oege de Moor. Algebra of Programming. Prentice Hall International Series in Computer Science. Prentice Hall, 1997. Relational calculus of optimisation: max R = membership intersect (R / converse-membership), the power transpose Lambda, and argmax as max R composed with Lambda F (Ch. 10, Optimisation problems). Grounds the point-free min/max/argmax surface.

[3]

B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, Cambridge, 2 edition, 2002.

[4]

Richard Dedekind. Was sind und was sollen die Zahlen?. Vieweg, Braunschweig, 1888.

[5]

Joachim Lambek and Philip J Scott. Introduction to Higher-Order Categorical Logic. Cambridge University Press, 1988.

[6]

F. William Lawvere and Robert Rosebrugh. Sets for Mathematics. Cambridge University Press, 2003. Discusses the construction of the continuum and Dedekind cuts within a categorical framework.

[7]

William F. Lawvere. An elementary theory of the category of sets. Proceedings of the National Academy of Sciences, 52(6):1506–1511, 1964.

[8]

Erik Meijer, Maarten Fokkinga, and Ross Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In Conference on Functional Programming Languages and Computer Architecture, volume 523 of Lecture Notes in Computer Science, pages 124–144. Springer, 1991.

[9]

Giuseppe Peano. Arithmetices principia, nova methodo exposita. Bocca, Turin, 1889.

[10]

Benjamin C. Pierce. Basic Category Theory for Computer Scientists. MIT Press, 1991.