John DeNero (outono de 2019). «Computer Science 61A, Berkeley». Department of Electrical Engineering and Computer Sciences, Berkeley. Consultado em 14 de agosto de 2020
Turing, A. M. (1937). «Computability and λ-definability». Cambridge University Press. The Journal of Symbolic Logic. 2 (4): 153–163. doi:10.2307/2268280
Church, A. (1940). «A Formulation of the Simple Theory of Types». Journal of Symbolic Logic. 5 (2): 56–68. doi:10.2307/2266170
Backus, J. (1978). «Can programming be liberated from the von Neumann style?: A functional style and its algebra of programs». Communications of the ACM. 21 (8): 613–641. doi:10.1145/359576.359579
Clinger, William (1998). «Proper tail recursion and space efficiency». Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation - PLDI '98. [S.l.: s.n.] pp.174–185. ISBN0897919874. doi:10.1145/277650.277719
Launchbury, John (março de 1993). A Natural Semantics for Lazy Evaluation. Symposium on Principles of Programming Languages. Charleston, Carolina do Sul: ACM. pp.144–154. doi:10.1145/158511.158618
Huet, Gérard P. (1973). «The Undecidability of Unification in Third Order Logic». Information and Control. 22 (3): 257–267. doi:10.1016/s0019-9958(73)90301-x
Hartmanis, Juris; Hemachandra, Lane (1986). «Complexity classes without machines: On complete languages for UP». Automata, Languages and Programming. Col: Lecture Notes in Computer Science. 226. Berlim, Heidelberg: Springer Berlin Heidelberg. pp.123–135. ISBN978-3-540-16761-7. doi:10.1007/3-540-16761-7_62. Consultado em 12 de dezembro de 2024
Pechtchanski, Igor; Sarkar, Vivek (2005). «Immutability specification and its applications». Concurrency and Computation: Practice and Experience. 17 (5–6): 639–662. doi:10.1002/cpe.853
Hartmanis, Juris; Hemachandra, Lane (1986). «Complexity classes without machines: On complete languages for UP». Automata, Languages and Programming. Col: Lecture Notes in Computer Science. 226. Berlim, Heidelberg: Springer Berlin Heidelberg. pp.123–135. ISBN978-3-540-16761-7. doi:10.1007/3-540-16761-7_62. Consultado em 12 de dezembro de 2024