Barendregt, Henk. (1991) Self-interpretation in lambda calculus. Journal of functional programming, 1(2), 229–234.
Clinger, William. (1984) (Aug.). The scheme 311 compiler: An exercise in denotational semantics. Pages 356–364of: Proc. 1984 ACM Symposium on Lisp and Functional Programming.
Consel, Charles. (1990) Binding time analysis for higher order untyped functional languages. Pages 264–272of: Proc. 1990 ACM Symposium on Lisp and Functional Programming.
Consel, Charles, & Khoo, Siau Cheng. (1992) (June). On-line & off-line partial evaluation: Semantic specifications and correctness proofs. Tech. rept. YALEU/DCS/RR-912. Yale University Department of Computer Science.
Gomard, Carsten K. (1990) Partial type inference for untyped functional programs. Pages 282–287of: Proc. 1990 ACM Symposium on Lisp and Functional Programming.
Gomard, Carsten K. (1992) A self-applicable partial evaluator for the lambda calculus: Correctness and pragmatics. Acm transactions on programming languages and systems,14(2), 147–172.
Henglein, Fritz. (1991) Efficient type inference for higher-order binding-time analysis. Pages 448–472of: Hughes, J. (ed), Functional programming languages and computer architecture, 5th acm conference. Lecture Notes in Computer Science, vol. 523. Berlin, Heidelberg, New York:Springer-Verlag.
Hunt, Sebastian, & Sands, David. (1991) Binding time analysis: A new perspective. Pages 154–165of: Proceedings of the symposium on partial evaluation and semantics-based program manipulation. SIGPLAN Notices 26(9), September, 1991.
Jorring, U., & Scherlis, William L. (1986) Compilers and staging transformations. Pages 86–96of: Conf. Rec. 13th ACM Symposium on Principles of Programming Languages.
Launchbury, John. (1989) (Nov.). Projection factorizations in partial evaluation. Ph.D. thesis, University of Glasgow.
Launchbury, John. (1991) A strongly-typed self-applicable partial evaluator. In: Hughes, John (ed), Functional programming languages and computer architecture, vol. 523. Berlin, Heidelberg, and New York: Springer-Verlag.
Mogensen, Torben Æ. (1992a) (June). Efficient self-interpretation in lambda calculus. to appear.
Mogensen, Torben Æ. (1992b) Self-applicable partial evaluation for pure lambda calculus. Pages 116–121of: Consel, Charles (ed), Acm sigplan workshop on partial evaluation and semantics-based program manipulation.
Nielson, Flemming, & Nielson, Hanne Riis. (1988) Two-level semantics and code generation. Theoretical computer science, 56, 59–133.
Palsberg, Jens. (1993) Correctness of binding time analysis. Journal of functional programming, 11.
Pfenning, Frank, & Elliott, Conal. (1988) (June). Higher-order abstract syntax. Pages 199–208of: Proceedings sigplan ‘88 conference on programming language design and implementation.
Wand, Mitchell. (1982) Deriving target code as a representation of continuation semantics. Acm transactions on programming languages and systems, 4(3), 496–517.
Wand, Mitchell, & Oliva, Dino P. (1992) Proving the correctness of storage representations. Pages 151–160of: Proc. 1992 ACM Symposium on Lisp and Functional Programming.