1. Arnold, A., Nivat, M.: Metric interpretations of infinite trees and semantics of nondeterministic recursive programs. Theor. Comput. Sci. 11(2), 181–205 (1980)
2. Bahr, P.: Partial order infinitary term rewriting and Böhm Trees. In: Lynch, C. (ed.) Proceedings of the 21st International Conference on Rewriting Techniques and Applications, Leibniz International Proceedings in Informatics (LIPIcs), vol. 6, pp. 67–84. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2010) doi: 10.4230/LIPIcs.RTA.2010.67 . http://drops.dagstuhl.de/opus/volltexte/2010/2645
3. Barendregt, H., Klop, J.W.: Applications of infinitary lambda calculus. Inf. Comput. 207(5), 559–582 (2009). doi: 10.1016/j.ic.2008.09.003
4. Barendregt, H.P.: The Lambda-Calculus, Its Syntax and Semantics. North-Holland, Amsterdam (1984)
5. Barr, M.: Terminal coalgebras in well-founded set theory. Theor. Comput. Sci. 114, 299–315 (1993)