1. Abramsky, S., Lenisa, M.: Linear realizability and full completeness for typed lambda-calculi. Ann. Pure Appl. Logic 134(2–3), 122–168 (2005)
2. Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics, vol. 103. Studies in Logic and the Foundations of Mathematics. Elsevier, Amsterdam (1984)
3. Lecture Notes in Computer Science;A Carboni,1988
4. Faber, E., van Oosten, J.: More on geometric morphisms between realizability toposes. Theory Appl. Categories 29, 874–895 (2014)
5. Guerrieri, G.: Head reduction and normalization in a call-by-value lambda-calculus. In Chiba, Y., Escobar, S., Nishida, N., Sabel, D., Schmidt-Schauß, M. (eds.) 2nd International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2015), vol. 46 of OpenAccess Series in Informatics (OASIcs), pp. 3–17, Dagstuhl, Germany (2015). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik