1. M. Abadi , L. Cardelli , P.-L. Curien , and J.-J. Levy . 1989 . Explicit Substitutions. In Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages(POPL ’90) . 31–46. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy. 1989. Explicit Substitutions. In Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages(POPL ’90). 31–46.
2. Typed closure conversion preserves observational equivalence
3. Andrew W. Appel . 1992. Compiling with Continuations . Cambridge University Press . Andrew W. Appel. 1992. Compiling with Continuations. Cambridge University Press.
4. A call-by-need lambda calculus
5. William J. Bowman and Amal Ahmed. 2018. Typed closure conversion for the calculus of constructions . In Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018 , Philadelphia, PA, USA , June 18-22, 2018 . 797–811. William J. Bowman and Amal Ahmed. 2018. Typed closure conversion for the calculus of constructions. In Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018, Philadelphia, PA, USA, June 18-22, 2018. 797–811.