References

1. M. Abadi, L. Cardelli & G. Plotkin (1993): Types for the Scott Numerals.. http://lucacardelli.name/Papers/Notes/scott2.pdf.
2. B. Geron & H. Geuvers (2013): Continuation calculus. In: Proceedings of COS 2013, EPTCS 127, pp. 66–85, doi:10.4204/EPTCS.127.5.
3. Bram Geron (2013): Continuation Calculus, master's thesis. http://alexandria.tue.nl/extra1/afstversl/wsk-i/geron2013.pdf.
4. Herman Geuvers (2014): A typed λ-calculus with CBN and CBV iterators. To appear.
5. J.M. Jansen (2013): Programming in the λ-Calculus: From Church to Scott and Back. In: The Beauty of Functional Code, Lecture Notes in Computer Science 8106, pp. 168–180, doi:10.1007/978-3-642-38143-0.
6. Jean-Louis Krivine (1994): Classical Logic, Storage Operators and Second-Order lambda-Calculus. Ann. Pure Appl. Logic 68(1), pp. 53–78, doi:10.1016/0168-0072(94)90047-7.
7. A. Miquel (2009): Classical realizability with forcing and the axiom of countable choice. http://perso.ens-lyon.fr/alexandre.miquel/habilitation/forcing.pdf.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org